Professional Documents
Culture Documents
Processing
Dr. P. Arulmozhivarman
Associate Processor
School of Electrical Sciences
VIT University
Principal application areas
Spatial Spectral
Pre-Processing
Enhancement Restoration
Point Processing Masking Filtering Degradation Models Inverse Filtering Wiener Filtering
Compression
Segmentation
Edge Detection
Description
Enhancement Restoration
• Inverse filtering
Spatial Spectral • Wiener filtering
Domain Domain
Filtering
Point Processing Spatial filtering • fft2/ifft2
•imadjust •filter2 • fftshift
•histeq
Image restoration attempts to restore images
that have been degraded
Identify the degradation process and attempt to
reverse it
Similar to image enhancement, but more objective
Filtering to Remove Noise
We can use spatial filters of different kinds
to remove different kinds of noise
The arithmetic mean filter is a very simple
one and is calculated as follows:
ˆf ( x, y ) 1
g ( s, t )
mn ( s ,t )S xy
This is implemented as the
1/ 9 1/ 9 1/ 9 simple smoothing filter
1
/9 1/ 9 1/ 9
Blurs the image to remove
noise
1/ 9 1/ 9 1/ 9
Other Means
Harmonic Mean:
mn
fˆ ( x, y )
1
( s ,t )S xy g ( s, t )
Works well for salt noise, but fails for pepper
noise
Also does well for other kinds of noise such as
Gaussian noise
Other Means (cont…)
Contraharmonic Mean:
g ( s, t )
( s ,t )S xy
Q 1
fˆ ( x, y )
g ( s, t )
( s ,t )S xy
Q
Median Filter:
fˆ ( x, y ) mean{g ( s, t )}
( s ,t )S xy
Excellent at noise removal, without the
smoothing effects that can occur with other
smoothing filters
Particularly good when salt and pepper noise
is present
Max and Min Filter
Max Filter:
fˆ ( x, y ) max {g ( s, t )}
( s ,t )S xy
Min Filter:
fˆ ( x, y) min {g ( s, t )}
( s ,t )S xy
Max filter is good for pepper noise and min is
good for salt noise
Midpoint Filter
Midpoint Filter:
ˆf ( x, y ) 1 max {g ( s, t )} min {g ( s, t )}
2 ( s ,t )S xy ( s ,t )S xy
Good for random Gaussian and uniform
noise
Alpha-Trimmed Mean Filter
Points
Lines
Edges
| R | T
T: nonnegative threshold:
9
R w1 z1 w2 z2 ... w9 z9 wi zi
i 1
Point Detection
R1 R2 R3 R4
Assumption:
the regions are sufficiently homogeneous, so that
the transition between two regions can be
determined on the basis of gray-level
discontinuities alone.
Image Segmentation
Edge Detection
Basic Idea:
f
Gx x
F f
G y
y
f | Gx | | Gy |
Gy
Direction angle of ∇f at (x,y): a( x, y) tan
1
Gx
Image Segmentation
Image Segmentation
Image Segmentation
Image Segmentation
Image Segmentation
Gradient Operators
Gy ( z3 2 z6 z9 ) ( z1 2 z4 z7 )
Summary: Gradient Operators
Positive: leading
Negative: trailing
Zero: in constant gray levels
2
f 2
f
f 2 2
2
(of a 2-D function f(x,y)):
x y
2 f 4 z5 ( z2 z4 z6 z8 )
Laplacian
The idea:
Laplacian
r 2 2 r 2
h 4 exp 2
2
2
where r2 = x2 + y2.
determines the degree of blurring that occurs.
Image Segmentation
Image Segmentation
Thank you!