Improved RIC bound for the recovery of sparse signals by orthogonal matching pursuit with noise

被引:1
作者
Tong, Chao [1 ]
Li, Jun [1 ]
Zhang, Weizhi [1 ]
机构
[1] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
关键词
iterative methods; time-frequency analysis; compressed sensing; sparse matrices; noise; l(2) bounded noise; sensing matrix; restricted isometry constant bound; orthogonal matching pursuit algorithm; sparse signal recovery; RIC bound;
D O I
10.1049/el.2016.1523
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The restricted isometry constant (RIC) bound for the recovery of a sparse signal with l(2) bounded noise by orthogonal matching pursuit algorithm is studied. We show under our weaker condition on the RIC of sensing matrix and the minimum magnitude of the non-zero components, the support of the unknown signal can be recovered exactly under l(2) bounded noise. Our results are better than the best existing ones.
引用
收藏
页码:1956 / 1958
页数:2
相关论文
共 7 条
[1]  
[Anonymous], APPL COMPUT HARM ANA
[2]   The restricted isometry property and its implications for compressed sensing [J].
Candes, Emmanuel J. .
COMPTES RENDUS MATHEMATIQUE, 2008, 346 (9-10) :589-592
[3]   Subspace Pursuit for Compressive Sensing Signal Reconstruction [J].
Dai, Wei ;
Milenkovic, Olgica .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) :2230-2249
[4]   SPARSE SIGNALS RECOVERY FROM NOISY MEASUREMENTS BY ORTHOGONAL MATCHING PURSUIT [J].
Shen, Yi ;
Li, Song .
INVERSE PROBLEMS AND IMAGING, 2015, 9 (01) :231-238
[5]   Greed is good: Algorithmic results for sparse approximation [J].
Tropp, JA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2231-2242
[6]   Improved bounds on restricted isometry constant for orthogonal matching pursuit [J].
Wen, Jinming ;
Zhu, Xiaomei ;
Li, Dongfang .
ELECTRONICS LETTERS, 2013, 49 (23) :1487-1489
[7]   The Exact Support Recovery of Sparse Signals With Noise via Orthogonal Matching Pursuit [J].
Wu, Rui ;
Huang, Wei ;
Chen, Di-Rong .
IEEE SIGNAL PROCESSING LETTERS, 2013, 20 (04) :403-406