{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T08:29:47Z","timestamp":1773476987252,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"China Major State Research Development Program","award":["2018AAA0100704"],"award-info":[{"award-number":["2018AAA0100704"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972250"],"award-info":[{"award-number":["61972250"]}],"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":["U19B2035"],"award-info":[{"award-number":["U19B2035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011222","name":"National Laboratory of Pattern Recognition","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011222","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021,10,1]]},"DOI":"10.1109\/tpami.2020.2989928","type":"journal-article","created":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T20:19:46Z","timestamp":1587673186000},"page":"3648-3663","source":"Crossref","is-referenced-by-count":24,"title":["Unifying Offline and Online Multi-Graph Matching via Finding Shortest Paths on Supergraph"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4051-0561","authenticated-orcid":false,"given":"Zetian","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9908-1036","authenticated-orcid":false,"given":"Tianzhe","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.437"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7900232"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01141"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185550"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619511"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01136"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.31"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2491922"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0707-7"},{"key":"ref40","first-page":"1114","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.95"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2182810"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12184"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2387386"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2477832"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref3","article-title":"A faster algorithm for shortest-path SPFA","volume":"29","author":"duan","year":"1994","journal-title":"J Southwest Jiaotong Univ"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01261-8_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.03.021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00078"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01427149"},{"key":"ref2","first-page":"285","article-title":"The shortest path through a maze","author":"moore","year":"1959","journal-title":"Proc Int Symp Switching Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref20","first-page":"1860","article-title":"Solving the multi-way matching problem by permutation synchronization","author":"pachauri","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.459"},{"key":"ref21","first-page":"100","article-title":"Near-optimal joint object matching via convex relaxation","author":"chen","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15552-9_57"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989308"},{"key":"ref41","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.547"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"ref43","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00261"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9527405\/09076840.pdf?arnumber=9076840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:49:24Z","timestamp":1652194164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9076840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,1]]},"references-count":44,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.2989928","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,1]]}}}