Shrinkage-Based Alternating Projection Algorithm for Efficient Measurement Matrix Construction in Compressive Sensing
- 21 January 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 63 (5), 1073-1084
- https://doi.org/10.1109/tim.2014.2298271
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensingSignal Processing, 2011
- Optimized Projection Matrix for Compressive SensingEURASIP Journal on Advances in Signal Processing, 2010
- Subspace Pursuit for Compressive Sensing Signal ReconstructionIEEE Transactions on Information Theory, 2009
- Signal Recovery From Random Measurements Via Orthogonal Matching PursuitIEEE Transactions on Information Theory, 2007
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Extensions of compressed sensingSignal Processing, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Grassmannian frames with applications to coding and communicationApplied and Computational Harmonic Analysis, 2003
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- Lower bounds on the maximum cross correlation of signals (Corresp.)IEEE Transactions on Information Theory, 1974