IMAGE COMPRESSION

& ENCODING
 OBJECTIVES
 To understand image compression processing and the
basic operations.
 To learn different types of image redundancies
 To understand compression methods.
 OUTLINE:
What is Image Compression?
Image Compression Model
Data Redundancies
Compression Methods
 What is Image Compression?
 Image compression is a method to reduce the redundancies in
image representation in order to decrease data storage
requirements.
 It is a technique used to compress an image without visually
reducing the quality of the image itself.
 In the field of Image processing, the compression of images is an
important step before processing of larger images or videos. The
compression of images is carried out by an encoder and output a
compressed form of an image.

Note that data and information are not the same. Data refers to the means by which the information is conveyed.
Why the image must be compressed?
 The large storage requirement of multimedia data.
 The video or image files consume large amount of data
and it always required very high bandwidth networks in
transmission as well as communication costs.
Consider a black and white image that has a resolution of 1000 * 1000 and
each pixel uses 8 bits to represent the intensity. So, the total no of bits req = 1000 *
1000 * 8 = 8,000,000 bits per image. And consider if it is a video with 30 frames per
second of the above-mentioned type images then the total bits for a video of 5 secs is:
5*(30*(8, 000, 000))=1,200, 000, 000 bits.
This is only for a 5-sec black n white video, how much more storage for a
colorful and longer videos. So, we need a way to have proper representation as well to
store the information about the image in a minimum no of bits without losing the
character of the image.
 Aims of Image Compression
 Reduce the data storage and maintain the visual image
quality.
 Increase the speed of transmission by using the
repetition property of data.
 The goal of these processes is to represent an image
with the same quality level, but in a more solid form.
 Compression Fundamentals
 Image compression involves reducing the size of image
data files, while retaining necessary information.
 Retaining necessary information depends upon the
application.
 The ratio of the original, uncompressed image file and
the compressed file is referred to as the compression
ratio.
 Data redundancy is the central concept in image
compression and can be mathematically defined.
 Compression Steps

 Preparation: analog to digital conversion

 Processing: transform data into a domain easier to compress
 Quantization: reduce precision at which the output is stored.
 Entropy Encoding: remove redundant information in the
resulting data stream
 Some Transformation used in Image
Compression
 DCT (Discrete Cosine Transform)
 DWT (Discrete Wavelet Transform)

Some Compression Standard

 JPEG - Based on DCT
 JPEG 2000 – Based on DWT
 GIF
General Image Compression Model
 The image compression system
is composed of 2 distinct
functional component: an
encoder & a decoder.
 Encoder performs Compression
while Decoder performs
Decompression.
 Encoder is used to remove the
redundancies through a series
of 3 independent operations. In
the Decoder, the inverse steps
are performed
Channel Encoder & Decoder
Encoder
 Data Redundancies
Compression algorithms are developed by taking advantage of the
redundancy that is inherent in image data.
Three types of data redundancy:
 Coding Redundancy
Occurs when the data used to represent the image is not utilized in an
optimal manner
 Interpixel Redundancy
Occurs because adjacent pixels tend to be highly correlated, in most
images the brightness levels do not change rapidly, but change gradually.
 Psychovisual Redundancy
Some information is more important to the human visual system than
other types of information.
 Coding Redundancy
 Code is a symbol (letters, numbers, bits) used to represent a body of
information.
 Code word is a sequence of symbols used to represent a piece of
information or an event (e.g., gray levels).
 Code word length is the number of symbols in each code word.
 Coding redundancy is associated with the representation of
information. The information is represented in the form of codes.
 Symbols with higher appearing probabilities are assigned with code
of less amount of data. Binary code: symbols ( 0, 1 ) , length
(3)
 Inter-Pixel Redundancy
It is also called Spatial & Temporal redundancy. This type of redundancy is
related with the Interpixel correlations within an image. Because the pixels of
most 2D intensity arrays are correlated spatially(i.e. Each pixel is similar to or
dependent on neighbor pixel), information is replicated unnecessarily.

 Inter-Pixel Spatial Redundancy  Inter-Pixel Temporal Redundancy

 Due to the correlation between the  The statistical correlation between
neighboring pixels in an image.
pixels from successive frames in
 The value of any given pixel can be
predicated from the value of its neighbors video sequence
(highly correlated).  Temporal redundancy is also called
 The information carried by individual pixel is inter-frame redundancy.
relatively small  Removing a large amount of
 To reduce redundancy, the difference redundancy leads to efficient video
between adjacent pixels can be used to compression.
represent an image.
 Psychovisual Redundancy
 Certain information has relatively less importance for the quality of image
perception and can be eliminated without significant quality loss.
 Removing this type of redundancy is a lossy process (Lossy Compression or
Irreversible compression) and the lost information cannot be recovered.
 The method used to remove this type of redundancy is called quantization
which means the mapping of a broad range of input values to a limited
number of output values.
 Psychovisual redundancies exist because human perception does not
involve quantitative analysis of every pixel or luminance value in the
image.
- We’re more sensitive to differences between dark intensities than bright ones.
- We’re more sensitive to differences of intensity in green than red or blue.
- Use variable quantization : devote most bits to green, fewest to blue.
 Fidelity Criteria
 When lossy compression techniques are employed, the decompressed image
will not be identical to the original image. In such cases , we can define
fidelity criteria that measure the difference between this two images.
Two Types of Compression Method
 Lossy Image Compression
 The methods are required to achieve high compression ratios for complex
images.
 An image reconstructed can be performed in both spatial or transform
domains.
 The process of quantization-dequantization introduces loss in the
reconstructed image and is inherently responsible for the “lossy” nature of
the compression scheme.
 DCT is most widely used for image formats like JPEG, MPEG for video and
MP3 for audio.
 Lossless Image Compression
 The methods are needed in some digital imaging applications, such as:
medical images, x-ray images, etc.
 Examples: run- length coding, Huffman coding, lossless predictive coding, etc.
Trade Off : Quality vs Compression
 Lossless Compression (Information
Preserving)
-Original can be recovered exactly.
- Higher quality
- Larger size
 Lossy Compression
-Only an approximation of the
original can be recovered.
- Lower quality
- Smaller size
- END -