{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T11:38:31Z","timestamp":1783597111936,"version":"3.55.0"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602176"],"award-info":[{"award-number":["61602176"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization","award":["U1609220"],"award-info":[{"award-number":["U1609220"]}]},{"DOI":"10.13039\/501100002858","name":"China Post-Doctoral Science Foundation","doi-asserted-by":"publisher","award":["2016M590337"],"award-info":[{"award-number":["2016M590337"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tcyb.2017.2655538","type":"journal-article","created":{"date-parts":[[2017,2,17]],"date-time":"2017-02-17T19:51:59Z","timestamp":1487361119000},"page":"765-779","source":"Crossref","is-referenced-by-count":81,"title":["Adaptive Discrete Hypergraph Matching"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8703-6414","authenticated-orcid":false,"given":"Changsheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yin","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guitao","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/34.400565"},{"key":"ref33","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.10.013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.21"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_45"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1981.4767144"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016313"},{"key":"ref35","first-page":"313","article-title":"Balanced graph matching","author":"cour","year":"2006","journal-title":"Proc NIPS"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2477832"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152360"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_59"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.690"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/11612704_49"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33765-9_13"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref21","first-page":"381","article-title":"Softmax to softassign: Neural network algorithms for combinatorial optimization","volume":"2","author":"gold","year":"1995","journal-title":"J Artif Neural Netw"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref25","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":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767707"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_27"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.31"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2387386"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2000.861047"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/34.790431"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00132-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref17","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc CVPR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref19","first-page":"1969","article-title":"The constrained Laplacian rank algorithm for graph-based clustering","author":"nie","year":"2016","journal-title":"Proc AAAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_49"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298912"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2527239"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.05.016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2536752"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2585355"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.157"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2738050"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.08.003"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2015.06.005"},{"key":"ref48","article-title":"Geometric polynomial constraints in higher-order graph matching","author":"bansal","year":"2014","journal-title":"arXiv 1405 6261"},{"key":"ref47","first-page":"5270","article-title":"A flexible tensor block coordinate ascent scheme for hypergraph matching","author":"ngoc","year":"2015","journal-title":"Proc CVPR"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1142\/S021800141260004X"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1142\/S021800141550010X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.04.015"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8246764\/07858754.pdf?arnumber=7858754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:12Z","timestamp":1642004712000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7858754\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":61,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2655538","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}