Joint quantization and diffusion for compressed sensing measurements of natural images

Recent research advances have revealed the computational secrecy of the compressed sensing (CS) paradigm. Perfect secrecy can also be achieved by normalizing the CS measurement vector. However, these findings are established on real-valued measurements while digital devices can only store the samples at a finite precision. Based on the distribution of measurements of natural images sensed by structurally random ensemble, a joint quantization and diffusion approach for the real-valued measurements is suggested. In this way, a nonlinear cryptographic diffusion is intrinsically imposed on the CS quantization process and the overall security level is thus enhanced. It is shown that the proposed scheme is able to resist known-plaintext attack while the original CS scheme without quantization cannot.

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

[2]  Raziel Haimi-Cohen,et al.  Distribution of Compressive Measurements Generated by Structurally Random Matrices , 2013, ArXiv.

[3]  Trac D. Tran,et al.  Fast and Efficient Compressive Sensing Using Structurally Random Matrices , 2011, IEEE Transactions on Signal Processing.

[4]  Rayan Saab,et al.  Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing , 2013, ArXiv.

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

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

[7]  Zhenxing Qian,et al.  Compressing Encrypted Image Using Compressive Sensing , 2011, 2011 Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing.

[8]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

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

[10]  Anamitra Makur,et al.  Lossy compression of encrypted image by compressive sensing technique , 2009, TENCON 2009 - 2009 IEEE Region 10 Conference.

[11]  Rayan Saab,et al.  Sobolev Duals for Random Frames and ΣΔ Quantization of Compressed Sensing Measurements , 2013, Found. Comput. Math..

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Felix Krahmer,et al.  An RIP-Based Approach to $\Sigma \Delta $ Quantization for Compressed Sensing , 2014, IEEE Signal Processing Letters.

[14]  Enrico Magli,et al.  On the security of random linear measurements , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[15]  Bin Song,et al.  Joint Sampling Rate and Bit-Depth Optimization in Compressive Video Sampling , 2014, IEEE Transactions on Multimedia.

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

[17]  Y. Rachlin,et al.  The secrecy of compressed sensing measurements , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[18]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.