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...
| Main Authors: | Xueping Chen, Jianzhong Liu, Xianwen Ding, Hengzhen Huang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-05-01
|
| Series: | IET Signal Processing |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/sil2.12096 |
Similar Items
-
A new result on recovery sparse signals using orthogonal matching pursuit
by: Xueping Chen, et al.
Published: (2022-08-01) -
Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction
by: Yun-Bin Zhao, et al.
Published: (2023-01-01) -
Efficiency of Orthogonal Matching Pursuit for Group Sparse Recovery
by: Chunfang Shao, et al.
Published: (2023-04-01) -
Group Forward–Backward Orthogonal Matching Pursuit for General Convex Smooth Functions
by: Zhongxing Peng, et al.
Published: (2024-11-01) -
A Near-Optimal Restricted Isometry Condition of Multiple Orthogonal Least Squares
by: Junhan Kim, et al.
Published: (2019-01-01)