IJCSMC, Vol. 5, Issue. 9, September 2016, pg.93 An ... · that after transform [10]. Fig. 2shows the encryption image after applied Arnold transform over original image. Encryption
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Muslim Mohsin Khudhair, International Journal of Computer Science and Mobile Computing, Vol.5 Issue.9, September- 2016, pg. 93-102
The decompression algorithm represents reverse steps for the proposed image compression. Firstly, applied arithmetic decoding
for decompress DC-array, Nonzero-array and Zero-array. Thereafter, nonzero-array and zero-array are combined together for
reconstructing minimized-array. Secondly, using Parallel Sequential Search Algorithm (PSS-Algorithm), moreover, this
algorithm represents inverse Minimize-Matrix-Size Algorithm for reconstructing AC-Matrix. PSS-Algorithm, estimates (Ai, Bi
and Ci) by using (Di) with Key. Whereas, Ai, Bi and Ci are represents estimated columns for decompress AC-Matrix [17, 20,
21]. PSS-Algorithm can be illustrates in the following steps:
Step 1: PSS-Algorithm starts to pick first (P) data from the Limited-Data, and then these (P) data are connected with each other
look like a network as shown in Fig. 6. In Fig. 6 (Column-1) data connected as a network with (Column-2) data, also (Column-2) is networking with (Column-3). In another words, the searching algorithm computes all options in parallel. For example: A=[1 -
1 0] , B=[1 -2 0] and C=[3 -1 5], and P=3, according to Equation (4) (A),(B) and (C) computes 27 times. This means, all options
computes in parallel and one option will be matched with the (Di), and (Ai), (Bi) and (Ci) in (Column-1), (Column-2) and
(Column-3) represented decompressed data.
Initially, PSS algorithm starts with P=10 data from (Limited-Data(1…10.)) that used by the algorithm, these data are
estimates three columns (A, B and C), as mentioned in Fig. 6 (a). Thereafter, the algorithm starts searching for original data
(Ai, Bi and Ci) which is depends on compressed column (Di) and Key-values. The first iteration for the algorithm starts with
matching selected (Di) with 10 outputs from PSS-algorithm (i.e. P=10, three columns = P3= 1000 data). In another words,
Equation (4) executed 1000 times in parallel for finding original values for columns (A,B and C) as mentioned in Fig. 6 (b). If
result unmatched, in this case the second option will be taken form (Limited-Data(11…20.)) (i.e. selecting another 10 data from
Limited-Data transferred to Array1), while (Array2) and (Array3) are remains in same old options, if the processing still did not
find the result, in this case (Array2=Array1) (i.e. transferred data from Array1 to Array2), then new processing starts. This process will continue until finding all original columns (Ai, Bi and Ci) in AC-Matrix.
(a) copy P data from Limited-Data to temporary “Array1” for PSS-Algorithm
Fig. 5
Muslim Mohsin Khudhair, International Journal of Computer Science and Mobile Computing, Vol.5 Issue.9, September- 2016, pg. 93-102
In this paper, an efficient image encryption and compression system is designed using image transformation. An From the
experimental results it is evident that, the proposed system technique gives better performance compared to other traditional
systems techniques. In another meaning, the value of PSNR, CR are high and the value of MSE is low that means our technique
is effective. Also the results demonstrate that for test images, the loss of information is less hence the quality is better. In future,
the technique can be extended by applying different transforms on color image. High performance compression algorithms may
be developed and implemented using neural networks and soft computing.
REFERENCES
[1] H. Zhu, C. Zhao, and X. Zhang, "A Novel Image Encryption–Compression Scheme Using Hyper-Chaos and Chinese
Remainder Theorem," Signal Processing: Image Communication, vol. 28, Issue 6, pp. 2992–3006, July 2013.
[2] M. Johnson and D. Schonberg," On Compressing Encrypted Data," IEEE Transactions On Signal Processing, Vol. 52, No.
10, pp. 670–680, Oct. 2004.
[3] X. Zhang, " Lossy Compression and Iterative Reconstruction for Encrypted Image," IEEE Transactions On Information Forensics And Security, Vol. 6, No. 1, pp. 53–58, March 2011.
[4] R. C. Gonzalez and R.E. Woods, Digital Image processing, 3rd ed, Pearson Prentice Hall, 2008.
[5] W. Liu, L. Dong, and Q. Yao, "Efficient Compression of Encrypted Grayscale Images," IEEE Transactions On Image
Processing, Vol. 19, No. 4, pp. 1097–1102, April 2010.
[6] J. Zhou, and Y.Y. Tang, " Designing an Efficient Image Encryption-Then-Compression System via Prediction Error
Clustering and Random Permutation," IEEE Transactions On Informations Forensics And Security, Vol. 9, No. 1, pp. 39–
50, Jan. 2014.
[7] M. M. Khudhair, " An Efficient Image Encryption Technique by Using Cascaded Combined Permutation," International
Journal of Computer Science and Information Security (IJCSIS), Vol.14, No. 6, pp. 576-588, 2016.
[8] S. Li, C. Li, G. Chen, N. G. Bourbakis, and K. T. Lo, "A General Quantitative Cryptanalysis of Permutation-only
Multimedia Ciphers Against Plaintext Attacks," Signal Processing: Image Communication, Vol. 23, pp. 212–223, March
2008. [9] B. Wang, J. Ding, Q. Wen, X. Liao, and C. Liu, " An Image Watermarking Algorithm Based On DWT DCT and SVD,"
IEEE International Conference, Network Infrastructure and Digital Content, pp. 1034–1038, Dec. 2009.
[10] G. Chen, Y. Mao, and C. K. Chui, " A Symmetric Image Incryption Scheme Based on 3D Chaotic Cat Maps," Chaos,
Solitons and Fractals, Vol. 21, Issue 3, pp. 749–761, July 2004.
[11] K. S. Thyagarajan, Still Image and Video Compression with Matlab, John Wiley & Sons, Inc., Hoboken, New Jersey, 2011.
[12] M.C. Stamm and K. J. R. Liu, " Wavelet-Based Image Compression Anti-Forensics," In Proceedings of IEEE 17th
international conference on image processing, Hong Kong, pp. 1737–1740, Sep. 2010.
[13] M. Antonini, M. Barlaud, and I. Daubechies, "Image Coding Using Wavelet Transform," IEEE Transactions on Image
Processing, Vol. I , No. 2, pp. 205–220, April 1992.
[14] T. Acharya, and P. S. Tsai, JPEG2000 Standard for Image Compression: Concepts, Algorithms and VLSI Architecture,
New York, John Wiley & Sons, 2005. [15] K. R. Rao, and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, San Diego, Academic Press,
1990.
[16] D. Zhao, W. Gao, and Y. K. Chan, "Morphological Representation of DCT Coefficients for Image Compression," IEEE
Transactions on Circuits and Systems FOR Video Technology, Vol. 12, No. 9, pp. 819–823, Sep. 2002.
[17] F. Huang, J. Huang, and Y. Q. Shi, " Detecting Double JPEG Compression With the Same Quantization Matrix," IEEE
Transactions on Information Forensics and Security, Vol. 5, No. 4, pp. 848–856, Des. 2010.
[18] K. Sayood, Introduction to Data Compression, 4th ed, Academic Press, Morgan Kaufman Publishers, 2012.
[19] S. Singh, V. Kumar, and H. K. Verma, "DWT–DCT Hybrid Scheme for Medical Image Compression," Journal of Medical
Engineering & Technology, Vol. 31, No. 2, pp. 109–122, April 2007.
[20] M.M. Siddeq, and G. Al-Khafaji, " Applied Minimized Matrix Size Algorithm on the Transformed Images by DCT and
DWT used for Image Compression," International Journal of Computer Applications, Vol. 70, No.15, pp. 33–40, May
2013. [21] P. Y. Chen, and J. Y. Chang, " An Adaptive Quantization Scheme for 2-D DWT Coefficients," International Journal of
Applied Science and Engineering, Vol. 11, No.1, pp. 85–100, 2013.
[22] J. Singh, and P. Kaur, " Image Encryption and Compression System Using Haar, Daubechies and
Coiflet Wavelets," International Journal of Computer Science Engineering and Information Technology Research, Vol. 5,
Issue 5, pp. 17–26, Oct. 2015.
[23] Y. K. Chen, F. C. Cheng, and P. Tsai, "A Gray-Level Clustering Reduction Algorithm with the Least PSNR," Expert
Systems with Applications 38, pp. 10183–10187, 2011.
[24] A. Tanchenko, "Visual-PSNR Measure of Image Quality," Journal of Visual Communication and Image Representation,