{"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":1774600036652,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/cvpr.2010.5539951","type":"proceedings-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T17:57:43Z","timestamp":1281463063000},"page":"2496-2503","source":"Crossref","is-referenced-by-count":16,"title":["Beyond trees: MRF inference via outer-planar decomposition"],"prefix":"10.1109","author":[{"given":"Dhruv","family":"Batra","sequence":"first","affiliation":[]},{"given":"A. C.","family":"Gallagher","sequence":"additional","affiliation":[]},{"given":"Devi","family":"Parikh","sequence":"additional","affiliation":[]},{"given":"Tsuhan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804355"},{"key":"ref33","article-title":"New outer bounds on the marginal polytope","author":"sontag","year":"0","journal-title":"NIPS 2007"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90072-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/12.53581"},{"key":"ref30","article-title":"Efficient exact inference in planar ising models","author":"schraudolph","year":"0","journal-title":"NIPS'2008"},{"key":"ref37","article-title":"Revisiting the decomposition approach to inference in exponential families and graphical models Technical Report Research report CTU-CMP-2009–06","author":"werner","year":"2009","journal-title":"Center for Machine Perception Czech Technical University"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587355"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref34","article-title":"Tightening lp relaxations for map using message passing","author":"sontag","year":"2008","journal-title":"UAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46908-4_34"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","article-title":"Some network flow problems solved with pseudoboolean programming","volume":"13","author":"hammer","year":"1965","journal-title":"Operations Research"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref13","article-title":"Local rules for global map: When do they work ?","author":"jung","year":"0","journal-title":"NIPS 2009"},{"key":"ref14","article-title":"Local algorithms for approximate inference in minor-excluded graphs","author":"jung","year":"2007","journal-title":"NIPS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703953"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0002-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref19","article-title":"Beyond loose lp-relaxations: Optimizing mrfs by repairing cycles","author":"komodakis","year":"0","journal-title":"ECCV 2008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(95)00011-D"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587401"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90065-7"},{"key":"ref27","article-title":"Approximation algorithms for some topological invariants of graphs","author":"poranen","year":"2004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587609"},{"key":"ref5","article-title":"Using combinatorial optimization within max-product belief propagation","author":"duchi","year":"0","journal-title":"NIPS 2007"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"ref8","article-title":"Approximate inference using planar graph decomposition","author":"globerson","year":"0","journal-title":"NIPS 2006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206828"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/1060590.1060666","article-title":"Edge partition of planar sraphs into two outerplanar graphs","author":"gon\u00e7alves","year":"2005","journal-title":"STOC"},{"key":"ref1","article-title":"Dynamic planar-cuts: Efficient computation of min-marginals for outer-planar models","author":"batra","year":"2009","journal-title":"NIPS Workshop on Discrete Optimization in Machine Learning"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206846"},{"key":"ref22","article-title":"A simple max-cut algorithm for planar graphs","author":"liers","year":"2008","journal-title":"Technical report Combinatorial Optimization in Physics (COPhy)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90075-9"},{"key":"ref23","article-title":"An annotated bibliography on the thickness, outerthickness, and arboricity of a graph","author":"m\u00e4kinen","year":"2009","journal-title":"Technical Report University of Tampere"},{"key":"ref26","article-title":"Reverend bayes on inference engines: A distributed hierarchical approach","author":"pearl","year":"0","journal-title":"Proc AAAI 1982"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587595"}],"event":{"name":"2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"San Francisco, CA, USA","start":{"date-parts":[[2010,6,13]]},"end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5521876\/5539770\/05539951.pdf?arnumber=5539951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T08:38:38Z","timestamp":1711701518000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5539951\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2010.5539951","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}