Denoising by sparse approximation: error bounds based on rate-distortion theory
From MaRDI portal
Publication:871470
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
Cites work
- scientific article; zbMATH DE number 1192047 (Why is no real title available?)
- scientific article; zbMATH DE number 46194 (Why is no real title available?)
- scientific article; zbMATH DE number 53570 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Ten Lectures on Wavelets
Cited in
(5)- Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
- On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
- Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem
- 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)