Lossless compression of encrypted grey-level and color images

The feasibility of lossless compression of encrypted images has been recently demonstrated by relying on the analogy with source coding with side information at the decoder. However previous works only addressed the compression of bilevel images, namely sparse black and white images, with asymmetric probabilities of black and white pixels. In this paper we investigate the possibility of compressing encrypted grey level and color images, by decomposing them into bit-planes. A few approaches to exploit the spatial and cross-plane correlation among pixels are discussed, as well as the possibility of exploiting the correlation between color bands. Some experimental results are shown to evaluate the gap between the proposed solutions and the theoretically achievable performance.

[1]  Vinod M. Prabhakaran,et al.  On compressing encrypted data , 2004, IEEE Transactions on Signal Processing.

[2]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[3]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[4]  M.J. Wainwright,et al.  Sparse Graph Codes for Side Information and Binning , 2007, IEEE Signal Processing Magazine.

[5]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[6]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[7]  Kannan Ramchandran,et al.  On Compression of Encrypted Images , 2006, 2006 International Conference on Image Processing.

[8]  Soo-Chang Pei,et al.  Reversible integer color transform with bit-constraint , 2005, IEEE International Conference on Image Processing 2005.

[9]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.