JOURNAL OF LATEX CLASS FILES, VOL. 14, NO.
8, AUGUST 2023
A Comparative Study On Image Compression in
Cloud Computing
Tri Yulianto Nugroho¹, Ahmad Nur Hidayat¹, Mas Syahdan Filsafan¹, Yoehan Arif Ardiansyah¹, and Bagus Jati
Santoso¹
Department of Informatics, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia
email: 6025222015@mhs.its.ac.id, 6025222012@mhs.its.ac.id, 6025221054@mhs.its.ac.id,
60252210120@mhs.its.ac.id, bagus@if.its.ac.id
Abstract—The purpose of this study is to compare the use of
Discrete Cosine Transform (DCT), Discrete Wavelet Transform
(DWT), Singular Value Decomposition (SVD), and Karhumen-
Loeve Transform (KLT) as image compression techniques in
the Cloud computing. of the four methods we will compare
the amount of compression, the speed during the compression
process, and compare the image quality after compression. In
this study there are 6 examples of photos that will be used in
testing.
Index Terms—cloud computing, mage compression
I. I NTRODUCTION
With the increasing dependence of humans on technology
from day to day, the resulting digital information is also in-
creasing and can be accessed anywhere with any device. That
reliance can take many forms, from taking photos of beautiful
landscapes to collecting images for training in driverless car
systems and going beyond creating industrial and medical
images. This generated information whether acoustics, images,
etc. needs to be stored in a media file before being processed
or transmitted. These media files occupy space on the storage
device which can be accessed from anywhere. As the number
of files increases, we are forced to delete less important files
or buy more storage devices[1].
Initially, emphasis of research in image compression was
on the development of analog methods for reducing video
transmission bandwidth, however, with the advent of digital
computers and subsequent development of advanced integrated
circuits, attention shifted from analog compression to digital
approaches. With the development of practical application
based on several key international image compression stan-
dards, the field has experienced substantial growth. The main
purpose of image compression is to store or transmit images
in an efficient form. Compression is achieved by lessening
redundancies such as inter-pixel redundancy, psycho-visual
redundancy, and coding redundancy of the image data.[2]
We will try to use the Discrete Wavelet Transform (DWT)
for image compression. Discrete Wavelet Transform (DWT) is
a data compression technique based on signal processing. This
technique divides the signal into several levels and each level
will be compressed separately. DWT can be used to compress
various types of data, such as images and sound. One of the
J. Doe and J. Doe are with Anonymous University.
Manuscript received April 19, 2023; revised August 26, 2023.
1
advantages of DWT is its ability to reduce data redundancy
and maintain picture or sound quality with minimal loss
of information. DWT can also produce smaller file sizes
compared to other compression techniques, such as JPEG
or MP3. DWT can also be used with lossless compression
techniques.[3]
When it comes to using cloud computing, speeding up data
transfers is key to ensuring that users get optimal performance.
One way to speed up data transfer is through lossless com-
pression. Lossless compression is a compression technique in
which data can be compressed into a smaller size without
losing data quality.
Researchers will also try to use data compression using
Discrete Cosine Transform (DCT) which is one of the most
commonly used compression techniques. DCT quickly and
effectively generates frequency coefficients that efficiently
represent the original signal. In DCT, the original signal is
partitioned into small blocks and each block is converted
into a transformative signal. Each block is then represented
by a number of frequency coefficients sorted by frequency
magnitude.
In general, DCT is usually used in data compression appli-
cations to reduce the size of data files. Data compression using
the DCT algorithm is usually lossy because some unimportant
information in the data can be lost. Therefore, the quality of
data before and after compression can be different.
Researchers will also try several other data compression
methods such as Karhunen-Loéve Transform (KLT) and Sin-
gular Value Decomposition (SVD). Where these methods have
different image compression features and have their respective
advantages and disadvantages. KLT is the most efficient linear
transformation for energy compaction. The transformation
matrix can be obtained by calculating the eigenvectors of
the covariance of the input image data to reduce the high
computational complexity. While SVD is a linear algebraic
technique that is used to break the image into 2, namely the
orthogonal matrix and the diagonal matrix. Where SVD is
more suitable is used to narrow down the low rating estimates
on images.
In this study there are 6 examples of photos that will
be used in testing. The sample photos will be compressed
using the Discrete Cosine Transform (DCT), Discrete Wavelet
Transform (DWT), Singular Value Decomposition (SVD), and
Karhumen-Loeve Transform (KLT) as image compression
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2023
techniques in the Cloud. testing will focus on comparing the
amount of compression, speed during the compression process,
and comparison of image quality after compression.
II. E ASE OF U SE
Related Work
III. METHODOLOGY
In this study there are 6 examples of photos that will be
used in testing. we will compare the amount of compression,
the speed during the compression process, and compare the
image quality after compression. There are 4 methods that
will be used to make comparisons: Discrete Cosine Trans-
form (DCT), Discrete Wavelet Transform (DWT), Singular
Value Decomposition (SVD), and Karhumen-Loeve Transform
(KLT) as image compression techniques in Cloud Computing.
A. Discrete Cosine Transform
One of the most often used methods of data compression
is the discrete cosine transform (DCT). Frequency coefficients
produced by DCT efficiently and quickly represent the original
signals. The original signal is divided into smaller blocks for
DCT, and each block is transformed into a new signal. Follow-
ing that, each block is represented by a number of frequency
coefficients that are arranged according to the frequency’s
magnitude. The discrete cosine transform (DCT) converts a
signal from spatial representation to frequency domain by
taking advantage of cosine functions. The DCT summarizes
sinusoids of various sizes and frequencies to represent an
image. Most of the visually relevant information about an
image for a typical image is concentrated in just a few DCT
coefficients, according to the property of DCT.[4]
B. Discrete Wavelet Transform
Morlet and Grossman created the wavelet transform as an
alternative to older mathematical transformations to address
resolution issues in the 1980s. It is a mathematical function
to describe data or functions. Continuous Wavelet Transform
(CWT) and Discrete Wavelet Transform (DWT) are the two
series that make up this transformation. The discovery of meth-
ods for decoding discrete time signals in 1976 served as the
foundation for DWT [5]. The CWT analyzes signals using a
collection of fundamental functions coupled by straightforward
scaling and transitions. While in DWT, digital filterization
techniques are used to obtain the representation of the digital
signal time scale.
C. Singular Value Decomposition
SVD is a mathematical approach to dividing images matrix
into three elements, namely one sigular element and two
unary elements. A watermark is usually embedded in a single
element to provide resilience and imperceptibility. Of the three
matrices produced from the SVD process, one of them has a
single value from the original matrix. What what is meant by
a single value here is the distance between a matrix and single
matrix. These single values Later it will be useful for matrices
2
which are transformations of vector node to another vector
space or a different dimension.[6] SVD is a powerful and
useful tool for decomposition in linear algebra which functions
for image processing such as image encoding and image noise
removal. For example, metric A with m rows and n columns,
will produce orthogonal metrics Y (m x m) and V (n x n), so:
U = u1 u2 · · · um and V = v1 v2 · · · vn (1)
can be proven by :
T
U AV = diag (σ1 ,..., σp ) , p = min(m,n) (2)
where :
σ1 ≥ σ2 ,..., σp ≥ 0 (3)
ai is the singular value of A and the vector ui and vi is the i-
th left and i-right singular vectors single vector each.[7] SVD
contains intensity image information, modifying a single value
produces better image contrast.[8]
D. Karhumen-Loeve Transform
The Karhunen-Loéve transform(KLT) is linear orthogo-
nal transformations, which are applied to 3-D data sets for
decoration data on different bands. If the 3-D data set is
hyperspectral image, KLT will remove the correlation between
image bands, building a more compressible data set.[9] KLT
has shown a good performance in decorating lossless spectral
component.[10]
IV. EXPERIMENTAL SETUP
lingkungan uji coba
V. PERFORMANCE EVALUATION
VI. C ONCLUSION
R EFERENCES
[1] A. Rizki, N. Ismail, and R. Mardiati, “Integrasi kriptografi algoritma
mars dan steganografi metode least significant bit (lsb) dengan media file
berekstensi *.wav,” TELKA - Telekomunikasi, Elektronika, Komputasi
dan Kontrol, vol. 3, pp. 57–67, 05 2017.
[2] M. T. Banday and T. J. Shah, “A comparative study of image compres-
sion techniques,” no. October, 2013.
[3] K. H. Talukder and K. Harada, “Discrete wavelet transform for image
compression and a model of parallel image compression scheme for
formal verification.” in World Congress on Engineering. Citeseer, 2007,
pp. 531–535.
[4] M. Ahuja and S. Shantaiya, “A review on image compression using dct
and dwt,” International Journal for Scientific Research & Development,
vol. 3, no. 10, 2015.
[5] D. Sripathi, “Efficient implementations of discrete wavelet transforms
using fpgas,” 2003.
[6] A. A. Adli, Rosal and Eko, “Image watermarking using triple transform
(dct-dwt-svd) to improve copyright protection performance,” 2018 Inter-
national Seminar on Research of Information Technology and Intelligent
Systems (ISRITI), 2018.
[7] A. Touazi and M. Debyeche, “An svd-based scheme for mfcc com-
pression in distributed speech recognition system,” Automatic Speech
Recognition and Understanding Workshop. December, 2013.
[8] M. S. R. V.R.VijayKumar, A.Vidya, “Super resolution enhancement of
medical image using quaternion wavelet transform with svd,” 017 4th
International Conference on Signal Processing, Communications and
Networking (ICSCN -2017), March 16 – 18, 2017, Chennai, INDIA,
2017.
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2023 3

[9] C. Egho and T. Vladimirova, “Adaptive hyperspectral image com-

pression using the klt and integer klt algorithms,” 2014 NASA/ESA
Conference on Adaptive Hardware and Systems (AHS), 2014.
[10] N. R. M. Noor and T. Vladimirova, “Parallelised fault-tolerant integer
klt implementation for lossless hyperspectral image compression on
board satellites,” 2013 NASA/ESA Conference on Adaptive Hardware
and Systems (AHS-2013), 2013.