{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:51:31Z","timestamp":1787363491787,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Imaging Sci."],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p>We propose convex relaxations for nonconvex energies on vector-valued functions which are tractable yet as tight as possible. In contrast to existing relaxations, we can handle the combination of nonconvex data terms with coupled regularizers such as $l^2$-regularizers. The key idea is to consider a collection of hypersurfaces with a relaxation that takes into account the entire functional rather than separately treating the data term and the regularizers. We provide a theoretical analysis, detail the implementations for different functionals, present run time and memory requirements, and experimentally demonstrate that the coupled $l^2$-regularizers give systematic improvements regarding denoising, inpainting, and optical flow estimation.<\/jats:p>","DOI":"10.1137\/130908348","type":"journal-article","created":{"date-parts":[[2014,2,11]],"date-time":"2014-02-11T14:04:29Z","timestamp":1392127469000},"page":"294-336","source":"Crossref","is-referenced-by-count":16,"title":["Convex Relaxation of Vectorial Problems with Coupled Regularization"],"prefix":"10.1137","volume":"7","author":[{"given":"Evgeny","family":"Strekalovskiy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonin","family":"Chambolle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2014,2,11]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s005260100152"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"L. Ambrosio, N. Fusco, and D. Pallara,<i>Functions of Bounded Variation and Free Discontinuity Problems<\/i> Oxford Math. Monogr., The Clarendon Press, Oxford University Press, New York, 2000.","DOI":"10.1093\/oso\/9780198502456.001.0001"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0406-y"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0390-2"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-1236(88)90009-2"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/S0294-1449(17)30018-5"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238310"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"atypb9","first-page":"25","author":"Brox T.","year":"2004","journal-title":"Heidelberg"},{"key":"atypb10","unstructured":"A. Chambolle, D. Cremers, and T. Pock,<i>A Convex Approach for Computing Minimal Partitions<\/i> Technical report TR-2008-05, Department of Computer Science, University of Bonn, Bonn, Germany, 2008."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/110856733"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/040615286"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.174"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01301259"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1984.33.33036"},{"key":"atypb17","unstructured":"L. C. Evans and R. F. Gariepy,<i>Measure Theory and Fine Properties of Functions<\/i> Stud. Adv. Math., CRC Press, Boca Raton, FL, 1992."},{"key":"atypb18","unstructured":"H. Federer,<i>Geometric Measure Theory<\/i> Springer-Verlag, New York, 1969."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1975.24.24031"},{"key":"atypb20","doi-asserted-by":"crossref","unstructured":"M. Giaquinta, G. Modica, and J. Sou\u010dek,<i>Cartesian Currents in the Calculus of Variations.I.Cartesian Currents<\/i> Springer-Verlag, Berlin, 1998.","DOI":"10.1007\/978-3-662-06218-0"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/110823766"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1137\/120862351"},{"key":"atypb23","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"Greig D.","year":"1989","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"H. Ishikawa and D. Geiger,<i>Segmentation by grouping junctions<\/i> in Proceedings of the 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1998, pp. 125-131.","DOI":"10.1109\/CVPR.1998.698598"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"atypb28","doi-asserted-by":"crossref","unstructured":"J. Lellmann, F. Becker, and C. Schn\u00f6rr,<i>Convex optimization for multi-class image labeling with a novel family of total variation based regularizers<\/i> in Proceedings of the 2009 IEEE 12th International Conference on Computer Vision, 2009, pp. 646-653.","DOI":"10.1109\/ICCV.2009.5459176"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/100805844"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1119\/1.13706"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/11.1.50"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"T. Pock and A. Chambolle,<i>Diagonal preconditioning for first order primal-dual algorithms in convex optimization<\/i> in Proceedings of the 2011 IEEE International Conference on Computer Vision, 2011, pp. 1762-1769.","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"atypb33","unstructured":"T. Pock, D. Cremers, H. Bischof, and A. Chambolle,<i>An algorithm for minimizing the piecewise smooth Mumford-Shah functional<\/i> in Proceedings of the 2009 IEEE 12th International Conference on Computer Vision, 2009."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/090757617"},{"key":"atypb35","doi-asserted-by":"crossref","unstructured":"T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers,<i>A convex formulation of continuous multi-label problems<\/i> in Computer Vision-ECCV 2008, Springer-Verlag, Berlin, Heidelberg, 2008, pp. 792-805.","DOI":"10.1007\/978-3-540-88690-7_59"},{"key":"atypb36","unstructured":"R. T. Rockafellar,<i>Convex Analysis<\/i> Princeton University Press, Princeton, NJ, 1996."},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"atypb38","unstructured":"D. Schlesinger and B. Flach,<i>Transforming an Arbitrary MinSum Problem into a Binary One<\/i> Technical report, Department of Computer Science, Dresden University of Technology, Dresden, Germany, 2006."},{"key":"atypb39","doi-asserted-by":"crossref","unstructured":"E. Strekalovskiy, B. Goldluecke, and D. Cremers,<i>Tight convex relaxations for vector-valued labeling problems<\/i> in Proceedings of the 2011 IEEE International Conference on Computer Vision, 2011.","DOI":"10.1109\/ICCV.2011.6126514"},{"key":"atypb40","doi-asserted-by":"crossref","unstructured":"D. Sun, S. Roth, and M. J. Black,<i>Secrets of optical flow estimation and their principles<\/i> in Proceedings of the 2010 IEEE Conference on Computer Vision and Pattern Recognition, 2010, pp. 2432-2439.","DOI":"10.1109\/CVPR.2010.5539939"},{"key":"atypb41","doi-asserted-by":"crossref","unstructured":"C. Villani,<i>Topics in Optimal Transportation<\/i> Grad. Stud. Math. 58, AMS, Providence, RI, 2003.","DOI":"10.1090\/gsm\/058"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.236"},{"key":"atypb44","first-page":"243","author":"Zach C.","year":"2008","journal-title":"Berlin"},{"key":"atypb45","doi-asserted-by":"crossref","unstructured":"C. Zach, C. H\u00e4ne, and M. Pollefeys,<i>What is optimized in tight convex relaxations for multi-label problems?<\/i> in Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 1664-1671.","DOI":"10.1109\/CVPR.2012.6247860"}],"container-title":["SIAM Journal on Imaging Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130908348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:16:13Z","timestamp":1787321773000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130908348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.1137\/130908348"],"URL":"https:\/\/doi.org\/10.1137\/130908348","relation":{},"ISSN":["1936-4954"],"issn-type":[{"value":"1936-4954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}