Discrete Cosine Transform

WHAT IS AN INTEGRAL TRANSFORM

 In mathematics, an integral transform maps an equation from its original domain into
another domain where it might be manipulated and solved much more easily than in the
original domain. The solution is then mapped back to the original domain using the inverse
of the integral transform.
 Some examples are :
 Laplace Transform
 Complex Fourier Transform
A Table of Integral Transforms
DISCRETE TRANSFORM

 In signal processing , Discrete transforms are mathematical transforms, often linear

transforms, of signals between discrete domains, such as between discrete time and
discrete frequency.

 In addition to spectral analysis of signals, discrete transforms play important role in data
compression, signal detection, digital filtering and correlation analysis.

 Classical signal processing deals with one-dimensional discrete transforms. Other

application areas, such as image processing, computer vision, high definition television,
visual telephony, etc. make use of two-dimensional and in general, multidimensional
discrete transforms.
DISCRETE COSINE TRANSFORM

 A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a
sum of cosine functions oscillating at different frequencies.
 It is an orthogonal transformation that is very widely used in image compression and is
widely accepted in the multimedia standards.
 It belongs to a family of 16 trigonometric transformations.
 It transforms a signal or image from the spatial domain to the frequency domain.
Contd..

 DCT is a technique for converting a signal into elementary frequency components and
that’s why it is widely used in the field of Image Compression.

 The key equation of DFT is defined by:

where 𝑓𝑘 is a discrete integer function representing a signal in the time domain.

Formulae

 For 1-D
F=C.f

 For 2-D
F=C.f.Ct

where C denotes Cosine transform matrix,

f is the original image and
C t denotes transpose of Cosine transform matrix
Value of Cosine Transform Matrix

 C(u,v) = √ 1/N if u = 0, 0 <= v <= N-1

= √2/N *cos[(2v+1)∏u / 2N] if 1 <= u <= N-1 and
0 <= v <= N-1
Example -1

Ex: Find DCT of image f(x)={1,2,4,7}

Example -2

Ex : Find 2D discrete cosine transform of 1 2 2 1

2 1 2 1
1 2 2 1
2 1 2 1
DISCRETE FOURIER TRANSFORM

 The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier Transform for
signals known only at N instants separated by sample times T i.e. a finite sequence of
data).