{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T10:38:34Z","timestamp":1791196714983,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540886891","type":"print"},{"value":"9783540886907","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88690-7_60","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T12:11:47Z","timestamp":1223640707000},"page":"806-820","source":"Crossref","is-referenced-by-count":30,"title":["Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Komodakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Paragios","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G.: Approximate labeling via graph-cuts based on linear programming. In: PAMI (2007)","DOI":"10.1109\/TPAMI.2007.1061"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF Optimization via Dual Decomposition: Message-passing revisited. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on (hyper)trees: Message-passing and linear programming. IEEE Trans. on Information Theory (2005)","DOI":"10.1109\/TIT.2005.856938"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent Tree-reweighted Message Passing for Energy Minimization. PAMI\u00a028(10) (2006)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G., Paragios, N.: Fast Approximately Optimal Solutions for Single and Dynamic MRFs. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383095"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Werner, T.: A Linear Programming Approach to Max-Sum Problem: A Review. PAMI\u00a029(7) (2007)","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"60_CR7","unstructured":"Yanover, C., Meltzer, T., Weiss, Y.: Linear Programming Relaxations and Belief Propagation \u2013 An Empirical Study. JMLR\u00a07 (2006)"},{"key":"60_CR8","unstructured":"Sontag, D., Jaakkola, T.: New outer bounds on the marginal polytope. In: NIPS (2008)"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Werner, T.: High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587355"},{"key":"60_CR10","unstructured":"Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., Weiss, Y.: Tightening LP relaxations for MAP using message passing. In: UAI (2008)"},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"Kumar, M.P., Kolmogorov, V., Torr, P.H.S.: An analysis of convex relaxations for MAP estimation. In: NIPS (2007)","DOI":"10.1145\/1390156.1390242"},{"key":"60_CR12","unstructured":"Komodakis, N., Paragios, N.: Beyond loose LP-relaxations for MRF optimization. Technical report, Ecole Centrale Paris (2008)"},{"key":"60_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11744047_2","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., et al.: A Comparative Study of Energy Minimization Methods for Markov Random Fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 16\u201329. Springer, Heidelberg (2006)"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. In: PAMI (November 2001)","DOI":"10.1109\/34.969114"},{"key":"60_CR15","unstructured":"Raj, A., Singh, G., Zabih, R.: MRF\u2019s for MRI\u2019s: Bayesian Reconstruction of MR Images via Graph Cuts. In: CVPR (2006)"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383203"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88690-7_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T06:35:50Z","timestamp":1576650950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88690-7_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886891","9783540886907"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88690-7_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}