{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T21:57:35Z","timestamp":1791410255840,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642155512","type":"print"},{"value":"9783642155529","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15552-9_38","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:40:36Z","timestamp":1283672436000},"page":"520-534","source":"Crossref","is-referenced-by-count":9,"title":["Towards More Efficient and Effective LP-Based Algorithms for MRF Optimization"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Komodakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. on Info. Theory (2005)","DOI":"10.1109\/TIT.2005.856938"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI (2006)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"38_CR3","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":"38_CR4","doi-asserted-by":"crossref","unstructured":"Werner, T.: A linear programming approach to max-sum problem: A review. PAMI (2007)","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Szeliski, R., et\u00a0al.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI (2008)","DOI":"10.1109\/TPAMI.2007.70844"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11263-006-7899-4","volume":"70","author":"P.F. Felzenszwalb","year":"2006","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. IJCV\u00a070, 41\u201354 (2006)","journal-title":"IJCV"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G.: Image completion using efficient belief propagation via priority scheduling and dynamic pruning. In: IEEE TIP (2007)","DOI":"10.1109\/TIP.2007.906269"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A. Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms\u00a027, 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-45243-0_52","volume-title":"Pattern Recognition","author":"I. Kovtun","year":"2003","unstructured":"Kovtun, I.: Partial optimal labeling search for a np-hard subclass of (max,+) problems. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol.\u00a02781, pp. 402\u2013409. Springer, Heidelberg (2003)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Alahari, K., Kohli, P., Torr, P.: Reduce, reuse and recycle: Efficiently solving multi-label mrfs. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587402"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Shekhovtsov, A., Kovtun, I., Hlav\u00e1\u010d, V.: Efficient mrf deformation model for non-rigid image matching. In: CVIU (2008)","DOI":"10.1109\/CVPR.2007.383205"},{"key":"38_CR12","unstructured":"http:\/\/www.csd.uoc.gr\/~komod\/publications\/docs\/eccv10_supp.pdf"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Dykstra, R.L.: An iterative procedure for obtaining i-projections onto the intersection of convex sets. Annals of Probability (1985)","DOI":"10.1214\/aop\/1176992918"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206846"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.110"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Kohli, P., Kumar, P., Torr, P.: P3 and beyond: Solving energies with higher order cliques. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383204"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15552-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T10:17:20Z","timestamp":1575281840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15552-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155512","9783642155529"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15552-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}