Bayesian Sparse Reconstruction Method of Compressed Sensing in the Presence of Impulsive Noise

被引:14
作者
Ji, Yunyun [1 ]
Yang, Zhen [2 ]
Li, Wei [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Commun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Key Lab Broadband Wireless Commun & Sensor Networ, Minist Educ, Nanjing 210003, Jiangsu, Peoples R China
基金
美国国家科学基金会;
关键词
Bayesian sparse reconstruction; Bayesian impulse detection; Compressed sensing; Impulsive noise fast relevance vector machine; Pruning; SIGNAL RECOVERY;
D O I
10.1007/s00034-013-9605-4
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The majority of existing recovery algorithms in the framework of compressed sensing are not robust to the impulsive noise. However, the impulsive noise is always present in the actual communication and signal processing system. In this paper, we propose a method named 'Bayesian sparse reconstruction' to recover the sparse signal from the measurement vector which is corrupted by the impulsive noise. The Bayesian sparse reconstruction method is composed of five parts, which are the preliminary detection of the location set of impulses, the impulsive noise fast relevance vector machine algorithm, the step of pruning, Bayesian impulse detection algorithm and the maximum a posteriori estimate of the sparse vector. The Bayesian sparse reconstruction method can achieve effective signal recovery in the presence of impulsive noise, depending on the mutual influence of the impulsive noise fast relevance vector machine algorithm, the step of pruning and the Bayesian impulse detection algorithm. Experimental results show that the Bayesian sparse reconstruction method is robust to the impulsive noise and effective in the additive white Gaussian noise environment.
引用
收藏
页码:2971 / 2998
页数:28
相关论文
共 34 条
[1]  
[Anonymous], 2003, P 9 INT WORKSH ART I
[2]  
[Anonymous], 2010, THESIS RICE U HOUSTO
[3]   IEEE-SPS and connexions - An open access education collaboration [J].
Baraniuk, Richard G. ;
Burrus, C. Sidney ;
Thierstein, E. Joel .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+
[4]   Accelerated iterative hard thresholding [J].
Blumensath, Thomas .
SIGNAL PROCESSING, 2012, 92 (03) :752-756
[5]   Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance [J].
Blumensath, Thomas ;
Davies, Mike E. .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2010, 4 (02) :298-309
[6]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[7]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[8]  
Candes E, 2007, ANN STAT, V35, P2313, DOI 10.1214/009053606000001523
[9]   The restricted isometry property and its implications for compressed sensing [J].
Candes, Emmanuel J. .
COMPTES RENDUS MATHEMATIQUE, 2008, 346 (9-10) :589-592
[10]  
Carrillo RE, 2011, INT CONF ACOUST SPEE, P3664