Lecture 5
Lecture 5
Angle
Shape features are evident
Phase angle is 0
DC term is dominant
Basics of Filtering in Frequency Domain
Frequency Domain Filtering Fundamentals
Low-Pass and High-Pass Filters
Correspondence to the Spatial Domain Filter
ILPF, cutoff 60
ILPF, cutoff 30 Energy 95.7%
Energy 93.1%
D 2 (u,v) / 2 D02
H (u, v) e
Applying the GLPF
Image Degradation and Restoration
Image degradation due to
• noise in transmission
• imperfect image acquisition
• environmental
condition
• quality of sensor
http://fireoracleproductions.com/services samp
les
Google image
Image Degradation and Restoration
Restoration in the Presence of Noise Only –
Spatial Filtering
Image Restoration with Additive Noise
𝑔 𝑥, 𝑦 = 𝑓 𝑥, 𝑦 + 𝜂 𝑥, 𝑦
Noise models:
• Impulse noise: pepper and salt
• Continuous noise model:
• Gaussian, Rayleigh, Gamma, Exponential, Uniform
Properties of Noise
• Spatial properties
• Spatially periodic noise
• Spatially independent noise
• Frequency properties
• White noise – noise containing all frequencies within
a bandwidth
Some Important Noise Model
( z z ) 2
1
p(z) e 2 2
2
http://www.gergltd.com/cse486/project2/
• Due to electronic circuit
• Due to the image sensor
• poor illumination
• high temperature
Some Important Noise Model
2 ( za)
2
a b z b1 az
p(z) b (z a)e za
z0
b
e
za p(z) (b 1)!
0
0 z0
Rayleigh noise
• range imaging Gamma noise
•Background model for Magnetic • laser imaging
Resonance Imaging (MRI)
images
Some Important Noise Model
Pa for z a
P for z b
aeaz z0 P(z) b
P(z)
0 z0
0 Otherwise
Impulse noise
Uniform noise • salt and pepper noise
Exponential noise
• laser imaging
An Example
Degradation (convolution)
f (x, g(x, y)
Restoration (deconvolution)
Estimate the Degradation Function
• Observation
• Experimentation
• Mathematical modeling
Estimate Degradation Function - Observation
Assumptions:
Assumptions:
•A similar equipment is available
T
g(x, y) f [x x0 (t), y y0 (t)]dt
0
T
H (u, v) e j 2 [ux0 (t )vy 0 (t )] dt
0
Estimation by Modeling – Example
• Inverse filtering
• Wiener filtering
Inverse Filtering
Ideally: In practice:
G(u, v) H (u, v)F(u, v) G(u, v) H (u, v)F(u, v) N (u, v)
G(u, v) N (u, v)
F̂(u, v) F̂(u, v) F (u, v)
H (u, v) H (u, v)
Original image
G(u, v)
H (u, v)
Degraded image
An Example of Inverse Filtering (Cont.)
Full filter Cutoff radius = 40
Original image
Assumptions:
• Noise and image are uncorrelated
• Noise has zero mean
1 H (u, v)
2
F̂ (u,v) G(u,v)
H (u, v) H (u,v) | N (u, v) | / | F(u,v) |
2 2 2
2
N (u, v) is the power spectrum of noise
2
F (u, v) is the power spectrum of undegraded image
The Formulation (Cont.)
u0 v0
M 1 N 1
fˆ(x, y) 2
u0 v0
The Formulation
1 H (u, v) 2
F̂ (u,v) G(u,v)
H (u, v) H (u,v) | N (u, v) | / | F (u,v) |
2 2 2
An approximation
1 H (u, v)
2
F̂(u, v) G(u, v)
H (u, v) H (u, v) K
2
Example 2 – Motion Blur + Additive Noise
Inverse Wiener
filtering filtering
Noise level