Home/EURASIP Journal on Advances in Signal Processing/Article Record
Peer-Reviewed Article March 7, 2006

Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: EURASIP Journal on Advances in Signal Processing
Publisher: Springer Science+Business Media • Egypt • 1110-8657
DOI: https://doi.org/10.1155/asp/2006/26318

Abstract

If a signal is known to have a sparse representation with respect to a frame, it can be estimated from a noise-corrupted observation by finding the best sparse approximation to . 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.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

64
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.