2022 Fourth International Conference on Emerging Research in Electronics, Computer Science and Technology (ICERECT)
An Analysis on Techniques of Image Compression
Lossy And Lossless
2022 Fourth International Conference on Emerging Research in Electronics, Computer Science and Technology (ICERECT) | 978-1-6654-5635-7/22/$31.00 ©2022 IEEE | DOI: 10.1109/ICERECT56837.2022.10060123
1st Janarthanan S
Department of Computer Science and Engineering
Galgotias University
Greater Noida, India
janarthanan@galgotiasuniversity.edu.in
Abstract—Image compression is a kind of information
compression that encodes genuine images with few pieces. Image
compression is utilized to lessen repetitive and unessential image
information so it tends to be recorded or sent in a proficient way.
Thus, image compression abbreviates network transmission
times and velocities up information move. No information is lost
during the compression interaction while involving the lossless
procedure for packing images. Different picture compression
techniques are applied to these sorts of issues. Questions like
"how to achieve image compression" and "what sorts of
innovation are utilized" may now come up. Therefore, two
unique sorts of approaches — lossless and lossy image
compression draws near — are habitually portrayed. These
strategies require next to no memory and are easy to apply. The
Huffman encoding techniques have likewise been utilized in a
calculation that packs images and afterward de-pressurizes
them.
Keywords—Compression Techniques, Image, Lossles, Lossy.
I. INTRODUCTION
Image compression is a kind of information/image
compression application in which the principal image is
encoded utilizing a limited number of pieces. The essential
objective of picture compression is to diminish the importance
and overt repetitiveness of image information so it very well
might be saved or communicated in a superior configuration
[1] – [5].
Image compression is the most common way of
diminishing the size of an image's information while keeping
the vital data. The primary objective of image compression is
to show an image in few pieces while keeping up with the
fundamental data inside the actual image. Techniques for
compacting huge information documents, for example, image
records, are being grown rapidly. (1) Because of the speedy
improvement of innovation, it is important to deal with a
tremendous measure of image information to store those
photographs appropriately. Utilizing effective methods
ordinarily prompts the compression of images.
There are a few calculations that are utilized to do these
types of compression in various ways, for example, lossless
and lossy. The grayscale image that should be compacted has
pixel esteems that reach from 0 to 255.
Compression is utilized to diminish how much
information expected to show the substance of an image,
document, or video without altogether bringing down the
nature of the real material. Furthermore, it lessens how much
pieces expected to keep and send advanced documents.
Packing something truly intends that there is an information
part whose size must be decreased. JPEG is the best choice for
digitized images for this situation. An especially well known
technique for compression is the Joint Visual Master
978-1-6654-5635-7/22/$31.00 ©2022 IEEE
Authorized licensed use limited to: Sardar Patel Institute of Technology. Downloaded on November 22,2023 at 17:52:26 UTC from IEEE Xplore. Restrictions apply.
2nd Urmimala Naha
Department of Engineering & Technology
Jaipur National University
Jaipur, India
urmi.naha@jnujaipur.ac.in
Gathering (JPEG) framework, which relies upon the Discrete
Cosine Change (DCT).
A. Image
Basically, an image is a 2-D information that has been
modified by the human visual framework. Commonly, simple
signs are utilized to address images. Nonetheless, they are
changed from simple to advanced structure for handling,
putting away, and transmission by PC applications. Generally,
a computerized image is a two-layered exhibit of pixels [6],
[7].
Especially in remote detecting, biomedical, and video
conferencing applications, images make up an enormous piece
of the information. As our dependence on and utilization of
PCs and data keeps on expanding, so does our requirement for
powerful method for putting away and conveying tremendous
volumes of information.
B. Image Compression
The issue of bringing down how much information
expected to address a computerized image is managed through
image compression. It is a technique intended to deliver a
minimal portrayal of an image, diminishing the requirement
for image capacity and transmission. The evacuation of at
least one of the three basic information redundancies brings
about compression:
• Redundant Coding
• Redundancy between pixels
• Psycho visual Repetition
When inferior code words are utilized, there is coding
overt repetitiveness. Connections between an image's pixels
lead to inter pixel overt repetitiveness. Information that the
human visual framework overlooks causes psycho visual
overt repetitiveness (for example outwardly unimportant
data). By using these redundancies, image compression
calculations bring down the quantity of pieces expected to
address an image. To make the reproduced image, the packed
information is exposed to a converse method named
decompression (disentangling). The objective of compression
is to limit the quantity of pieces while keeping an image's goal
and visual quality that is as near the first as is useful. Encoders
and decoders are the two unmistakable primary structure
components that make up image compression frameworks.
C. Image Compression Techniques
Depending on whether or not the compressed image can
be used to reconstruct the original image exactly, two
categories of image compression techniques can be broadly
distinguished. Which are:
 • The lossless method
