{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:34:45Z","timestamp":1780392885842,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":159,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["61471235"],"award-info":[{"award-number":["61471235"]}]},{"name":"Shanghai Science and Technology Commitee","award":["15JC1401700"],"award-info":[{"award-number":["15JC1401700"]}]},{"name":"Shanghai Science and Technology Commitee","award":["14XD1402100"],"award-info":[{"award-number":["14XD1402100"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,6]]},"DOI":"10.1145\/2911996.2912035","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:09:57Z","timestamp":1465564197000},"page":"167-174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":142,"title":["A Short Survey of Recent Advances in Graph Matching"],"prefix":"10.1145","author":[{"given":"Junchi","family":"Yan","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xu-Cheng","family":"Yin","sequence":"additional","affiliation":[{"name":"University of Science and Technology Beijing, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiyao","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng","family":"Deng","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyuan","family":"Zha","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaokang","family":"Yang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.21"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401651112"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459312"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.211474"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.epsr.2015.12.006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2007.10.012"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.02.013"},{"key":"e_1_3_2_1_8_1","volume-title":"Geometric polynomial constraints in higher-order graph matching. arXiv preprint arXiv:1405.6261","author":"Bansal M.","year":"2014","unstructured":"M. Bansal and K. Daniilidis . Geometric polynomial constraints in higher-order graph matching. arXiv preprint arXiv:1405.6261 , 2014 . M. Bansal and K. Daniilidis. Geometric polynomial constraints in higher-order graph matching. arXiv preprint arXiv:1405.6261, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.954600"},{"key":"e_1_3_2_1_10_1","volume-title":"A quadratic assignment formulation of the graph edit distance. arXiv preprint arXiv:1512.07494","author":"Bougleux S.","year":"2015","unstructured":"S. Bougleux , L. Brun , V. Carletti , P. Foggia , B. Ga\u00fcz\u00e8re , and M. Vento . A quadratic assignment formulation of the graph edit distance. arXiv preprint arXiv:1512.07494 , 2015 . S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Ga\u00fcz\u00e8re, and M. Vento. A quadratic assignment formulation of the graph edit distance. arXiv preprint arXiv:1512.07494, 2015."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.12.004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645888.673056"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.790431"},{"key":"e_1_3_2_1_15_1","volume-title":"Vision Interface","author":"Bunke H.","year":"2000","unstructured":"H. Bunke . Graph matching : theoretical foundations, algorithms, and applications . In Vision Interface , 2000 . H. Bunke. Graph matching: theoretical foundations, algorithms, and applications. In Vision Interface, 2000."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.05.007"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.10.013"},{"key":"e_1_3_2_1_20_1","volume-title":"ICML","author":"Chen Y.","year":"2014","unstructured":"Y. Chen , G. Leonidas , and Q. Huang . Matching partially similar objects via matrix completion . In ICML , 2014 . Y. Chen, G. Leonidas, and Q. Huang. Matching partially similar objects via matrix completion. In ICML, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.12.009"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"e_1_3_2_1_24_1","unstructured":"M. Cho S. Kwak C. Schmid and J. Ponce. Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In CVPR.  M. Cho S. Kwak C. Schmid and J. Ponce. Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In CVPR."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888150.1888189"},{"key":"e_1_3_2_1_26_1","volume-title":"CVPR","author":"Cho M.","year":"2012","unstructured":"M. Cho and K. M. Lee . Progressive graph matching: Making a move of graphs via probabilistic voting . In CVPR , 2012 . M. Cho and K. M. Lee. Progressive graph matching: Making a move of graphs via probabilistic voting. In CVPR, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1077-3142(03)00009-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68020-8_4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050985"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2000.906251"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.01.009"},{"key":"e_1_3_2_1_35_1","volume-title":"NIPS","author":"Cour T.","year":"2006","unstructured":"T. Cour , P. Srinivasan , and J. Shi . Balanced graph matching . In NIPS , 2006 . T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In NIPS, 2006."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/7.575891"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-009-0157-y"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03848-8_5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.51"},{"key":"e_1_3_2_1_42_1","volume-title":"SODA","author":"Eppstein D.","year":"1995","unstructured":"D. Eppstein . Subgraph isomorphism in planar graphs and related problems . In SODA , 1995 . D. Eppstein. Subgraph isomorphism in planar graphs and related problems. In SODA, 1995."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767835"},{"key":"e_1_3_2_1_44_1","volume-title":"NIPS","author":"Fiori M.","year":"2013","unstructured":"M. Fiori , P. Sprechmann , J. Vogelstein , P. Muse , and G. Sapiro . Robust multimodal graph matching: Sparse coding meets graph matching . In NIPS , 2013 . M. Fiori, P. Sprechmann, J. Vogelstein, P. Muse, and G. Sapiro. Robust multimodal graph matching: Sparse coding meets graph matching. In NIPS, 2013."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"e_1_3_2_1_46_1","volume-title":"Graph matching and learning in pattern recognition in the last 10 years. IJPRAI, 33(1)","author":"Foggia P.","year":"2014","unstructured":"P. Foggia , G. Percannella , and M. Vento . Graph matching and learning in pattern recognition in the last 10 years. IJPRAI, 33(1) , 2014 . P. Foggia, G. Percannella, and M. Vento. Graph matching and learning in pattern recognition in the last 10 years. IJPRAI, 33(1), 2014."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"e_1_3_2_1_49_1","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1990","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability ; A Guide to the Theory of NP-Completeness. Freeman and Co. , NY, USA, 1990 . M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman and Co., NY, USA, 1990."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"e_1_3_2_1_51_1","volume-title":"Matrix computations","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. Loan . Matrix computations . Johns Hopkins University Press , 1996 . G. Golub and C. Loan. Matrix computations. Johns Hopkins University Press, 1996."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/645890.671103"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.374"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366186"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/MMCS.1999.779297"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.07.008"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298807"},{"key":"e_1_3_2_1_59_1","first-page":"60","volume-title":"IS&T\/SPIE's Symposium on Electronic Imaging: Science and Technology","author":"Kitamoto A.","year":"1993","unstructured":"A. Kitamoto , C. Zhou , and M. Takagi . Similarity retrieval of noaa satellite imagery by graph matching . In IS&T\/SPIE's Symposium on Electronic Imaging: Science and Technology , pages 60 -- 73 , 1993 . A. Kitamoto, C. Zhou, and M. Takagi. Similarity retrieval of noaa satellite imagery by graph matching. In IS&T\/SPIE's Symposium on Electronic Imaging: Science and Technology, pages 60--73, 1993."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2011.07.008"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.690"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"e_1_3_2_1_65_1","volume-title":"NIPS","author":"Leordeanu M.","year":"2009","unstructured":"M. Leordeanu , M. Hebert , and R. Sukthankar . An integer projected fixed point method for graph matching and map inference . In NIPS , 2009 . M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and map inference. In NIPS, 2009."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575586"},{"key":"e_1_3_2_1_69_1","article-title":"Human age estimation based on locality and ordinal information","author":"Li C.","year":"2015","unstructured":"C. Li , Q. Liu , W. Dong , X. Zhu , J. Liu , and H. Lu . Human age estimation based on locality and ordinal information . IEEE Transaction on Cybernetics , 2015 . C. Li, Q. Liu, W. Dong, X. Zhu, J. Liu, and H. Lu. Human age estimation based on locality and ordinal information. IEEE Transaction on Cybernetics, 2015.","journal-title":"IEEE Transaction on Cybernetics"},{"key":"e_1_3_2_1_70_1","volume-title":"CVPR","author":"Li C.","year":"2012","unstructured":"C. Li , Q. Liu , J. Liu , and H. Lu . Learning ordinal discriminative features for age estimation . In CVPR , 2012 . C. Li, Q. Liu, J. Liu, and H. Lu. Learning ordinal discriminative features for age estimation. In CVPR, 2012."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp203"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2211373"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.223"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.45"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0707-7"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-012-0284-8"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_3_2_1_79_1","volume-title":"Seeded graph matching via joint optimization of fidelity and commensurability. stat, 1050:16","author":"Lyzinski V.","year":"2014","unstructured":"V. Lyzinski , S. Adali , J. T. Vogelstein , Y. Park , and C. E. Priebe . Seeded graph matching via joint optimization of fidelity and commensurability. stat, 1050:16 , 2014 . V. Lyzinski, S. Adali, J. T. Vogelstein, Y. Park, and C. E. Priebe. Seeded graph matching via joint optimization of fidelity and commensurability. stat, 1050:16, 2014."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"e_1_3_2_1_81_1","volume-title":"Data Engineering","author":"Melnik S.","year":"2002","unstructured":"S. Melnik , H. Garcia-Molina , and E. Rahm . A versatile graph matching algorithm and its application to schema matching . Data Engineering , 2002 . S. Melnik, H. Garcia-Molina, and E. Rahm. A versatile graph matching algorithm and its application to schema matching. Data Engineering, 2002."},{"key":"e_1_3_2_1_82_1","volume-title":"The dynamic hungarian algorithm for the assignment problem with changing costs","author":"Mills-Tettey G. A.","year":"2007","unstructured":"G. A. Mills-Tettey , A. Stentz , and M. B. Dias . The dynamic hungarian algorithm for the assignment problem with changing costs . 2007 . G. A. Mills-Tettey, A. Stentz, and M. B. Dias. The dynamic hungarian algorithm for the assignment problem with changing costs. 2007."},{"key":"e_1_3_2_1_83_1","first-page":"1","volume-title":"Pattern Analysis and Applications","author":"Moreno-Garc\u0131a C. F.","year":"2015","unstructured":"C. F. Moreno-Garc\u0131a and F. Serratosa . Correspondence consensus of two sets of correspondences through optimisation functions . Pattern Analysis and Applications , pages 1 -- 13 , 2015 . C. F. Moreno-Garc\u0131a and F. Serratosa. Correspondence consensus of two sets of correspondences through optimisation functions. Pattern Analysis and Applications, pages 1--13, 2015."},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41095-015-0030-4"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.846635"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.02.013"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.5555\/1769371.1769382"},{"key":"e_1_3_2_1_89_1","volume-title":"CVPR","author":"Ngoc Q.","year":"2015","unstructured":"Q. Ngoc , A. Gautier , and M. Hein . A flexible tensor block coo rd inate ascent scheme for hypergraph matching . In CVPR , 2015 . Q. Ngoc, A. Gautier, and M. Hein. A flexible tensor block coo rd inate ascent scheme for hypergraph matching. In CVPR, 2015."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299080"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.040"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2015.08.001"},{"key":"e_1_3_2_1_93_1","volume-title":"NIPS","author":"Pachauri D.","year":"2013","unstructured":"D. Pachauri , R. Kondor , and S. Vikas . Solving the multi-way matching problem by permutation synchronization . In NIPS , 2013 . D. Pachauri, R. Kondor, and S. Vikas. Solving the multi-way matching problem by permutation synchronization. In NIPS, 2013."},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.157"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01299390"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-BJPS188"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016313"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_3_2_1_99_1","volume-title":"Approximate graph edit distance in quadratic time","author":"Riesen K.","year":"2015","unstructured":"K. Riesen , M. Ferrer , and H. Bunke . Approximate graph edit distance in quadratic time . IEEE\/ACM Transactions on Computational Biology and Bioinformatics , 2015 . K. Riesen, M. Ferrer, and H. Bunke. Approximate graph edit distance in quadratic time. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 2015."},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.01.025"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.5555\/646265.686240"},{"key":"e_1_3_2_1_102_1","first-page":"353","volume-title":"A distance measure between attributed relational graphs for pattern recognition","author":"Sanfeliu A.","year":"1983","unstructured":"A. Sanfeliu and K.-S. Fu . A distance measure between attributed relational graphs for pattern recognition . pages 353 -- 362 , 1983 . A. Sanfeliu and K.-S. Fu. A distance measure between attributed relational graphs for pattern recognition. pages 353--362, 1983."},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887003.1887032"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.5555\/2009206.2009223"},{"key":"e_1_3_2_1_105_1","first-page":"249","volume-title":"5th International Conference on Computer Vision Theory and Applications","author":"G\u00fcell G. Sanrom\u00e0","year":"2010","unstructured":"G. Sanrom\u00e0 G\u00fcell , R. Alqu\u00e9zar Mancho , and F. Serratosa Casanelles . Graph matching using sift descriptors: an application to pose recovery of a mobile robot . In 5th International Conference on Computer Vision Theory and Applications , pages 249 -- 254 , 2010 . G. Sanrom\u00e0 G\u00fcell, R. Alqu\u00e9zar Mancho, and F. Serratosa Casanelles. Graph matching using sift descriptors: an application to pose recovery of a mobile robot. In 5th International Conference on Computer Vision Theory and Applications, pages 249--254, 2010."},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00253-2"},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003241"},{"key":"e_1_3_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.04.015"},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021800141550010X"},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676563"},{"key":"e_1_3_2_1_112_1","volume-title":"TMI","author":"Shen D.","year":"2002","unstructured":"D. Shen and C. D. Hammer . Hierarchical attribute matching mechanism for elastic registration . TMI , 2002 . D. Shen and C. D. Hammer. Hierarchical attribute matching mechanism for elastic registration. TMI, 2002."},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.366"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.547"},{"issue":"6","key":"e_1_3_2_1_115_1","first-page":"500","article-title":"Many-to-many feature matching in object recognition: a review of three approaches. Computer Vision","volume":"6","author":"Shokoufandeh A.","year":"2012","unstructured":"A. Shokoufandeh , Y. Keselman , M. F. Demirci , D. Macrini , and S. Dickinson . Many-to-many feature matching in object recognition: a review of three approaches. Computer Vision , IET , 6 ( 6 ): 500 -- 513 , 2012 . A. Shokoufandeh, Y. Keselman, M. F. Demirci, D. Macrini, and S. Dickinson. Many-to-many feature matching in object recognition: a review of three approaches. Computer Vision, IET, 6(6):500--513, 2012.","journal-title":"IET"},{"key":"e_1_3_2_1_116_1","first-page":"557","volume-title":"Decision and Control","author":"Showbridge P.","year":"1999","unstructured":"P. Showbridge , M. Kraetzl , and D. Ray . Detection of abnormal change in dynamic networks. In Information , Decision and Control , pages 557 -- 562 , 1999 . P. Showbridge, M. Kraetzl, and D. Ray. Detection of abnormal change in dynamic networks. In Information, Decision and Control, pages 557--562, 1999."},{"key":"e_1_3_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.12.007"},{"key":"e_1_3_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001413500018"},{"key":"e_1_3_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_45"},{"key":"e_1_3_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"e_1_3_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_59"},{"key":"e_1_3_2_1_122_1","volume-title":"AISTATS","author":"Torr P. H. S.","year":"2003","unstructured":"P. H. S. Torr . Solving markov random fields using semidefinite programmin . In AISTATS , 2003 . P. H. S. Torr. Solving markov random fields using semidefinite programmin. In AISTATS, 2003."},{"key":"e_1_3_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88688-4_44"},{"key":"e_1_3_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"e_1_3_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.002"},{"key":"e_1_3_2_1_126_1","volume-title":"Graph matching techniques for computer vision. Graph-Based Methods in Computer Vision: Developments and Applications: Developments and Applications, page 1","author":"Vento M.","year":"2012","unstructured":"M. Vento and P. Foggia . Graph matching techniques for computer vision. Graph-Based Methods in Computer Vision: Developments and Applications: Developments and Applications, page 1 , 2012 . M. Vento and P. Foggia. Graph matching techniques for computer vision. Graph-Based Methods in Computer Vision: Developments and Applications: Developments and Applications, page 1, 2012."},{"key":"e_1_3_2_1_127_1","article-title":"Density maximization for improving graph matching with its applications","author":"Wang C.","year":"2015","unstructured":"C. Wang , L. Wang , and L. Liu . Density maximization for improving graph matching with its applications . IEEE Transactions on Image Processing , 2015 . C. Wang, L. Wang, and L. Liu. Density maximization for improving graph matching with its applications. IEEE Transactions on Image Processing, 2015.","journal-title":"IEEE Transactions on Image Processing"},{"key":"e_1_3_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661278"},{"key":"e_1_3_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_49"},{"key":"e_1_3_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00117-7"},{"key":"e_1_3_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(95)00115-8"},{"key":"e_1_3_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1237-5"},{"key":"e_1_3_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2477832"},{"key":"e_1_3_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_27"},{"key":"e_1_3_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"e_1_3_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2387386"},{"key":"e_1_3_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.5555\/2888116.2888248"},{"key":"e_1_3_2_1_138_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.31"},{"key":"e_1_3_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"e_1_3_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2477843"},{"key":"e_1_3_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.0076"},{"key":"e_1_3_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33765-9_13"},{"key":"e_1_3_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2015.7351123"},{"key":"e_1_3_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2016.01.004"},{"key":"e_1_3_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15939-8_33"},{"key":"e_1_3_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"e_1_3_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"e_1_3_2_1_148_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"e_1_3_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027730"},{"key":"e_1_3_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.114"},{"key":"e_1_3_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01427149"},{"key":"e_1_3_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.898928"},{"key":"e_1_3_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.5555\/645495.657719"},{"key":"e_1_3_2_1_154_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2501802"},{"key":"e_1_3_2_1_155_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.376"},{"key":"e_1_3_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2015.376"},{"key":"e_1_3_2_1_157_1","first-page":"1301","volume-title":"ICML","author":"Zhou K.","year":"2013","unstructured":"K. Zhou , H. Zha , and L. Song . Learning triggering kernels for multi-dimensional hawkes processes . In ICML , pages 1301 -- 1309 , 2013 . K. Zhou, H. Zha, and L. Song. Learning triggering kernels for multi-dimensional hawkes processes. In ICML, pages 1301--1309, 2013."},{"key":"e_1_3_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.459"},{"key":"e_1_3_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.002"}],"event":{"name":"ICMR'16: International Conference on Multimedia Retrieval","location":"New York New York USA","acronym":"ICMR'16","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 2016 ACM on International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911996.2912035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2911996.2912035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:07Z","timestamp":1750222567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911996.2912035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":159,"alternative-id":["10.1145\/2911996.2912035","10.1145\/2911996"],"URL":"https:\/\/doi.org\/10.1145\/2911996.2912035","relation":{},"subject":[],"published":{"date-parts":[[2016,6,6]]},"assertion":[{"value":"2016-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}