An Improved Toeplitz Measurement Matrix for Compressive Sensing

Compressive sensing (CS) takes advantage of the signal's sparseness in some domain, allowing the entire signal to be efficiently acquired and reconstructed from relatively few measurements. A proper measurement matrix for compressive sensing is significance in above processions. In most compressive sensing frameworks, random measurement matrix is employed. However, the random measurement matrix is hard to implement by hardware. So the randomness of the measurement matrix leads to the poor performance of signal reconstruction. In this paper, Toeplitz matrix is employed and optimized as a deterministic measurement matrix. A hardware platform for signal efficient acquisition and reconstruction is built by field programmable gate arrays (FPGA). Experimental results demonstrate the proposed approach, compare with the existing state-of-the-art method, and have the highest technical feasibility, lowest computational complexity, and least amount of time consumption in the same reconstruction quality.

[1]  Anupam Gupta,et al.  An elementary proof of the Johnson-Lindenstrauss Lemma , 1999 .

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

[3]  Wei Sui,et al.  Method of image reconstruction based on very sparse random projection , 2007 .

[4]  Trac D. Tran,et al.  Fast compressive sampling with structurally random matrices , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Justin K. Romberg,et al.  Compressive Sensing by Random Convolution , 2009, SIAM J. Imaging Sci..

[6]  M. Yamaguti,et al.  Chaos and Fractals , 1987 .

[7]  L. Rebollo-Neira,et al.  Optimized orthogonal matching pursuit approach , 2002, IEEE Signal Processing Letters.

[8]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[9]  Deanna Needell,et al.  Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..

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

[11]  Li Chao,et al.  Spatial-temporal Difference Method for Detecting Small Moving Targets in Visible Image Background Clutter , 2006 .

[12]  Holger Rauhut,et al.  Circulant and Toeplitz matrices in compressed sensing , 2009, ArXiv.

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

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

[15]  Holger Rauhut Stability Results for Random Sampling of Sparse Trigonometric Polynomials , 2008, IEEE Transactions on Information Theory.

[16]  Rachel Ward,et al.  New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property , 2010, SIAM J. Math. Anal..

[17]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[18]  F. Sebert,et al.  Toeplitz block matrices in compressed sensing and their applications in imaging , 2008, 2008 International Conference on Information Technology and Applications in Biomedicine.

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

[20]  A. Robert Calderbank,et al.  A fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[21]  Wei Sui,et al.  A Method of Image Reconstruction Based on Sub-Gaussian Random Projection , 2008 .

[22]  Junfeng Yang,et al.  Practical compressive sensing with Toeplitz and circulant matrices , 2010, Visual Communications and Image Processing.

[23]  Leon O. Chua,et al.  Practical Numerical Algorithms for Chaotic Systems , 1989 .

[24]  R. Calderbank,et al.  Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery , 2009 .

[25]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Random Matrices , 2010, LATIN.

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

[27]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[28]  M. Ng Circulant and skew-circulant splitting methods for Toeplitz systems , 2003 .

[29]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[30]  A. Pinkus n-Widths in Approximation Theory , 1985 .

[31]  Stephen J. Wright,et al.  Toeplitz-Structured Compressed Sensing Matrices , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

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

[33]  Michael K. Ng,et al.  Splitting iterations for circulant‐plus‐diagonal systems , 2005, Numer. Linear Algebra Appl..