Compressed Sensing Natural Imaging via Hadamard-Diagonal Matrix

The measurement matrix is one of the keys of the compressed sensing. However, the existing measurement matrices face the two main problems of the difficult hardware implementation and the low sensing efficiency. In fact, those matrices always ignore the energy concentration characteristic of the natural images in the sparse domain, which greatly limits the sensing efficiency of the measurement matrices and thus the construction efficiency. In this paper, we propose a simple but efficient measurement matrix based on the Hadamard matrix with the consideration of maximizing the energy conservation in the sparse domain, named Hadamard-Diagonal Matrix (HDM). We keep the main sensing rows and columns in the Hadamard matrix with '1' and the others with '0' to keep more energy after the sampling of the natural images in the sparse domain, which increases the sensing efficiency. Meanwhile, the HDM is a binary and sparse matrix which benefits the hardware implementation. The experimental results show that the HDM performs better than some popular existing measurement matrices and is incoherent with different sparse basis.

[1]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[2]  E.J. Candes Compressive Sampling , 2022 .

[3]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

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

[5]  Alexandros G. Dimakis,et al.  LP decoding meets LP decoding: A connection between channel coding and compressed sensing , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[7]  S. Jiao,et al.  Compressed sensing and reconstruction with bernoulli matrices , 2010, The 2010 IEEE International Conference on Information and Automation.

[8]  Alexandros G. Dimakis,et al.  LDPC Codes for Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[9]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

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

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

[12]  Thong T. Do,et al.  Sparsity adaptive matching pursuit algorithm for practical compressed sensing , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

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

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

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

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

[17]  H. Andrews,et al.  Hadamard transform image coding , 1969 .

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

[19]  Trac D. Tran,et al.  Fast compressive imaging using scrambled block Hadamard ensemble , 2008, 2008 16th European Signal Processing Conference.

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

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