{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:35Z","timestamp":1742914055262,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642338847"},{"type":"electronic","value":"9783642338854"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33885-4_31","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T04:08:54Z","timestamp":1348632534000},"page":"305-314","source":"Crossref","is-referenced-by-count":3,"title":["Submodular Relaxation for MRFs with High-Order Potentials"],"prefix":"10.1007","author":[{"given":"Anton","family":"Osokin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Vetrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206846"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s11263-008-0202-0","volume":"82","author":"P. Kohli","year":"2009","unstructured":"Kohli, P., Ladick\u00fd, L., Torr, P.H.S.: Robust higher order potentials for enforcing label consistency. IJCV\u00a082, 302\u2013324 (2009)","journal-title":"IJCV"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TPAMI.2010.91","volume":"33","author":"H. Ishikawa","year":"2011","unstructured":"Ishikawa, H.: Transformation of general binary MRF minimization to the first order case. IEEE TPAMI\u00a033, 1234\u20131249 (2011)","journal-title":"IEEE TPAMI"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206739"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE TPAMI\u00a023, 1222\u20131239 (2001)","journal-title":"IEEE TPAMI"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/TPAMI.2008.217","volume":"31","author":"P. Kohli","year":"2008","unstructured":"Kohli, P., Kumar, M.P., Torr, P.: \n                    \n                      \n                    \n                    $\\mathcal{P}^3$\n                  &Beyond: Move making algorithms for solving higher order functions. IEEE TPAMI\u00a031, 1645\u20131656 (2008)","journal-title":"IEEE TPAMI"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-011-0437-z","volume":"96","author":"A. Delong","year":"2012","unstructured":"Delong, A., Osokin, A., Isack, H., Boykov, Y.: Fast approximate energy minimization with label costs. IJCV\u00a096, 1\u201327 (2012)","journal-title":"IJCV"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TPAMI.2010.108","volume":"33","author":"N. Komodakis","year":"2010","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF energy minimization and beyond via dual decomposition. IEEE TPAMI\u00a033, 531\u2013552 (2010)","journal-title":"IEEE TPAMI"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Kappes, J.H., Savchynskyy, B., Schn\u00f6rr, C.: A bundle approach to efficient MAP-inference by lagrangian relaxation. In: CVPR (2012)","DOI":"10.1109\/CVPR.2012.6247863"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-15552-9_38","volume-title":"Computer Vision \u2013 ECCV 2010","author":"N. Komodakis","year":"2010","unstructured":"Komodakis, N.: Towards More Efficient and Effective LP-Based Algorithms for MRF Optimization. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part II. LNCS, vol.\u00a06312, pp. 520\u2013534. Springer, Heidelberg (2010)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Osokin, A., Vetrov, D., Kolmogorov, V.: Submodular decomposition framework for inference in associative Markov networks with global constraints. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995361"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math.\u00a0123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"31_CR13","unstructured":"Kolmogorov, V., Wainwright, M.: On the optimality of tree-reweighted max-product message passing. In: UAI (2005)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V. Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., Rother, C.: Minimizing non-submodular functions with graph cuts \u2013 a review. IEEE TPAMI\u00a029, 1274\u20131279 (2007)","journal-title":"IEEE TPAMI"},{"key":"31_CR15","unstructured":"Christoudias, C., Georgescu, B., Meer, P.: Synergism in low-level vision. In: CVPR (2002)"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE TPAMI\u00a026, 1124\u20131137 (2004)","journal-title":"IEEE TPAMI"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE TPAMI\u00a028, 1568\u20131583 (2006)","journal-title":"IEEE TPAMI"},{"key":"31_CR18","unstructured":"Lewis, A., Overton, M.: Nonsmooth optimization via BFGS. SIAM J. Optimization (2008)"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"J. Burke","year":"2005","unstructured":"Burke, J., Lewis, A., Overton, M.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optimization\u00a015, 751\u2013779 (2005)","journal-title":"SIAM J. Optimization"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012. Workshops and Demonstrations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33885-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:09:20Z","timestamp":1575277760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33885-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642338847","9783642338854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33885-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}