{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:02:23Z","timestamp":1742378543224},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193170"},{"type":"electronic","value":"9783642193187"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19318-7_37","type":"book-chapter","created":{"date-parts":[[2011,2,16]],"date-time":"2011-02-16T11:10:47Z","timestamp":1297854647000},"page":"471-482","source":"Crossref","is-referenced-by-count":2,"title":["Multiple Order Graph Matching"],"prefix":"10.1007","author":[{"given":"Aiping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sikun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018, 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S. Belongie","year":"2002","unstructured":"Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell.\u00a024, 509\u2013522 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"D.G. Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision\u00a060, 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vision"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008), pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2009), pp. 1980\u20131987 (2009)","DOI":"10.1109\/CVPRW.2009.5206619"},{"issue":"12","key":"37_CR6","doi-asserted-by":"publisher","first-page":"2205","DOI":"10.1109\/TPAMI.2010.51","volume":"32","author":"M. Chertok","year":"2010","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 99,\u00a032(12), 2205\u20132215 (2010)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence 99"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: International Conference of Computer Vision (ICCV 2005), pp. 1482\u20131489 (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L.D. Lathauwer","year":"2000","unstructured":"Lathauwer, L.D., Moor, B.D., Vandewalle, J.: On the best rank-1 and rank-(r1,r2,.,rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl.\u00a021, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/S0895479801387413","volume":"23","author":"E. Kofidis","year":"2002","unstructured":"Kofidis, E., Regalia, P.A.: On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl.\u00a023, 863\u2013884 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advanced in Neural Information Processing Systems (NIPS 2006) (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19318-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T05:18:02Z","timestamp":1712207882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19318-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193170","9783642193187"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19318-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}