Vous êtes sur la page 1sur 5

IJSTE - International Journal of Science Technology & Engineering | Volume 1 | Issue 11 | May 2015

ISSN (online): 2349-784X

Image Encryption Compression System via


Prediction Error Clustering and Random
Permutation
Ms. Thejangunuo Juline Linyu
PG Student(M.Tech)
Department of Electronics & Communication
RajaRajeshwari College of Engineering, Bangalore

Mr. B.B. S Kumar


Assistant Professor
Department of Electronics & Communication
RajaRajeshwari College of Engineering, Bangalore

Abstract
In this paper we present an image encryption and compression system, where encryption of an image is conducted prior to
compression. The proposed image encryption operated in the prediction error domain is to provide a reasonably high level of
security. Also an efficient lossless compression of the encrypted image is performed by using Arithmetic coding with Run length
encoding. We achieved higher compression ratios by using Arithmetic coding with Run length encoding compared to using only
Arithmetic coding algorithm. Experimental results illustrated that the proposed system is efficient in terms of compression ratio
and Peak signal to noise ratio.
Keywords: Arithmetic Coding, Encryption, Run Length Encoding
________________________________________________________________________________________________________

I. INTRODUCTION
With the expeditious progression of data exchange in electronic way, information security is becoming more important in data
storage and transmission. In many practical scenarios contents of multimedia need both to be compressed as well as protected.
The conventional way is to first compress and then encrypt, in some cases it may be desirable to operate the other way around.
This is the case, for example of an encrypted content that is transmitted without compression through the internet, but at a certain
point needs to be compressed in order to match the characteristics of the transmission link. Compression of an encrypted data
seems to be infeasible at first sight, but in [2] it showed that by relying on the theory of source coding it is indeed possible to
compress the encrypted data with available side information at the decoder end. . As the multimedia data is transmitted over
networks on large scale, we need to have a reliable technique to prevent data getting leaked or attacked. The security mechanism
should typically be a reliable method to protect the images as well as videos with same potential. Good encryption makes a
source look completely random, traditional algorithms are unable to compress encrypted data. For this reason, traditional systems
make sure to compress before they encrypt. We are using the concept of private key encryption, for the encryption and
decryption of image. Neither the security nor the compression efficiency will be sacrificed by performing compression in the
encrypted domain. Many techniques require the complex computation to be done to encrypt the images and videos but it takes a
larger overhead of computing values for non sensitive data too. So the solution to this problem is to do selective encryption.
Government, military and private business organizations make use of great deal of confidential images about their patients (in
Hospitals), geographical areas (in research processes), enemy positions (in defence and military operations) product, and
financial-status [3]. Most of this information is now captured, processed and stored on electronic computers and transmitted
across the vast geographical areas network to other computer, if these confidential images about enemy positions ,patient ,and
geographical areas fall into the maliciously behaving hands, than such a breach of security could lead to lots of war, wrong
treatment etc. So protecting confidential images is an ethical and legal requirement. We store information in computer system in
the form of files. File is considered as a basic entity for keeping the information in electronic form.

II. PROPOSED SYSTEM


The block diagram of proposed system is shown in figure1 and 2. Initially the input image is pre-processed, then compression of
encrypted image is conducted at the transmitting end. Compressed bit- streams obtained after compression is decompressed by
using decoding algorithm at the receiving end. Decryption of the decompressed image is obtained by using the key that is kept as
side information.

All rights reserved by www.ijste.org

354

Image Encryption Compression System via Prediction Error Clustering and Random Permutation
(IJSTE/ Volume 1 / Issue 11 / 061)

Fig. 1: Proposed System at Transmitting End

Fig. 2: Proposed System at Receiving End

III. IMAGE ENCRYPTION


Encryption is the process of encoding message or information in such a way only authorized persons can see it. Encryption does
not itself prevent interception, but denies the message content to the interceptor. There are various encryption techniques
available, out of which we use random permutation in our proposed system.
The input image I is first fed into Gradient Adjusted Prediction (GAP) [7]. Gradient adjusted prediction is an efficient
prediction method for lossless compression of image encryption. By calculating its gradient in vertical and horizontal orientation
with the known context, the pixel value can be well estimated. The vertical and horizontal gradient is estimated by using:
dh = |
| +|
|+|
|
(1)
dv = |

| +|

|+|

(2)

We obtained prediction error image by taking the difference of original pixel value and predicted pixel value of the image.
Before applying random permutation it is necessary to divide the image into different blocks hence we used clustering techniques
to obtained clusters. By using two key-driven cyclic shifting operations random permutation is performed to each cluster.
Encrypted image is obtained by assembling back all the clusters.

IV. IMAGE COMPRESSION


