Estimation error bounds for frame denoising

Alyson K. Fletcher, Kannan RamchandranProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2003 · DOI

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 <i>inefficiently</i> 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.
BibTeX
@inproceedings{fletcher2003estimation,
  author = {Alyson K. Fletcher and Kannan Ramchandran},
  title = {{Estimation error bounds for frame denoising}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2003},
  doi = {10.1117/12.507260},
}

Loading related content...

Figure