On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- Authors
- Wang, Jian; Shim, Byonghyo
- Issue Date
- 9월-2012
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Compressed sensing (CS); orthogonal matching pursuit (OMP); sparse signal; restricted isometry property (RIP)
- Citation
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.60, no.9, pp.4973 - 4976
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON SIGNAL PROCESSING
- Volume
- 60
- Number
- 9
- Start Page
- 4973
- End Page
- 4976
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/107552
- DOI
- 10.1109/TSP.2012.2203124
- ISSN
- 1053-587X
- Abstract
- Orthogonal matching pursuit (OMP) is a greedy search algorithm popularly being used for the recovery of compressive sensed sparse signals. In this correspondence, we show that if the isometry constant delta(K+1) of the sensing matrix Phi satisfies delta(K+1) < 1/root K+1 then the OMP algorithm can perfectly recover K-sparse signals from the compressed measurements y = Phi x. Our bound offers a substantial improvement over the recent result of Davenport and Wakin and also closes gap between the recovery bound and fundamental limit over which the perfect recovery of the OMP cannot be guaranteed.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Informatics > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.