On the strong uniqueness of highly sparse expansions from redundant dictionaries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

On the strong uniqueness of highly sparse expansions from redundant dictionaries

Abstract

A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an ``incoherent'' dictionary, this solution is unique and can be recovered as the unique solution of a linear programming problem. We generalize these results to a large class of sparsity measures which includes the ell^p-sparsity measures for 0 \le p \le 1. We give sufficient conditions on a signal such that the simple solution of a linear programming problem simultaneously solves all the non-convex (and generally hard combinatorial) problems of sparsest representation w.r.t. arbitrary admissible sparsity measures. Our results should have a practical impact on source separation methods based on sparse decompositions, since they indicate that a large class of sparse priors can be efficiently replaced with a Laplacian prior without changing the resulting solution.
Fichier principal
Vignette du fichier
2004_ICA_GribonvalNielsen.pdf (184.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00567341 , version 1 (20-02-2011)

Identifiers

Cite

Rémi Gribonval, Morten Nielsen. On the strong uniqueness of highly sparse expansions from redundant dictionaries. Independent Component Analysis and Blind Signal Separation, Fifth International Conference, ICA 2004, Sep 2004, Granada, Spain. pp.201-208, ⟨10.1007/978-3-540-30110-3_26⟩. ⟨inria-00567341⟩
205 View
139 Download

Altmetric

Share

Gmail Facebook X LinkedIn More