{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:00:29Z","timestamp":1761058829080},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/iccv.2007.4408838","type":"proceedings-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T13:19:35Z","timestamp":1216387175000},"page":"1-8","source":"Crossref","is-referenced-by-count":38,"title":["Learning Graph Matching"],"prefix":"10.1109","author":[{"given":"Tiberio S.","family":"Caetano","sequence":"first","affiliation":[]},{"family":"Li Cheng","sequence":"additional","affiliation":[]},{"given":"Quoc V.","family":"Le","sequence":"additional","affiliation":[]},{"given":"Alex J.","family":"Smola","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Graph-based methods for vision: A yorkist manifesto","author":"hancock","year":"2002","journal-title":"SSPR & SPR 2002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3115\/1220835.1220850"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"article-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1982","author":"papadimitriou","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/34.310691"},{"journal-title":"Convex Mathematical Programs for Relational Matching of Object Views","year":"2004","author":"schellewald","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(92)90043-3"},{"key":"ref19","article-title":"Large margin methods for structured and interdependent output variables","author":"tsochantaridis","year":"2005","journal-title":"IMLR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/34.993558"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/s10107-003-0437-z","article-title":"Recent advances in the solution of quadratic assignment problems","author":"anstreicher","year":"2003","journal-title":"Math Program Ser B"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.207"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315201"},{"key":"ref8","article-title":"Balanced graph matching","author":"cour","year":"2006","journal-title":"In NIPS"},{"key":"ref7","article-title":"Structural matching in computer vision using probabilistic relaxation","author":"christmas","year":"1994","journal-title":"PAMI"},{"year":"0","key":"ref2"},{"year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"}],"event":{"name":"2007 IEEE 11th International Conference on Computer Vision","start":{"date-parts":[[2007,10,14]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2007,10,21]]}},"container-title":["2007 IEEE 11th International Conference on Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4408818\/4408819\/04408838.pdf?arnumber=4408838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:35:36Z","timestamp":1557675336000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4408838\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iccv.2007.4408838","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}