On optimization of the measurement matrix for compressive sensing

In this paper the problem of Compressive Sensing (CS) is addressed. The focus is on estimating a proper measurement matrix for compressive sampling of signals. The fact that a small mutual coherence between the measurement matrix and the representing matrix is a requirement for achieving a successful CS is now well known. Therefore, designing measurement matrices with smaller coherence is desired. In this paper a gradient descent method is proposed to optimize the measurement matrix. The proposed algorithm is designed to minimize the mutual coherence which is described as absolute off-diagonal elements of the corresponding Gram matrix. The optimization is mainly applied to random Gaussian matrices which is common in CS. An extended approach is also presented for sparse signals with respect to redundant dictionaries. Our experiments yield promising results and show higher reconstruction quality of the proposed method compared to those of both unoptimized case and previous methods.

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

[2]  Antonio Artes-Rodriguez,et al.  Sensing matrix optimization in Distributed Compressed Sensing , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.

[3]  M. Lustig,et al.  Compressed Sensing MRI , 2008, IEEE Signal Processing Magazine.

[4]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

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

[6]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[7]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

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

[9]  Jean-Luc Starck,et al.  Compressed Sensing in Astronomy , 2008, IEEE Journal of Selected Topics in Signal Processing.

[10]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

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

[12]  Bhaskar D. Rao,et al.  Sparse channel estimation via matching pursuit with application to equalization , 2002, IEEE Trans. Commun..

[13]  Guillermo Sapiro,et al.  Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization , 2009, IEEE Transactions on Image Processing.

[14]  Saeid Sanei,et al.  Segmented compressive sensing , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.

[15]  David L. Donoho,et al.  Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .

[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..

[18]  Saeid Sanei,et al.  A compressive sensing approach for progressive transmission of images , 2009, 2009 16th International Conference on Digital Signal Processing.

[19]  T. Blumensath,et al.  Iterative Thresholding for Sparse Approximations , 2008 .

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

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

[22]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.