Shrinkage-Based Alternating Projection Algorithm for Efficient Measurement Matrix Construction in Compressive Sensing

A simple but efficient measurement matrix construction algorithm (MMCA) within compressive sensing (CS) framework is introduced. In the CS framework, the smaller coherence between the measurement matrix Φ and the sparse matrix (basis) Ψ can lead to better signal reconstruction performance. In this paper, we achieve this purpose by adopting shrinkage and alternating projection technique iteratively. Finally, the coherence among the columns of the optimized measurement matrix Φ and the fixed sparse matrix Ψ can be decreased greatly, even close to the Welch bound. The extensive experiments have been conducted to test the performance of the proposed algorithm, which are compared with that of the state-of-the-art algorithms. We conclude that the recovery performance of greedy algorithms [e.g., orthogonal matching pursuit (OMP) and regularized OMP] using the proposed MMCA outperforms the random algorithm and the algorithms introduced by Elad, Vahid, Hang, and Xu. In addition, the real temperature data gathering and reconstruction in wireless sensor networks have been conducted. The experimental results also show the superiority of MMCA for real temperature data reconstruction comparing with other existing measurement matrix optimization algorithms.

[1]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

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

[3]  Saeid Sanei,et al.  A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing , 2012, Signal Process..

[4]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  Pierre Vandergheynst,et al.  Average Performance Analysis for Thresholding , 2007, IEEE Signal Processing Letters.

[6]  Deanna Needell,et al.  Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit , 2007, IEEE Journal of Selected Topics in Signal Processing.

[7]  Pierre Vandergheynst,et al.  Dictionary Preconditioning for Greedy Algorithms , 2008, IEEE Transactions on Signal Processing.

[8]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[9]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[10]  Michael Elad,et al.  Optimized Projections for Compressed Sensing , 2007, IEEE Transactions on Signal Processing.

[11]  Yiming Pi,et al.  Optimized Projection Matrix for Compressive Sensing , 2010, EURASIP J. Adv. Signal Process..

[12]  Robert W. Heath,et al.  Designing structured tight frames via an alternating projection method , 2005, IEEE Transactions on Information Theory.

[13]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

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

[15]  Yi Shen,et al.  Measurement matrix construction algorithm for sparse signal recovery , 2013, 2013 IEEE International Instrumentation and Measurement Technology Conference (I2MTC).

[16]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Yaakov Tsaig,et al.  Extensions of compressed sensing , 2006, Signal Process..