{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:40:13Z","timestamp":1772844013313,"version":"3.50.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030632694","type":"print"},{"value":"9783030632700","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:00:00Z","timestamp":1608681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:00:00Z","timestamp":1608681600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-63270-0_13","type":"book-chapter","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T08:03:09Z","timestamp":1608624189000},"page":"188-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Metric Methods in Computer Vision and Pattern Recognition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9931-4154","authenticated-orcid":false,"given":"Oleh","family":"Berezsky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6494-2289","authenticated-orcid":false,"given":"Mykhailo","family":"Zarichnyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Fox, K., Nath, A., Sidiropoulos, A., Wang, Y.: Computing the Gromov-Hausdorff distance for metric trees. ACM Trans. Algorithms 14, 24:1\u201324:20 (2018)","DOI":"10.1145\/3185466"},{"key":"13_CR2","unstructured":"Akitaya, H.A., Buchin, M., Ryvkin, L., Urhausen, J.: The k-Fr\u00e9chet Distance: How to Walk Your Dog While Teleporting, preprint (2019)"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002240010003","volume":"33","author":"J Alber","year":"2000","unstructured":"Alber, J., Niedermeier, R.: On multidimensional curves with Hilbert property. Theory Comput. Syst. 33(4), 295\u2013312 (2000)","journal-title":"Theory Comput. Syst."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Blomer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251\u2013265 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s00454-009-9152-8","volume":"43","author":"H Alt","year":"2010","unstructured":"Alt, H., Buchin, M.: Can we compute the similarity between surfaces? Discrete Comput. Geom. 43(1), 78\u201399 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"17","author":"MJ Atallah","year":"1983","unstructured":"Atallah, M.J.: A linear time algorithm for the Hausdorff distance between convex polygons. Inf. Process. Lett. 17, 207\u2013209 (1983)","journal-title":"Inf. Process. Lett."},{"key":"13_CR8","first-page":"3","volume":"43","author":"LE Bazylevych","year":"1996","unstructured":"Bazylevych, L.E., Zarichnyi, M.M.: On metrization of the hyperspace of oriented curves. Vis. Lviv. Univ. Ser. mekh.-mat. 43, 3\u20135 (1996)","journal-title":"Vis. Lviv. Univ. Ser. mekh.-mat."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Berezsky, O.: Fr\u00e9chet metric for trees. In: Proceedings of the 2016 IEEE First International Conference on Data Stream Mining & Processing (DSMP), Lviv, 23\u201327 August 2016, pp. 213\u2013217 (2016)","DOI":"10.1109\/DSMP.2016.7583543"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Berezsky, O., Melnyk, G., Batko, Y., Pitsun, O.: Regions matching algorithms analysis to quantify the image segmentation results. In: Proceedings of the XIth International Scientific and Technical Conference Computer Sciences and Information Technologies, CSIT 2016, Lviv, 6\u201310 September 2016, pp. 33\u201336 (2016)","DOI":"10.1109\/STC-CSIT.2016.7589862"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Berezsky, O., Pitsun, O., Batryn, N., Berezska, K., Savka, N., Dolynyuk, T.: Image segmentation metric-based adaptive method. In: Proceedings of the 2018 IEEE Second International Conference on Data Stream Mining & Processing (DSMP), Lviv, 21\u201325 August 2018, pp. 54\u2013557 (2018)","DOI":"10.1109\/DSMP.2018.8478579"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Berezsky, O.M., Pitsun, O.Y.: Computation of the minimum distance between non-convex polygons for segmentation quality evaluation. In: Proceedings of the XIIth International Scientific and Technical Conference Computer Sciences and Information Technologies, CSIT 2017, Lviv, 5\u20138 September 2017, pp. 183\u2013186 (2017)","DOI":"10.1109\/STC-CSIT.2017.8098764"},{"key":"13_CR13","first-page":"41","volume":"1","author":"OM Berezsky","year":"2018","unstructured":"Berezsky, O.M., Pitsun, O.Y.: Evaluation methods of image segmentation quality. Radio Electron. Comput. Sci. Control 1, 41\u201361 (2018)","journal-title":"Radio Electron. Comput. Sci. Control"},{"issue":"2","key":"13_CR14","first-page":"165","volume":"48","author":"O Berezsky","year":"2017","unstructured":"Berezsky, O., Zarichnyi, M.: Fr\u00e9chet distance between weighted rooted trees. MatematychniStudii 48(2), 165\u2013170 (2017)","journal-title":"MatematychniStudii"},{"issue":"1","key":"13_CR15","first-page":"88","volume":"50","author":"O Berezsky","year":"2018","unstructured":"Berezsky, O., Zarichnyi, M.: Gromov-Fr\u00e9chet distance between curves. MatematychniStudii 50(1), 88\u201392 (2018)","journal-title":"MatematychniStudii"},{"issue":"4","key":"13_CR16","first-page":"4","volume":"6","author":"O Berezsky","year":"2017","unstructured":"Berezsky, O., Zarichnyi, M., Pitsun, O.: Development of a metric and the methods for quantitative estimation of the segmentation of biomedical images. East.-Eur. J. Enterp. Technol. 6(4), 4\u201311 (2017)","journal-title":"East.-Eur. J. Enterp. Technol."},{"issue":"7","key":"13_CR17","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1090\/S0002-9939-08-09173-9","volume":"136","author":"CJ Bishop","year":"2008","unstructured":"Bishop, C.J., Hakobyan, H.: A central set of dimension 2. Proc. Am. Math. Soc. 136(7), 2453\u20132461 (2008)","journal-title":"Proc. Am. Math. Soc."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2007.08.003","volume":"41","author":"K Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet distance between simple polygons. Comput. Geom. 41, 2\u201320 (2008)","journal-title":"Comput. Geom."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Burago, D., Burago, Y., Ivanov, S.: A Course in Metric Geometry. Vol. 33 of Graduate Studies in Mathematics. American Mathematical Society, Providence, Rhode Island, June 2001","DOI":"10.1090\/gsm\/033"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jvcir.2007.04.003","volume":"19","author":"JG Camarena","year":"2008","unstructured":"Camarena, J.G., Gregori, V., Morillas, S., Sapena, A.: Fast detection and removal of impulsive noise using peer groups and fuzzy metrics. J. Vis. Commun. Image Represent. 19, 20\u201329 (2008)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"13_CR21","unstructured":"Chowdhury, S.: Metric and Topological Approaches to Network Data Analysis. Ph.D thesis, The Ohio State University (2019)"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1093\/sysbio\/syx046","volume":"67","author":"C Colijn","year":"2018","unstructured":"Colijn, C., Plazzotta, G.: A metric on phylogenetic tree shapes. Syst. Biol. 67(1), 113\u2013126 (2018)","journal-title":"Syst. Biol."},{"key":"13_CR23","unstructured":"Cook IV, A.F., Driemel, A., Sherette, J., Wenk, C.: Computing the Fr\u00e9chet distance between folded polygons. Comput. Geom. 50, 1\u201316 (2015)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Deza, M.M., Deza, E.: Encyclopedia of distances, pp. 1\u2013583. Springer (2009)","DOI":"10.1007\/978-3-642-00234-2_1"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Dubuisson, M.-P., Jain, A.K.: A modified hausdorff distance for object matching. In: Proceedings of the 12th International Conference on Pattern Recognition, Jerusalem, Israel, pp. 566\u2013568 (1994)","DOI":"10.1109\/ICPR.1994.576361"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Edwards, D.A.: The Structure of Superspace, Published in: Studies in Topology. Academic Press (1975)","DOI":"10.1016\/B978-0-12-663450-1.50017-7"},{"key":"13_CR27","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical Report CDTR 94\/64, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria (1994)"},{"key":"13_CR28","first-page":"1","volume":"19","author":"H Hahn","year":"1908","unstructured":"Hahn, H.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Mathematico di Palermo 19, 1\u201374 (1908)","journal-title":"Rendiconti del Circolo Mathematico di Palermo"},{"issue":"3","key":"13_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1112\/S0024611597000233","volume":"74","author":"DH Fremlin","year":"1997","unstructured":"Fremlin, D.H.: Skeletons and central sets. Proc. London Math. Soc. 74(3), 701\u2013720 (1997)","journal-title":"Proc. London Math. Soc."},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Gromov, M.: Groups of Polynomial growth and Expanding Maps. Publications mathematiques I.H.E.S., 53 (1981)","DOI":"10.1007\/BF02698687"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Huttenlocher, D.P., Klanderman, G.A., William, J.R.: Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Machine Intell. 15(9), 850\u2013863 (1993)","DOI":"10.1109\/34.232073"},{"issue":"3","key":"13_CR32","first-page":"396","volume":"7","author":"N Jayanthi","year":"2018","unstructured":"Jayanthi, N., Indu, S.: Comparison of image matching techniques. Int. J. Latest Trends Eng. Technol. 7(3), 396\u2013401 (2018)","journal-title":"Int. J. Latest Trends Eng. Technol."},{"key":"13_CR33","unstructured":"Katukam, R.: Image comparison methods & tools: a review. In: 1st National Conference on, Emerging Trends in Information Technology [ETIT], 28th\u201329th December 2015, pp. 35\u201342 (2015)"},{"issue":"5","key":"13_CR34","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1142\/S0218001498000348","volume":"12","author":"S Kwong","year":"1998","unstructured":"Kwong, S., He, Q.H., Man, K.F., Tang, K.S., Chau, C.W.: Parallel genetic-based hybrid pattern matching algorithm for isolated word recognition. Int. J. Pattern Recogn. Artif. Intell. 12(5), 573\u2013594 (1998)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"13_CR35","unstructured":"Majhi, S., Vitter, J., Wenk, C.: Approximating Gromov-Hausdorff Distance in Euclidean Space. arXiv:1912.13008v1"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"M\u00e9moli, F.: Gromov-Hausdorff distances in Euclidean spaces. In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, Anchorage, AK, USA, pp. 1\u20138. IEEE, June 2008","DOI":"10.1109\/CVPRW.2008.4563074"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.comgeo.2004.05.004","volume":"30","author":"A Mosig","year":"2005","unstructured":"Mosig, A., Clausen, M.: Approximately matching polygonal curves with respect to the Fr\u00e9chet distance. Comput. Geom. 30, 113\u2013127 (2005)","journal-title":"Comput. Geom."},{"issue":"7","key":"13_CR38","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/34.56215","volume":"12","author":"M Parizeau","year":"1990","unstructured":"Parizeau, M., Plamondon, R.: A comparative analysis of regional correlation, dynamic time warping, and skeletal tree matching for signature verification. IEEE Trans. Pattern Anal. Mach. Intell. 12(7), 710\u2013717 (1990)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.comgeo.2005.01.004","volume":"37","author":"G Rote","year":"2007","unstructured":"Rote, G.: Computing the Fr\u00e9chet distance between piecewise smooth curves. Comput. Geom. 37, 162\u2013174 (2007)","journal-title":"Comput. Geom."},{"key":"13_CR40","unstructured":"Revaud, J., Weinzaepfel, P., Harchaoui, Z., Schmid, C.: Deep convolutional matching. In: Computer Vision & Pattern Recognition, pp. 1164\u20131172 (2015)"},{"issue":"1","key":"13_CR41","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1142\/S0218195916500035","volume":"26","author":"MI Schlesinger","year":"2016","unstructured":"Schlesinger, M.I., Vodolazskiy, E.V., Yakovenko, V.M.: Fr\u00e9chet similarity of closed polygonal curves. Int. J. Comput. Geom. Appl. 26(1), 53\u201366 (2016)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"13_CR42","unstructured":"Schmidt, J., Gr\u00f6ller, E., Bruckner, S.: VAICo: visual analysis for image comparison. IEEE Trans. Vis. Comput. Graph. 19(12), 2090\u20132099 (2013)"},{"key":"13_CR43","unstructured":"Smith, Z., Wan, Z.: Gromov-Hausdorff distances on p-metric spaces and ultrametric spaces. arXiv:1912.00564v3"},{"key":"13_CR44","unstructured":"Touli, E.F.: Fr\u00e9chet-Like Distances between Two Merge Trees. arXiv:2004.10747"},{"key":"13_CR45","unstructured":"Tuzhilin, A.A.: Who Invented the Gromov-Hausdorff Distance? arXiv:1612.00728v1"},{"key":"13_CR46","unstructured":"Zarichnyi, I.: Gromov-Hausdorff Ultrametric. arXiv preprint math\/0511437 (2005)"},{"key":"13_CR47","unstructured":"Zhou, Y., Chen, M., Webster, M.F.: Comparative evaluation of visualization and experimental results using image comparison metrics. In: Proceedings of IEEE Visualization 2002 Conference, Boston, USA, pp. 315\u2013322 (2002)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Intelligent Systems and Computing V"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63270-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T21:12:37Z","timestamp":1724101957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63270-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,23]]},"ISBN":["9783030632694","9783030632700"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63270-0_13","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,23]]},"assertion":[{"value":"23 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computer Science and Information Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zbarazh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ukraine","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"V","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csit2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/csit.lp.edu.ua","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}