{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T10:25:19Z","timestamp":1778840719223,"version":"3.51.4"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/iccv.2011.6126507","type":"proceedings-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T16:40:48Z","timestamp":1328028048000},"page":"2274-2281","source":"Crossref","is-referenced-by-count":44,"title":["Semi-supervised learning and optimization for hypergraph matching"],"prefix":"10.1109","author":[{"given":"Marius","family":"Leordeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Zanfir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Sminchisescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.185"},{"key":"14","article-title":"Solving markov random fields using semidefinite programming","author":"torr","year":"2003","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"11","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Neural Information Processing Systems"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/11585978_12","article-title":"Probabilistic subgraph matching based on convex relaxation","author":"schellewald","year":"2005","journal-title":"Energy Minimization Methods Computer Vision Pattern Recognition"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"2","article-title":"Segmentation as maximumweight independent set","author":"brendel","year":"2010","journal-title":"Neural Information Processing Systems"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206533"},{"key":"7","article-title":"A tensorbased algorithm for high-order graph matching","author":"duchenne","year":"2009","journal-title":"International Conference on Computer Vision and Pattern Recognition"},{"key":"6","article-title":"Balanced graph matching","author":"cour","year":"2006","journal-title":"Neural Information Processing Systems"},{"key":"5","article-title":"Reweighted random walks for graph matching","author":"cho","year":"2010","journal-title":"European Conference on Computer Vision"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801387413"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"}],"event":{"name":"2011 IEEE International Conference on Computer Vision (ICCV)","location":"Barcelona, Spain","start":{"date-parts":[[2011,11,6]]},"end":{"date-parts":[[2011,11,13]]}},"container-title":["2011 International Conference on Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6118259\/6126217\/06126507.pdf?arnumber=6126507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T09:36:56Z","timestamp":1497951416000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6126507\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iccv.2011.6126507","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}