{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T12:14:21Z","timestamp":1770552861017,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000781","name":"ERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NOLEPRO"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2017,6,1]]},"DOI":"10.1109\/tpami.2016.2574706","type":"journal-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T13:05:39Z","timestamp":1464872739000},"page":"1054-1075","source":"Crossref","is-referenced-by-count":20,"title":["An Efficient Multilinear Optimization Framework for Hypergraph Matching"],"prefix":"10.1109","volume":"39","author":[{"given":"Quynh","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Tudisco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Gautier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Hein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995455"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44522-6_24"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.45"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.52"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"ref36","article-title":"A flexible\n tensor block coordinate ascent scheme for hypergraph matching","author":"nguyen","year":"2015","journal-title":"Proc Comput Vis Pattern Recog"},{"key":"ref35","author":"mundy","year":"1993","journal-title":"Applications of Invariance in Computer Vision"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177151"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206533"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref29","article-title":"An\n integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.29"},{"key":"ref1","year":"0"},{"key":"ref20","first-page":"522","article-title":"Discovering texture regularity as a\n higher-order correspondence problem","author":"hays","year":"2006","journal-title":"Proc 9th Eur Conf Comput Vis -Vol Part II"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.690"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/KES.1999.820179"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.376"},{"key":"ref10","first-page":"492","article-title":"Reweighted random walks for\n graph matching","author":"cho","year":"2010","journal-title":"Proc 11th Eur Conf Comput Vis Part V"},{"key":"ref11","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"2012","journal-title":"IEEE Conf Comput Vis Pattern Recog"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299142"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref14","article-title":"Balanced graph matching","author":"cour","year":"2007","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDAR.1995.602033"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref19","article-title":"Tutorial I: The algebraic approach to invariance","author":"hartley","year":"1994","journal-title":"Proc ESPRIT Workshop"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00054-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972238"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.15"},{"key":"ref49","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540189"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88688-4_44"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1074\/mcp.T200001-MCP200"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/IEMBS.2004.1403843"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.05.013"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7919342\/07482852.pdf?arnumber=7482852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:23Z","timestamp":1641987563000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7482852\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":50,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2016.2574706","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,1]]}}}