Escolar Documentos
Profissional Documentos
Cultura Documentos
INTRODUCTION
speeds and digital communication system performance, demand for data storage
web applications have not only sustained the need for more efficient ways to
encode signals and images but have made compression of such signals central to
For still image compression, the joint photographic experts group (JPEG)
degrades at low bit rates mainly because of the underlying block-based Discrete
cosine Transform (DCT) scheme. More recently, the wavelet transform has
higher compression ratios. Over the past few years, a variety of powerful and
developed and implemented. Because of the many advantages, the top contenders
IMAGE COMPRESSION
significantly different than compressing saw binary data. Some general purpose
compression programs can be used to compress images, but the result is less than
optimal. This is because images have certain statistical properties which can be
exploited by encoders specifically designed for them. Also some finer details in
1. Lossy Compression
2. Lossless Compression.
an exact duplicate of the input data stream after a compress or expand cycle. Here
This is the type of compression used when storing data base records, spread
(b) Quantizer
Source encoder
STEPS IN COMPRESSION
2. Dividing the image data into various classes, based on their importance.
3. Dividing the available bit budget among these classes such that the
distortion is a minimum.
5. Encode each class separately using an entropy coder and write to the file.
Bit allocation
different classes. Depending on the importance of the data it contains, each class
is allocated a portion of the total bit budget, such that the compressed image has
The Rate Distortion theory is often used for solving the problem of
allocating bits to a set of classes, or for bit rate control in general. The theory
aims at reducing the distortion for a given target bit rate, by optimally allocating
bits to the various classes of data. One approach to solve the problem of optimal
2. For each class, one bit is reduced from its quota of allocated bits, and the
3. Of all the classes, the class with minimum distortion for a reduction of 1
5. The total rate for all the classes is calculated as R = p (i) * B (i), where p is
6. Compare the target rate and distortion specifications with the values
coefficient representing the brightness level in that point. When looking from a
one, and lesser important one. But most natural images have smooth colour
variations, with the fine details being represented as sharp edges in between the
low frequency variations and the sharp variations as high frequency variations.
The low frequency components constitute the base of an image and the
high frequency components add upon them to refine the image thereby giving a
detailed image. Hence the smooth variations are demanding more importance
Separating the smooth variations and details of the image can be done in
many ways. One such way is the decomposition of the image using Discrete
DWT of an image
A low pass filter and a high pass filter are chosen, such that they exactly
halve the frequency range between themselves. The filter pass is called the
analysis filter pair. First the low pass filter is applied for each row of data,
thereby getting the low frequency components of the row. But since the low pass
filter is a half band filter, the output data contains frequencies only in the first
half of the original frequency range. So they can be subsampled by two, so that
the output data now contains only half the original number of samples. Now the
high pass filter is applied for the same row of data, and similarly the high pass
components are separated and placed by the side of the low pass components.
Next, the filtering is done for each column of the intermediate data. The
resulting two dimensional array of coefficients contains four bands of data, each
The LL band can be decomposed once again in the same manner, thereby
producing even more subbands. This can be done up to any level, thereby
The LL band at the highest level can be classified as most important and
the other detail bands can be classified as of lesser importance, with the degree of
importance decreasing from the top of the pyramid to the bands at the bottom.
LL HL
LL HL HH
HL
LH
LL HL HL HL
LH HH LH HH
LH HH LH HH LH HH
FIGURE 2
Just as a forward transform is used to separate the image data into various
classes of data into a reconstructed image. A pair of high pass and low pass filters
is used here also. Then filter pair is called the synthesis filter pair. The filtering
procedure is just the opposite. We start from the topmost level, apply the filters
coloumnwise first and then rowwise and proceed to the next level, till we reach
Quantization
values in the image data with a finite set of values. The input to a quantizer is the
original data, and the output is always one among a finite number of levels. The
quantizer is a function whose set of output values are discrete, and usually finite.
A quantizer can be specified by its input partitions and output levels. If the
input range is divided into levels of equal spacing, then the quantizer is termed as
uniform quantizer can be easily specified by its lower bound and step size. Also,
In a uniform quantizer, if the input falls between n*r and (n=1)*r, the
output
n-2 n-1 n n+1 n+2
| X | X | X | X | X |
(n-2)r (n-1)r nr (n+1)r (n+2)r (n+3)r
input
Just the same way a quantizer partitions its input and outputs discrete
levels, a dequantizer is one which receives the output levels of a quantizer and
converts them into normal data, by translating each level into a reproduction
• Given the output levels or partitions of the encoder, the best decoder is one
that puts the reproduction parts x1 on the centers of mass of the partitions.
• Given the reproduction points of the decoder, the best encoder is one that puts
the partition boundaries exactly in the middle of the reproduction points i.e.,
neighbor condition.
Entropy coding
After the data has been quantized in to a finite set of values, it can be
the amount of information present in the data, and an entropy coder encodes the
given set of symbols with the minimum number of bits required to represent
them.
Two of the most popular entropy coding schemes are Huffman coding and
Arithmetic coding.
ratios from visually lossless to as great as 350-to-1. Figure below shows the
DRAM
Dram
manager
Digital
Wavelet
Component Digital filters, Run
video decimator Adaptive length Huffman
Video I/O 1/0 post and quantizer coder coder
interpolator
Host
Host 1/0
On chip post and
transform FIFO
buffer
compression is the same as the area needed for decompression. In contrast, other
compression techniques require more work and special circuitry to compress than
to decompress a signal.
interface and delivers a compressed video stream through its host interface in
encode mode .In decode mode, the IC accepts a compressed bit stream through
its host interface and delivers component digital video through its video
separate frequency bands. The chip then optimizes each band to include only
frequencies the naked eyes can discern. Because the eye lacks sensitivity at high
ADVANTAGES
1. The high image compression ratios reduces the hard disk storage capacity
6. Because wavelet transforms compress the entire frame, any change makes
APPLICATIONS
2. MPEG-4 uses wavelet tiling to allow the division of images into several
CONCLUSION
at low bit rates because of overlapping bases function and better energy
images thereby allowing variable bit rates. The JPEG-2000 standard incorporates
representation are the grand challenges facing the data compression community.
robustness, error resilience, and complexity are a few of the many outstanding
challenges in image coding to be fully resolved and may affect image data
BIBLIOGRAPHY
December 2000
Publication.
5. http:/engineering.rowan.edu/~polikar/WAVELETS/WTtutorial.html
ABSTRACT
the blot that occurs when pictures, sound and video are converted from their
the present explosion of high quality data, the need to compress it with less
distortion of data is the need of the hour. Compression lowers the cost of storage
CONTENTS
1. INTRODUCTION
2. IMAGE COMPRESSION
• Steps in compression
• Bit allocation
• DWT of an image
• Quantization
• Entropy coding
5. ADVANTAGES
6. APPLICATIONS
7. CONCLUSION
8. BIBLIOGRAPHY
ACKNOWLEDGEMENT
I express my thanks to Mr. Muhammed Kutty our group tutor and also
to our staff advisor Ms. Biji Paul for their kind co-operation and guidance for
preparing and presenting this seminar.
I also thank all the other faculty members of AEI department and my
friends for their help and support.