Medical Image Processing (UBM1601)

Unit – I Fundamentals of Medical Image

Processing and Transforms

Image Transforms - DFT

Dr.K.Nirmala
Asso. Prof. / BME, SSNCE
Unit I – Fundamentals of medical Image
Processing and Transforms

• Steps in Digital Image Processing

• Components of Digital Image Processing
• Elements of Visual Perception
• Image Sampling and Quantization
• Relationships between pixels
• Color image fundamentals - RGB, HSI models
• Medical image file formats- DICOM,ANALYZE 7.5,NIFTI
and INTERFILE
• 2D transforms - DFT, DCT, KLT
 Previous Session

• Fundamentals of Digital Image Processing

• Components of Digital Image Processing
• Elements of visual perception
• Sampling and Quantisation
• Basic relationship between pixels
 Session Objectives

• To study one dimensional and two dimensional Fourier

Transform.
• To learn two dimensional Discrete Fourier Transform
• To learn 1 – D and 2 – D FFT
 Session Outcomes

• At the end of the session, students will be able to describe

the 2D discrete Fourier transform and its properties
Fourier Transform:

• Let f(x) be a continuous function of real variable x

then
1 
F ( ) 
2  f ( x)exp( j x)dx

f ( x)   F ( )exp( j x)d


• The Fourier transform pair exists if f(x) is continuous

and integrable and F(ω) is integrable
Discrete Fourier Transform:

1 N 1  j 2 xu
Fu   f x exp( ), u  0,1, , N  1
N x 0 N

N 1
j 2 xu
f x   Fu exp( ), x  0,1, , N  1
u 0 N
2 – D Fourier Transform:
F (u, v)  ( f ( x, y ))

M 1 N 1
1 xu yv
F (u , v) 
MN
 f ( x, y ) exp[ j 2 (  )]
M N
x 0 y 0

f ( x, y)  1 ( F (u, v))

M 1 N 1
xu yv
f ( x, y )    F (u, v)exp[ j 2 (  )]
u 0 v 0 M N
PROPERTIES OF FOURIER TRANSFORM
xu yv xu yv
Separability: exp[ j 2 (  )]  exp( j 2 )exp( j 2 )
M N M N
M 1 N 1
1 xu yv
F (u , v) 
MN
 f ( x, y ) exp[  j 2 (
M

N
)]
x 0 y 0
M 1 N 1
1 xu 1 vy

M
 exp( j 2 M ) N  f ( x, y ) exp(  j 2
N
)
x 0 y 0
M 1
1 xu

M
 F ( x, v) exp( j 2 M
)
x 0
Conjugate Symmetry: F(u,v) = F*(-u,-v)
1 M 1 N 1 ux vy
F (u, v)  
MN x0 y 0
f ( x, y )exp[ j 2 (  )]
M N

1 M 1 N 1 ux vy
F (  u, v )= 
MN x0 y 0
f ( x, y )exp[ j 2 (  )]
M N
M 1 N 1
1 ux vy *
F (u, v) 
*

MN x0 y 0
f ( x, y){exp[ j 2 (  )]}
M N

1 N 1 N 1 ux vy
 
MN x0 y 0
f ( x, y )exp[ j 2 (  )]  F (u , v)
M N
Shifting (Translation):

f ( x, y )exp[ j 2 (u0 x / M  v0 y / N )] 
F (u  u0 , v  v0 )
f ( x  x0 , y  y0 ) 
F (u, v)exp[ j 2 (ux0 / M  vy0 / N )]
Rotation

Polar coordinates:
x  r cos , y  r sin 
u  w cos  , v  w sin 
f ( x, y )  f ( r ,  ) F (u, v)  F ( w, )
f (r,  0 )  F (w,  0 )
Periodicity:

The discrete Fourier transform and its inverse are

periodic with period N, i.e.,

F(u,v)=F(u+n,v)=F(u,v+N)=F(u+N,v+N)
Distributivity & Scaling:

• From the definition of continuous and discrete Fourier

transform pair

F{f1(x,y)+f2(x,y)}=F{f1(x,y)}+F{f2(x,y}

and in general,

F{f1(x,y).f2(x,y)}≠F{f1(x,y)}.F{f2(x,y}

• The Fourier transform and its inverse are distributive over

addition but not over multiplication

For two scalars a and b,

af(x,y) aF(u,v)
f(ax,by) 1/|ab|* F(u/a,v/b)
Convolution:
Consider two functions f(x,y) and g(x,y) then
 
f ( x, y ) * g ( x, y )    f ( ,  ) g ( x   , y   )dd
  

f ( x, y ) * g ( x, y )  F (u, v)G (u, v)

and
f ( x, y ) g ( x, y )  F (u, v) * G (u, v)
Discrete Convolution:

• Let f(x,y)and g(x,y) are discrete arrays of size

A x B and C X D. These arrays must be assumed
periodic with some period M and N in the x and
y directions. Choose,

M  A  C 1
and
N  B  D 1
1
 m  0 n  0
M 1 N 1
f ( x, y ) * g ( x, y )  f ( x, y ) g ( x  m, y  n)
MN
Correlation:

• The correlation of two functions f(x,y) and g(x,y) is

defined by the relation
 
f ( x, y)og ( x, y)    ( ,  ) g ( x   , y   )dd
*
f


f ( x, y )og ( x, y )  F * (u , v)G (u , v)
and
f * ( x, y ) g ( x, y )  F (u , v)oG (u , v)
 Summary

• 2D discrete Fourier Transform are studied.

• Properties of 2D DFT are studied.
 Review question

1. Define Discrete Fourier Transform?

2. What are the properties of Fourier Transform?
3. Define Convolution ?
4. Compute 2D basis function for N=4
1 1 1
5. Perform 2D DFT on the given image x=1 1 1
1 1 1
 Text Books and References
Text Books:
• Rafael C. Gonzalez, Richard E. Woods, ‘Digital Image Processing’, Pearson,
Third Edition, 2010.
• Anil K. Jain, ‘Fundamentals of Digital Image Processing’, Pearson, 2002.

References:
• Kenneth R. Castleman, ‘Digital Image Processing’, Pearson, 2006.
• Rafael C. Gonzalez, Richard E. Woods, Steven Eddins, ‘Digital Image
Processing using MATLAB’, Pearson Education, Inc., 2011.
• D. E. Dudgeon and RM. Mersereau, ‘Multidimensional Digital Signal
Processing’, Prentice Hall Professional Technical Reference, 1990.
• William K. Pratt, ‘Digital Image Processing’, John Wiley, New York, 2002
• Milan Sonka et al, ‘Image processing, analysis and machine vision’,
Brookes/Cole, Vikas Publishing House, 2nd edition, 1999.
Thank You