{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T10:25:20Z","timestamp":1778840720931,"version":"3.51.4"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cvpr.2012.6247667","type":"proceedings-article","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T15:05:51Z","timestamp":1343833551000},"page":"127-134","source":"Crossref","is-referenced-by-count":56,"title":["Factorized graph matching"],"prefix":"10.1109","author":[{"family":"Feng Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"De la Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"35","article-title":"Feature correspondence via graph matching: Models and global optimization","author":"torresani","year":"2008","journal-title":"ECCV"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90029-8"},{"key":"33","article-title":"Recognizing and tracking human action","author":"sullivan","year":"2002","journal-title":"ECCV"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"34","article-title":"Solving Markov random fields using semidefinite programming","author":"torr","year":"2003","journal-title":"AISTATS"},{"key":"16","author":"everingham","year":"0","journal-title":"The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"13","article-title":"Balanced graph matching","author":"cour","year":"2006","journal-title":"NIPS"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.95"},{"key":"11","article-title":"Reweighted random walks for graph matching","author":"cho","year":"2010","journal-title":"ECCV"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581958"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126548"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"22","article-title":"Discovering texture regularity as a higher-order correspondence problem","author":"hays","year":"2006","journal-title":"ECCV"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.212"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"25","article-title":"An integer projected fixed point method for graph matching and MAP inference","author":"leordeanu","year":"2009","journal-title":"NIPS"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177151"},{"key":"29","author":"ng","year":"2002","journal-title":"A Continuation Approach for Solving Nonlinear Optimization Problems with Discrete Variables"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/34.211474"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719154"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.121"},{"key":"1","year":"0"},{"key":"30","article-title":"Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision","author":"schellewald","year":"2001","journal-title":"DAGM-Symposium"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126316"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0803042"},{"key":"31","article-title":"Probabilistic subgraph matching based on convex relaxation","author":"schellewald","year":"2005","journal-title":"EMMCVPR"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"}],"event":{"name":"2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"Providence, RI","start":{"date-parts":[[2012,6,16]]},"end":{"date-parts":[[2012,6,21]]}},"container-title":["2012 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6235193\/6247647\/06247667.pdf?arnumber=6247667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T21:12:56Z","timestamp":1490130776000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6247667\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2012.6247667","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}