Signal Reconstruction of Compressed Sensing Based on Alternating Direction Method of Multipliers

The sparse signal reconstruction of compressive sensing can be accomplished by $${l_1}$$ l 1 -norm minimization, but in many existing algorithms, there are the problems of low success probability and high computational complexity. To overcome these problems, an algorithm based on the alternating direction method of multipliers is proposed. First, using variable splitting techniques, an additional variable is introduced, which is tied to the original variable via an affine constraint. Then, the problem is transformed into a non-constrained optimization problem by means of the augmented Lagrangian multiplier method, where the multipliers can be obtained using the gradient ascent method according to dual optimization theory. The $${l_1}$$ l 1 -norm minimization can finally be solved by cyclic iteration with concise form, where the solution of the original variable could be obtained by a projection operator, and the auxiliary variable could be solved by a soft threshold operator. Simulation results show that a higher signal reconstruction success probability is obtained when compared to existing methods, while a low computational cost is required.

[1]  Dmitry M. Malioutov,et al.  Homotopy continuation for sparse signal representation , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[2]  Joel A. Tropp,et al.  Simultaneous sparse approximation via greedy pursuit , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[3]  Yuan Lei,et al.  A new accelerated alternating minimization method for analysis sparse recovery , 2018, Signal Process..

[4]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[5]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[6]  Fei Wen,et al.  Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization , 2017, IEEE Transactions on Signal Processing.

[7]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[8]  Remi Gribonval Piecewise linear source separation , 2003, SPIE Optics + Photonics.

[9]  D. Donoho For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[10]  ZhangYin,et al.  Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing , 2011 .

[11]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[12]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[13]  Allen Y. Yang,et al.  Fast L1-Minimization Algorithms For Robust Face Recognition , 2010, 1007.3753.

[14]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[15]  Wen-Liang Hwang,et al.  Fast Matching Pursuit Video Coding by Combining Dictionary Approximation and Atom Extraction , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[16]  Lei Feng,et al.  Robust image compressive sensing based on half-quadratic function and weighted schatten-p norm , 2019, Inf. Sci..

[17]  Svetha Venkatesh,et al.  Efficient Algorithms for Robust Recovery of Images From Compressed Data , 2012, IEEE Transactions on Image Processing.

[18]  P. Stoica,et al.  Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher , 2004, IEEE Signal Process. Mag..

[19]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[20]  E.J. Candes Compressive Sampling , 2022 .

[21]  Hong Zhu,et al.  Primal and dual alternating direction algorithms for ℓ1-ℓ1-norm minimization problems in compressive sensing , 2012, Computational Optimization and Applications.

[22]  Wenxian Yu,et al.  Efficient and Robust Recovery of Sparse Signal and Image Using Generalized Nonconvex Regularization , 2017, IEEE Transactions on Computational Imaging.

[23]  David Zhang,et al.  A Survey of Sparse Representation: Algorithms and Applications , 2015, IEEE Access.

[24]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[25]  Patrick L. Combettes,et al.  Signal Recovery by Proximal Forward-Backward Splitting , 2005, Multiscale Model. Simul..

[26]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[27]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[28]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[29]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[30]  Andreas Antoniou,et al.  New Improved Algorithms for Compressive Sensing Based on $\ell_{p}$ Norm , 2014, IEEE Transactions on Circuits and Systems II: Express Briefs.

[31]  Junfeng Yang,et al.  Alternating Direction Algorithms for 1-Problems in Compressive Sensing , 2009, SIAM J. Sci. Comput..