Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Image Transforms

# Image Transforms

Ratings: (0)|Views: 22|Likes:
CS804B, M1_5, Lecture Notes
CS804B, M1_5, Lecture Notes

### Availability:

See more
See less

11/25/2012

pdf

text

original

Seminar Topics
Resmi N.G.
1.

Discrete Cosine Transform2.

Discrete Sine Transform3.

Haar Transform5.

Optimum Mean Square Quantizer
1. Discrete Cosine Transform
An NxN cosine transform matrix C={c(k,n)}, also known as DCT is defined as
( )
1,0,01(,)212cos,11,012
k n  N c k nn k N n  N
π
=
=
+
≤ − ≤ −
Let N = 4.110,0,(0,0)0.524111,(0,1)0.524112,(0,2)0.524113,(0,3)0.524
Whenk n cn cn cn c
= = = = == = = == = = == = = =

( )( )( )( )
2011211,0,(1,0)coscos0.65334248221112131,(1,1)coscos0.27064248222112152,(1,2)coscos0.270642482231123,(1,3)cos424
Whenk n cn cn cn c
π π π π π π π
× + ×
= = = = =
×
× + ×
= = = =
×
× + ×
= = = =
×
× + ×= =×
17cos0.653382
π
= =

( )( )( )( )
20122122,0,(2,0)coscos0.54248221122161,(2,1)coscos0.542482221221102,(2,2)coscos0.542482231223,(2,3)cos424
Whenk n cn cn cn c
π π π π π π π
× + ×
= = = = =
×
× + ×
= = = =
×
× + ×
= = = =
×
× + ×
= =
×
114cos0.582
π
= =

( )( )( )( )
20132133,0,(3,0)coscos0.27064248221132191,(3,1)coscos0.653342482221321152,(3,2)coscos0.653342482231323,(3,3)cos42
Whenk n cn cn cn c
π π π π π π π
× + ×
= = = = =
×
× + ×
= = = =
×
× + ×
= = = =
×
× + ×= =
121cos0.2706482
π
= =
×
0.5000 0.5000 0.5000 0.50000.6533 0.2706 -0.2706 -0.65330.5000 -0.5000 -0.5000 0.50000.2706 -0.6533 0.6533 -0.2706
=

Orthogonality of 4x4 DCT matrix
:CC
T
=C
T
C=I1.0000 0.0000 0.0000 0.00000.0000 1.0000 0.0000 0.00000.0000 0.0000 1.0000 0.00000.0000 0.0000 0.0000 1.0000
=

0.5000 0.5000 0.5000 0.50000.5000 0.6533 0.5000 0.27060.6533 0.2706 -0.2706 -0.65330.500.5000 -0.5000 -0.5000 0.50000.2706 -0.6533 0.6533 -0.2706
CC
=
00 0.2706 -0.5000 -0.65330.5000 -0.2706 -0.5000 0.65330.5000 -0.6533 0.5000 -0.2706

0.5000 0.6533 0.5000 0.27060.5000 0.5000 0.5000 0.50000.5000 0.2706 -0.5000 -0.65330.650.5000 -0.2706 -0.5000 0.65330.5000 -0.6533 0.5000 -0.2706
C
=
33 0.2706 -0.2706 -0.65330.5000 -0.5000 -0.5000 0.50000.2706 -0.6533 0.6533 -0.2706

1.0000 0.0000 0.0000 0.00000.0000 1.0000 0.0000 0.00000.0000 0.0000 1.0000 0.00000.0000 0.0000 0.0000 1.0000
=

One dimensional DCT
of a sequence {u(n)},0 ≤ n ≤ N-1 is defined as
10
(21)()()()cos,0121,0()2,11
N n
n v k k u n k  N  N where k  N
π α α
=
+
=
=
=

Inverse transform
is given by,
10
(21)()()()cos,012
N
n u n k v k n  N
π α
=
+
=

Properties of DCT:
1.

DCT is real and orthogonal.
*1
C C C
=
=

2.

DCT is NOT the real part of DFT.
3.

It is a fast transform and requires only O(Nlog
2
N) operations via N-point FFT.
4.

Excellent energy compaction for highly correlated data.
2. Discrete Sine Transform
An NxN sine transform matrix Ψ={ψ(k,n)}, also known as DST is defined as
2(1)(1)(,)sin,01,0111
k nk n k N n  N
π ψ
+ +
=
+ +
Let N = 4.