English

Stable Recovery with Analysis Decomposable Priors

Information Theory 2013-05-22 v2 Functional Analysis math.IT Optimization and Control

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.

Keywords

Cite

@article{arxiv.1304.4407,
  title  = {Stable Recovery with Analysis Decomposable Priors},
  author = {M. J. Fadili and G. Peyré and S. Vaiter and C. Deledalle and J. Salmon},
  journal= {arXiv preprint arXiv:1304.4407},
  year   = {2013}
}

Comments

4 pages, to appear in SAMPTA 2013

R2 v1 2026-06-22T00:00:29.490Z