Published August 2007
| Version public
Technical Report
Open
Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case
Creators
Abstract
This 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(mln d) random linear measurements of that signal. This is a massive improvement over previous results, which require O(m2) measurements. The new results for OMP are comparable with recent results for another approach called Basis Pursuit (BP). In some settings, the OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal recovery problems.
Additional Information
Date: 11 April 2005. Revised 8 November 2006 and 15 August 2007. JAT has been supported by NSF DMS 0503299 and ACG has been supported by NSF DMS 0354600.Files
Caltech_ACM_TR_2007_01.pdf
Files
(329.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:bfd51130d288e8d0d2aa34d318758235
|
329.1 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 27144
- Resolver ID
- CaltechAUTHORS:20111010-134929077
Related works
- Describes
- http://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07 (URL)
Funding
- NSF
- DMS 0503299
- NSF
- DMS 0354600
Dates
- Created
-
2011-10-19Created from EPrint's datestamp field
- Updated
-
2023-04-26Created from EPrint's last_modified field
Caltech Custom Metadata
- Caltech groups
- Applied & Computational Mathematics
- Series Name
- ACM Technical Reports
- Series Volume or Issue Number
- 2007-01