{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:53:26Z","timestamp":1725566006980},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232230"},{"type":"electronic","value":"9783540301257"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30125-7_44","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T05:32:50Z","timestamp":1284787970000},"page":"352-359","source":"Crossref","is-referenced-by-count":3,"title":["Graph Matching Using Manifold Embedding"],"prefix":"10.1007","author":[{"given":"Bai","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Hang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Edwin","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","volume-title":"Algebraic l-theory and topological manifolds","author":"A. Ranicki","year":"1992","unstructured":"Ranicki, A.: Algebraic l-theory and topological manifolds. Cambridge University Press, Cambridge (1992)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral graph theory. CBMS series\u00a092 (1997)","DOI":"10.1090\/cbms\/092"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1098\/rspb.1991.0045","volume":"244","author":"G.L. Scott","year":"1991","unstructured":"Scott, G.L., Longuett-Higgins, H.C.: An algorithm for associating the features of two images. Proceedings of the Royal Society of London B\u00a0244, 21\u201326 (1991)","journal-title":"Proceedings of the Royal Society of London B"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TPAMI.2003.1195989","volume":"25","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. PAMI\u00a025, 530\u2013549 (2003)","journal-title":"PAMI"},{"key":"44_CR5","volume-title":"The geometry of geodesics","author":"H. Busemann","year":"1955","unstructured":"Busemann, H.: The geometry of geodesics. Academic Press, London (1955)"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J.B. Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science\u00a0290, 586\u2013591 (2000)","journal-title":"Science"},{"key":"44_CR7","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":"44_CR8","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI\u00a023, 1120\u20131136 (2001)","journal-title":"IEEE PAMI"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE PAMI\u00a018 (1996)","DOI":"10.1109\/CVPR.1996.517080"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-70659-3_13","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"S. Kosinov","year":"2002","unstructured":"Kosinov, S., Caelli, T.: Inexact multisubgraph matching using graph eigenspace and clustering models. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 133\u2013142. Springer, Heidelberg (2002)"},{"key":"44_CR11","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":"44_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE PAMI\u00a017 (1995)","DOI":"10.1109\/34.400565"}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30125-7_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:42:33Z","timestamp":1605760953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30125-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232230","9783540301257"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30125-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}