Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation

Publication date 12 February 2018

Machine vision and scene understanding (68T45) Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: We present an extension of the cut-pursuit algorithm, introduced by Landrieu and Obozinski (2017), to the graph total-variation regularization of functions with a separable nondifferentiable part. We propose a modified algorithmic scheme as well as adapted proofs of convergence. We also present a heuristic approach for handling the cases in which the values associated to each vertex of the graph are multidimensional. The performance of our algorithm, which we demonstrate on difficult, ill-conditioned large-scale inverse and learning problems, is such that it may in practice extend the scope of application of the total-variation regularization.

This page was built for publication: Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6297664)