An Unsupervised Learning Approach for Visual
Data Compression with Chaotic Encryption
2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT) | 978-1-6654-1480-7/21/$31.00 ©2021 IEEE | DOI: 10.1109/ICECCT52121.2021.9616827
Bharti Ahuja
Department of IT
National Institute of Technology Raipur
Raipur, India
bharti.salunke99@gmail.com
Abstract—The increased demand of multimedia leads to
shortage of network bandwidth and memory capacity. As a
result, image compression is more significant for decreasing
data redundancy, saving storage space and bandwidth. Along
with the compression the next major challenge in this field is to
safeguard the compressed data further from the spy which are
commonly known as hackers. It is evident that the major
increments in the fields like communication, wireless sensor
network, data science, cloud computing and machine learning
not only eases the operations of the related field but also
increases the challenges as well. This paper proposes a worthy
composition for image compression encryption based on
unsupervised learning i.e. k-means clustering for compression
with logistic chaotic map for encryption. The main advantage
of the above combination is to address the problem of data
storage and the security of the visual data as well. The
algorithm reduces the size of the input image and also gives the
larger key space for encryption. The validity of the algorithm is
testified with the PSNR, MSE, SSIM and Correlation
coefficient.
Keywords—Compression, Encryption, Chaotic
Clustering, Data security.
I. INTRODUCTION
Since an image carries a huge set of information as
compared to almost all data types hence the strongest popular
medium of communication at this time. The today’s modern
era of social networking, advancements in satellite,
communication, cloud storage and advanced high class
algorithms like machine learning and deep learning are
working like catalyst in the widespread use of visual data
communication. Because images are frequently transmitted
across an insecure channel like the internet, protecting
images against cyber-attacks is a critical issue in a wide
range of applications including medical services like
telemedicine, smart devices like electric vehicles, navigation
and the defense.
Image encryption is a useful technique for converting
visual data into a form that is hard for humans to
comprehend. Secure form of communication for images is
always provided by the variety of research in the field of
cryptography. Different approaches for image cryptography
have recently been suggested, including optical image
encryption [1], DNA coding [2], Compressive sensing [3],
and Chaos.
Due to the extreme sensitivity of chaotic maps to their
originating states, a number of cryptographic algorithms
dependent on chaos theory have been proposed [4]. As a
result, in the encryption algorithm, their originating
circumstances are being used as a key. Large volumes of
Authorized licensed use limited to: National Institute of Technology. Downloaded on December 03,2021 at 17:52:38 UTC from IEEE Xplore. Restrictions apply.
Rajesh Doriya
Department of IT
National Institute of Technology Raipur
Raipur, India
rajeshdoriya.it@nitrr.ac.in
information in the form of visuals exist on the World Wide
Web.
Every day, billions of photos are uploaded to social
media like instagram, Twitter, Linkedin and Facebook, as
well as cloud storage systems like Google Drive and
Dropbox. Image compression technologies are required to
reduce the image size and save storage space when dealing
with such vast amounts of information. Due to restricted
bandwidth and spying, the image of interest should be
protected and compressed too while sending through a
channel [5].
Image compression process is eliminating unnecessary
and repeated data from a digital image in order to reduce the
data needed to represent it. It entails downsizing image while
maintaining all of the relevant information which can appeals
the human visual system.
Discrete wavelet transform, Discrete cosine transform,
SPHIT, JPEG, K-Means clustering, and Fuzzy Compression
map, [6] are few of the majorly used image compression
algorithms previously. Some hybrid combinations such as
PCA with K means clustering were also employed in the
past. It operates with the goal of reducing unnecessary data
by applying dimension reduction and color quantization [7].
Pixels are the units of measurement for the intensity of a
picture. Each pixel in a colorful image is made up of three
bytes, each of which contains RGB (Red-Blue-Green) data
with Red, Blue, and Green intensities.
In the proposed work, k mean clustering is used with the
logistic chaotic map for compression and encryption
respectively. The objective here is to provide the security
with the compression.
The said combination has the following two advantages:
• The K means clustering effectively reduce the size
of an image up to the adequate level of human
visual system.
• The Logistic chaotic map provides the good level of
encryption with larger key space.
The following is a breakdown of the remaining article:
The early notions are the topic of Section II. The III section
displays proposed technique, while section IV exhibits the
effectiveness of the scheme through computer simulations.
Finally, in part V, a conclusion is reached.
II. PREREQUISITES
A. K-Means Clustering
For resolving the clustering difficulty, K-Means has been
one of the easiest unsupervised learning method. It also finds
application in image compression. K-Means employs lossy
compression rather than lossless compression, therefore the
original picture cannot be recovered again from compressed
image. The disparity between the compressed picture and the
original image grows as the compression ratio increases.
It is a clustering method based on centroid values. The
method divides the data into k distinct clusters as shown in
fig. 1. The centroid point represents each cluster in the K-
Means clustering technique. It divides data sets into k
clusters Si(0,1,2,....k), each of which has a centroid (cluster
center) Ci [8]. The K-means clustering technique for picture
compression works on the following principle:
 The value of k (Number of chosen clusters) is
