A simple test to check the optimality of sparse signal approximations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Signal Processing Year : 2006

A simple test to check the optimality of sparse signal approximations

Abstract

Approximating a signal or an image with a sparse linear expansion from an overcomplete dictionary of atoms is an extremely useful tool to solve many signal processing problems. Finding the sparsest approximation of a signal from an arbitrary dictionary is a NP-hard problem. Despite this, several algorithms have been proposed that provide sub-optimal solutions. However, it is generally difficult to know how close the computed solution is to being "optimal", and whether another algorithm could provide a better result. In this paper we provide a simple test to check whether the output of a sparse approximation algorithm is nearly optimal, in the sense that no significantly different linear expansion from the dictionary can provide both a smaller approximation error and a better sparsity. As a by-product of our theorems, we obtain results on the identifiability of sparse overcomplete models in the presence of noise, for a fairly large class of sparse priors."
Fichier principal
Vignette du fichier
2006_SigPro_SimpleTest.pdf (2.41 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00544941 , version 1 (08-02-2011)

Identifiers

Cite

Rémi Gribonval, Rosa Maria Figueras I Ventura, Pierre Vandergheynst. A simple test to check the optimality of sparse signal approximations. Signal Processing, 2006, special issue on Sparse Approximations in Signal and Image Processing, 86 (3), pp.496--510. ⟨10.1016/j.sigpro.2005.05.026⟩. ⟨inria-00544941⟩
143 View
270 Download

Altmetric

Share

Gmail Facebook X LinkedIn More