{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T18:36:52Z","timestamp":1721241412315},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Australian Research Council Linkage","award":["LP0991757"],"award-info":[{"award-number":["LP0991757"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/tip.2015.2416639","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T18:54:08Z","timestamp":1427309648000},"page":"2110-2123","source":"Crossref","is-referenced-by-count":10,"title":["Density Maximization for Improving Graph Matching With Its Applications"],"prefix":"10.1109","volume":"24","author":[{"family":"Chao Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Lei Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Lingqiao Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"606","article-title":"Mode-seeking on graphs via random walks","author":"cho","year":"2012","journal-title":"Proc IEEE CVPR"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.425"},{"key":"ref33","first-page":"29","article-title":"The generalized patchmatch correspondence algorithm","author":"barnes","year":"2010","journal-title":"Proc ECCV"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.299"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.216"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.175"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000027790.02288.f2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.5244\/C.16.36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.147"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1964921.1964965"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-005-3848-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014573219977"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/0600000009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000045324.43199.43"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540081"},{"key":"ref21","first-page":"1280","article-title":"Feature correspondence and deformable object matching via agglomerative correspondence clustering","author":"cho","year":"2009","journal-title":"Proc IEEE 12th ICCV"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.16"},{"key":"ref23","first-page":"428","article-title":"Graph degree linkage: Agglomerative clustering on a directed graph","author":"zhang","year":"2012","journal-title":"Proc 12th ECCV"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995314"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.238"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539868"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01595.x"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2006.11.011"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/080732730"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.79"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459366"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177151"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408978"},{"key":"ref12","first-page":"821","article-title":"On the convergence of graph matching: Graduated assignment revisited","author":"tian","year":"2012","journal-title":"Proc 12th ECCV"},{"key":"ref13","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"2012","journal-title":"Proc IEEE CVPR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.376"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539776"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.221"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0303-4"},{"key":"ref6","article-title":"Balanced graph matching","author":"cour","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref5","first-page":"492","article-title":"Reweighted random walks for graph matching","author":"cho","year":"2010","journal-title":"Proc ECCV"},{"key":"ref8","article-title":"An integer projected fixed point method for graph matching and MAP inference","author":"leordeanu","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.253"},{"key":"ref9","first-page":"596","article-title":"Feature correspondence via graph matching: Models and global optimization","author":"torresani","year":"2008","journal-title":"Proc 10th ECCV"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.435"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.372"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015720"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937505"},{"key":"ref42","first-page":"144","article-title":"Co-recognition of image pairs by data-driven Monte Carlo image exploration","author":"cho","year":"2008","journal-title":"Proc 10th ECCV"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-005-3964-7"},{"key":"ref44","first-page":"1","article-title":"Aligning images in the wild","author":"lin","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.46"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/7070895\/07067397.pdf?arnumber=7067397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:47:33Z","timestamp":1642006053000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7067397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":60,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tip.2015.2416639","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}