Boundedness and unboundedness in total variation regularization

From MaRDI portal



Abstract: We consider whether minimizers for total variation regularization of linear inverse problems belong to Linfty even if the measured data does not. We present a simple proof of boundedness of the minimizer for fixed regularization parameter, and derive the existence of uniform bounds for sufficiently small noise under a source condition and adequate a priori parameter choices. To show that such a result cannot be expected for every fidelity term and dimension we compute an explicit radial unbounded minimizer, which is accomplished by proving the equivalence of weighted one-dimensional denoising with a generalized taut string problem. Finally, we discuss the possibility of extending such results to related higher-order regularization functionals, obtaining a positive answer for the infimal convolution of first and second order total variation.


In mathematics, the total variation identifies several slightly different concepts, related to the local or global structure of the codomain of a function or a measure. The total variation denoising, also known as total variation regularization or total variation filtering, is a noise removal process (filter). It is based on the principle that signals with excessive and possibly spurious detail have high total variation, that is, the integral of the image gradient magnitude is high. The total variation regularization have had an important role in several classical problems of the geometric measure theory, signal processing and physics. Several authors studied the total variation regularization [\textit{V. Caselles} et al., Rev. Mat. Iberoam. 27, No. 1, 233--252 (2011; Zbl 1228.94005); \textit{K. Bredies} et al., SIAM J. Imaging Sci. 3, No. 3, 492--526 (2010; Zbl 1195.49025); \textit{A. Chambolle} and \textit{P-L. Lions}, Numer. Math. 76, No. 2, 167--188 (1997; Zbl 0874.68299); \textit{E. Gonzalez} and \textit{U. Massari} Rend. Sem. Mat. Univ. Politec. Torino 52, No. 1, 1--28 (1994; Zbl 0819.49025); \textit{M. Grasmair} and \textit{A. Obereder} Numer. Funct. Anal. Optim. 29, No. 3--4, 346--361 (2008; Zbl 1142.65013); \textit{M. Grasmair}, J. Math. Imaging Vision 27, No. 1, 59--66 (2007; Zbl 1478.94041); \textit{V. Gutev}, J. Math. Anal. Appl. 491, No. 1, Article ID 124242, 12 p. (2020; Zbl 1519.54006); \textit{C. Kirisits} et al., SIAM J. Imaging Sci. 12, No. 4, 1643--1668 (2019; Zbl 1439.49066); \textit{T. Valkonen}, Inverse Probl. 37, No. 4, Article ID 045010, 30 p. (2021; Zbl 1515.65147)]. The principal objective in this paper is to study boundedness and unboundedness in total variation regularization. The authors present a simple proof of boundedness of the minimizer for fixed regularization parameter, and obtain a boundedness result for the case of infimal convolution of first and second order total variation regularizers, for which the optimality conditions are closely related to subgradients of total variation.



Cites work









This page was built for publication: Boundedness and unboundedness in total variation regularization

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