critical in the sense that k must be smaller than the
number of picture pixels N.
 By using pixel of the picture as a data set, the
centroid is calculated using the K-means method to
get the centroid µ.
 Every pixel's centroid and index of the centroid are
stored, eliminating the need to preserve all of the
source data.
Fig. 1. Data map before and after clustering.
The algorithm will group similar colors together in ‘k'
clusters (say ‘k' = 64) in an image compression problem. As
a result, the centroid of every cluster represents the 3
dimensional color vectors (RGB) that fall within that cluster.
Such ‘k' centroids will substitute all of the color vectors in
respective clusters, resulting in only ‘k' color combinations
being used across the image. As a result, we just need to
preserve the label of each pixel in the image that indicates
which cluster that pixel belongs to. We also maintain the
codebook for the ‘k' centroids, that are the only colors visible
in the compressed image [9].
B. Logistic Map
For its basic but unpredictable nature, the logistic map
becomes one of the most widely utilized chaotic maps in
image encryption.
Mathematically it is represented as:
Authorized licensed use limited to: National Institute of Technology. Downloaded on December 03,2021 at 17:52:38 UTC from IEEE Xplore. Restrictions apply.
 y n1  u  yn  (1  y n ) 
Two arguments are used in the above technique to
generate random sequencing. As a result, this technique
exhibits disordered conduct, often referred as chaotic
behavior. Fig. 2 depicts a schematic approach of illustrating
this process, in which the bifurcation diagram provides
information on machine dynamics. Fig. 2 shows a bifurcation
diagram where value begins at u = 3.75 and ends at u = 4.
For y1, y2, y3.....yn , it obtains values between 0 and 1 [10].
Fig. 2. Bifurcation diagram of Logistic Map.
III. SUGGESTED ALGORITHM
Following are the key steps of the proposed compression
encryption algorithm which is shown in fig.3
 Reshaping Image: It reduces all pixel values to a
single size dimension (mxn), with each pixel having
three dimensions to represent RGB values. Here m
and n representing row and column respectively.
 Clustering: Apply K means clustering to obtain the
k-centroid which gives information about its
neighboring color set.
 Substituting every pixel with its centroid: The
centroid now indicate all color combination of
(mxn) number of pixels. Every pixel's value should
be replaced with its centroid.
 Reshaping Compressed Image: Reshaping the
compressed image. [(mxn, 3) dimension to actual
(m, n, 3) dimension]
 Get Compressed Image: Show the compressed
image and save it to storage.
 Logistic Chaotic Map applied: On application of
chaotic map, the compressed image is encrypted
with the advantage of large key space.
 Output Compressed Encrypted Image: Display the
compressed encrypted image.
 Fig. 3. Flow diagram of the proposed compression encryption algorithm.

(Software Version: MATLAB 2016a) Fig. 4 and 5

IV. RESULT describes the computational outcomes after MATLAB
This segment contains two colored images (Pepper and simulation.
Aeroplane) for testing purpose with a resolution of 512×512.

Fig. 4. Simulation results for Pepper image.

Fig. 5. Simulation results for Aeroplane image.

TABLE I. PERFORMANCE ASSESSMENT OF THE IMAGES FOR THE

The performance assessment of the proposed algorithm is PROPOSED SCHEME
evaluated like PSNR (Peak signal to noise ratio), MSE
(Mean square error), SSIM (Structural similarity index) and Performance assessment
Images
Correlation coefficient. Table 1 describes the PSNR, MSE PSNR MSE SSIM
and SSIM values of the images for the proposed scheme. Pepper 31.0386 7.8731e-04 0.9797
Graphical representation of Correlation coefficient for
Aeroplane 33.2496 4.7320e-04 0.9754
original and compressed encrypted Pepper image is shown in
fig. 6.

Authorized licensed use limited to: National Institute of Technology. Downloaded on December 03,2021 at 17:52:38 UTC from IEEE Xplore. Restrictions apply.
 Fig. 6. Correlation coefficient for original and compressed encrypted Pepper image.
V. CONCLUSION
The suggested technique employs K means clustering
and the logistic chaotic map. The goal is to ensure security
while compressing an image data. The following are the
advantages of the aforementioned combined effect: K means
clustering is easier to implement, can scales huge set of data,
efficiently reduces the size of an image to a level that the
human visual system can sustain and the most importantly
guarantees convergence. With a larger key space, the
Logistic Chaotic Map offers a decent level of security with
adequate Peak Signal to Noise Ratio and shows the lowest
level of Structural Similarity Index for encrypted image.
REFERENCES
[1] M. A. B. Farah, R. Guesmi, A. Kachouri, and M. Samet, “A novel
chaos based optical image encryption using fractional Fourier
transform and DNA sequence operation,” Opt. Laser Technol., vol.
121, 2020, doi: 10.1016/j.optlastec.2019.105777.
[2] X. Chai, X. Fu, Z. Gan, Y. Lu, and Y. Chen, “A color image
cryptosystem based on dynamic DNA encryption and chaos,” Signal
Processing, vol. 155, 2019, doi: 10.1016/j.sigpro.2018.09.029.
[3] Y. Dou and M. Li, “An Image Encryption Algorithm Based on
Compressive Sensing and M Sequence,” IEEE Access, 2020, doi:
10.1109/ACCESS.2020.3043240.
Authorized licensed use limited to: National Institute of Technology. Downloaded on December 03,2021 at 17:52:38 UTC from IEEE Xplore. Restrictions apply.
[4] S. Salunke, M. Venkatadri, M. Farukh Hashmi, and B. Ahuja, “Novel
beta function-based image encryption with fractional sine transform,”
Mater. Today Proc., 2021, doi: 10.1016/j.matpr.2021.05.278.
[5] A. Ghaffari, “Image compression-encryption method based on two-
dimensional sparse recovery and chaotic system,” Sci. Rep., vol. 11,
no. 1, 2021, doi: 10.1038/s41598-020-79747-4.
[6] A. Singh and K. G. Kirar, “Review of image compression
techniques,” in International Conference on Recent Innovations in
Signal Processing and Embedded Systems, RISE 2017, 2018, vol.
2018-January, doi: 10.1109/RISE.2017.8378148.
[7] R. Rayan, M. S. Hossain, and Asaduzzaman, “Compression of Large-
Scale Image Dataset using Principal Component Analysis and K-
means Clustering,” in 2nd International Conference on Electrical,
Computer and Communication Engineering, ECCE 2019, 2019, doi:
10.1109/ECACE.2019.8679270.
[8] Z. Sun and Y. Wun, “Multispectral image compression based on
fractal and K-Means clustering,” in 2009 1st International Conference
on Information Science and Engineering, ICISE 2009, 2009, doi:
10.1109/ICISE.2009.772.
[9] X. Wan, “Application of K-means Algorithm in Image Compression,”
in IOP Conference Series: Materials Science and Engineering, 2019,
vol. 563, no. 5, doi: 10.1088/1757-899X/563/5/052042.
[10] S. Salunke, M. Venkatadri, M. F. Hashmi, and B. Ahuja, “Image Data
Preservation with Fractional Sine Transform and Dual Chaotic
Sequence,” in Advances in Intelligent Systems and Computing, 2021,
vol.1299.