{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:56:27Z","timestamp":1761058587430,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679127"},{"type":"electronic","value":"9783540445913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722604_11","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T11:49:50Z","timestamp":1167479390000},"page":"120-132","source":"Crossref","is-referenced-by-count":1,"title":["Spectral Correspondence for Deformed Point-Set Matching"],"prefix":"10.1007","author":[{"given":"M.","family":"Carcassoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS series 92, AMS Ed. (1997)","DOI":"10.1090\/cbms\/092"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/cviu.1995.1004","volume":"61","author":"T.F. Cootes","year":"1995","unstructured":"Cootes, T.F., Taylor, C.J., Cooper, D.H., Graham, J.: Active Shape Models - Their Training and Application. Computer Vision, Graphics and Image Understanding\u00a061, 38\u201359 (1995)","journal-title":"Computer Vision, Graphics and Image Understanding"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1109\/34.730557","volume":"20","author":"A.D.J. Cross","year":"1998","unstructured":"Cross, A.D.J., Hancock, E.R.: Graph matching with a dual step EM algorithm. IEEE PAMI\u00a020, 1236\u20131253 (1998)","journal-title":"IEEE PAMI"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statistical Soc. Ser. B (methodological)\u00a039, 1\u201338 (1977)","journal-title":"J. Royal Statistical Soc. Ser. B (methodological)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"M.I. Jordan","year":"1994","unstructured":"Jordan, M.I., Jacobs, R.A.: Hierarchical mixtures of experts and the EM algorithm. Neural Computation\u00a06, 181\u2013214 (1994)","journal-title":"Neural Computation"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/34.387502","volume":"17","author":"S. Sclaroff","year":"1995","unstructured":"Sclaroff, S., Pentland, A.P.: Modal Matching for Correspondence and Recognition. IEEE PAMI\u00a017, 545\u2013661 (1995)","journal-title":"IEEE PAMI"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Scott, G.L., Longuet-Higgins, H.C.: An algorithm for associating the features of 2 images. In: Proceedings of the Royal Society of London Series B (Biological), vol.\u00a0244, pp. 21\u201326 (1991)","DOI":"10.1098\/rspb.1991.0045"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/cviu.1997.0631","volume":"70","author":"K. Sengupta","year":"1998","unstructured":"Sengupta, K., Boyer, K.L.: Modelbase partitioning using property matrix spectra. Computer Vision and Image Understanding\u00a070(2), 177\u2013196 (1998)","journal-title":"Computer Vision and Image Understanding"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0262-8856(92)90043-3","volume":"10","author":"L.S. Shapiro","year":"1992","unstructured":"Shapiro, L.S., Brady, J.M.: Feature-based correspondence - an eigenvector approach. Image and Vision Computing\u00a010, 283\u2013288 (1992)","journal-title":"Image and Vision Computing"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Shokoufandeh, A., Dickinson, S.J., Siddiqi, K., Zucker, S.W.: Indexing using a spectralen coding of topological structure. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp. 491\u2013497 (1999)","DOI":"10.1109\/CVPR.1999.784726"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Sossa, H., Horaud, R.: Model indexing: the graph-hashing approach. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp. 811\u2013815 (1992)","DOI":"10.1109\/CVPR.1992.223252"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE PAMI\u00a010, 695\u2013703 (1988)","journal-title":"IEEE PAMI"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"R.C. Wilson","year":"1997","unstructured":"Wilson, R.C., Hancock, E.R.: Structural Matching by Discrete Relaxation. IEEE PAMI\u00a019, 634\u2013648 (1997)","journal-title":"IEEE PAMI"}],"container-title":["Lecture Notes in Computer Science","Articulated Motion and Deformable Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722604_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T19:08:30Z","timestamp":1736708910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722604_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679127","9783540445913"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/10722604_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}