• Lossy methods
D. Lossless compression technique
The first image can be impeccably recuperated from the
packed (encoded) image utilizing lossless compression
techniques. Since they don't acquaint commotion with the
sign, these are additionally alluded to as quiet.
Since it utilizes insights/decay techniques to diminish/take
out overt repetitiveness, it is additionally alluded to as entropy
coding. Just few requesting applications, similar to clinical
imaging, utilize lossless compression.
Lossless compression includes the following methods:
• Run length encoding is first.
• Huffman coding 2.
• LZW coding 3.
• Four. Area coding
E. Lossy compression technique
Relatively talking, lossy techniques offer considerably
higher compression proportions. Since the nature of the
recreated images is adequate for most of utilizations, lossy
techniques are every now and again utilized. As indicated by
this arrangement, the de-pressurized image isn't the very same
as the first image, yet all at once it's somewhat close.
Fig. 1. Outline of lossy image compression
Fig. 1 shows that the layout of lossy compression
calculations, which is introduced previously. This course of
expectation, change, and decay is very much reversible. Data
is lost because of quantization. In any case, the entropy coding
that follows the quantization cycle is lossless. The method
involved with interpreting is turned around. To get the
quantized information, entropy interpreting is first applied to
compacted information. It is then exposed to de-quantization,
trailed by the converse change, to give the reconstructed
image.
II. RELATED WORK
Shruthi K N, Shashank 2016Makers is a point by point
assessment of many changes, including discrete cosine
change, solitary worth decay, discrete hadamard change,
incline change, and discrete har change, which are connected
with an assortment of considered biomedical images to
accomplish picture pressure. The activities on images are
completed in change space, where the DC coefficients are put
away. The truncation activity is done by laying out an
examination breaking point to accomplish the ideal PSNR to
keep up with the proliferation's tendency. In this review, all
Authorized licensed use limited to: Sardar Patel Institute of Technology. Downloaded on November 22,2023 at 17:52:26 UTC from IEEE Xplore. Restrictions apply.
tension plans are applied to the organic images by setting the
PSNR to 25dB and 30dB [8].
Seyun Kim 2014This study presents a clever setting
versatile number juggling coding and various leveled
expectation based lossless variety image compression method.
A RGB image is first de-correlated utilizing a reversible tone
change for lossless compression, and afterward the Y part is
encoded utilizing a regular lossless grayscale image
compression strategy. We make a various leveled method to
encode the chrominance images that empowers the utilization
of upper, left, and lower pixels for pixel expectation, rather
than the upper and left pixels utilized by customary raster
examine expectation calculations.
V. Sunil 2012In this review, the creator talks about how
wavelet changes are utilized to pack images. The subtleties are
furnished by specialists who are worried about a specific sort
of strain strategy that utilizes wavelet changes. A progression
of basic models and coefficients that, when imitated and
added, rehash the first model is the means by which wavelets
address a flighty model. Plans for data strain can be separated
into lossless tension and lossy tension. Lossy tension, as a rule,
brings about significantly higher strain than lossless strain. A
group of capacities known as wavelets is used to scale and
spatially limit a given banner [9].
Image pressure alludes to shortening a portrayal record's
length without undermining its quality. There are two
frameworks for pressure, contingent upon whether the
recreated image is the very same as the first or whether some
obscure sad occasion might have happened. Lossy techniques
and lossless frameworks are the two systems. Because of the
way that DWT and DCT are lossy calculations, this study
utilizes them. Improved results for PSNR have been acquired
in this paper's strain concentrate on utilizing DCT and Wavelet
change by picking legitimate system V. Sunil 2014have
checked on cutting edge techniques for lossless image
compression. These techniques were assessed tentatively
utilizing a set-up of 45 image that rehashed a few application
spaces. Among these techniques, the analysts considered, the
best compression proportions were accomplished by CALIC.
Arup Kumar 2013examines the performance of a set of
lossless data compression algorithm, on different form of text
data. A set of selected algorithms are implemented to evaluate
the performance in compressing text data. A set of defined text
file are used as test bed. The performance of different
algorithms is measured on the basis of different parameter and
tabulated in this article. The article is concluded by a
comparison of these algorithms from different aspects. Next
investigated lossless information compression systems and
analyzes their presentation. The boosts have figure out that
math encoding system is exceptionally strong over Huffman
encoding strategy. In correlation they came to realize that
compression proportion of math encoding is better Also,
besides math encoding decreases channel data transfer
capacity and transmission time [10], [11], [12], [13], [14], [15]
III. METHODOLOGY
The Run Length Encoding Calculation, Huffman
Encoding Calculation, and Delta Encoding were built and
tried with different images to assess the exhibition of the
previously mentioned compression techniques. The
compression proportion and compression time were processed
to survey the calculation's presentation. The size of the source
image and the plan of a few image sorts (Double image, Dim
level image, and RGB image) with different expansions (.png
and.jpg expansions) decide how well the calculations perform.
To show the relationship between the size of the packed
photographs and the compression time, an outline is made.
The ideal calculation is one that offers a decent saving rate
while requiring minimal measure of compression time.
IV. EXPERIMENT STEP
Set up the test bed by displaying Appendix A. Use the
Java-developed programme to evaluate the algorithms
displayed in Fig. 2 by running it.
Fig. 2. Screenshot from used software
A. Measurement Parameters
The assessment limit can change contingent upon how the
compacted report is utilized. The two most significant
elements for an interesting presence and viability. (9)
Estimation of tension Execution of the strain computation
regularly relies upon the source information's outright
redundancy. Thusly, we utilized a similar test records for
every one of the estimations to sum up the test stage coming
up next were the limits:
1) Tension Extent: The proportion of the main record to
the compacted record using (1)
/ is typically stated as the ratio between the greatest and
= (1)
The proportion between the first and packed documents is
known as the compression factor. Basically, this is something
contrary to compression proportion using (2) and (3).
"
! =
# between the estimator and the estimated value is measured by
! =
$
2) Saving Percentage: The proportion of the file's size
reduction following compression using (4)
% & & =
' "
% (4)
" =;
3) Compression Time: The amount of time, measured in
milliseconds that the algorithm needs to compress the file.
B. Quality Measures
Quality metrics can be divided into two categories:
subjective measures and objective measures. The quality
indicators that are focused on human viewers fall under
subjective evaluations. In this scenario, human visual
interpretation is crucial for assessing the image's quality.
The category of objective measures includes those
performance indicators for quality that are solely
computational in nature. It is impossible to justify using a
certain technique to create an image of higher quality. Setting
Authorized licensed use limited to: Sardar Patel Institute of Technology. Downloaded on November 22,2023 at 17:52:26 UTC from IEEE Xplore. Restrictions apply.
up quantifiable methods to assess the impact of image
enhancement algorithms on image quality is therefore
necessary. To determine which image enhancement method
delivers the best results, different algorithms can be compared
using the same collection of test photos. The following
parameters were used to examine and evaluate the various
compression algorithms currently in use:
1) Compression Ratio (CR): By comparing the size of the
compressed image to the original image, the compression
ratio can be used to gauge how well data can be compressed
using (5). The compressed image size decreases as the
compression ratio rises.
* ( ,-)
)= (5)
( ,-)
2) Mean Opinion Score (MOS): By observing them after
being exposed to the group and the type of examination they
underwent, a big number of people can rate the quality of a
compressed image can be derived using (6). The possible
ratings are: (1) bad, (2) poor, (3) fair, (4) good, and (5)
excellent. A mean opinion score is the sum of the scores
(MOS)
/ = ∑12# , ( ) (6)
3) Computational Complexity (CC): In computer science,
computational complexity is the study of how algorithms are
designed and how they work together with computability
theory. It attempts to categorise issues that can or cannot be
resolved with roughly constrained resources.
4) Peak Signal to Noise Ratio (PSNR): The quality of the
image is hampered by the relationship between the maximum
power of a signal and the power of distorted noise. The PSNR
smallest possible values of a variable, using the logarithmic
decibel scale given in (7).
A lower PSNR value indicates a worse-quality image.
;
345) = 208 &#9 : ? @A (7)
<= >
(2)
5) Mean Square Error (MSE): The average difference
(3) MSE using (8). Due to the assumption that all outcomes are
equally likely or because the estimate did not take into
account information that could have led to a more accurate
conclusion, the difference is apparent. A higher MSE value
indicates a lower-quality image.
#
/4B = ∑=2# ∑;-2#(C( , D) − C( , D))
F
(8)
6) Structural Content (SC): It determines how closely
two signals' structures resemble one another or how closely
they share certain characteristic. This measurement provides
a thorough analysis of the relative importance of an original
signal and a compressed signal using (9). It is a global metric
because there are no localised distortions on that basis. A
higher SC score indicates a lower-quality image.
∑K ∑H ( ( ,-)G
4 = ∑LJ*
K ∑H
IJ*
G (9)
LJ* IJ*( ( ,-)
The decompressed picture difference from the original
image is calculated using the Normalized Absolute Error
(NAE), with a value of zero perfectly fitting using (10). A /N = max(|C( , D) − C( , D)|) (12)
higher NAE value indicates a lower-quality image.
The aforementioned factors were selected to show which
∑K H
LJ* ∑IJ*( ( -)' ( ,-)
5MB = ∑K H (10) compression approach will be more effective and shown to be
LJ* ∑IJ*( ( -)) the best among several other strategies in a specific situation.
If we carefully examine the aforementioned parameters after
The average of the difference between the original and computation for various techniques, keeping in mind the
compressed image pixels is known as the average difference compressed image's end application area, it will give us a hint
(AD) using (11). It is used to determine how clean an image as to which technique can be regarded as the best technique.
is because the cleaner the image is, the less noise there will be
in the final product. V. RESULTS AND DISCUSSION
A larger value of AD indicates a lower-quality image. Tables I, and II presentation the result of applying the three
#
calculations (RLE, delta, and Huffman) to the seven test
MN = ∑=2# ∑;
-2#(C( , D) − C( , D) (11) images. The tables show the compacted image size in pixels,
=;
compression proportion, saving rate, and compression time in
7) Maximum Difference (MD): For all examined ms, which is in Fig. 3 and Fig. 4.
compression methods, it has a good relationship with MOS. A. Results:
It is a metric for comparing the quality of compressed images
1) RLE Algorithm
across various compression schemes using (12).
A higher value of MD indicates a lower-quality image.

TABLE. I. RLE ALGORITHM RESULTS

Image Type original compressed image compression ratio compression factor saving percentage compression
image size time"ms
"pixels" size "pixels
Binary 7120 590 0.09 20.36 96% 1.3
8663 6395 1.23 21.56 99% 2.36
8965 7456 1.36 28.63 79% 3.25
Grey level 8999 7896 2.14 32.32 77% 3.85
9123 8563 2.96 41.32 120% 4.23
RGB 9185 8948 3.2 45.88 452% 4.85
9963 9452 3.62 50.23 510% 5.63

VI. DISCUSSION

A. Compression ratio comparison:

TABLE. II. COMPRESSION RATIO COMPARISONS

Image RTE Delta Huffman
No. compression compression compression
Ratio Ratio Ratio
1 0.09 0.06 0.10
2 0.15 0.09 0.25
3 1.80 0.85 0.36
4 1.96 0.96 0.41
5 2.03 0.99 0.52
6 2.12 0.98 0.63
7 3.56 0.55 0.75
Fig. 3. RLE algorithm result

Fig. 4. Delta encoding results

Fig. 5. Compression ratio comparison chart

Authorized licensed use limited to: Sardar Patel Institute of Technology. Downloaded on November 22,2023 at 17:52:26 UTC from IEEE Xplore. Restrictions apply.
 We can deduct from the examination of compression TRANSACTIONS ON IMAGE PROCESSING, VOL. 23, NO. 1,
proportions. Table II and Fig. 5 that the Delta encoding is the JANUARY 2018. Pp 445-449
best calculation for a wide range of images (Double, Dim, and [8] V. Sunil Kumar and M. Indra Sena Reddy “Image Compression
Techniques by using Wavelet Transform”, Journal of Information
RGB images), which is reliable with the discoveries in for dim Engineering and Applications, 2020, Pp 35-40.
level images. [9] Arup Kumar Bhattacharjee, TanumonBej, and Saheb Agarwal,
“Comparison Study of Lossless Data Compression Algorithms for Text
VII. CONCLUSION Data \n,” IOSR J. Comput. Eng., vol. 11, no. 6, pp. 15–19, 2019.
Here is a clarification of an original strategy for picture [10] AzamKarami, MehranYazdiand Grégoire Mercier “Compression of
compression that consolidates the Huffman encoder and Hyperspectral Images Using Discerete Wavelet Transform and Tucker
Wavelet-based Image Coding. Decomposition”, IEEE, 2020, Pp 444-450.
[11] B. C. Vemuri, S. Sahni, F. Chen, C. Kapoor, C. Leonard, and J.
Productively used, which brought about a more prominent Fitzsimmons, “Losseless image compression,” Igarss 2018, vol. 45, no.
compression proportion and better PSNR? This work likewise 1, pp. 1–5, 2014.
helps programming engineers in making new compacted [12] F. Semiconductor, “Using the Run Length Encoding Features on the
programming for the utilization of the Huffman encoding MPC5645S,” pp. 1–8, 2017
calculation to pack any image as a lossless real image. At the [13] FouziDouak, RedhaBenzid and Nabil Benoudjit “Color image
compression algorithm based on the DCT transform combined to an
point when one can make their own structure for packing any adaptive block scanning”, Elsevier, 2019, Pp 16-26.
image with minimal measure of trouble concerning existence. [14] Krishan Gupta, Dr Mukesh Sharma, Neha Baweja “THREE
B Information compression is utilized on advanced DIFFERENT KG VERSION FOR IMAGE COMPRESSION” 2020.
photographs during the time spent image compression. To Pp 831-837
store or communicate information successfully, the objective [15] M. Dipperstein, “Adaptive Delta Coding Discussion and
is to, basically, wipe out the overt repetitiveness of the visual Implementation.” [Online]. Available:
information. Lossy or lossless image compression is http://michael.dipperstein.com/delta/index.html.
conceivable. The kinds of images canvassed in this work
incorporate a few standard images, computerized images, bio-
clinical images, and so on for the image
formats.png,.jpeg,.bmp, and so on. We give the broad writing
audit on the ongoing image compression draws near.
Following a survey of the writing, we recognized various
issues and challenges with image compression draws near,
including the image's PSNR esteem, compression proportion,
processed time, and others.
VIII. FUTURE SCOPE
Carefully put away, handled, and sent huge measures of
information consistently. DCT and DWT are two techniques
utilized in this course of image compression. Inside the
compression framework, two different encoding frameworks
— prescient coding and change coding — are being used.
Later on, we will pack the image utilizing different techniques
and increment the PSNR, compression proportion, and
different measurements. Moreover, utilize some image
compression streamlining techniques to pack the image.
REFERENCES
[1] M. Grossberg, I. Gladkova, S. Gottipati, M. Rabinowitz, P. Alabi, T.
George, and A. Pacheco, “A comparative study of lossless compression
algorithms on multi-spectral imager data,” Proc. -2019 Data
Compression Conf. DCC 2009, 2019.
[2] MFerniUkrit, G.R.Suresh “Effective Lossless Compressionjor Medical
Image Sequences Using Composite Algorithm” 2018 International
Conference on Circuits, Power and Computing Technologies. Pp 1122-
1126.
[3] NavpreetSaroya and Prabhpreet Kaur “Analysis of IMAGE
COMPRESSION Algorithm Using DCT and DWT Transforms”,
International Journal of Advanced Research in Computer Science and
Software Engineering, 2019 Pp 897-900.
[4] P. O. F. T. H. E. I. R. E, “A Method for the Construction of Minimum-
Redundancy Codes *.”
[5] S. Porwal, Y. Chaudhary, J. Joshi, and M. Jain, “Data Compression
Methodologies for Lossless Data and Comparison between
Algorithms,” vol. 2, no. 2, pp. 142–147, 2019.
[6] S.M.Ramesh and Dr.A.Shanmugam “Medical Image Compression
using WaveletDecomposition for Prediction Method”, IJCSIS, 2010,
Pp 262-265.
[7] Seyun Kim, Nam Ik Cho “Hierarchical Prediction and Context
Adaptive Coding for Lossless Color Image Compression” I EEE

Authorized licensed use limited to: Sardar Patel Institute of Technology. Downloaded on November 22,2023 at 17:52:26 UTC from IEEE Xplore. Restrictions apply.