A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework
arXiv:1303.2257 · doi:10.1109/JSTSP.2009.2039173
Abstract
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: -least mean square (-LMS) algorithm and -exponentially forgetting window LMS (-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 -zero attraction projection (-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.
arXiv comment28 pages, 8 figures
References in corpus (14)
- Rejoinder to "Least angle regression" by Efron et al
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Pathwise coordinate optimization
- l_0 Norm Constraint LMS Algorithm for Sparse System Identification
- Signal Recovery from Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited by in corpus (16)
- Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm
- Recursive Recovery of Sparse Signal Sequences from Compressive Measurements: A Review
- On the Performance Bound of Sparse Estimation with Sensing Matrix Perturbation
- Decentralized Sparse Multitask RLS over Networks
- Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-point Attracting Projection
- Robustness of Sparse Recovery via -minimization: A Topological Viewpoint
- Oracle-order Recovery Performance of Greedy Pursuits with Replacement against General Perturbations
- A New Variable Step-size Zero-point Attracting Projection Algorithm
- An Improved Variable Step-size Zero-point Attracting Projection Algorithm
- The Convergence Guarantees of a Non-convex Approach for Sparse Recovery
- Zero-point attracting projection algorithm for sequential compressive sensing
- Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding
- Sparsity-Aware STAP Algorithms Using -norm Regularization For Radar Systems
- Underwater Acoustic Channel Adaptive Estimation using l21 Norms
- Study of Diffusion Normalized Least Mean M-estimate Algorithms
- Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments