pith. sign in

arxiv: 1304.4407 · v2 · pith:GMK637PEnew · submitted 2013-04-16 · 💻 cs.IT · math.FA· math.IT· math.OC

Stable Recovery with Analysis Decomposable Priors

classification 💻 cs.IT math.FAmath.ITmath.OC
keywords decomposableanalysisnormregularizedsolutionssufficientuniquenessalong
0
0 comments X
read the original abstract

In this paper, we investigate in a unified way the structural properties of solutions to inverse problems. These solutions are regularized by the generic class of semi-norms defined as a decomposable norm composed with a linear operator, the so-called analysis type decomposable prior. This encompasses several well-known analysis-type regularizations such as the discrete total variation (in any dimension), analysis group-Lasso or the nuclear norm. Our main results establish sufficient conditions under which uniqueness and stability to a bounded noise of the regularized solution are guaranteed. Along the way, we also provide a strong sufficient uniqueness result that is of independent interest and goes beyond the case of decomposable norms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.