Share Email Print

Proceedings Paper

Estimation error bounds for frame denoising
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A subspace-based method for denoising with a frame works as follows: If a signal is known to have a sparse representation with respect to the frame, the signal can be estimated from a noise-corrupted observation of the signal by finding the best sparse approximation to the observation. 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 gives bounds to show how inefficiently white Gaussian noise is represented by sparse linear combinations of frame vectors. The bounds hold for any frame so they are generally loose for frames designed to represent structured signals. Nevertheless, the bounds can be combined with knowledge of the approximation efficiency of a given family of frames for a given signal class to study the merit of frame redundancy for denoising.

Paper Details

Date Published: 13 November 2003
PDF: 7 pages
Proc. SPIE 5207, Wavelets: Applications in Signal and Image Processing X, (13 November 2003); doi: 10.1117/12.507260
Show Author Affiliations
Alyson K. Fletcher, Univ. of California/Berkeley (United States)
Kannan Ramchandran, Univ. of California/Berkeley (United States)

Published in SPIE Proceedings Vol. 5207:
Wavelets: Applications in Signal and Image Processing X
Michael A. Unser; Akram Aldroubi; Andrew F. Laine, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?