IEEE transactions on information theory, 2011-09, Vol.57 (9), p.6215-6221
2011
Details
- Autor(en) / Beteiligte
- Titel
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Ist Teil von
- IEEE transactions on information theory, 2011-09, Vol.57 (9), p.6215-6221
- Ort / Verlag
- New York, NY: IEEE
- Erscheinungsjahr
- 2011
- Link zum Volltext
- Quelle
- IEEE Electronic Library (IEL)
- Beschreibungen/Notizen
- This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O (k̅), then OMP can stably recover a k̅ -sparse signal in 2-norm under measurement noise. For compressed sensing applications, this result implies that in order to uniformly recover a k̅ -sparse signal in R d , only O ( k̅ ln d ) random projections are needed. This analysis improves some earlier results on OMP depending on stronger conditions that can only be satisfied with Ω( k̅ 2 ln d ) or Ω( k̅ 1.6 ln d ) random projections.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0018-9448eISSN: 1557-9654DOI: 10.1109/TIT.2011.2162263Titel-ID: cdi_crossref_primary_10_1109_TIT_2011_2162263
- Format
- –
- Schlagworte
- Access methods and protocols, osi model, Algorithm design and analysis, Applied sciences, Approximation algorithms, Compressed sensing, Detection, estimation, filtering, equalization, prediction, Estimation theory, Exact sciences and technology, feature selection, greedy algorithms, Information theory, Information, signal and communications theory, Matching pursuit algorithms, Noise, Optimization, Sampling, quantization, Signal and communications theory, Signal processing algorithms, Signal, noise, sparse recovery, statistical learning, Telecommunications, Telecommunications and information theory, Teleprocessing networks. Isdn