{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T18:20:39Z","timestamp":1783707639788,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_59","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T16:11:47Z","timestamp":1223655107000},"page":"792-805","source":"Crossref","is-referenced-by-count":83,"title":["A Convex Formulation of Continuous Multi-label Problems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Pock","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schoenemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gottfried","family":"Graber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horst","family":"Bischof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"Series B","key":"59_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D. Greig","year":"1989","unstructured":"Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. Royal Statistics Soc.\u00a051(Series B), 271\u2013279 (1989)","journal-title":"J. Royal Statistics Soc."},{"issue":"2","key":"59_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"59_CR3","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 Trans. Pattern Anal. Mach. Intell.\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"59_CR4","unstructured":"Veksler, O.: Efficient Graph-based Energy Minimization Methods in Computer Vision. PhD thesis, Cornell University (July 1999)"},{"key":"59_CR5","unstructured":"Schlesinger, D., Flach, B.: Transforming an arbitrary minsum problem into a binary one. Technical Report TUD-FI06-01, Dresden University of Technology (2006)"},{"issue":"7","key":"59_CR6","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T. Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: A review. IEEE Trans. Pattern Anal. Mach. Intell.\u00a029(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"10","key":"59_CR7","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H. Ishikawa","year":"2003","unstructured":"Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Trans. Pattern Anal. Mach. Intell.\u00a025(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"59_CR8","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"L. Rudin","year":"1992","unstructured":"Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D\u00a060, 259\u2013268 (1992)","journal-title":"Physica D"},{"issue":"5","key":"59_CR10","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1137\/040615286","volume":"66","author":"T. Chan","year":"2006","unstructured":"Chan, T., Esedoglu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal of Applied Mathematics\u00a066(5), 1632\u20131648 (2006)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BF01236935","volume":"11","author":"W. Fleming","year":"1960","unstructured":"Fleming, W., Rishel, R.: An integral formula for total gradient variation. Arch. Math.\u00a011, 218\u2013222 (1960)","journal-title":"Arch. Math."},{"key":"59_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/0917016","volume":"17","author":"C. Vogel","year":"1996","unstructured":"Vogel, C., Oman, M.: Iteration methods for total variation denoising. SIAM J. Sci. Comp.\u00a017, 227\u2013238 (1996)","journal-title":"SIAM J. Sci. Comp."},{"issue":"6","key":"59_CR13","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1137\/S1064827596299767","volume":"20","author":"T. Chan","year":"1999","unstructured":"Chan, T., Golub, G., Mulet, P.: A nonlinear primal-dual method for total variation-based image restoration. SIAM J. Sci. Comp.\u00a020(6), 1964\u20131977 (1999)","journal-title":"SIAM J. Sci. Comp."},{"key":"59_CR14","unstructured":"Carter, J.: Dual Methods for Total Variation-based Image Restoration. PhD thesis, UCLA, Los Angeles, CA (2001)"},{"key":"59_CR15","unstructured":"Chambolle, A.: An algorithm for total variation minimizations and applications. J. Math. Imaging Vis. (2004)"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Chambolle, A.: Total variation minimization and a class of binary MRF models. Energy Minimization Methods in Computer Vision and Pattern Recognition, 136\u2013152 (2005)","DOI":"10.1007\/11585978_10"},{"key":"59_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R. Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Augmented lagrangians and applications of the proximal point algorithm in convex programming. Math. of Oper Res\u00a01, 97\u2013116 (1976)","journal-title":"Math. of Oper Res"},{"issue":"2","key":"59_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10851-007-0002-0","volume":"28","author":"X. Bresson","year":"2007","unstructured":"Bresson, X., Esedoglu, S., Vandergheynst, P., Thiran, J., Osher, S.: Fast global minimization of the active contour\/snake model. J. Math. Imaging Vis.\u00a028(2), 151\u2013167 (2007)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"59_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TPAMI.2006.12","volume":"28","author":"B. Appleton","year":"2006","unstructured":"Appleton, B., Talbot, H.: Globally minimal surfaces by continuous maximal flows. IEEE Trans. Pattern Anal. Mach. Intell.\u00a028(1), 106\u2013118 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1-3","key":"59_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D. Scharstein","year":"2002","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comp. Vis.\u00a047(1-3), 7\u201342 (2002)","journal-title":"Int. J. Comp. Vis."}],"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_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T17:54:33Z","timestamp":1738432473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88690-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886891","9783540886907"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88690-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}