scholarly journals Secured Color Image Compression based on Compressive Sampling and Lü System

2020 ◽  
Vol 49 (3) ◽  
pp. 346-369
Author(s):  
Sundarakrishnan Sundarakrishnan ◽  
B.Jaison B.Jaison ◽  
S.P.Raja S.P.Raja

An efficacious and unharmed approach is vital for transmission of sensitive and secret images over unsecure public Internet. In this paper, secured color image compression method based on compressive sampling and Lü system is proposed. Initially, the plain-image is sparsely represented in transform basis. Compressive sampling measurements are obtained from these sparse transform coefficients by employing incoherent sensing matrix. To upgrade the security level, permutation-substitution operations are performed on pixels based on Lü system. To concoct input sensitivity in the scheme, the keys are obtained from input image. Lastly, fast and efficient greedy algorithm is utilized for sparse signal reconstruction. To evaluate the performance of the proposed scheme Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), Average Difference (AD), Structural Content (SC), Normalized Cross Correlation (NCC), Normalized Absolute Error (NAE), Edge Strength Similarity (ESSIM), Maximum Difference (MD), Correlation Coefficient, Unified Average Changing Intensity (UACI), Key Sensitivity, Number of pixel change Rate (NPCR), Key Space and Histogram metrics are used. Experimental results demonstrate that the proposed scheme produced highly satisfactory security.

Vestnik MEI ◽  
2021 ◽  
pp. 105-113
Author(s):  
Pavel A. Chernov

Seven console codecs BMF 2.01 (BMF.exe), WebP (cwebp.exe, dwebp.exe), PAQ8L (paq-8l_intel.exe), PAQ8P (paq8p_sse2.exe), JPEG-LS (jpeg.exe), JPEG2000 (convert.exe), PNG (opting.exe) are tested on a set of 19 grayscale images and 10 color images (widespread images used in testing compression methods). An image compression program tester was developed. The tester receives images and executable files of image compression programs, and programs are started for each input image to compress and restore the image. The program operation results are contained in an HTML/CSS file, which includes, among other information, the bitrates achieved by the compression programs and the results of checking how successfully the compressed files were restored. Partial clones of the Blend-A13+, Blend-16, Blend-20 compression methods have been made to compare the effectiveness of the multipredictors that lie at the heart of the Blend-A13+, Blend-16, Blend-20 methods. Partial clones of the Blend-A13+, Blend-16, Blend-20 compression methods consist of multipredictors used in the Blend-A13+, Blend-16, Blend-20, methods, and 13 and 16 elementary predictors used in the Blend-A13+ and Blend-16 methods, respectively. The predictor GAP+ is replaced by the predictor GAP; the modeling like JPEG-LS is replaced by contextual modeling with quantization of a context from differences of pixels from the vicinity of the coded pixel, the arithmetic coder, and the reversible intercolor RGB-YUV transformation from JPEG2000. For many images, the obtained partial clones outperformed the results yielded by the JPEG-LS, JPEG2000, PNG methods and gave results at the level provided by the PAQ8L and WebP compression methods. In general, the BMF2.01 method demonstrated the best results on the test set of images. On the test set of images, the multipredictors from Blend-16 and Blend-20 unexpectedly provided color image compression results poorer than the multipredictor from the Blend-A13+ method. In compressing grayscale images, the multipredictor from Blend-20 yielded better results than the multipredictors from Blend-16, Blend-A13+.


Author(s):  
K. Sundara Krishnan ◽  
B. Jaison ◽  
S. P. Raja

In this paper, an efficient novel dual permutation–substitution structure-based color image encryption algorithm is proposed. Initially, the Secure Hash Algorithm-512 (SHA-512) is applied to the input image to generate the initial values for the Lü system dynamically. In the first stage of permutation, inter-color-component pixel shuffling is carried out with a circular pixel-swapping mechanism. In the second stage, intra-color-component pixel shuffling is executed, based on pseudorandom positions generated by the Lü chaotic system. Pixel values are changed in the substitution stage, based on float-valued chaotic sequences generated by the Lü system. The performance of the proposed algorithm is evaluated with metrics such as key space, key sensitivity, histograms, correlation coefficients (vertical, horizontal and diagonal), information entropy, number of pixel changes rate (NPCR), unified average changing intensity (UACI), peak signal-to-noise ratio (PSNR), mean absolute error (MAE), contrast analysis, encryption time and the National Institute of Standards and Technology Special Publication 800-22 (NIST SP 800-22) statistical test. The experimental results obtained and performance assessment show that the proposed scheme has produced good results.


Sign in / Sign up

Export Citation Format

Share Document