New bounds on the restricted isometry constant δ2k

被引:130
作者
Mo, Qun [1 ]
Li, Song [1 ]
机构
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R China
关键词
Compressed sensing; Restricted isometry property; Restricted isometry constant; Sparse recovery; RECOVERY;
D O I
10.1016/j.acha.2011.04.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Restricted isometry constants play an important role in compressed sensing. In the literature, E.J. Candes has proven that delta(2k) < root 2 -1 approximate to 0.4142 is a sufficient condition for the l(1) minimization problem having a k-sparse solution. Later, S. Foucart and M. Lai have improved the condition to delta(2k) < 0.4531 and S. Foucart has improved the bound to delta(2k) < 0.4652. In 2010, T. Cai, L Wang and G. Xu have improved the condition to delta(2k) < 0.4721 for the cases such that k is a multiple of 4 or k is very large and S. Foucart has improved the bound to delta(2k) < 0.4734 for large values of k. In this paper, we have improved the sufficient condition to delta(2k) < 0.4931 for general k. Also, in some special cases, the sufficient condition can be improved to delta(2k) < 0.6569. These new bounds have several benefits on recovering compressible signals with noise. Crown Copyright (C) 2011 Published by Elsevier Inc. All rights reserved.
引用
收藏
页码:460 / 468
页数:9
相关论文
共 7 条
[1]   New Bounds for Restricted Isometry Constants [J].
Cai, T. Tony ;
Wang, Lie ;
Xu, Guangwu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4388-4394
[2]   Shifting Inequality and Recovery of Sparse Signals [J].
Cai, T. Tony ;
Wang, Lie ;
Xu, Guangwu .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (03) :1300-1308
[3]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[4]   The restricted isometry property and its implications for compressed sensing [J].
Candes, Emmanuel J. .
COMPTES RENDUS MATHEMATIQUE, 2008, 346 (9-10) :589-592
[5]   Restricted Isometry Constants Where lp Sparse Recovery Can Fail for 0 &lt; p ≤ 1 [J].
Davies, Michael Evan ;
Gribonval, Remi .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) :2203-2214
[6]   A note on guaranteed sparse recovery via l1-minimization [J].
Foucart, Simon .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2010, 29 (01) :97-103
[7]   Sparsest solutions of underdetermined linear systems via lq-minimization for 0 &lt; q ≤ 1 [J].
Foucart, Simon ;
Lai, Ming-Jun .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 26 (03) :395-407