Recovery of signals by a weighted l2/l1 minimization under arbitrary prior support information

被引:9
作者
Ge, Huanmin [1 ]
Chen, Wengu [2 ]
机构
[1] China Acad Engn Phys, Grad Sch, Beijing 100088, Peoples R China
[2] Inst Appl Phys & Computat Math, Beijing 100088, Peoples R China
关键词
Block restricted isometry property; Block sparse; Compressed sensing; Weighted l(2)/l(1) minimization; REWEIGHTED LEAST-SQUARES; LINEAR INVERSE PROBLEMS; SPARSE SIGNALS; ALGORITHM; PURSUIT; BOUNDS;
D O I
10.1016/j.sigpro.2018.02.027
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we introduce a weighted l(2)/l(1) minimization method to recover block sparse signals with arbitrary prior support information from a linear model. When partial prior support information is available, a sufficient condition based on the block restricted isometry property is derived to guarantee stable recovery of block sparse signals via weighted l(2)/l(1) minimization. We then show that if the accuracy of every prior block support estimate is at least 50%, the sufficient recovery condition of the weighted l(2)/l(1) minimization is weaker than that of the l(2)/l(1) minimization, and the weighted l(2)/l(1) minimization has better recovery performance than the l(2)/l(1) minimization. Moreover, we illustrate the advantages of the weighted l(2)/l(1) minimization in terms of the recovery performance of block sparse signals under uniform and non-uniform prior information by extensive numerical experiments. The significance of the results lies in the facts that explicitly using block sparsity and partial support information of block sparse signals can achieve better recovery performance than handling the signals as being in the conventional sense, thereby ignoring the additional structure and prior support information in the problem. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:288 / 302
页数:15
相关论文
共 53 条
[1]   Bayesian Compressive Sensing Using Laplace Priors [J].
Babacan, S. Derin ;
Molina, Rafael ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (01) :53-63
[2]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[3]   Iterative Thresholding for Sparse Approximations [J].
Blumensath, Thomas ;
Davies, Mike E. .
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2008, 14 (5-6) :629-654
[4]   Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices [J].
Cai, T. Tony ;
Zhang, Anru .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) :122-132
[5]   Sharp RIP bound for sparse signal and low-rank matrix recovery [J].
Cai, T. Tony ;
Zhang, Anru .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2013, 35 (01) :74-93
[6]   Compressed Sensing and Affine Rank Minimization Under Restricted Isometry [J].
Cai, T. Tony ;
Zhang, Anru .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (13) :3279-3290
[7]   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
[8]   On Recovery of Sparse Signals Via l1 Minimization [J].
Cai, T. Tony ;
Xu, Guangwu ;
Zhang, Jun .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3388-3397
[9]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[10]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215