A simple test to check the optimality of a sparse signal approximation
From MaRDI portal
Publication:1027249
DOI10.1016/j.sigpro.2005.05.026zbMath1163.94342OpenAlexW2154604910MaRDI QIDQ1027249
R. M. Figueras I Ventura, Pierre 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
inverse problemapproximationgreedy algorithmconvex programmingBayesian estimationovercomplete dictionaryidentifiabilitysparse representationmatching pursuitbasis pursuitFOCUSSsparse prior
Related Items (5)
Highly sparse representations from dictionaries are unique and independent of the sparseness measure ⋮ Two-dimensional random projection ⋮ Sparse recovery by non-convex optimization - instance optimality ⋮ Sparse set membership identification of nonlinear functions and application to fault detection ⋮ A linear system output transformation for sparse approximation
This page was built for publication: A simple test to check the optimality of a sparse signal approximation