{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:46:46Z","timestamp":1743144406363,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_7","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"75-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Distance Transform"],"prefix":"10.1007","author":[{"given":"Johan","family":"\u00d6fverstedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joakim","family":"Lindblad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nata\u0161a","family":"Sladoje","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"7_CR1","unstructured":"Angulo, J., Jeulin, D.: Stochastic watershed segmentation. In: Proceedings of the 8th International Symposium on Mathematical Morphology, pp. 265\u2013276 (2007)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1008214317492","volume":"8","author":"A Baddeley","year":"1998","unstructured":"Baddeley, A., Molchanov, I.: Averaging of random sets based on their distance functions. J. Math. Imaging Vis. 8(1), 79\u201392 (1998)","journal-title":"J. Math. Imaging Vis."},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"7_CR4","unstructured":"Beucher, S.: Use of watersheds in contour detection. In: Proceedings of the International Workshop on Image Processing, CCETT (1979)"},{"issue":"3","key":"7_CR5","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(3), 344\u2013371 (1986)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/140977552","volume":"8","author":"L Cuel","year":"2015","unstructured":"Cuel, L., Lachaud, J.O., M\u00e9rigot, Q., Thibert, B.: Robust geometry estimation using the generalized voronoi covariance measure. SIAM J. Imaging Sci. 8(2), 1293\u20131314 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"7_CR7","unstructured":"Cuisenaire, O., Macq, B.: Fast k-NN classification with an optimal k-distance transformation algorithm. In: 2000 10th European Signal Processing Conference, pp. 1\u20134. IEEE (2000)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s002360050075","volume":"34","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Mannila, H.: Distance measures for point sets and their computation. Acta Informatica 34(2), 109\u2013133 (1997)","journal-title":"Acta Informatica"},{"issue":"2\u20133","key":"7_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF00118590","volume":"2","author":"J Goutsias","year":"1992","unstructured":"Goutsias, J.: Morphological analysis of discrete random shapes. J. Math. Imaging Vis. 2(2\u20133), 193\u2013215 (1992)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.patrec.2010.08.010","volume":"32","author":"S Gustavson","year":"2011","unstructured":"Gustavson, S., Strand, R.: Anti-aliased Euclidean distance transform. Pattern Recogn. Lett. 32(2), 252\u2013257 (2011)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0019-9958(70)80006-7","volume":"17","author":"G Levi","year":"1970","unstructured":"Levi, G., Montanari, U.: A grey-weighted skeleton. Inf. Control 17(1), 62\u201391 (1970)","journal-title":"Inf. Control"},{"issue":"9","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/S0031-3203(99)00024-2","volume":"32","author":"T Lewis","year":"1999","unstructured":"Lewis, T., Owens, R., Baddeley, A.: Averaging feature maps. Pattern Recogn. 32(9), 1615\u20131630 (1999)","journal-title":"Pattern Recogn."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Lindblad, J., Curic, V., Sladoje, N.: On set distances and their application to image registration. In: Proceedings of 6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009, pp. 449\u2013454. IEEE (2009)","DOI":"10.1109\/ISPA.2009.5297672"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-319-18720-4_54","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"J Lindblad","year":"2015","unstructured":"Lindblad, J., Sladoje, N.: Exact linear time Euclidean distance transforms of grid line sampled shapes. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 645\u2013656. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18720-4_54"},{"key":"7_CR15","volume-title":"Random Sets and Integral Geometry","author":"G Matheron","year":"1975","unstructured":"Matheron, G.: Random Sets and Integral Geometry. Wiley, New York (1975)"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/TPAMI.2003.1177156","volume":"25","author":"CR Maurer","year":"2003","unstructured":"Maurer, C.R., Qi, R., Raghavan, V.: A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 25(2), 265\u2013270 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"16","key":"7_CR17","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1016\/j.patrec.2013.08.012","volume":"34","author":"R Moreno","year":"2013","unstructured":"Moreno, R., Koppal, S., De Muinck, E.: Robust estimation of distance between sets of points. Pattern Recogn. Lett. 34(16), 2192\u20132198 (2013)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"7_CR18","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 (JACM) 13(4), 471\u2013494 (1966)","journal-title":"J. ACM (JACM)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.patrec.2015.04.006","volume":"76","author":"PK Saha","year":"2016","unstructured":"Saha, P.K., Borgefors, G., di Baja, G.S.: A survey on skeletonization algorithms and their applications. Pattern Recogn. Lett. 76, 3\u201312 (2016)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/cviu.2002.0974","volume":"86","author":"PK Saha","year":"2002","unstructured":"Saha, P.K., Wehrli, F.W., Gomberg, B.R.: Fuzzy distance transform: theory, algorithms, and applications. Comput. Visi. Image Underst. 86(3), 171\u2013190 (2002)","journal-title":"Comput. Visi. Image Underst."}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:07:35Z","timestamp":1679188055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_7","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"}]}}