An Optimal Condition for the Block Orthogonal Matching Pursuit Algorithm
Recovery of the support of a block K-sparse signal x from a linear model y = Ax + v, where A is a sensing matrix and v is a noise vector, arises from many applications. The block orthogonal matching pursuit (BOMP) algorithm is a popular block sparse recovery algorithm and has received much attention...
Main Authors: | Jinming Wen, Huangke Chen, Zhengchun Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8404118/ |
Similar Items
-
Preconditioned generalized orthogonal matching pursuit
by: Zhishen Tong, et al.
Published: (2020-05-01) -
On the Error Probability of Support Recovery for Orthogonal Matching Pursuit With a Random Measurement Matrix
by: Yonggu Lee, et al.
Published: (2020-01-01) -
Improved Sufficient Conditions for Support Recovery of Sparse Signals Via Orthogonal Matching Pursuit
by: Xiaolun Cai, et al.
Published: (2018-01-01) -
On Recovery of Block Sparse Signals via Block Compressive Sampling Matching Pursuit
by: Xiaobo Zhang, et al.
Published: (2019-01-01) -
The Sufficient Conditions for Orthogonal Matching Pursuit to Exactly Reconstruct Sparse Polynomials
by: Aitong Huang, et al.
Published: (2022-10-01)