{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:11:43Z","timestamp":1770336703863,"version":"3.49.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cvpr.2012.6247701","type":"proceedings-article","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T11:05:51Z","timestamp":1343819151000},"page":"398-405","source":"Crossref","is-referenced-by-count":26,"title":["Progressive graph matching: Making a move of graphs via probabilistic voting"],"prefix":"10.1109","author":[{"family":"Minsu Cho","sequence":"first","affiliation":[]},{"family":"Kyoung Mu Lee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"NIPS"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000027790.02288.f2"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"23","article-title":"Feature correspondence via graph matching: Models and global optimization","author":"torresani","year":"2008","journal-title":"ECCV"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383091"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.143"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587472"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-005-3964-7"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2004.02.006"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.79"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995455"},{"key":"1","author":"arya","year":"1994","journal-title":"An Optimal Algorithm for Approximate Nearest Neighbor Searching"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"7","article-title":"Reweighted random walks for graph matching","author":"cho","year":"2010","journal-title":"ECCV"},{"key":"6","article-title":"Feature correspondence and deformable object matching via agglomerative correspondence clustering","author":"cho","year":"2009","journal-title":"ICCV"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"9","article-title":"Balanced graph matching","author":"cour","year":"2007","journal-title":"NIPS"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539777"}],"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\/06247701.pdf?arnumber=6247701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T17:13:31Z","timestamp":1490116411000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6247701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2012.6247701","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}