Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields

A valuable opportunity is provided by compressed sensing (CS) to accomplish the tasks of high speed sampling, the transmission of large volumes of data, and storage in signal processing. To some extent, CS has brought tremendous changes in the information technologies that we use in our daily lives. However, the construction of compressed sensing matrices still can pose substantial problems. In this paper, we provide a kind of deterministic construction of sensing matrices based on singular linear spaces over finite fields. In particular, by choosing appropriate parameters, we constructed binary sensing matrices that are superior to existing matrices, and they outperform DeVore’s matrices. In addition, we used an embedding manipulation to merge our binary matrices with matrices that had low coherence, thereby improving such matrices. Compared with the quintessential binary matrices, the improved matrices possess better ability to compress and recover signals. The favorable performance of our binary and improved matrices was demonstrated by numerical simulations.

[1]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

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

[3]  Yi Fang,et al.  Deterministic Construction of Compressed Sensing Matrices from Protograph LDPC Codes , 2015, IEEE Signal Processing Letters.

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

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

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

[7]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[8]  Hao Chen,et al.  Deterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes , 2015, ArXiv.

[9]  Kaishun Wang,et al.  Singular linear space and its applications , 2011, Finite Fields Their Appl..

[10]  W. Wootters,et al.  Optimal state-determination by mutually unbiased measurements , 1989 .

[11]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[12]  Kaishun Wang,et al.  Association schemes based on attenuated spaces , 2010, Eur. J. Comb..

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

[14]  Bin Gu,et al.  Incremental learning for ν-Support Vector Regression , 2015, Neural Networks.

[15]  Dimitris A. Pados,et al.  New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets , 2003, IEEE Trans. Commun..

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

[17]  Farrokh Marvasti,et al.  Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices , 2009, IEEE Transactions on Information Theory.

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

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

[20]  Yuhui Zheng,et al.  Image segmentation by generalized hierarchical fuzzy C-means algorithm , 2015, J. Intell. Fuzzy Syst..

[21]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[22]  Farrokh Marvasti,et al.  Matrices With Small Coherence Using $p$-Ary Block Codes , 2012, IEEE Transactions on Signal Processing.

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

[24]  Gennian Ge,et al.  Deterministic Sensing Matrices Arising From Near Orthogonal Systems , 2014, IEEE Transactions on Information Theory.

[25]  Gennian Ge,et al.  Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves , 2012, IEEE Transactions on Information Theory.

[26]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Matrices , 2010, Proceedings of the IEEE.

[27]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

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

[29]  Michael B. Wakin,et al.  Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.

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

[31]  A. Robert Calderbank,et al.  Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.

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

[33]  Gennian Ge,et al.  Deterministic Construction of Sparse Sensing Matrices via Finite Geometry , 2014, IEEE Transactions on Signal Processing.

[34]  J. Tropp,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.

[35]  Stephen J. Dilworth,et al.  Explicit constructions of RIP matrices and related problems , 2010, ArXiv.

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

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