A note on orthogonal matching pursuit under restricted isometry property
Abstract The orthogonal matching pursuit (OMP) algorithm is a classical greedy algorithm widely used in compressed sensing. The number of iterations required for the OMP algorithm to perform exact the recovery of sparse signals is a fundamental problem in signal processing. In this work, by investig...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-05-01
|
| Series: | IET Signal Processing |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/sil2.12096 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract The orthogonal matching pursuit (OMP) algorithm is a classical greedy algorithm widely used in compressed sensing. The number of iterations required for the OMP algorithm to perform exact the recovery of sparse signals is a fundamental problem in signal processing. In this work, by investigating the relationship between the iteration number for OMP and the signal estimation error based on the restricted isometry property, the authors obtained tighter bounds on the number of iterations required to approximately recover a sparse signal with noise and exact support recovering for the noiseless cases of OMP. |
|---|---|
| ISSN: | 1751-9675 1751-9683 |