A simple test to check the optimality of a sparse signal approximation

DOI10.1016/J.SIGPRO.2005.05.026zbMATH Open1163.94342OpenAlexW2154604910MaRDI QIDQ1027249FDOQ1027249

R. M. Figueras I Ventura, P. Vandergheynst, Rémi Gribonval

Publication date: 1 July 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00544941/file/2006_SigPro_SimpleTest.pdf

Recommendations

• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure

zbMATH Keywords

identifiabilityinverse problemBayesian estimationgreedy algorithmapproximationconvex programmingsparse representationmatching pursuitbasis pursuitFOCUSSovercomplete dictionarysparse prior

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (7)

• A linear system output transformation for sparse approximation
• Two-dimensional random projection
• Sparse recovery by non-convex optimization - instance optimality
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Sparse set membership identification of nonlinear functions and application to fault detection
• Testing Sparsity-Inducing Penalties
• Title not available (Why is that?)

This page was built for publication: A simple test to check the optimality of a sparse signal approximation

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