Signal recovery from random measurements via Orthogonal Matching Pursuit (2007)
Cached
Download Links
- [www.math.lsa.umich.edu]
- [www.acm.caltech.edu]
- [www.math.lsa.umich.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Trans. Inform. Theory |
| Citations: | 137 - 4 self |
BibTeX
@ARTICLE{Tropp07signalrecovery,
author = {Joel A. Tropp and Anna and C. Gilbert},
title = {Signal recovery from random measurements via Orthogonal Matching Pursuit},
journal = {IEEE Trans. Inform. Theory},
year = {2007},
volume = {53},
pages = {4655--4666}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This technical report demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results for OMP, which require O(m 2) measurements. The new results for OMP are comparable with recent results for another algorithm called Basis Pursuit (BP). The OMP algorithm is faster and easier to implement, which makes it an attractive alternative to BP for signal recovery problems. 1.
