{"id":"https://openalex.org/W2134002877","doi":"https://doi.org/10.1109/iccv.2009.5459284","title":"Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest","display_name":"Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2134002877","doi":"https://doi.org/10.1109/iccv.2009.5459284","mag":"2134002877"},"language":"en","primary_location":{"id":"doi:10.1109/iccv.2009.5459284","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2009.5459284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 12th International Conference on Computer Vision","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004095177","display_name":"Camille Couprie","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C Couprie","raw_affiliation_strings":["Laboratoire d'Informatique Gaspard-Monge, Universit\u00e9 Paris-Est, Noisy-le-Grand, France","Universit\u00e9 Paris-Est, Laboratoire, d'Informatique Gaspard-Monge, Equipe A3SI, ESIEE (93160 Noisy-le-Grand, France)"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique Gaspard-Monge, Universit\u00e9 Paris-Est, Noisy-le-Grand, France","institution_ids":["https://openalex.org/I4210152518"]},{"raw_affiliation_string":"Universit\u00e9 Paris-Est, Laboratoire, d'Informatique Gaspard-Monge, Equipe A3SI, ESIEE (93160 Noisy-le-Grand, France)","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084386176","display_name":"Leo Grady","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]},{"id":"https://openalex.org/I4210137693","display_name":"Siemens (United States)","ror":"https://ror.org/04axb7e79","country_code":"US","type":"company","lineage":["https://openalex.org/I1325886976","https://openalex.org/I4210137693"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L Grady","raw_affiliation_strings":["Department of Imaging and Visualization, Siemens AG Corporate Research and Development, Princeton, NJ, USA","Siemens Corporate Research, Department of Imaging and Visualization, (Princeton, N.J. 08540. USA)"],"affiliations":[{"raw_affiliation_string":"Department of Imaging and Visualization, Siemens AG Corporate Research and Development, Princeton, NJ, USA","institution_ids":["https://openalex.org/I4210137693"]},{"raw_affiliation_string":"Siemens Corporate Research, Department of Imaging and Visualization, (Princeton, N.J. 08540. USA)","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052368829","display_name":"Laurent Najman","orcid":"https://orcid.org/0000-0002-6190-0235"},"institutions":[{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L Najman","raw_affiliation_strings":["Laboratoire d'Informatique Gaspard-Monge, ESIEE, Universit\u00e9 Paris-Est, Paris, France","Universit\u00e9 Paris-Est, Laboratoire d\u2019Informatique Gaspard Monge, Equipe A3SI, ESIEE, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique Gaspard-Monge, ESIEE, Universit\u00e9 Paris-Est, Paris, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]},{"raw_affiliation_string":"Universit\u00e9 Paris-Est, Laboratoire d\u2019Informatique Gaspard Monge, Equipe A3SI, ESIEE, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002452272","display_name":"Hugues Talbot","orcid":"https://orcid.org/0000-0002-2179-3498"},"institutions":[{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"H Talbot","raw_affiliation_strings":["Laboratoire d'Informatique Gaspard-Monge, ESIEE, Universit\u00e9 Paris-Est, Paris, France","Universit\u00e9 Paris-Est, Laboratoire d\u2019Informatique Gaspard Monge, Equipe A3SI, ESIEE, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique Gaspard-Monge, ESIEE, Universit\u00e9 Paris-Est, Paris, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]},{"raw_affiliation_string":"Universit\u00e9 Paris-Est, Laboratoire d\u2019Informatique Gaspard Monge, Equipe A3SI, ESIEE, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004095177"],"corresponding_institution_ids":["https://openalex.org/I4210154111","https://openalex.org/I4210152518"],"apc_list":null,"apc_paid":null,"fwci":29.47335022,"has_fulltext":false,"cited_by_count":127,"citation_normalized_percentile":{"value":0.998543,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"731","last_page":"738"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.987500011920929,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.7049208879470825},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.653333842754364},{"id":"https://openalex.org/keywords/watershed","display_name":"Watershed","score":0.6345536708831787},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5949799418449402},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5796467065811157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5001895427703857},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.4924114942550659},{"id":"https://openalex.org/keywords/minimum-spanning-tree-based-segmentation","display_name":"Minimum spanning tree-based segmentation","score":0.48746252059936523},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.4651896059513092},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4594825506210327},{"id":"https://openalex.org/keywords/scale-space-segmentation","display_name":"Scale-space segmentation","score":0.4516342282295227},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42818528413772583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41737979650497437},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4070495665073395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39930281043052673},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3775917887687683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3589828908443451},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2215999960899353},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.21932348608970642},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.097330242395401}],"concepts":[{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.7049208879470825},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.653333842754364},{"id":"https://openalex.org/C150547873","wikidata":"https://www.wikidata.org/wiki/Q947851","display_name":"Watershed","level":2,"score":0.6345536708831787},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5949799418449402},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5796467065811157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5001895427703857},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.4924114942550659},{"id":"https://openalex.org/C42314347","wikidata":"https://www.wikidata.org/wiki/Q6865488","display_name":"Minimum spanning tree-based segmentation","level":5,"score":0.48746252059936523},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.4651896059513092},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4594825506210327},{"id":"https://openalex.org/C65885262","wikidata":"https://www.wikidata.org/wiki/Q7429708","display_name":"Scale-space segmentation","level":4,"score":0.4516342282295227},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42818528413772583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41737979650497437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4070495665073395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39930281043052673},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3775917887687683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3589828908443451},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2215999960899353},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.21932348608970642},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.097330242395401},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccv.2009.5459284","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2009.5459284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 12th International Conference on Computer Vision","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W151895561","https://openalex.org/W1569930776","https://openalex.org/W1785730614","https://openalex.org/W1987983010","https://openalex.org/W2006554089","https://openalex.org/W2020999234","https://openalex.org/W2025564919","https://openalex.org/W2032841680","https://openalex.org/W2035773017","https://openalex.org/W2056352580","https://openalex.org/W2105365768","https://openalex.org/W2107884096","https://openalex.org/W2109374510","https://openalex.org/W2112058288","https://openalex.org/W2113042487","https://openalex.org/W2113854572","https://openalex.org/W2114487471","https://openalex.org/W2115284428","https://openalex.org/W2121947440","https://openalex.org/W2124351162","https://openalex.org/W2125637308","https://openalex.org/W2128000934","https://openalex.org/W2128356031","https://openalex.org/W2128680590","https://openalex.org/W2134839354","https://openalex.org/W2140574866","https://openalex.org/W2146369368","https://openalex.org/W2147899407","https://openalex.org/W2150430720","https://openalex.org/W2157394577","https://openalex.org/W2162310225","https://openalex.org/W2163096274","https://openalex.org/W2169551590","https://openalex.org/W2294819727","https://openalex.org/W2597248654","https://openalex.org/W2913192828","https://openalex.org/W4234235766","https://openalex.org/W4244769743","https://openalex.org/W4248635988","https://openalex.org/W6606194389","https://openalex.org/W6677132139"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W2350028416"],"abstract_inverted_index":{"In":[0],"this":[1,86,127],"work,":[2],"we":[3,118],"extend":[4],"a":[5,28,39,47,61,67,92],"common":[6,40],"framework":[7,130],"for":[8,69,83,135],"seeded":[9],"image":[10,26,156],"segmentation":[11,96,142],"that":[12,65,98],"includes":[13],"the":[14,55,70,78,109,113,123],"graph":[15],"cuts,":[16],"random":[17],"walker,":[18],"and":[19,143],"shortest":[20],"path":[21],"optimization":[22],"algorithms.":[23],"Viewing":[24],"an":[25,52,103],"as":[27,51],"weighted":[29],"graph,":[30],"these":[31],"algorithms":[32,97],"can":[33],"be":[34],"expressed":[35],"by":[36],"means":[37],"of":[38,46,95,151],"energy":[41,128],"function":[42],"with":[43],"differing":[44],"choices":[45],"parameter":[48,63],"q":[49,111],"acting":[50],"exponent":[53],"on":[54],"differences":[56],"between":[57],"neighboring":[58],"nodes.":[59],"Introducing":[60],"new":[62,93,133],"p":[64,100],"fixes":[66,99],"power":[68,110,120],"edge":[71],"weights":[72],"allows":[73],"us":[74],"to":[75,101,146],"also":[76,131],"include":[77],"optimal":[79,104],"spanning":[80,105],"forest":[81,106],"algorithm":[82,125],"watersheds":[84,145],"in":[85,126,139,153],"same":[87],"framework.":[88],"We":[89],"then":[90],"propose":[91],"family":[94],"produce":[102],"but":[107],"varies":[108],"beyond":[112,155],"usual":[114],"watershed":[115,124,141],"algorithm,":[116],"which":[117],"term":[119],"watersheds.":[121],"Placing":[122],"minimization":[129],"opens":[132],"possibilities":[134],"using":[136,144],"unary":[137],"terms":[138],"traditional":[140],"optimize":[147],"more":[148],"general":[149],"models":[150],"use":[152],"application":[154],"segmentation.":[157]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}