Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory
Open Access
- 8 March 2006
- journal article
- research article
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2006 (1) , 026318
- https://doi.org/10.1155/ASP/2006/26318
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithmsAdvances in Computational Mathematics, 2006
- Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion TheoryEURASIP Journal on Advances in Signal Processing, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Complexity-regularized image denoisingIEEE Transactions on Image Processing, 2001
- Adaptive wavelet thresholding for image denoising and compressionIEEE Transactions on Image Processing, 2000
- Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1997
- Very low bit-rate video coding based on matching pursuitsIEEE Transactions on Circuits and Systems for Video Technology, 1997
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Filtering random noise from deterministic signals via data compressionIEEE Transactions on Signal Processing, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993