Denoising by sparse approximation: error bounds based on rate-distortion theory

DOI10.1155/ASP/2006/26318MaRDI QIDQ871470zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Rate-distortion theory in information and communication theory (94A34)

Review text

Summary: If a signal \(x\) is known to have a sparse representation with respect to a frame, it can be estimated from a noise-corrupted observation \(y\) by finding the best sparse approximation to \(y\). Removing noise in this manner depends on the frame efficiently representing the signal while it inefficiently represents the noise. The mean-squared error (MSE) of this denoising scheme and the probability that the estimate has the same sparsity pattern as the original signal are analyzed. First an MSE bound that depends on a new bound on approximating a Gaussian signal as a linear combination of elements of an overcomplete dictionary is given. Further analyses are for dictionaries generated randomly according to a spherically-symmetric distribution and signals expressible with single dictionary elements. Easily-computed approximations for the probability of selecting the correct dictionary element and the MSE are given. Asymptotic expressions reveal a critical input signal-to-noise ratio for signal recovery.

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

• Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• 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?)
• Ten Lectures on Wavelets

Cited in

(5)

• Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
• Lower Limits of Discrete Universal Denoising
• Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem

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)