Compression main objective is to reduce irrelevance or redundancy data of an image in order to be able to store or transmit data
in an efficient form. Image compression may be lossy or lossless; we use lossless compression in our proposed system. Lossless
data compression is a class of data compression algorithm that allows the original data to be perfectly reconstructed from the
compressed data. Lossless data compression is used in many applications. Arithmetic coding and Run length encoding are the
two techniques incorporated to compress the encrypted image in proposed system. AC is used because of its refined and accurate
property and it helps us achieve better compression efficiency compared to Huffman coding. The flowchart of arithmetic coding
is shown below:

Fig. 3: Flowchart of Arithmetic Coding

All rights reserved by www.ijste.org

355

Image Encryption Compression System via Prediction Error Clustering and Random Permutation
(IJSTE/ Volume 1 / Issue 11 / 061)

V. IMAGE DECOMPRESSION AND DECRYPTION


The original image is needed to be recovered at the receiver end. It is necessary to perform decompression to the compressed
encrypted bit-streams. Arithmetic decoding was applied to the bit-stream to obtain the permuted image after which it is deassembled into different clusters and de-permutation was performed to obtain the decrypted image.

VI. EXPERIMENTAL RESULTS


The proposed approach was executed using MATLAB R2012b in windows 7 operating system with 3GB RAM. The
experiments are carried out on some standards colour images like lena.jpg, sunflower.jpg of variable size. Input original image of
size 512 x 512 jpeg format is shown in figure 4. At the pre-processing stage we converted the colour image to gray scale image
after resizing the image to 128 x 128 as shown in figure 5 and 6. Figure 7 shows the prediction error image obtained by using
GAP, figure 8 shows the encrypted image obtained after randomly permuting the predicted error image, figure 9 shows the
decompressed image at the receiver end and finally the decrypted image is shown in figure 10. The performance evaluation
factors such as compression ratio and PSNR at different stages of operation are represented with bar charts in figure 11.

Fig. 4: Original Input Image (512 X 512)

Fig. 5: Resize Image (128x128)

Fig. 6: Gray Scale Image

Fig. 7: Prediction Error Image

All rights reserved by www.ijste.org

356

Image Encryption Compression System via Prediction Error Clustering and Random Permutation
(IJSTE/ Volume 1 / Issue 11 / 061)

Fig. 8: Encrypted Image

Fig. 9: Decompressed Image

Fig. 10: Decrypted Image

Fig. 11: (A) Bar Chart Representation of Compression Ratio (CR) For Two Different Techniques (B) Bar Chart Representation Of Peak Signal
To Noise Ratio (PSNR) At Different Stages Of Operation

VII. CONCLUSION
The experimental result indicates that it is indeed possible to compress an encrypted image without relying on the secret key.
Higher compression ratio infers to higher compression efficiency. We gain 0.5% to 0.52% by using AC in combination with
RLE
The secrecy of an image is perfectly achieved and its quality is retained at the receiver end. In future the proposed system can
be extended to lossy compression.

REFERENCES
[1]
[2]
[3]

J. Zhou, X. Liu, and O. C. Au, On the design of an efficient encryption-then-compression system, in Proc. ICASSP, 2013, pp. 28722876.
M. Johnson, P. Ishwar, V. M. Prabhakaran, D. Schonberg, and K. Ramchandran, On compressing encrypted data, IEEE Trans. Signal Process., vol. 52,
no. 10, pp. 29923006, Oct. 2004.
P.S.Kishore, N.Ajay Nagendra, K.Pratap Reddy, V.V.S.Murthy, Smoothing And Optimal Compression Of Encrypted Gray Scale Images, International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 Vol. 2, Issue 3, May-Jun 2012, pp.023-028

All rights reserved by www.ijste.org

357

Image Encryption Compression System via Prediction Error Clustering and Random Permutation
(IJSTE/ Volume 1 / Issue 11 / 061)
[4]
[5]
[6]
[7]

D. Klinc, C. Hazay, A. Jagmohan, H. Krawczyk, and T. Rabin, On compression of data encrypted with block ciphers, IEEE Trans. Inf. Theory, vol. 58,
no. 11, pp. 69897001, Nov. 2012.
R. Lazzeretti and M. Barni, Lossless compression of encrypted greylevel and color images, in Proc. 16th Eur. Signal Process. Conf., Aug. 2008, pp. 15.
A. Kumar and A. Makur, Distributed source coding based encryption and lossless compression of gray scale and color images, in Proc. MMSP, 2008
Feng-Yang Hsieh et.al, A Lossless Image Coder Integrating Predictors and Block-Adaptive Prediction, Journal Of Information Science And Engineering
24, 1579-1591 (2008)

All rights reserved by www.ijste.org

358

Vous aimerez peut-être aussi