{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:48Z","timestamp":1742912388684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_6","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distance Transform Based on Weight Sequences"],"prefix":"10.1007","author":[{"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":[[2019,2,23]]},"reference":[{"key":"6_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":"6_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."},{"key":"6_CR3","series-title":"Lecture Notes in Computational Vision and Biomechanics","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-94-007-4174-4_7","volume-title":"Digital Geometry Algorithms. Theoretical Foundations and Applications to Computational Imaging","author":"D Coeurjolly","year":"2012","unstructured":"Coeurjolly, D., Vacavant, A.: Separable distance transformation and its applications. In: Brimkov, V., Barneva, R. (eds.) Digital Geometry Algorithms. Theoretical Foundations and Applications to Computational Imaging. LNCVB, vol. 2, pp. 189\u2013214. Springer, Dordrecht (2012). https:\/\/doi.org\/10.1007\/978-94-007-4174-4_7"},{"issue":"3","key":"6_CR4","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":"6_CR5","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."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322434","volume":"40","author":"R Fabbri","year":"2008","unstructured":"Fabbri, R., Costa, L.D.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":"6_CR7","volume-title":"Genetic Algorithms in Search, Optimization & Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Boston (1989)"},{"issue":"3","key":"6_CR8","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":"6_CR9","doi-asserted-by":"publisher","unstructured":"Nagy, B.: Metric and non-metric distances on $$\\mathbb{Z}^n$$ by generalized neighbourhood sequences. In: IEEE Proceedings of $$4^{th}$$ 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":"6_CR10","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$$ and $$\\infty 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":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-38294-9_25","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"B Nagy","year":"2013","unstructured":"Nagy, B., Strand, R., Normand, N.: A weight sequence distance function. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 292\u2013301. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_25"},{"issue":"8","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1007\/s1085","volume":"60","author":"B Nagy","year":"2018","unstructured":"Nagy, B., Strand, R., Normand, N.: Distance functions based on multiple types of weighted steps combined with neighborhood sequences. J. Math. Imaging Vis. 60(8), 1209\u20131219 (2018). https:\/\/doi.org\/10.1007\/s1085","journal-title":"J. Math. Imaging Vis."},{"issue":"11","key":"6_CR13","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 Recogn. Lett. 14(11), 883\u2013888 (1993). https:\/\/doi.org\/10.1016\/0167-8655(93)90152-4","journal-title":"Pattern Recogn. Lett."},{"key":"6_CR14","volume-title":"Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science","author":"JA Sethian","year":"1999","unstructured":"Sethian, J.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":"6_CR15","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":"6_CR16","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 Recogn. Lett. 28(15), 2029\u20132036 (2007). https:\/\/doi.org\/10.1016\/j.patrec.2007.05.016","journal-title":"Pattern Recogn. Lett."},{"key":"6_CR17","unstructured":"Strand, R., Nagy, B.: A weighted neighborhood sequence distance function with three local steps. In: IEEE Proceedings of $$8^{th}$$ International Symposium on Image and Signal Processing and Analysis (ISPA 2011), Dubrovnik, Croatia, pp. 564\u2013568 (2011)"},{"key":"6_CR18","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":"6_CR19","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 Recogn. 19(3), 237\u2013246 (1986). https:\/\/doi.org\/10.1016\/0031-3203(86)90014-2","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:07:40Z","timestamp":1679188060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}