A simple test to check the optimality of a sparse signal approximation
Authors:
- 1 March 2006
- journal article
- Published by Elsevier in Signal Processing
- Vol. 86 (3) , 496-510
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Stable recovery of sparse overcomplete representations in the presence of noiseIEEE Transactions on Information Theory, 2005
- Sparse geometric image representations with bandeletsIEEE Transactions on Image Processing, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problemIEEE Transactions on Signal Processing, 2003
- Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition2002
- The curvelet transform for image denoisingIEEE Transactions on Image Processing, 2002
- Blind Source Separation by Sparse Decomposition in a Signal DictionaryNeural Computation, 2001
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithmIEEE Transactions on Signal Processing, 1997
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993