Xavier Institute of Engineering

A
MINI PROJECT REPORT
ON

“IMAGE COMPRESSION”

Image Processing And Machine Vision (ECC603)

Under the Guidance

Prof. Madhura Shirodkar

Project Group Members:

Atharva Deherkar (201902008)
Purva Hambire (201902017)
Sumeet Sharma (201902029)
Kritika Singh (201902033)

Electronics and Telecommunication

2021-2022
 Index

SR. NAME PG.

NO. NO.

1 Introduction 3

2 Literature Survey 4

3 Comparison of Paper 1 and 8

Paper 2

4 Conclusion 9

5 References 10

2
 Introduction
• Image compression is the process of reducing the size of a image in bytes
without sacrificing the image's quality.
• Uncompressed images can occupy a large amount of memory in RAM and in
storage media, and they can take more time to transfer from one device to
another. Hence there is a need for Image compression.
• Some of the common image compression techniques are:
o Wavelets
o Fractal
o DCT
o Chroma sub sampling
o Transform coding
o Run-length encoding

3
 Literature Survey
Paper 1: DCT-Based Colour Image Compression Algorithm
Using an Efficient Lossless Encoder

With the rapid development of society technology, people have raised higher demand
on both the quality and quantity of images, which has led to the increasing requirement
of digital image’s storage space and Transmission bandwidth. The DCT is a lossy
compression technique efficient capable of achieving data compression ratios from
near-studio-quality up to for acceptable-quality content.

The compression phase includes five steps: the YCbCr transform, the DCT transform,
the thresholding, the Quantization, and the modified lossless encoding, where the
YCbCr transform, the thresholding, and the quantization will Cause information loss.

YCbCr Transform
Y is the luma component of the colour. Luma component is the brightness of the colour
(that means the light intensity of the colour.)
Cb and Cr is the blue component and red component related to the chroma
component. (That means Cb is the blue component relative to the green component.
Cr is the red component relative to the green component.)

DCT
DCT stands for Discrete Cosine Transform. It is a type of fast computing Fourier
transform which maps real signals to corresponding values in frequency domain. DCT
just works on the real part of the complex signal because most of the real-world signals
are real signals with no complex components.
𝑁−1 𝑁−1
1 (2𝑥 + 1)𝑖𝜋 (2𝑦 + 1)𝑗𝜋
𝐷 (𝑖, 𝑗) = 𝐶 (𝑖)𝐶 (𝑗) ∑ ∑ 𝑝(𝑥, 𝑦) cos [ ] cos [ ]
√2𝑁 2𝑁 2𝑁
𝑥=0 𝑦=0
1
;𝑢 = 0
𝐶 (𝑢) = {√2
1; 𝑢 > 0

4
Thresholding And Quantization
To control the quality of compressed image, this algorithm applies the bisection
method to repeat an iterative process to automatically select the threshold.

Quantization is the process of mapping continuous infinite values to a smaller set of

discrete finite values. In the context of simulation and embedded computing, it is about
approximating real-world values with a digital representation that introduces limits on
the precision and range of a value.

5
Paper 2: Fractal Image Compression and Its Techniques
What is a Fractal?
A Fractal is a type of mathematical shape that are infinitely complex. In essence, a
Fractal is a pattern that repeats forever, and every part of the Fractal, regardless of
how zoomed in, or zoomed out you are, it looks very similar to the whole image.
Fractals are found in nature- like clouds, forests, plants etc and practically found in
antennas, in geometry and in computing.

Lossy Compression
Lossy compression is a method of data compression in which the size of the file is
reduced by eliminating data in the file. In doing so, image quality is sacrificed to
decrease file size. Any data that the compression algorithm deems expendable is
removed from the image, thereby reducing its size.

6
Fractal Image Compression
Fractal compression is a lossy digital picture compression method based on fractals. It
is a growing technique for representing an image as a contractive change on an image
space with a settled point around the core image. The strategy works well with textures
and natural photos, depending on the fact that different areas of the same image often
look alike. The strategy works well with textures and natural photos, depending on the
fact that different areas of the same image often look alike. Fractal algorithms turn
these components into "fractal codes," which are then utilized to reproduce the
encoded image.
This study examines the most fundamental developments in one-of-a-kind fractal code
design, both practical and theoretically. Iterated function system- Iterated function
systems (IFSs) are a technique for creating fractals that produces self-similar fractals.
If an object appears "nearly" the same on any scale, it is said to be self-similar.
Fractals are a type of self-similar object that is particularly fascinating. The image is
broken into sub-blocks for fractal compression. The most similar block is then
determined in a half-size version of the image and saved for each block. This process
is repeated for each block. The inverse is then done iteratively during decompression
to retrieve the original image.

7
 Comparison Of Paper 1 And Paper 2
Parameter DCT based image Fractal Image
compression Compression
Purpose Employed to compress the Employed to evade the
colour image repetitive compressions of
analogous blocks
Percentage compressed 60% to 67% of the image 50% of the image size is
size is reduced
Application The images can be saved Fractal image compression
in the compressed format has been used in a number
and can be reconverted to of commercial applications:
the RGB version when they on One Software,
must be displayed. developed under license
from Iterated Systems Inc.,
Genuine Fractals 5 which is
a Photoshop plugin
capable of saving files in
compressed FIF (Fractal
Image Format).

8
 Conclusion
• Image compression reduces the size of a picture or file by simplifying the
data's complexity and deleting some of the data.
• The capacity to deliver high compression ratios for a wide range of images,
the speed of its decoding process, and its multi-resolution properties are the
key advantages of the fractal compression technique.

9
 References
[1] Y. Zhou, C. Wang, and X. Zhou, “DCT-Based Color Image Compression Algorithm
Using an Efficient Lossless Encoder,” Int. Conf. Signal Process. Proceedings,
ICSP, vol. 2018-August, pp. 450–454, 2019, doi: 10.1109/ICSP.2018.8652455.
[2] M. Joshi, A. K. Agarwal, and B. Gupta, Fractal image compression and its
techniques: A review, vol. 742. Springer Singapore, 2019. doi: 10.1007/978-981-13-
0589-4_22.
[3] “What is a Fractal? - The Ultimate Guide to Understanding Fractals.”
[Link]
[4] “Image Compression — DCT Method. DCT based Image Compression | by Ojaas
Hampiholi | Towards Data Science.” [Link]
compression-dct-method-f2bb79419587
[5] “Lossy Data Compression: JPEG.”
[Link]
compression/lossy/jpeg/[Link]
[6] “JPEG DCT, Discrete Cosine Transform (JPEG Pt2)- Computerphile - YouTube.”
[Link]
[7] “What is fractal compression(In Hindi)?? - YouTube.”
[Link]
[8] “Fractal compression - Wikipedia.”
[Link]

10