{"id":"https://openalex.org/W2075514126","doi":"https://doi.org/10.1016/s0031-3203(02)00085-7","title":"Circular shortest path in images","display_name":"Circular shortest path in images","publication_year":2002,"publication_date":"2002-12-02","ids":{"openalex":"https://openalex.org/W2075514126","doi":"https://doi.org/10.1016/s0031-3203(02)00085-7","mag":"2075514126"},"language":"en","primary_location":{"id":"doi:10.1016/s0031-3203(02)00085-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(02)00085-7","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","raw_type":"journal-article"},"type":"article","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/A5041589060","display_name":"Changming Sun","orcid":"https://orcid.org/0000-0001-5943-1989"},"institutions":[{"id":"https://openalex.org/I1292875679","display_name":"Commonwealth Scientific and Industrial Research Organisation","ror":"https://ror.org/03qn8fb07","country_code":"AU","type":"funder","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Changming Sun","raw_affiliation_strings":["CSIRO Mathematical and Information Sciences, Locked Bag 17, North Ryde, NSW 1670, Australia","CSIRO Mathematical and Information Sciences, Locked Bag 17, North Ryde, NSW 1670, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSIRO Mathematical and Information Sciences, Locked Bag 17, North Ryde, NSW 1670, Australia","institution_ids":["https://openalex.org/I1292875679"]},{"raw_affiliation_string":"CSIRO Mathematical and Information Sciences, Locked Bag 17, North Ryde, NSW 1670, Australia#TAB#","institution_ids":["https://openalex.org/I1292875679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019817620","display_name":"Stefano Pallottino","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Pallottino","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041589060"],"corresponding_institution_ids":["https://openalex.org/I1292875679"],"apc_list":{"value":2710,"currency":"USD","value_usd":2710},"apc_paid":null,"fwci":11.1244,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.9853143,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"36","issue":"3","first_page":"709","last_page":"719"},"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.9987000226974487,"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.9987000226974487,"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/T12549","display_name":"Image and Object Detection Techniques","score":0.9983999729156494,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.789117693901062},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5996076464653015},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5912162661552429},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5794886946678162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.558161199092865},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5154129266738892},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.512941300868988},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5100048780441284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47980406880378723},{"id":"https://openalex.org/keywords/feature-extraction","display_name":"Feature extraction","score":0.4655251204967499},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46273383498191833},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.4434208273887634},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.43987351655960083},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4328334629535675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4216327667236328},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.4110189974308014},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3554390072822571},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09128272533416748}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.789117693901062},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5996076464653015},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5912162661552429},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5794886946678162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.558161199092865},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5154129266738892},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.512941300868988},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5100048780441284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47980406880378723},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.4655251204967499},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46273383498191833},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.4434208273887634},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.43987351655960083},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4328334629535675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4216327667236328},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.4110189974308014},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3554390072822571},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09128272533416748},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0031-3203(02)00085-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(02)00085-7","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.2321","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://extra.cmis.csiro.au/IA/changs/doc/sun-pallottino03pr2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.7258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://extra.cmis.csiro.au/IA/changs/doc/sun-pallottino03pr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W85580290","https://openalex.org/W1540639362","https://openalex.org/W1622297907","https://openalex.org/W1882361424","https://openalex.org/W2018266703","https://openalex.org/W2057689732","https://openalex.org/W2061632451","https://openalex.org/W3137299218","https://openalex.org/W4285719527","https://openalex.org/W6603485381"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2347245430","https://openalex.org/W2375775343","https://openalex.org/W2156431668","https://openalex.org/W4293054712","https://openalex.org/W2562562750","https://openalex.org/W2198982833","https://openalex.org/W2161960576","https://openalex.org/W2112429204","https://openalex.org/W2368964068"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}