Paper
17 September 2005 Sparse approximation, denoising, and large random frames
Author Affiliations +
Proceedings Volume 5914, Wavelets XI; 59140M (2005) https://doi.org/10.1117/12.615772
Event: Optics and Photonics 2005, 2005, San Diego, California, United States
Abstract
If a signal x is known to have a sparse representation with respect to a frame, the signal can be estimated from a noise-corrupted observation y by finding the best sparse approximation to y. The ability to remove noise in this manner depends on the frame being designed to efficiently represent the signal while it inefficiently represents the noise. This paper analyzes the mean squared error (MSE) of this denoising scheme and the probability that the estimate has the same sparsity pattern as the original signal. Analyses are for dictionaries generated randomly according to a spherically-symmetric distribution. Easily-computed approximations for the probability of selecting the correct dictionary element and the MSE are given. In the limit of large dimension, these approximations have simple forms. The asymptotic expressions reveal a critical input signal-to-noise ratio (SNR) for signal recovery.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alyson K. Fletcher, Sundeep Rangan, and Vivek K. Goyal "Sparse approximation, denoising, and large random frames", Proc. SPIE 5914, Wavelets XI, 59140M (17 September 2005); https://doi.org/10.1117/12.615772
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Signal to noise ratio

Associative arrays

Denoising

Error analysis

Interference (communication)

Palladium

Signal generators

Back to Top