Permutation enhanced parallel reconstruction for compressive sampling

In this paper, a simple but efficient permutation enhanced parallel reconstruction architecture for compressive sampling (CS) is proposed. In this architecture, a measurement matrix is constructed from a block-diagonal sensing matrix, the sparsifying basis of the target signal, and a pre-defined permutation matrix. In this way, the projection of the signal onto the sparsifying basis can be divided into several segments and all segments can be reconstructed in parallel. Thus, the computational complexity and the time for reconstruction can be reduced significantly. With a good permutation matrix, the error performance of the proposed method can be improved compared with the option without permutation. The proposed method can be used in applications where the computational complexity and time for reconstruction are crucial evaluation criteria and centralized sampling is acceptable. Simulation results show that the proposed method can achieve comparable results to the centralized reconstruction methods (i.e., standard CS and distributed CS), while requiring much less reconstruction time.

[1]  Richard G. Baraniuk,et al.  Kronecker Compressive Sensing , 2012, IEEE Transactions on Image Processing.

[2]  Tommaso Melodia,et al.  Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[3]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[4]  R.G. Baraniuk,et al.  Distributed Compressed Sensing of Jointly Sparse Signals , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[5]  Kwok-Wo Wong,et al.  Embedding cryptographic features in compressive sensing , 2014, Neurocomputing.

[6]  Richard G. Baraniuk,et al.  An Information-Theoretic Approach to Distributed Compressed Sensing ∗ , 2005 .

[7]  Michael B. Wakin,et al.  Concentration of Measure for Block Diagonal Matrices With Applications to Compressive Signal Processing , 2011, IEEE Transactions on Signal Processing.

[8]  Hai Jiang,et al.  2D signal compression via parallel compressed sensing with permutations , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

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

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

[11]  Thomas B. Schön,et al.  2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015 , 2016 .

[12]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[13]  Amir Averbuch,et al.  Adaptive Compressed Image Sensing Using Dictionaries , 2012, SIAM J. Imaging Sci..

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

[15]  Lu Gan Block Compressed Sensing of Natural Images , 2007, 2007 15th International Conference on Digital Signal Processing.

[16]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..

[17]  Richard G. Baraniuk,et al.  Recovery of Jointly Sparse Signals from Few Random Projections , 2005, NIPS.

[18]  Hai Jiang,et al.  Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals , 2013, IEEE Transactions on Signal Processing.

[19]  Michael B. Wakin,et al.  The Restricted Isometry Property for Random Block Diagonal Matrices , 2012, ArXiv.