{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T07:57:29Z","timestamp":1784879849938,"version":"3.55.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1116886"],"award-info":[{"award-number":["IIS-1116886"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1049694"],"award-info":[{"award-number":["IIS-1049694"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61129001"],"award-info":[{"award-number":["61129001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61025005"],"award-info":[{"award-number":["61025005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61221001"],"award-info":[{"award-number":["61221001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"111 Program","award":["B07022"],"award-info":[{"award-number":["B07022"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/tip.2014.2387386","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T19:52:08Z","timestamp":1420573928000},"page":"994-1009","source":"Crossref","is-referenced-by-count":93,"title":["Consistency-Driven Alternating Optimization for Multigraph Matching: A Unified Approach"],"prefix":"10.1109","volume":"24","author":[{"given":"Junchi","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyuan","family":"Zha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaokang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"ref38","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.12.007"},{"key":"ref31","article-title":"Solving the multi-way matching problem by permutation synchronization","author":"pachauri","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001413500018"},{"key":"ref37","article-title":"Balanced graph matching","author":"cour","year":"2006","journal-title":"Advances in neural information processing systems"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.374"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152360"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90053-8"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.13182\/NSE05-05"},{"key":"ref28","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc IEEE CVPR"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.376"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2002.803111"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.09.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.10.013"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00107-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15992-3_33"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003253"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015775"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00117-7"},{"key":"ref50","first-page":"381","article-title":"Softmax to softassign: Neural network algorithms for combinatorial optimization","volume":"2","author":"gold","year":"1996","journal-title":"J Artif Neural Netw"},{"key":"ref51","author":"chvatal","year":"1983","journal-title":"Linear Programming"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90029-8"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177151"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/0803042"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.04.015"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1142\/S021800141260004X"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767707"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"ref11","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref13","first-page":"492","article-title":"Reweighted random walks for graph matching","author":"cho","year":"2010","journal-title":"Proc ECCV"},{"key":"ref14","first-page":"821","article-title":"On the convergence of graph matching: Graduated assignment revisited","author":"tian","year":"2012","journal-title":"Proc ECCV"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.51"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2000.906248"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001402001915"},{"key":"ref19","first-page":"342","article-title":"Graph-based k-means clustering: A comparison of the set median versus the generalized median graph","author":"ferrer","year":"2009","journal-title":"Proc 13th CAIP"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540151"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33765-9_13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01427149"},{"key":"ref49","first-page":"1","article-title":"Multi-view point registration via alternating optimization","author":"yan","year":"2015","journal-title":"Proc AAAI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141925"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10268-4_16"},{"key":"ref48","first-page":"407","article-title":"Graduated consistency-regularized optimization for multi-graph matching","author":"yan","year":"2014","journal-title":"Proc ECCV"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14980-1_17"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/7014495\/07001592.pdf?arnumber=7001592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:54Z","timestamp":1642004874000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7001592\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":64,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tip.2014.2387386","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}