A Stochastic Gradient Approach on Compressive Sensing Signal Reconstruction Based on Adaptive Filtering Framework

被引:127
作者
Jin, Jian [1 ]
Gu, Yuantao [1 ]
Mei, Shunliang [1 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Adaptive filter; compressive sensing (CS); least mean square (LMS); l(o) norm; sparse signal reconstruction; stochastic gradient; ATOMIC DECOMPOSITION; ALGORITHMS; SELECTION; RECOVERY; SPARSITY;
D O I
10.1109/JSTSP.2009.2039173
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Based on the methodological similarity between sparse signal reconstruction and system identification, a new approach for sparse signal reconstruction in compressive sensing (CS) is proposed in this paper. This approach employs a stochastic gradient-based adaptive filtering framework, which is commonly used in system identification, to solve the sparse signal reconstruction problem. Two typical algorithms for this problem: l(o)-least mean square (l(o)-LMS) algorithm and l(o)-exponentially forgetting window LMS (l(o)-EFWLMS) algorithm are hence introduced here. Both the algorithms utilize a zero attraction method, which has been implemented by minimizing a continuous approximation of norm of the studied signal. To improve the performances of these proposed algorithms, an l(o)-zero attraction projection (l(o)-ZAP) algorithm is also adopted, which has effectively accelerated their convergence rates, making them much faster than the other existing algorithms for this problem. Advantages of the proposed approach, such as its robustness against noise, etc., are demonstrated by numerical experiments.
引用
收藏
页码:409 / 420
页数:12
相关论文
共 50 条
[1]  
[Anonymous], STUDIES APPL MATH
[2]  
[Anonymous], FAST SOLUTION 11 NOR
[3]  
[Anonymous], 2015, Linear and Nonlinear Programming
[4]  
[Anonymous], 2008, 2008 IEEE INT C AC S, DOI DOI 10.1109/ICASSP.2008.4518498
[5]   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-+
[6]  
Benesty J, 2002, INT CONF ACOUST SPEE, P1881
[7]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[8]   LINEARIZED BREGMAN ITERATIONS FOR COMPRESSED SENSING [J].
Cai, Jian-Feng ;
Osher, Stanley ;
Shen, Zuowei .
MATHEMATICS OF COMPUTATION, 2009, 78 (267) :1515-1536
[9]  
Candes E. J., 2006, P INT C MATH MADR SP, V3, P1433, DOI DOI 10.4171/022-3/69
[10]   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