{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:24:20Z","timestamp":1774599860143,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cvpr.2012.6247863","type":"proceedings-article","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T15:05:51Z","timestamp":1343833551000},"page":"1688-1695","source":"Crossref","is-referenced-by-count":29,"title":["A bundle approach to efficient MAP-inference by Lagrangian relaxation"],"prefix":"10.1109","author":[{"given":"J. H.","family":"Kappes","sequence":"first","affiliation":[]},{"given":"B.","family":"Savchynskyy","sequence":"additional","affiliation":[]},{"given":"C.","family":"Schnorr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Solution to structural recognition (max,+)-problems by their equivalent transformations","author":"schlesinger","year":"2007","journal-title":"Control systems and machines"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995652"},{"key":"18","first-page":"113130","article-title":"Syntactic analysis of two-dimensional visual signals in noisy conditions","volume":"4","author":"schlesinger","year":"1976","journal-title":"Kibernetika"},{"key":"15","first-page":"1043","article-title":"Message-passing for graph-structured linear programs: Proximal methods and rounding schemes","volume":"11","author":"ravikumar","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1080\/10556780701318796"},{"key":"13","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-45586-8_4","article-title":"Lagrangian relaxation","author":"lemare?chal","year":"2001","journal-title":"Computational Combinatorial Optimization"},{"key":"14","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","article-title":"Minimization methods for non-differentiable functions","author":"shor","year":"1985","journal-title":"Springer Series in Computational Mathematics"},{"key":"20","first-page":"89","article-title":"Evaluation of a first-order primaldual algorithm for MRF energy minimization","author":"schmidt","year":"2011","journal-title":"EMMCVPR"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2011.06.012"},{"key":"23","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","article-title":"A comparative study of energy minimization methods for Markov random fields with smoothness-based priors","volume":"30","author":"szeliski","year":"2008","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"24","author":"wainwright","year":"2008","journal-title":"Graphical models exponential families and variational inference"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"26","article-title":"Planar cycle covering graphs","author":"yarkony","year":"2011","journal-title":"UAI"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"10","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","article-title":"Convergent tree-reweighted message passing for energy minimization","volume":"28","author":"kolmogorov","year":"2006","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539951"},{"key":"7","first-page":"735","article-title":"MRF inference by k-fan decomposition and tight Lagrangian relaxation","volume":"6313","author":"kappes","year":"2010","journal-title":"European Conference on Computer Vision (ECCV)"},{"key":"6","article-title":"Lagrangian relaxation for MAP estimation in graphical models","author":"johnson","year":"2007","journal-title":"45th Annual Allerton Conference on Communication Control and Computing"},{"key":"5","author":"helmberg","year":"2011","journal-title":"The ConicBundle Library for Convex Optimization v0 3 10"},{"key":"4","article-title":"Convergent messagepassing algorithms for inference over general graphs with convex free energy","author":"hazan","year":"2008","journal-title":"The 24th Conference on Uncertainty in Artificial Intelligence (UAI)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585731"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591907"}],"event":{"name":"2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"Providence, RI","start":{"date-parts":[[2012,6,16]]},"end":{"date-parts":[[2012,6,21]]}},"container-title":["2012 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6235193\/6247647\/06247863.pdf?arnumber=6247863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T22:18:37Z","timestamp":1497997117000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6247863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2012.6247863","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}