Supervised By:

Richa Sharma Tania Gupta

(Electronics & Communication Department)

LIST OF STUDENTS :
1. Shailja Verma 2. Rohit 3. Abhishek Pandey 4. Ashish Gupta 5. Naman Kumar 6. Chitrakshi

CONTENTS
Basics of project Reasons to choose ODCT for this project

What is update algorithm

Hardware implementation of ODCT algorithm

Goal of Image Compression

Digital images require large space for storage and bandwidths for transmission. The goal of image compression is to reduce the amount of data required to represent a digital image. oReduce storage requirements and increase transmission rates.

IMAGE COMPRESSION
Data (image) compression is the reduction or elimination of redundancy in data representation in order to achieve reduction in storage and communication cost.

Original image

Compressed image

WHAT IS DCT ??
A transform is defined as mapping of correlated data into uncorrelated data. Discrete cosine transform attempts to decorrelate the image data.After decorrelation each transform coefficient can be encoded independently.

DCT was initially introduced in 1974.

DCT IS BETTER THAN DFT

Need Fewer coefficient. Powerful bandwidth reduction capability.

Strong energy compaction.

TYPES OF DCT/DST

Even DCT (EDCT) Even DST (EDST)

Odd DCT (ODCT) Odd DST (ODST)

DCT/DST I II III IV DCT/DST V VI VII VIII

Even DCT/DST Odd DCT/DST

REASON TO CHOOSE ODCT

* The

Even discrete cosine transform and Even discrete sine transform both are already received more attention and used in many image and video standard like JPEG,MPEG-2 and lots of fast algorithms are developed for that. * ODCT and ODST have great application in HEVC (High Efficiency Video Coding)

Update Algorithm
For the real-time processing of the infinite input sequence of data, a portion of the sequence is sampled and the transform is performed. New input data points are shifted in as and when they are available and the oldest data points are shifted out. To calculate the transform of the new sequence the technique the update algorithm is used.

HOW THESE ALGORITHMS WORK

Let we take a example: Assume we have a data Sequence

1,2,3,4,5,6,7,8,9,10,11,12,13
Assume window size N=8 and Shifted by r =1

1,2,3,4,5,6,7,8,9,10,11,12
Through Standard equation

Coefficient Through Update algorithm

DESIGN FLOW FOR ODCT ALGORITHM

Input File (image) Computation of image pixel using MATLAB Simulation

Computation of ODCT coefficient using IUS Simulator using NClaunch

Functional Verification

Synthesis of ODCT algorithm

OUTPUT

References
[2] A. Reznik, Fast computing of discrete cosine and sine transform of type VI and VII, IEEE Computer Graphics and Application, Vol-13,March 2011, Published by Qualcomm Inc. [2] J.F.Blinn, What is deal with DCT, IEEE Computer Graphics and Application, Vol13,March 1993, issue: 4,pp:78-83

THANK YOU