{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:49:20Z","timestamp":1780386560452,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0031-3203(02)00085-7","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T12:32:36Z","timestamp":1038832356000},"page":"709-719","source":"Crossref","is-referenced-by-count":66,"title":["Circular shortest path in images"],"prefix":"10.1016","volume":"36","author":[{"given":"Changming","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Pallottino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(02)00085-7_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","article-title":"Shortest path algorithms","volume":"13","author":"Gallo","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0031-3203(02)00085-7_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","article-title":"Shortest paths algorithms","volume":"73","author":"Cherkassky","year":"1996","journal-title":"Math. Programming"},{"issue":"7","key":"10.1016\/S0031-3203(02)00085-7_BIB3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/S0167-8655(97)00076-7","article-title":"Regularised shortest-path extraction","volume":"18","author":"Buckley","year":"1997","journal-title":"Pattern Recognition Lett."},{"issue":"1\/2\/3","key":"10.1016\/S0031-3203(02)00085-7_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1014585622703","article-title":"Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques","volume":"47","author":"Sun","year":"2002","journal-title":"Internat. J. Comput. Vision"},{"key":"10.1016\/S0031-3203(02)00085-7_BIB5","doi-asserted-by":"crossref","unstructured":"S. Intille, A. Bobick, Disparity-space images and large occlusion stereo, in: Proceedings of European Conference on Computer Vision, Stockholm, Sweden, 1994, pp. 179\u2013186.","DOI":"10.1007\/BFb0028349"},{"key":"10.1016\/S0031-3203(02)00085-7_BIB6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/ima.1850040104","article-title":"Experiments with symmetrized intensity-based dynamic programming algorithms for reconstructing digital terrain model","volume":"4","author":"Gimel'farb","year":"1992","journal-title":"Internat. J. Imaging Systems Technol."},{"issue":"1","key":"10.1016\/S0031-3203(02)00085-7_BIB7","first-page":"18","article-title":"A dynamic programming algorithm for binocular stereo vision","volume":"3","author":"Lloyd","year":"1985","journal-title":"GEC J. Res."},{"key":"10.1016\/S0031-3203(02)00085-7_BIB8","unstructured":"http:\/\/wwwdnyalb.er.usgs.gov\/projects\/bgag\/intro.text.html."},{"key":"10.1016\/S0031-3203(02)00085-7_BIB9","unstructured":"M.A. Lovell, G. Williamson, P.K. Harvey (Ed.), Borehole Imaging: Applications and Case Histories, Special Publications No. 159, Geological Society, London, 1999."},{"key":"10.1016\/S0031-3203(02)00085-7_BIB10","doi-asserted-by":"crossref","unstructured":"H. du Buf, M. Bayer, S. Droop, R. Head, S. Juggins, S. Fisher, H. Bunke, M. Wilkinson, J. Roerdink, J. Pech-Pacheco, G. Crist\u00f3bal, H. Shahbazkia, A. Ciobanu, Diatom identification: a double challenge called ADIAC, in: Proceedings of the 10th International Conference on Image Analysis and Processing, Venice, Italy, 1999, pp. 734\u2013739.","DOI":"10.1109\/ICIAP.1999.797682"},{"key":"10.1016\/S0031-3203(02)00085-7_BIB11","unstructured":"R.V. Helgason, J.L. Kennington, B.D. Stewart, Dijkstra's two-tree shortest path algorithm, Technical Report, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX, 1988."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320302000857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320302000857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T20:59:23Z","timestamp":1554757163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320302000857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0031320302000857"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(02)00085-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}