{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:08:02Z","timestamp":1780765682994,"version":"3.54.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["DMS-1317424"],"award-info":[{"award-number":["DMS-1317424"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61527804"],"award-info":[{"award-number":["61527804"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","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":"NSFC","doi-asserted-by":"publisher","award":["61221001"],"award-info":[{"award-number":["61221001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"STCSM","doi-asserted-by":"publisher","award":["15JC1401700"],"award-info":[{"award-number":["15JC1401700"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"STCSM","doi-asserted-by":"publisher","award":["14XD1402100"],"award-info":[{"award-number":["14XD1402100"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"STCSM","doi-asserted-by":"publisher","award":["13511504501"],"award-info":[{"award-number":["13511504501"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The 111 Program","award":["B07022"],"award-info":[{"award-number":["B07022"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2016,6,1]]},"DOI":"10.1109\/tpami.2015.2477832","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T03:23:11Z","timestamp":1441941791000},"page":"1228-1242","source":"Crossref","is-referenced-by-count":135,"title":["Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization"],"prefix":"10.1109","volume":"38","author":[{"given":"Junchi","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minsu","family":"Cho","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 M.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001413500018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"ref30","first-page":"1860","article-title":"Solving the multi-way matching problem by permutation synchronization","author":"pachauri","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.374"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.12.007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015775"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366186"},{"key":"ref2","first-page":"100","article-title":"Near-optimal joint object matching via convex relaxation","author":"chen","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_27"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/69558.75700"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.51"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2307\/1907742"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"ref50","first-page":"596","article-title":"Feature correspondence via graph matching: Models and global optimization","author":"torresani","year":"0","journal-title":"Proc 10th Eur Conf Comput Vis"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152360"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0858-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_49"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12184"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/VAST.2014.7042494"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01427149"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2501802"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref17","first-page":"1114","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"0","journal-title":"Proc Adv Neur Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777638_0014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1109\/TIP.2014.2387386","article-title":"Consistency-driven alternating optimization for multi-graph matching: A unified approach","volume":"24","author":"yan","year":"2015","journal-title":"IEEE Trans Image Process"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00117-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP.2015.7340792"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90053-8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10268-4_16"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2009.5457683"},{"key":"ref47","first-page":"180","article-title":"Graduated assignment algorithm for finding the common labelling of a set of graphs","author":"ribalta","year":"0","journal-title":"Proc SSPR"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_10"},{"key":"ref44","first-page":"313","article-title":"Balanced graph matching","author":"cour","year":"0","journal-title":"Proc Adv Neural Inf Process Syst 19"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/34\/7464929\/7254216-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7464929\/07254216.pdf?arnumber=7254216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:47:34Z","timestamp":1649443654000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7254216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,1]]},"references-count":52,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2015.2477832","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,1]]}}}