{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:51:45Z","timestamp":1742917905088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031230271"},{"type":"electronic","value":"9783031230288"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-23028-8_20","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"193-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Distance Transforms in\u00a0Graphs and\u00a0in Gmaps"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8621-6424","authenticated-orcid":false,"given":"Majid","family":"Banaeyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6942-7625","authenticated-orcid":false,"given":"Carmine","family":"Carrat\u00f9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4915-4118","authenticated-orcid":false,"given":"Walter G.","family":"Kropatsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5947-8813","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Hlad\u016fvka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Banaeyan, M., Batavia, D., Kropatsch, W.G.: Removing redundancies in binary images. In: International Conference on Intelligent Systems and Patterns Recognition (ISPR), Hammamet, Tunisia, 24\u201325 March 2022. pp. 221\u2013233. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08277-1_19","DOI":"10.1007\/978-3-031-08277-1_19"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Banaeyan, M., Kropatsch, W.G.: Pyramidal connected component labeling by irregular graph pyramid. In: 2021 5th International Conference on Pattern Recognition and Image Analysis (IPRIA), pp. 1\u20135 (2021)","DOI":"10.1109\/IPRIA53572.2021.9483533"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Banaeyan, M., Kropatsch, W.G.: Parallel $$\\cal{O} (log(n))$$ computation of the adjacency of connected components. In: International Conference on Pattern Recognition and Artificial Intelligence (ICPRAI), Paris, France, June 1\u20133, 2022. pp. 102\u2013113. Springer, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-031-09282-4_9","DOI":"10.1007\/978-3-031-09282-4_9"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Beamer, S., Asanovic, K., Patterson, D.: Direction-optimizing breadth-first search. In: SC \u201912: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. pp. 1\u201310 (2012). https:\/\/doi.org\/10.1109\/SC.2012.50","DOI":"10.1109\/SC.2012.50"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0734-189X(84)90035-5","volume":"27","author":"G Borgefors","year":"1984","unstructured":"Borgefors, G.: Distance transformations in arbitrary dimensions. Comput. Vis., Graphics image Process. 27(3), 321\u2013345 (1984)","journal-title":"Comput. Vis., Graphics image Process."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Brun, L., Kropatsch, W.G.: Hierarchical graph encodings. In: L\u00e9zoray, O., Grady, L. (eds.) Image Processing and Analysis with Graphs: Theory and Practice, pp. 305\u2013349. CRC Press (2012)","DOI":"10.1201\/b12281-11"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Damiand, G., Lienhardt, P.: Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing. CRC Press (2014)","DOI":"10.1201\/b17403"},{"issue":"1","key":"20_CR8","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)","journal-title":"ACM Comput. Surv."},{"key":"20_CR9","volume-title":"The Structurally Optimal Dual Graph Pyramid and Its Application in Image Partitioning","author":"Y Haxhimusa","year":"2007","unstructured":"Haxhimusa, Y.: The Structurally Optimal Dual Graph Pyramid and Its Application in Image Partitioning. DISKI, Berlin (2007)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Kropatsch, W.G.: Building irregular pyramids by dual graph contraction. IEE-Proc. Visi. Image Signal Process. 142(No. 6), 366\u2013374 (1995)","DOI":"10.1049\/ip-vis:19952115"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/cviu.1995.1006","volume":"61","author":"L Latecki","year":"1995","unstructured":"Latecki, L., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Comput. Image Underst. 61(1), 70\u201383 (1995)","journal-title":"Comput. Image Underst."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0010-4485(91)90082-8","volume":"23","author":"P Lienhardt","year":"1991","unstructured":"Lienhardt, P.: Topological models for boundary representation: a comparison with n-dimensional generalized maps. Comput. Aided Des. 23(1), 59\u201382 (1991)","journal-title":"Comput. Aided Des."},{"issue":"5","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1111\/pce.14287","volume":"45","author":"M Momayyezi","year":"2022","unstructured":"Momayyezi, M., et al.: Desiccation of the leaf mesophyll and its implications for $$\\rm CO_2 $$ diffusion and light processing. Plant, Cell Enviro. 45(5), 1362\u20131381 (2022)","journal-title":"Plant, Cell Enviro."},{"issue":"1","key":"20_CR14","first-page":"5","volume":"6","author":"Z Pizlo","year":"2013","unstructured":"Pizlo, Z., Stefanov, E.: Solving large problems with a small working memory. J. Probll. Solv. 6(1), 5 (2013)","journal-title":"J. Probll. Solv."},{"issue":"4","key":"20_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. Assoc. Comput. Macch. 13(4), 471\u2013494 (1966)","journal-title":"Assoc. Comput. Macch."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23028-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:57:50Z","timestamp":1672541870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23028-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230271","9783031230288"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23028-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sspr2022.encs.concordia.ca\/","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":"32","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":"64% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}