High-dimension multi-label problems: convex or non convex relaxation?

Abstract : This paper is concerned with the problem of relaxing non convex functionals, used in image processing, into convex problems. We review most of the recently introduced relaxation methods, and we propose a new convex one based on a probabilistic approach, which has the advantages of being intuitive, flexible and involving an algorithm without inner loops. We investigate in detail the connections between the solutions of the relaxed functionals with a minimizer of the original one. Such connection is demonstrated only for non convex relaxation which turns out to be quite robust to initialization. As a case of study, we illustrate our theoretical analysis with numerical experiments, namely for the optical flow problem.
Liste complète des métadonnées

Cited literature [30 references]  Display  Hide  Download

Contributor : Nicolas Papadakis <>
Submitted on : Monday, April 22, 2013 - 12:47:10 PM
Last modification on : Friday, April 19, 2019 - 1:28:12 PM
Document(s) archivé(s) le : Monday, April 3, 2017 - 8:20:06 AM


Files produced by the author(s)




Nicolas Papadakis, Romain Yildizoglu, Jean-François Aujol, Vicent Caselles. High-dimension multi-label problems: convex or non convex relaxation?. SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2013, 6 (4), pp.2603-2639. ⟨10.1137/120900307⟩. ⟨hal-00757084v3⟩



Record views


Files downloads