{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:48:06Z","timestamp":1779295686851,"version":"3.51.4"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1109\/cvpr.2008.4587500","type":"proceedings-article","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T14:28:49Z","timestamp":1218551329000},"page":"1-8","source":"Crossref","is-referenced-by-count":261,"title":["Probabilistic graph and hypergraph matching"],"prefix":"10.1109","author":[{"given":"Ron","family":"Zass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Shashua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581245"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.95"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"16","first-page":"801","article-title":"space-time tracking","author":"torresani","year":"2002","journal-title":"ECCV"},{"key":"13","volume":"2","author":"neumann","year":"1950","journal-title":"Functional Operators"},{"key":"14","article-title":"probabilistic subgraph matching based on convex relaxation","author":"schellewald","year":"2005","journal-title":"Computer Vision and Pattern Recognition (CVPR)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1968-021-9"},{"key":"3","first-page":"261517","article-title":"journal of pattern recognition and art","volume":"18","author":"int","year":"2004","journal-title":"Intelligence Special issue on graph matching in pattern recognition and computer vision"},{"key":"2","year":"0"},{"key":"1","year":"0"},{"key":"10","first-page":"381","article-title":"softmax to softassign: neural network algorithms for combinatorial optimization","volume":"2","author":"gold","year":"1995","journal-title":"J Artif Neural Netw"},{"key":"7","year":"0"},{"key":"6","first-page":"407","article-title":"the dykstra algorithm with bregman projections","volume":"2","author":"censor","year":"1998","journal-title":"Communications in Applied Analysis"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972238"},{"key":"4","article-title":"a method for finding projections onto the intersections of convex sets in hilbert spaces","author":"boyle","year":"1985","journal-title":"Advances in order restricted statistical inference Proc Symp"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176992918"},{"key":"8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.7551\/mitpress\/7503.003.0044","article-title":"balanced graph matching","author":"cour","year":"2007","journal-title":"Neural Information Processing Systems (NIPS)"}],"event":{"name":"2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"Anchorage, AK, USA","start":{"date-parts":[[2008,6,23]]},"end":{"date-parts":[[2008,6,28]]}},"container-title":["2008 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4558014\/4587335\/04587500.pdf?arnumber=4587500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:53:56Z","timestamp":1738324436000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4587500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2008.4587500","relation":{},"subject":[],"published":{"date-parts":[[2008,6]]}}}