ECE 4007

Information Theory and Coding

SUBMITTED BY:

VIKRAMADITYA MISHRA -16BEC0123

ADITYA PRASAD-16BEC0860

SUSHANTH V. -16BEC0886

SLOT: G1+TG1

UNDER THE GUIDANCE OF:

Prof. KALAPRAVEEN BAGADI(SENSE)

 ACKNOWLDEGMENT

We, the members of this group, would like to take this opportunity
to thank the administration of VIT University, Vellore, for
providing us with the perfect atmosphere and state-of-the-art
infrastructure that is conducive to our growth as future Engineers.
We would also like to thank the Dean of SENSE School for
including this subject in our curriculum. Finally, we would wish
to extend our gratitude to our course professor, Prof. Kalapraveen
Bagadi for giving us this enlightening topic to work on, and
guiding us till the completion of our project.
 ABSTRACT
Image compression is a key technology in transmission and storage of digital
images because of vast data associated with them. This research suggests a new
image compression scheme with pruning proposal based on discrete wavelet
transformation (DWT). The effectiveness of the algorithm has been justified over
some real images, and the performance of the algorithm has been compared with
other common compression standards. The algorithm has been implemented
using Visual C++ and tested on a Pentium Core 2 Duo 2.1 GHz PC with 1 GB
RAM. Experimental results demonstrate that the proposed technique provides
sufficient high compression ratios compared to other compression techniques.
 INTRODUCTION
Image compression is used to reduce the image size and redundancy of the image
data. The amount of data used to represent these images, therefore needs to be
reduced. Image compression deals with redundancy, the number of bits needed to
represent on image by removing redundant data. Decreasing the redundancy is the
main aim of the image compression algorithms. Image compression technique,
mostly used two-dimensional (2D) image compression standards, such us JPEG,
JPRG-LS or JPRG2000 generally consider only intra brand Correlation. Image
compression is broadly classified into two categories namely Lossy and Lossless
depending on whether the original image can be recovered with fill mathematical
precision from the compressed image, Compression is the best of Digital image
Processing. Lossless or Lossy compression approaches can be applied to hyper
spectral image. Lossy compression is based on the principle of removing subjective
redundancy. Lossless compression is based on effective SR. Original image can be
fully recovered in Lossless image compression. It is useful to build the significant
transforms for the Lossless image compression area including dwt and various color
space transforms The High compression was established in lossy finds the highest
peak signal ratio (PSNR) and compression ratio. Compression ratio of PSNR values
between the same set of images at very low bit rates. It can be observed that Lena
image, Barbara image, Peppers Gold hill. This image performance may be calculated
using DCT and DWT algorithms. The input image is divided in to n x n blocks. Then
each block is transformed using DCT and DWT. The DCT Coefficients of each
block is arranged in hierarchical Manner.

DWT have different types of Wavelets and thresholding techniques. The first step
of the compression algorithm is image decomposition in nxn sub-images.The
Wavelet transforms is applied to each vector and some of the high frequency are
suppressed based on the some threshold criteria. Wavelet transforms involve
representing a general purpose in terms of simple, fixed building blocks are
generated from a particular fixed function called mother wavelet function.DCT only
compress the image of lower decorative performance, DCT is low level image
compression.DCT only offers Lossy transform. DWT offers both Lossy and Lossless
transform. The main focus of this work is dwt filter based on achieved compression
ratio. The Proposed image compression technique has been tested on well-known
image like compared with the JPEG2000 and DWT Techniques.
 BLOCK DIAGRAM

METHODOLOGY
DCT and DWT Image compression technique have the best compression
Framework Diagram. The Framework delivers the best result of the DCT and
DWT Image Compression. It is easy way to understand the technique.
Through the diagrammatic representation DCT and DWT Image compression
technique is easily understand. DCT of Lossy image compression may have
the high compression ratio, but the outcome of the image was not good. But
the DWT image compression technique the quality of the image ratio and the
outcome of the image was good. Using the lossless image compression the
output of the image was good us expected. DCT also have best image
compression ratio in the image compression technique, but the output of the
image in lossy compression was not good us expected. The DCT
transformation of the image is taken in to the pixel ratio us nxn matrix
formation. Then the image is transforms into the DCT quantization. After that
the DCT image will move to the DPCM encoder. Then the compressed image
will come us output.

