Example 4.2 Show that the matrix A is orthogonal
-2
2
Since the matrix
Therefore, AxA’=4]-2
3
1
00) fi oo
9 0} so 1 0
09) \o o 1)
Since A x A“! = A x AT = J, the given matrix is orthogonal.
Scanned with CamScannera
{1,2,8,9} a
wing sequence of numbers: *
Example 4.5 Apply DF
1 be included as part of either the forward DFT or iny,
Solution Were, }e factor 1/1 is gi
Z re, M= 4, The factor 1/M for applying DFT is given °°
DFT. nclude 1/M as part of the inverse DFT. So, the formul
F(u)= > foe
When u = 0,
F(0)= Spe” 4
= £(0)+ fl) + f(2)+ fG)= 1424849 = 20
Scanned with CamScannerDIGITAL IMAGE TRANSFORMS 139
When v= 1,
FO= Loe
a Ore +fxe), foe
When w= 2, DAN +9747;
FQ)=¥ pape
=
“UOXs faye y
fO)xen _
=142(-1) 480) 49-1) <2 Ing + £0)Ke*]
When u = 3,
io
= FO=D so"
g
2 .
=L/O xe + payne t) 4 JOKE fax)
=142(/)+8(-1)+9(-j) =-7-7}
Therefore, the DFT of the sequence is {20,7+7),-2,~7~7}}. One can verify this work by computing
the inverse of this sequence. Let us add the factor (1/M) as part of this formula. The formula for
computing the inverse DFT is given here:
10)= 7S rwe
io
2
a
Let.x = 0, one gets
reno
F0) =ixD Fe 7
=)
=1xfFO+F)+FQ)+FO)
[20+(-7+7)) +(-2)+ (7-79)
Repeating this for x = 1, one gets
5
fQ) =ixDFwe
0 4 F()xe? +FQ)xe* +FG)xe?]
Reed
1 .tFOxe
7 1
-7-1j(-)]=—x8=2
[204-74 TDD CAD HTT 8
BIS Bl
Scanned with CamScanner18) DIGITAL IMAGE PROCESSING
Repeating this fore = 2, one gets
L. Lewe *
+ RXe™ HFQINE
1 .
==x[FW) xe"
qeleew
lee
= Enpaoeere rik DEC INYHET= TED = PNB SS
Repeating this forws Jone gers
a) 8)
LPO xe + FONE fe FQN 4 FONE!
)
ROH T HTD HCD HTT ANOT=8
Scanned with CamScanneramples Apply DET to the following image and prove that DFT works,
2000
0000
0000
0000
T
Solution The forward transform is F(u, v) = Kernel x f(x, y) * Kernel
Fluyv)=
wNenoeoe
ot.
i
~cosoon
cooo
coco
ZTecceo
wnnno oe
: 1
The inverse 2D FFT is Jez * Kemel x Flu, v) x Kemel™
M
Pio.
ut -j a jf fe
x ys
JOM 1 1 all>
2
a
Ccooe
my
8
0
0
0
a
coo
000 0000
°
lence the original image is recovered without any loss of information.
Scanned with CamScanner