乐胖代购免代理版

{"id":"https://openalex.org/W2142761958","doi":"https://doi.org/10.1109/cvpr.2010.5539903","title":"A study on continuous max-flow and min-cut approaches","display_name":"A study on continuous max-flow and min-cut approaches","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2142761958","doi":"https://doi.org/10.1109/cvpr.2010.5539903","mag":"2142761958"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5539903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://bora.uib.no/bora-xmlui/bitstream/1956/5020/1/A%20study%20on%20continuous%20max-flow%20and%20min-cut%20approaches.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101561039","display_name":"Jing Yuan","orcid":"https://orcid.org/0000-0002-3548-5875"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jing Yuan","raw_affiliation_strings":["Computer Science Department, University of Western Ontario, Middlesex College 240, University of Western Ontario, London, ON, Canada, N6A 5B7"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Western Ontario, Middlesex College 240, University of Western Ontario, London, ON, Canada, N6A 5B7","institution_ids":["https://openalex.org/I125749732"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061969008","display_name":"Egil Bae","orcid":"https://orcid.org/0000-0002-4621-259X"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Egil Bae","raw_affiliation_strings":["Department of Mathematics, University of Bergen, University of Bergen, Johaness Brunsgate 12, Bergen 5007, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bergen, University of Bergen, Johaness Brunsgate 12, Bergen 5007, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101951979","display_name":"Xue\u2013Cheng Tai","orcid":"https://orcid.org/0000-0003-3359-9104"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Xue-Cheng Tai","raw_affiliation_strings":["Department of Mathematics, University of Bergen, University of Bergen, Johaness Brunsgate 12, Bergen 5007, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bergen, University of Bergen, Johaness Brunsgate 12, Bergen 5007, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.352,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":232,"citation_normalized_percentile":{"value":0.98617,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2217","last_page":"2224"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9967,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9785,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.57628655},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.55326134},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4752747},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.44705927},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.43555826}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.57628655},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5597486},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.55326134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.475504},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4752747},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.46698493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45702004},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.44705927},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.43947318},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43897426},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.43555826},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.42900065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42016646},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.41258377},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3174579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30691886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28736943},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.26394776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14456972},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5539903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://hdl.handle.net/1956/5020","pdf_url":"https://bora.uib.no/bora-xmlui/bitstream/1956/5020/1/A%20study%20on%20continuous%20max-flow%20and%20min-cut%20approaches.pdf","source":{"id":"https://openalex.org/S4306400085","display_name":"Bergen Open Research Archive (BORA) (University of Bergen)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I4432739","host_organization_name":"University of Bergen","host_organization_lineage":["https://openalex.org/I4432739"],"host_organization_lineage_names":["University of Bergen"],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://hdl.handle.net/1956/5020","pdf_url":"https://bora.uib.no/bora-xmlui/bitstream/1956/5020/1/A%20study%20on%20continuous%20max-flow%20and%20min-cut%20approaches.pdf","source":{"id":"https://openalex.org/S4306400085","display_name":"Bergen Open Research Archive (BORA) (University of Bergen)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I4432739","host_organization_name":"University of Bergen","host_organization_lineage":["https://openalex.org/I4432739"],"host_organization_lineage_names":["University of Bergen"],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":50,"referenced_works":["https://openalex.org/W1489458628","https://openalex.org/W1499695691","https://openalex.org/W1536031884","https://openalex.org/W1549861815","https://openalex.org/W1553702074","https://openalex.org/W1557598286","https://openalex.org/W1565005275","https://openalex.org/W1576499941","https://openalex.org/W1606763436","https://openalex.org/W1651266332","https://openalex.org/W1653619892","https://openalex.org/W1781337833","https://openalex.org/W1907897951","https://openalex.org/W1964119857","https://openalex.org/W1980360173","https://openalex.org/W2001933992","https://openalex.org/W2005089986","https://openalex.org/W2038495454","https://openalex.org/W2074078071","https://openalex.org/W2077786999","https://openalex.org/W2080622120","https://openalex.org/W2088979591","https://openalex.org/W2090359754","https://openalex.org/W2101309634","https://openalex.org/W2103498186","https://openalex.org/W2104095591","https://openalex.org/W2105365768","https://openalex.org/W2106569125","https://openalex.org/W2108619558","https://openalex.org/W2112058288","https://openalex.org/W2113137767","https://openalex.org/W2116040950","https://openalex.org/W2119213281","https://openalex.org/W2119867409","https://openalex.org/W2133374323","https://openalex.org/W2134820502","https://openalex.org/W2135095945","https://openalex.org/W2138165282","https://openalex.org/W2140789035","https://openalex.org/W2143516773","https://openalex.org/W2153396823","https://openalex.org/W2155697938","https://openalex.org/W2159152281","https://openalex.org/W2164918853","https://openalex.org/W2752885492","https://openalex.org/W2798766386","https://openalex.org/W4229572237","https://openalex.org/W4242209908","https://openalex.org/W4253214256","https://openalex.org/W79315950"],"related_works":["https://openalex.org/W3141688457","https://openalex.org/W2942946217","https://openalex.org/W2594460529","https://openalex.org/W2590727506","https://openalex.org/W2377700283","https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W2129497110","https://openalex.org/W1974018476","https://openalex.org/W1588356204"],"abstract_inverted_index":{"We":[0,24,69,91],"propose":[1,71,130],"and":[2,60,75,83,98,132,150,160,163],"study":[3],"novel":[4,131],"max-flow":[5,17,29,56,74,97,135,159,165],"models":[6,59,77,162],"in":[7,37,54],"the":[8,14,42,94,121,153,156],"continuous":[9,21,28,73,96,158],"setting,":[10],"which":[11,118],"directly":[12],"map":[13],"discrete":[15,55],"graph-based":[16],"problem":[18,36],"to":[19,32,86,108],"its":[20],"optimization":[22,143],"formulation.":[23],"show":[25],"such":[26],"a":[27,38,66,109],"model":[30],"leads":[31],"an":[33],"equivalent":[34],"min-cut":[35,58,76,99,161],"natural":[39],"way,":[40],"as":[41],"corresponding":[43,72],"dual":[44],"model.":[45],"In":[46,127],"this":[47],"regard,":[48],"we":[49,129],"revisit":[50],"basic":[51],"conceptions":[52],"used":[53],"/":[57],"give":[61,106],"their":[62],"new":[63],"explanations":[64],"from":[65],"variational":[67],"perspective.":[68],"also":[70],"constrained":[78],"by":[79,141],"priori":[80],"supervised":[81,104],"information":[82],"apply":[84],"them":[85],"interactive":[87],"image":[88,124,147],"segmentation/labeling":[89],"problems.":[90,126],"prove":[92],"that":[93],"proposed":[95],"models,":[100],"with":[101],"or":[102],"without":[103],"constraints,":[105],"rise":[107],"series":[110],"of":[111,155],"global":[112],"binary":[113],"solutions":[114],"\u03bb*(x)":[115],"\u03f5":[116],"{0,1},":[117],"globally":[119],"solves":[120],"original":[122],"nonconvex":[123],"partitioning":[125],"addition,":[128],"reliable":[133],"multiplier-based":[134],"algorithms.":[136,167],"Their":[137],"convergence":[138],"is":[139],"guaranteed":[140],"classical":[142],"theories.":[144],"Experiments":[145],"on":[146],"segmentation,":[148],"unsupervised":[149],"supervised,":[151],"validate":[152],"effectiveness":[154],"discussed":[157],"suggested":[164],"based":[166]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2142761958","counts_by_year":[{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":25},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":27},{"year":2013,"cited_by_count":29},{"year":2012,"cited_by_count":14}],"updated_date":"2025-01-19T09:19:55.815669","created_date":"2016-06-24"}