In the DWT transformation, the image is taking into HL, LH, HH, LL Ratios.
Then the image is moved into DWT transforms, and then DWT Quantization
is processed. After that the process is move to DPCM encoder. Then the
compressed image will come us the output. The output image has the good
compression ratio. The PSNR value of the compressed image is good us
expected.
 ALGORITHM OF DCT TRANSFORMATION
Step1: Consider the following as an example of an 8x8 sub image:

Before computing the DCT of the subimage, its gray values are shifted from
a positive range to one centered around zero. For an 8-bit image each pixel
has 256 possible values: [0,255]. To center around zero it is necessary to
subtract by half the number of possible values, or 128.

Step2: Subtracting 128 from each pixel value yields pixel

values on [ − 128,127].

Step3: The next step is to take the two-dimensional DCT, which is given by:

If this transformation is performed on the above matrix,

Note the rather large value of the top-left corner. This is the DC coefficient. The
remaining 63 coefficients are called the AC coefficients.
Step4: Consider a typical Quantization matrix:

;
Step 5: We get the following matrix by dividing corresponding Coefficient
matrix values and Quantization matrix values.

For example, using −415 (the DC coefficient) and

rounding to the nearest integer,

This process helps us to remove high frequency components from the right
downward side of the matrix. This therefore compresses the image with loss in
its space but not much noticeable changes in the image.
 MATLAB CODE ALGORITHM

1) Start the code

2) Initialize the rows and columns of the matrix and other variables used in
the forming the matrix

3) Take any image and read that image

4) First convert the image from RBG to YCbCr

5) Using the above algorithm find the down sampled image

6) Now start the DCT algorithm with 8x8 Image block

7) Form the matrix required for Quantization

8) Then start the Quantization process by subtracting 128 from each element
of the matrix

9) Using the Quantization table matrix round of the each value and display
the matrix

10) From now start the inverse DCT process

11) In inverse DCT each element should be added 128 value to each element
of the matrix

12) Display the original image and the compressed image.

 ALGORITHM OF DWT TRANSFORMATION

STEP 1: The image is level shifted by subtracting 128 from all the pixel values.
STEP 2: 1 – level wavelet decomposition of N × N image is computed by using
Daubechies 9 / 7 wavelet with symmetric periodic extension of data.
STEP 3: The approximation subband coefficients are scaled down by two.
STEP 4: JPEG standard (without level shifting) is applied to scaled
approximation subband with a specified quality factor. The approximation
subband coefficients are scaled down by two in STEP 3 to ensure that the DWT
coefficients, while applying JPEG standard in this STEP, are in the range [-510,
510].
STEP 5: Each detail subband is divided into non-overlapping 8 × 8 blocks.
Choose that 8x8 block containing maximum energy by comparing the energies in
the 8x8 blocks in the same position from the three detail subbands. Repeat this
for all the positions.
The energy in each 8 × 8 block is calculated using

where Wi,j is the wavelet coefficient in 8 × 8 block.

STEP 6: JPEG standard (without level shifting) is applied to the chosen

maximum energy blocks for the same quality factor used in STEP 4.
RESULT
 DCT DWT

Compression Ratio 1 0 0.996741

PSNR 12.13 58.37

MSE 7.2979e-09 .3599

 CONCLUSION

In this paper, we compare a new lossy and lossless image results using the of
transform coding technique DCT and DWT. Discrete Cohesion Transform
provides the higher compression ratio and avoiding jamming artifacts, allows
good localization both in spatial & regularity domain. Based on PSNR and MSE
values DCT is better than DWT with large coefficients and high compression
ratio. The Proposed technique was using DWT in order to get the high
compression technique. The DWT used achieved good PSNR values. Image de-
noising where the noise elements are located n high frequency. Wavelet
represents an excellent tool in image processing to increase the result in quality
and Performance.

REFERENCES

● Wikipedia.com
● Mathworks.com
● A.M.Raid , W.M.Khedr , M. A. El-dosuky and Wesam Ahmed “Jpeg
Image Compression Using Discrete Cosine Transform - A Survey”
International Journal of Computer Science
& Engineering Survey (IJCSES) Vol.5, No.2, April 2014

● Andrew B. Watson, NASA Ames Research Center “Image

Compression Using the Discrete Cosine Transform”
● https://www.ijcsmc.com/docs/papers/April2016/V5I4201635.pdf