{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:13Z","timestamp":1725484633314},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440116"},{"type":"electronic","value":"9783540706595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-70659-3_11","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T03:47:11Z","timestamp":1180151231000},"page":"113-122","source":"Crossref","is-referenced-by-count":5,"title":["Learning Structural Variations in Shock 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,8,21]]},"reference":[{"key":"11_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":"11_CR2","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":"11_CR3","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":"11_CR4","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":"11_CR5","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":"11_CR6","first-page":"912","volume":"1","author":"B. Luo","year":"2001","unstructured":"B. Luo, et al., Clustering shock trees, in CVPR, Vol 1, pp. 912\u2013919, 2001.","journal-title":"CVPR"},{"key":"11_CR7","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":"11_CR8","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":"11_CR9","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":"11_CR10","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":"11_CR11","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","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-70659-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T18:50:53Z","timestamp":1550343053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70659-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440116","9783540706595"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-70659-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}