A generalized uncertainty principle and sparse representation in pairs of bases (2002)
Cached
Download Links
- [www.cs.technion.ac.il]
- [www-sccm.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Trans. Inform. Theory |
| Citations: | 142 - 11 self |
BibTeX
@ARTICLE{Elad02ageneralized,
author = {Michael Elad and Alfred M. Bruckstein},
title = {A generalized uncertainty principle and sparse representation in pairs of bases},
journal = {IEEE Trans. Inform. Theory},
year = {2002},
volume = {48},
pages = {2558--2567}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An elementary proof of a basic uncertainty principle concerning pairs of representations of ℜ N vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the improvement of an important result due to Donoho and Huo concerning the replacement of the l0 optimization problem by a linear programming minimization when searching for the unique sparse representation. 1
Citations
| 1468 | A Wavelet Tour of Signal Processing - Mallat - 1999 |
| 243 | Uncertainty principles and ideal atomic decomposition - Donoho, Huo - 2001 |
| 118 | Uncertainty principles and signal recovery - Donoho, Stark - 1989 |
