Digtial Image Processing, Spring 2006
1
ECES 682 Digital Image Processing
Oleh TretiakECE Department
Drexel University
Digtial Image Processing, Spring 2006 2
About the Course
• Homework 2 due today• Midterm exam next week
Covers first three homeworks 90 minutes (second half of class)
Digtial Image Processing, Spring 2006 3
Last Week’s Lecture
• Image Enhancement in the Spatial Domain Gray level transformations Histogram processing Arithmetic/Logic operations Spatial filtering
Smoothing Sharpening
• Matlab image processing Image datatypes Image display
Digtial Image Processing, Spring 2006 4
This Week’s Lecture
• Chapter 4, Image enhancement in the frequency domain Fourier transform and the frequency domain Filtering with Fourier methods Spatial vs. Fourier filtering Smoothing filters Sharpening filters Laplacian Unsharp masking, homomorphic filtering Funny stuff with the FFT Convolution and correlation
Digtial Image Processing, Spring 2006 5
Mr. Joseph Fourier
• To analyze a heat transient problem, Fourier proposed to express an arbitrary function by the formula
QuickTime™ and aTIFF (Uncompressed) decompressor
are needed to see this picture.f (x) =A0 + Ak cos(2πkx/ L)+ Bk sin(2πkx/ L)
k=1
∞
∑k=1
∞
∑
0 ≤x≤L
Digtial Image Processing, Spring 2006 6
Fourier Methods
Continuous time, real function, finite interval
Sine/cosine Fourier series
Continuous time, complex function, finite interval
Fourier series, complex exponentials
Discrete time, complex function, infinite interval
Fourier transform, finite interval in frequency
Discrete time, complex function, finite interval
Discrete Fourier transform (DFT)
Two dimensional complex function, infinite intervals
2-D Fourier transform
Two dimensional complex function, polar coordinates
Fourier-Bessel transform, angular harmonics
Digtial Image Processing, Spring 2006 7
FT and FFT
• We normally deal with low-pass functions centered at the origin f(x) <—> F(u) Space range -X/2 < x < X/2 Frequency range -W< u <W
• Natural coordinates for DFT are fn
Space range 0 ≤ n < N Frequency range 0 ≤ k < N
Digtial Image Processing, Spring 2006 8
DFT Example
Digtial Image Processing, Spring 2006 9
2D FT Example
Digtial Image Processing, Spring 2006 10
Another Example
Digtial Image Processing, Spring 2006
11
Examples of 2DFT
a
b
c
a
bc
Image Fouriertransform
Digtial Image Processing, Spring 2006 12
Two-Dimensional Systems
• We would like to have a system model for vision.
hx(u,v) y(u,v)
• Input: Image• Output: Our mind’s perception
Digtial Image Processing, Spring 2006 13
‘Typical’ Visual Spatial Response
low contrast
high contrast
Digtial Image Processing, Spring 2006
15
Objective value
(intensity)
Subjective (perceived)
value
Mach Bands
Digtial Image Processing, Spring 2006
16
The circles have the same objective intensity.
Digtial Image Processing, Spring 2006
17
Digtial Image Processing, Spring 2006 19
How to Filter
1. Multiply image by (-1)x+y
Image dimensions MxN
2. Compute F(u, v) DFTDC at M/2, N/2.F(u, v) complex valued
• Multiply F(u, v) by H(u, v)DC for H(u, v) at M/2, N/2.
• Compute inverse DFT of result in (3)• Take real part of result in (4)• Multiply result in (5) by (-1)x+y
Digtial Image Processing, Spring 2006 20
Notch Filter
Digtial Image Processing, Spring 2006 21
Fourier Low- and High-Pass Filters
Digtial Image Processing, Spring 2006 22
High-Boost Filter
Digtial Image Processing, Spring 2006 23
Space and Frequency Filters
Digtial Image Processing, Spring 2006 24
Radial Low-Pass Filter
Digtial Image Processing, Spring 2006 25
Power Distribution
Digtial Image Processing, Spring 2006 26
Power Removal
(a) Original image, (b) 8% power removal, (c) 5.4% power removal, (d) 4.3%, (e) 2%, (f) 0.5%. Radii are 5, 15, 30, 80, and 230. Max frequency is 250
Digtial Image Processing, Spring 2006 27
Ideal vs. Butterworth
Digtial Image Processing, Spring 2006 28
Ideal vs. Gaussian
Digtial Image Processing, Spring 2006 29
‘Morphological’ Filtering
Digtial Image Processing, Spring 2006 30
Sharpening Filters
Digtial Image Processing, Spring 2006 31
Sharpening: Ideal vs. Butterworth
Digtial Image Processing, Spring 2006 32
Sharpening: Ideal vs. Gaussian
Digtial Image Processing, Spring 2006 33
Laplacian in the Frequency Domain
Digtial Image Processing, Spring 2006 34
Homomorphic Filtering
Digtial Image Processing, Spring 2006 35
Correlation and Finding Things
Digtial Image Processing, Spring 2006 36
More About the Fourier Transform
• Shift• Linearity• Scaling• Rotation• Seperability• Forward and inverse• Padding and wraparound
Digtial Image Processing, Spring 2006 37
Wraparound: Example
Digtial Image Processing, Spring 2006 38
Summary
• Fourier methods in image processing Filtering Other
• Filtering Space domain N2 image, M2 filter
Cost = cN2M2
Fourier domain Cost = kN2logN
• Other Spectral estimation
Digtial Image Processing, Spring 2006 39
References on the FT
• Ron Bracewell, The Fourier Transform and its Applications, McGraw-Hill, 2000
• About Josef Fourier www-groups.dcs.st-and.ac.uk
(University of Saint Andrews MacTutor history of mathematics web site). The image on the right is from that site.
Top Related