{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T23:27:33Z","timestamp":1783380453143,"version":"3.54.6"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012234","name":"Shenzhen Peacock Plan","doi-asserted-by":"publisher","award":["20130408-183003656"],"award-info":[{"award-number":["20130408-183003656"]}],"id":[{"id":"10.13039\/501100012234","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. Video Technol."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tcsvt.2017.2718225","type":"journal-article","created":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T18:40:48Z","timestamp":1498070448000},"page":"2978-2992","source":"Crossref","is-referenced-by-count":35,"title":["Second- and High-Order Graph Matching for Correspondence Problems"],"prefix":"10.1109","volume":"28","author":[{"given":"Ruonan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2664-4413","authenticated-orcid":false,"given":"Wenmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.36"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAFFC.2016.2628787"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12009"},{"key":"ref32","first-page":"5270","article-title":"A flexible tensor block coordinate ascent scheme for hypergraph matching","author":"nguyen","year":"2015","journal-title":"Proc CVPR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2199502"},{"key":"ref36","first-page":"1633","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","volume":"19","author":"zhou","year":"2006","journal-title":"Proc NIPS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.09.038"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5607-3"},{"key":"ref28","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc IEEE CVPR"},{"key":"ref27","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"2012","journal-title":"Proc IEEE CVPR"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76831-9_6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9664-0_5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238630"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"ref22","first-page":"1","article-title":"A K-Nearest-Neighbor-Pooling method for graph matching","author":"zhang","year":"2016","journal-title":"Proc ICME Workshop"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299142"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2000.855899"},{"key":"ref23","first-page":"799","article-title":"An MCMC-based prior sub-hypergraph matching in presence of outliers","author":"zhang","year":"2016","journal-title":"Proc ICPR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref25","first-page":"35","article-title":"Survey of feature points detection and matching using SURF, SIFT and PCA-SIFT","volume":"1","author":"shah","year":"2014","journal-title":"J Emerg Technol Innov Res JETIR"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref11","first-page":"313","article-title":"Balanced graph matching","volume":"19","author":"cour","year":"2007","journal-title":"Proc NIPS"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2467315"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref13","first-page":"1114","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Proc NIPS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.376"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46248-5_34"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/AVSS.2003.1217942"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-8671-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2011.6130224"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2567657"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126316"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.21"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-21"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587597"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011137"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325750"},{"key":"ref42","first-page":"1453","article-title":"Synthesis of MCMC and belief propagation","author":"ahn","year":"2016","journal-title":"Proc NIPS"},{"key":"ref41","author":"liu","year":"2008","journal-title":"Monte Carlo Strategies in Scientific Computing"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.690"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/0470011815.b2a14021"}],"container-title":["IEEE Transactions on Circuits and Systems for Video Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/76\/8506638\/07954631.pdf?arnumber=7954631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:03Z","timestamp":1642004943000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7954631\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":50,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcsvt.2017.2718225","relation":{},"ISSN":["1051-8215","1558-2205"],"issn-type":[{"value":"1051-8215","type":"print"},{"value":"1558-2205","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}