Designing an Efficient Image Encryption-Then- Compression System via Prediction Error Clustering and Random Permutation

0
499
Designing an Efficient Image Encryption-Then- Compression System via Prediction Error Clustering and Random Permutation

Designing an Efficient Image Encryption-Then- Compression System via Prediction Error Clustering and Random Permutation

Abstract  of Designing an Efficient Image Encryption-Then- Compression System

Designing an Efficient Image Encryption-Then- Compression System.In many practical scenarios, image encryption has to be conducted prior to image compression. This has led to the problem of how to design a pair of image encryption and compression algorithms such that compressing the encrypted images can still be efficiently performed. In this paper, we design a highly efficient image encryption-then-compression (ETC) system, where both lossless and lossy compression are considered. The proposed image encryption scheme operated in the prediction error domain is shown to be able to provide a reasonably high level of security. We also demonstrate that an arithmetic coding-based approach can be exploited to efficiently compress the encrypted images. 

 

Conclusion

In this paper,we have designed an efficient image Encryption-then-Compression (ETC) system.

Within the proposed framework, the image encryption has been achieved via prediction error clustering and random permutation.

Highly efficient compression of the encrypted data has then been realized by a context-adaptive arithmetic coding approach. Both theoretical and experimental results have shown that reasonably high level of security has been retained. 

 More notably, the coding efficiency of our proposed compression method on encrypted images is very close to that of the state-of-the-art lossless/lossy image codecs, which receive original, unencrypted images as inputs