{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:26Z","timestamp":1759134326851,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T00:00:00Z","timestamp":1521158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10851-018-0805-1","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T14:27:00Z","timestamp":1521210420000},"page":"1209-1219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Distance Functions Based on Multiple Types of Weighted Steps Combined with Neighborhood Sequences"],"prefix":"10.1007","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9494-6440","authenticated-orcid":false,"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Strand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Normand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,16]]},"reference":[{"key":"805_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S0734-189X(86)80047-0","volume":"34","author":"G Borgefors","year":"1986","unstructured":"Borgefors, G.: Distance transformations in digital images. Comput. Vis. Graph. Image Process. 34, 344\u2013371 (1986). https:\/\/doi.org\/10.1016\/S0734-189X(86)80047-0","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"5","key":"805_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/34.391389","volume":"17","author":"H Breu","year":"1995","unstructured":"Breu, H., Kirkpatrick, D., Werman, M.: Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17(5), 529\u2013533 (1995). https:\/\/doi.org\/10.1109\/34.391389","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"805_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.patcog.2010.08.028","volume":"44","author":"ME Celebi","year":"2011","unstructured":"Celebi, M.E., Celiker, F., Kingravi, H.A.: On Euclidean norm approximations. Pattern Recognit. 44(2), 278\u2013283 (2011). https:\/\/doi.org\/10.1016\/j.patcog.2010.08.028","journal-title":"Pattern Recognit."},{"key":"805_CR4","doi-asserted-by":"publisher","unstructured":"Coeurjolly, D., Vacavant, A.: Separable distance transformation and its applications. In: Digital Geometry Algorithms. Theoretical Foundations and Applications to Computational Imaging, Lecture Notes in Computational Vision and Biomechanics, vol 2, pp. 189\u2013214 (2012). https:\/\/doi.org\/10.1007\/978-94-007-4174-4_7","DOI":"10.1007\/978-94-007-4174-4_7"},{"issue":"3","key":"805_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0146-664X(80)90054-4","volume":"14","author":"PE Danielsson","year":"2008","unstructured":"Danielsson, P.E.: Euclidean distance mapping. Comput. Graph. Image Process. 14(3), 227\u2013248 (2008). https:\/\/doi.org\/10.1016\/0146-664X(80)90054-4","journal-title":"Comput. Graph. Image Process."},{"key":"805_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0255(87)90019-3","volume":"42","author":"PP Das","year":"1987","unstructured":"Das, P.P., Chakrabarti, P.P.: Distance functions in digital geometry. Inf. Sci. 42, 113\u2013136 (1987). https:\/\/doi.org\/10.1016\/0020-0255(87)90019-3","journal-title":"Inf. Sci."},{"key":"805_CR7","unstructured":"Denev, A.: Digital distance functions defined by sequence of weights, Bachelor Thesis, Dept. of Information Technology. Uppsala University (2011)"},{"issue":"1","key":"805_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322434","volume":"40","author":"R Fabbri","year":"2008","unstructured":"Fabbri, R., da Costa, L.F., Torelli, J.C., Bruno, O.M.: 2D Euclidean distance transform algorithms: a comparative survey. ACM Comput. Surv. 40(1), 1\u201344 (2008). https:\/\/doi.org\/10.1145\/1322432.1322434","journal-title":"ACM Comput. Surv."},{"key":"805_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.patrec.2013.12.012","volume":"40","author":"J Mukherjee","year":"2014","unstructured":"Mukherjee, J.: Linear combination of weighted t-cost and chamfering weighted distances. Pattern Recognit. Lett. 40, 72\u201379 (2014). https:\/\/doi.org\/10.1016\/j.patrec.2013.12.012","journal-title":"Pattern Recognit. Lett."},{"issue":"3","key":"805_CR10","doi-asserted-by":"crossref","first-page":"483","DOI":"10.5486\/PMD.2003.2875","volume":"63","author":"B Nagy","year":"2003","unstructured":"Nagy, B.: Distance functions based on neighbourhood sequences. Publ. Math. Debrecen 63(3), 483\u2013493 (2003)","journal-title":"Publ. Math. Debrecen"},{"key":"805_CR11","doi-asserted-by":"publisher","unstructured":"Nagy, B.: Metric and non-metric distances on $${\\mathbb{Z}}^n$$ Z n by generalized neighbourhood sequences. In: IEEE Proceedings of 4th International Symposium on Image and Signal Processing and Analysis (ISPA 2005), Zagreb, Croatia, pp. 215\u2013220 (2005). https:\/\/doi.org\/10.1109\/ISPA.2005.195412","DOI":"10.1109\/ISPA.2005.195412"},{"issue":"12","key":"805_CR12","doi-asserted-by":"publisher","first-page":"2344","DOI":"10.1016\/j.dam.2007.10.017","volume":"156","author":"B Nagy","year":"2008","unstructured":"Nagy, B.: Distance with generalized neighbourhood sequences in $$nD$$ nD and $$\\infty D$$ \u221e D . Discrete Appl. Math. 156(12), 2344\u20132351 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.10.017","journal-title":"Discrete Appl. Math."},{"key":"805_CR13","doi-asserted-by":"publisher","unstructured":"Nagy, B., Strand, R., Normand, N.: A weight sequence distance function. In: ISSM 2013\u201411th International Symposium on Mathematical Morphology, LNCS, vol. 7883, pp. 292\u2013301 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_25","DOI":"10.1007\/978-3-642-38294-9_25"},{"issue":"11","key":"805_CR14","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/0167-8655(93)90152-4","volume":"14","author":"I Ragnemalm","year":"1993","unstructured":"Ragnemalm, I.: The Euclidean distance transform in arbitrary dimensions. Pattern Recognit. Lett. 14(11), 883\u2013888 (1993). https:\/\/doi.org\/10.1016\/0167-8655(93)90152-4","journal-title":"Pattern Recognit. Lett."},{"issue":"4","key":"805_CR15","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/321356.321357","volume":"13","author":"A Rosenfeld","year":"1966","unstructured":"Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471\u2013494 (1966). https:\/\/doi.org\/10.1145\/321356.321357","journal-title":"J. ACM"},{"key":"805_CR16","volume-title":"Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science","author":"J\u00a0A Sethian","year":"1999","unstructured":"Sethian, J\u00a0.A.: Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge university press, Cambridge (1999)"},{"key":"805_CR17","unstructured":"Strand, R.: Distance Functions and Image Processing on Point-Lattices: with focus on the 3D face- and body-centered cubic grids. Ph.D. thesis, Uppsala University, Sweden (2008). http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-9312"},{"issue":"15","key":"805_CR18","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.patrec.2007.05.016","volume":"28","author":"R Strand","year":"2007","unstructured":"Strand, R.: Weighted distances based on neighbourhood sequences. Pattern Recognit. Lett. 28(15), 2029\u20132036 (2007). https:\/\/doi.org\/10.1016\/j.patrec.2007.05.016","journal-title":"Pattern Recognit. Lett."},{"key":"805_CR19","unstructured":"Strand, R., Nagy, B.: A weighted neighborhood sequence distance function with three local steps. In: IEEE Proceedings of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2011), Dubrovnik, Croatia, pp. 564\u2013568 (2011)"},{"key":"805_CR20","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1016\/j.tcs.2010.10.027","volume":"412","author":"R Strand","year":"2011","unstructured":"Strand, R., Nagy, B., Borgefors, G.: Digital distance functions on three-dimensional grids. Theor. Comput. Sci. 412, 1350\u20131363 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.027","journal-title":"Theor. Comput. Sci."},{"key":"805_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2012.05.010","volume":"448","author":"R Strand","year":"2012","unstructured":"Strand, R., Normand, N.: Distance transform computation for digital distance functions. Theor. Comput. Sci. 448, 80\u201393 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.010","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"805_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0031-3203(86)90014-2","volume":"19","author":"M Yamashita","year":"1986","unstructured":"Yamashita, M., Ibaraki, T.: Distances defined by neighborhood sequences. Pattern Recognit. 19(3), 237\u2013246 (1986). https:\/\/doi.org\/10.1016\/0031-3203(86)90014-2","journal-title":"Pattern Recognit."}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10851-018-0805-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-018-0805-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-018-0805-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T17:08:47Z","timestamp":1693588127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10851-018-0805-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["805"],"URL":"https:\/\/doi.org\/10.1007\/s10851-018-0805-1","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"type":"print","value":"0924-9907"},{"type":"electronic","value":"1573-7683"}],"subject":[],"published":{"date-parts":[[2018,3,16]]},"assertion":[{"value":"7 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}