{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:27:16Z","timestamp":1774600036674,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/cvpr.2009.5206567","type":"proceedings-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T18:36:32Z","timestamp":1267468592000},"page":"818-825","source":"Crossref","is-referenced-by-count":51,"title":["Global connectivity potentials for random field models"],"prefix":"10.1109","author":[{"given":"Sebastian","family":"Nowozin","sequence":"first","affiliation":[]},{"given":"Christoph H.","family":"Lampert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390242"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587355"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"36","author":"wolsey","year":"1998","journal-title":"Integer Programming"},{"key":"18","article-title":"An analysis of convex relaxations for MAP estimation","author":"kumar","year":"2008","journal-title":"NIPS"},{"key":"33","article-title":"Map estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"UAI"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"34","article-title":"A linear programming approach to max-sum problem: A review","author":"werner","year":"2005","journal-title":"Research Report Center for Machine Perception"},{"key":"16","article-title":"Beyond loose LPrelaxations: Optimizing MRFs by repairing cycles","author":"komodakis","year":"2008","journal-title":"ECCV"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390217"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"37","first-page":"1887","article-title":"Linear programming relaxations and belief propagation - An empirical study","volume":"7","author":"yanover","year":"2006","journal-title":"JMLR"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383204"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2008.07.008"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587417"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587699"},{"key":"20","article-title":"Conditional random fields: Probabilistic models for segmenting and labeling sequence data","author":"lafferty","year":"2001","journal-title":"ICML"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.112"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587401"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238308"},{"key":"25","author":"schrijver","year":"1998","journal-title":"Theory of Linear and Integer Programming"},{"key":"26","article-title":"New outer bounds on the marginal polytope","author":"sontag","year":"2007","journal-title":"NIPS"},{"key":"27","article-title":"Tightening LP relaxations for MAP using message passing","author":"sontag","year":"2008","journal-title":"UAI"},{"key":"28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.003.0006","article-title":"An introduction to conditional random fields for relational learning","author":"sutton","year":"2007","journal-title":"Introduction to Statistical Relational Learning"},{"key":"29","article-title":"Learning CRFs using graph cuts","author":"szummer","year":"2008","journal-title":"ECCV"},{"key":"3","article-title":"Learning to localize objects with structured output regression","author":"blaschko","year":"2008","journal-title":"ECCV"},{"key":"2","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.09.014"},{"key":"10","author":"karp","year":"2002","journal-title":"Maximum-weight Connected Subgraph Problem"},{"key":"30","first-page":"1453","article-title":"Large margin methods for structured and interdependent output variables","volume":"6","author":"tsochantaridis","year":"2005","journal-title":"JMLR"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390195"},{"key":"6","author":"everingham","year":"0","journal-title":"The PASCAL Visual Object Classes Challenge 2008 Results"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.02.006"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587440"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S233"},{"key":"8","article-title":"Fixing max-product: Convergent message passing algorithms for map lp-relaxations","author":"globerson","year":"2007","journal-title":"NIPS"}],"event":{"name":"2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops)","location":"Miami, FL","start":{"date-parts":[[2009,6,20]]},"end":{"date-parts":[[2009,6,25]]}},"container-title":["2009 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5191365\/5206488\/05206567.pdf?arnumber=5206567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T14:28:28Z","timestamp":1711290508000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5206567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2009.5206567","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}