{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:22:33Z","timestamp":1743002553175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437468"},{"type":"electronic","value":"9783540479772"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47977-5_54","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T17:07:52Z","timestamp":1179508072000},"page":"822-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Matching and Embedding through Edit-Union of Trees"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Torsello","sequence":"first","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H. G. Barrow","year":"1976","unstructured":"H. G. Barrow and R. M. Burstall, Subgraph isomorphism, matching relational structures and maximal cliques, Inf. Proc. Letter, Vol. 4, pp. 83, 84, 1976.","journal-title":"Inf. Proc. Letter"},{"key":"54_CR2","unstructured":"M. Bartoli et al., Attributed tree homomorphism using association graphs, In ICPR, 2000."},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"I. M. Bomze, M. Pelillo, and V. Stix, Approximating the maximum weight clique using replicator dynamics, IEEE Trans. on Neural Networks, Vol. 11, 2000.","DOI":"10.1109\/72.883403"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H. Bunke","year":"1983","unstructured":"H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, Vol 1, pp. 245\u2013253, 1983.","journal-title":"Pattern Recognition Letters"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0167-8655(99)00143-9","volume":"21","author":"H. Bunke","year":"2000","unstructured":"H. Bunke and A. Kandel, Mean and maximum common subgraph of two graphs, Pattern Recognition Letters, Vol. 21, pp. 163\u2013168, 2000.","journal-title":"Pattern Recognition Letters"},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/34.400565","volume":"17","author":"W. J. Christmas","year":"1995","unstructured":"W. J. Christmas and J. Kittler, Structural matching in computer vision using probabilistic relaxation, PAMI, Vol. 17, pp. 749\u2013764, 1995.","journal-title":"PAMI"},{"key":"54_CR7","first-page":"38","volume":"61","author":"T. F. Cootes","year":"1995","unstructured":"T. F. Cootes, C. J. Taylor, and D. H. Cooper, Active shape models-their training and application, CVIU, Vol. 61, pp. 38\u201359, 1995.","journal-title":"CVIU"},{"key":"54_CR8","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TPAMI.1986.4767835","volume":"8","author":"M. A. Eshera","year":"1986","unstructured":"M. A. Eshera and K-S Fu, An image understanding system using attributed symbolic representation and inexact graph-matching, PAMI, Vol 8, pp. 604\u2013618, 1986.","journal-title":"PAMI"},{"key":"54_CR9","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"L. E. Gibbons","year":"1997","unstructured":"L. E. Gibbons et al., Continuous characterizations of the maximum clique problem, Math. Oper. Res., Vol. 22, pp. 754\u2013768, 1997","journal-title":"Math. Oper. Res."},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"T. Heap and D. Hogg, Wormholes in shape space: tracking through discontinuous changes in shape, ICCV, pp. 344\u2013349, 1998.","DOI":"10.1109\/ICCV.1998.710741"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01451741","volume":"15","author":"B. B. Kimia","year":"1995","unstructured":"B. B. Kimia, A. R. Tannenbaum, and S. W. Zucker, Shapes, shocks, and deformations I, International Journal of Computer Vision, Vol. 15, pp. 189\u2013224, 1995.","journal-title":"International Journal of Computer Vision"},{"key":"54_CR12","first-page":"755","volume":"I","author":"T. Sebastian","year":"2001","unstructured":"T. Sebastian, P. Klein, and B. Kimia, Recognition of shapes by editing shock graphs, in ICCV, Vol. I, pp. 755\u2013762, 2001.","journal-title":"ICCV"},{"key":"54_CR13","first-page":"912","volume":"I","author":"B. Luo","year":"2001","unstructured":"B. Luo, et al., A probabilistic framework for graph clustering, in CVPR, Vol. I, pp. 912\u2013919, 2001.","journal-title":"CVPR"},{"key":"54_CR14","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M. Pelillo","year":"1999","unstructured":"M. Pelillo, K. Siddiqi, and S. W. Zucker, Matching hierarchical structures using association graphs, PAMI, Vol. 21, pp. 1105\u20131120, 1999.","journal-title":"PAMI"},{"key":"54_CR15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/34.387502","volume":"17","author":"S. Sclaroff","year":"1995","unstructured":"S. Sclaroff and A. P. Pentland, Modal matching for correspondence and recognition, PAMI, Vol. 17, pp. 545\u2013661, 1995.","journal-title":"PAMI"},{"key":"54_CR16","unstructured":"A. Shokoufandeh, S. J. Dickinson, K. Siddiqi, and S. W. Zucker, Indexing using a spectral encoding of topological structure, in CVPR, 1999."},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"K. Siddiqi and B. B. Kimia, A shock grammar for recognition, in CVPR, 507\u2013513, 1996.","DOI":"10.1109\/CVPR.1996.517119"},{"key":"54_CR18","doi-asserted-by":"crossref","unstructured":"K. Siddiqi, S. Bouix, A. Tannenbaum, and S. W. Zucker, The hamilton-jacobi skeleton, in ICCV, pp. 828\u2013834, 1999.","DOI":"10.1109\/ICCV.1999.790307"},{"key":"54_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1008102926703","volume":"35","author":"K. Siddiqi","year":"1999","unstructured":"K. Siddiqi et al., Shock graphs and shape matching, Int. J. of Comp. Vision, Vol. 35, pp. 13\u201332, 1999.","journal-title":"Int. J. of Comp. Vision"},{"key":"54_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"K-C Tai, The tree-to-tree correction problem, J. of the ACM, Vol. 26, pp. 422\u2013433, 1979.","journal-title":"J. of the ACM"},{"key":"54_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Int. Workshop on Visual Form","author":"A. Torsello","year":"2001","unstructured":"A. Torsello and E. R. Hancock, A skeletal measure of 2D shape similarity, Int. Workshop on Visual Form, LNCS 2059, 2001."},{"key":"54_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-44745-8_29","volume-title":"EMMCVPR","author":"A. Torsello","year":"2001","unstructured":"A. Torsello and E. R. Hancock, Efficiently computing weighted tree edit distance using relaxation labeling, in EMMCVPR, LNCS 2134, pp. 438\u2013453, 2001"},{"key":"54_CR23","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"W. H. Tsai","year":"1979","unstructured":"W. H. Tsai and K. S. Fu, Error-correcting isomorphism of attributed relational graphs for pattern analysis, Sys., Man, and Cyber., Vol. 9, pp. 757\u2013768, 1979.","journal-title":"Sys., Man, and Cyber."},{"key":"54_CR24","doi-asserted-by":"crossref","unstructured":"J. T. L. Wang, K. Zhang, and G. Chirn, The approximate graph matching problem, in ICPR, pp. 284\u2013288, 1994.","DOI":"10.1109\/ICPR.1994.576921"},{"key":"54_CR25","doi-asserted-by":"crossref","unstructured":"R. C. Wilson and E. R. Hancock, Structural matching by discrete relaxation, PAMI, 1997.","DOI":"10.1109\/34.601251"},{"key":"54_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"K. Zhang, A constrained edit distance between unordered labeled trees, Algorithmica, Vol. 15, pp. 205\u2013222, 1996.","journal-title":"Algorithmica"},{"key":"54_CR27","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. of Comp., Vol. 18, pp. 1245\u20131262, 1989.","journal-title":"SIAM J. of Comp."},{"key":"54_CR28","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"K. Zhang, R. Statman, and D. Shasha, On the editing distance between unorderes labeled trees, Inf. Proc. Letters, Vol. 42, pp. 133\u2013139, 1992.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2014 ECCV 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47977-5_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T12:24:23Z","timestamp":1737030263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47977-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437468","9783540479772"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-47977-5_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}