Denoising by sparse approximation: error bounds based on rate-distortion theory
DOI10.1155/ASP/2006/26318zbMATH Open1122.94014OpenAlexW2044199623WikidataQ59212649 ScholiaQ59212649MaRDI QIDQ871470FDOQ871470
Authors: Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal, Kannan Ramchandran 
Publication date: 19 March 2007
Published in: EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/asp/2006/26318
Recommendations
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Stable recovery of sparse overcomplete representations in the presence of noise
- On the stability of the basis pursuit in the presence of noise
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Sparse recovery with general frame via general-dual-based analysis Dantzig selector
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Rate-distortion theory in information and communication theory (94A34)
Cites Work
- Title not available (Why is that?)
- Ten Lectures on Wavelets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Cited In (5)
- Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem
- Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
- On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Lower Limits of Discrete Universal Denoising
This page was built for publication: Denoising by sparse approximation: error bounds based on rate-distortion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871470)
