{"id":"https://openalex.org/W2282030987","doi":"https://doi.org/10.1007/0-306-47025-x_37","title":"The Ordered Queue and the Optimality of the Watershed Approaches","display_name":"The Ordered Queue and the Optimality of the Watershed Approaches","publication_year":2005,"publication_date":"2005-12-27","ids":{"openalex":"https://openalex.org/W2282030987","doi":"https://doi.org/10.1007/0-306-47025-x_37","mag":"2282030987"},"language":"en","primary_location":{"id":"doi:10.1007/0-306-47025-x_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-306-47025-x_37","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Imaging and Vision","raw_type":"book-chapter"},"type":"book-chapter","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/A5087970571","display_name":"Roberto Lotufo","orcid":"https://orcid.org/0000-0002-5652-0852"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Roberto Lotufo","raw_affiliation_strings":["Universidade Estadual de Campinas, Campinas, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas, Campinas, SP, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015267493","display_name":"Alexandre X. Falc\u00e3o","orcid":"https://orcid.org/0000-0002-2914-5380"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Alexandre Falcao","raw_affiliation_strings":["Universidade Estadual de Campinas, Campinas, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas, Campinas, SP, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087970571"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":null,"apc_paid":null,"fwci":122.0155,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":1.0,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9869999885559082,"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"}},"topics":[{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9869999885559082,"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"}},{"id":"https://openalex.org/T13429","display_name":"Electricity Theft Detection Techniques","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12282","display_name":"Mineral Processing and Grinding","score":0.9413999915122986,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/watershed","display_name":"Watershed","score":0.8904705047607422},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8426321148872375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5490848422050476},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5288879871368408},{"id":"https://openalex.org/keywords/pixel","display_name":"Pixel","score":0.5056381225585938},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.4752245545387268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4512573182582855},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4470213055610657},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.441896915435791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4390425980091095},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.43220263719558716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4139328598976135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41031110286712646},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.356672465801239},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24704530835151672},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14880996942520142},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.13169798254966736},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05913987755775452}],"concepts":[{"id":"https://openalex.org/C150547873","wikidata":"https://www.wikidata.org/wiki/Q947851","display_name":"Watershed","level":2,"score":0.8904705047607422},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8426321148872375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5490848422050476},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5288879871368408},{"id":"https://openalex.org/C160633673","wikidata":"https://www.wikidata.org/wiki/Q355198","display_name":"Pixel","level":2,"score":0.5056381225585938},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.4752245545387268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4512573182582855},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4470213055610657},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.441896915435791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4390425980091095},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.43220263719558716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4139328598976135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41031110286712646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.356672465801239},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24704530835151672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14880996942520142},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.13169798254966736},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05913987755775452}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/0-306-47025-x_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-306-47025-x_37","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Imaging and Vision","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.5928","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.5928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dca.fee.unicamp.br/~lotufo/tmp/36.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.7799999713897705}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W79868454","https://openalex.org/W151895561","https://openalex.org/W1484144136","https://openalex.org/W1591019493","https://openalex.org/W1599786999","https://openalex.org/W1705206022","https://openalex.org/W1866589047","https://openalex.org/W2009907735","https://openalex.org/W2025564919","https://openalex.org/W2025818287","https://openalex.org/W2039152227","https://openalex.org/W2085917651","https://openalex.org/W2115284428","https://openalex.org/W2133496072","https://openalex.org/W2169528473","https://openalex.org/W3013741643","https://openalex.org/W3138807513","https://openalex.org/W6813151395"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2102269193","https://openalex.org/W2776102956"],"abstract_inverted_index":{"This":[0,20,31],"work":[1],"reviews":[2],"the":[3,6,23,26,45,68,74,77,82,91,106,112,124,127],"watershed":[4,29,46,56,69,109],"in":[5,65],"graph":[7],"framework":[8],"of":[9,25,51,76,126],"a":[10,15,48,98],"shortest-path":[11,38,78,128],"forest":[12,39,79,129],"problem":[13],"using":[14,115],"lexicographic":[16],"path":[17],"cost":[18],"formulation.":[19],"formulation":[21],"reflects":[22],"behavior":[24],"ordered":[27],"queue-based":[28],"algorithm.":[30],"algorithm":[32,70,84],"is":[33,47,85,93],"compared":[34],"with":[35],"our":[36],"proposed":[37],"(IFT-Image":[40],"Foresting":[41],"Transform),":[42],"concluding":[43],"that":[44,64],"special":[49],"case":[50],"that.":[52],"Recently":[53],"many":[54],"different":[55],"approaches":[57],"are":[58],"being":[59],"used.":[60,86],"We":[61],"point":[62],"out":[63],"some":[66],"cases":[67],"does":[71],"not":[72],"keep":[73],"optimality":[75,125],"solution":[80],"unless":[81],"IFT":[83,116],"The":[87,108],"main":[88],"difference":[89],"between":[90],"algorithms":[92],"related":[94],"to":[95],"permanently":[96],"labeling":[97],"pixel":[99,113],"when":[100],"inserting":[101],"or":[102],"removing":[103],"it":[104],"from":[105],"queue.":[107],"based":[110],"on":[111],"dissimilarity":[114],"can":[117],"segment":[118],"one-pixel":[119],"width":[120],"regions":[121],"while":[122],"keeping":[123],"solution.":[130]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}