A projection matrix design method for MSE deduction in adaptive compressive sensing

Abstract In adaptive compressive sensing, measurement matrix is adaptively designed to recover the sparse signal. After the support of the sparse signal is recovered, the projection measurement is designed to reduce the mean squared error of the estimated sparse signal. This paper proposes a projection matrix design method using the support set of the sparse signal estimated via previous measurements. The projection matrix design problem is formulated as an optimization problem, which minimizes the mean squared error of the estimated sparse signal with the energy of the projection matrix being constrained. A water filling like algorithm is proposed to solve the optimization problem. It is proved that the Water Filling algorithm gives the globally optimal solution once the sufficient condition is satisfied. A method is given to check whether the result given by the Water Filling algorithm is globally optimal or not. Numerical experiments demonstrate the effectiveness of the designed algorithm.

[1]  Adaptive Compressed Sensing via Minimizing Cramer–Rao Bound , 2014, IEEE Signal Processing Letters.

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

[3]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[4]  Yi Shen,et al.  Analysis of generalised orthogonal matching pursuit using restricted isometry constant , 2014 .

[5]  Robert D. Nowak,et al.  Signal Reconstruction From Noisy Random Projections , 2006, IEEE Transactions on Information Theory.

[6]  Wei Yu,et al.  Iterative water-filling for Gaussian vector multiple-access channels , 2001, IEEE Transactions on Information Theory.

[7]  D. L. Donoho,et al.  Compressed sensing , 2006, IEEE Trans. Inf. Theory.

[8]  Deanna Needell,et al.  Constrained Adaptive Sensing , 2015, IEEE Transactions on Signal Processing.

[9]  Christian Jutten,et al.  A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.

[10]  Giuseppe Caire,et al.  An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC , 2006, IEEE Journal on Selected Areas in Communications.

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

[12]  Yi Shen,et al.  Sufficient conditions for generalized Orthogonal Matching Pursuit in noisy case , 2015, Signal Process..

[13]  Bo Li,et al.  Projection matrix design using prior information in compressive sensing , 2017, Signal Process..

[14]  Miguel R. D. Rodrigues,et al.  Projection Design for Statistical Compressive Sensing: A Tight Frame Based Approach , 2013, IEEE Transactions on Signal Processing.

[15]  Michael Elad,et al.  Dictionaries for Sparse Representation Modeling , 2010, Proceedings of the IEEE.

[16]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[17]  Yonina C. Eldar,et al.  The Cramér-Rao Bound for Estimating a Sparse Parameter Vector , 2010, IEEE Transactions on Signal Processing.

[18]  Tianyao Huang,et al.  Cognitive random stepped frequency radar with sparse recovery , 2013, IEEE Transactions on Aerospace and Electronic Systems.

[19]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[20]  Emmanuel J. Candès,et al.  On the Fundamental Limits of Adaptive Sensing , 2011, IEEE Transactions on Information Theory.

[21]  Mark A. Davenport,et al.  Compressive binary search , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[23]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[24]  Bhaskar D. Rao,et al.  Sparse Bayesian learning for basis selection , 2004, IEEE Transactions on Signal Processing.