Image Restoration
Image Restoration
Image Restoration
Image Restoration
The more that is known about H and the noise term the closer the
estimate can be
Goal of restoration is
f ( x, y ) f ( x, y )
If H is a linear, position invariant process, then the degraded image
can be described as the convolution of h and f with an added noise
term
g(x,y)=h(x,y)*f(x,y)+(x,y)
G(u,v)=H(u,v)F(u,v)+N(u,v)
Noise models
Gaussian noise
Rayleigh noise
Exponential noise
Uniform noise
Gaussian noise
a>0
If b>a then any pixel with intensity b will appear as a light dot in the
image
ps(zi), i=0,1,2,L-1
The shape of the noise histogram identifies the closest PDF match.
If the shape is Gaussian, then the mean and variance are all that is
needed to construct a model for the noise (i.e. the mean and the
variance completely define the Gaussian PDF)
Mean filters
Order-Statistic filters
Adaptive filters
Mean filters
Order-Statistic filters
Median filter
Midpoint filter
Median filter
Replaces the value of a pixel by the median of the pixel values in the
neighborhood of that pixel
Midpoint filter
Adaptive filters
All filters considered thus far are applied to an image without regard
for how image characteristics may vary from one point to another in
the image
If this is not true then a simple test could set the ratio of
the variances to one if 2 > 2L L
The output of the filter is a single value that will be used to replace
the center value of Sx,y
If taking the Fourier transform of periodic noise and display that the
corresponding uv locations in fourier transformation plane very
bright dots will get
Bandreject
Bandpass
Notch Filter
Bandreject filters
Assume the following:
Bandpass filters
HBP(u,v)=1- HBR(u,v)
Notch filters
The constant D0k is the same for each pair of notches, but can be
different for different pairs
A notch pass filter can be expressed as
f x , y g x , y w x , y x , y
x, y F 1 H u, v G u, v
g x, y x, y g x, y x, y
w x, y
2 x, y 2 x, y
To obtain w(x,y) the goal is to minimize the variance in the
neighborhood of x,y in the image
1. Estimation by Observation;
2. Estimation by Experimentation;
Let denote the original subimage by gs(x,y) and the its restored
version by , we can assume
Gs (u, v)
H s (u, v)
Fs (u, v)
From the characteristics of this function, we then deduce the
complete degradation function H(u,v) based on the assumption of
position invariance.
The degradation is
For instance, assuming that the image motion is at a rate x0(t) = at/T
and y0(t) = bt/T, the degradation function will be:
Note: very important topics
(1) Weiner(minimum mean square error) filtering (Refer
Gonzalez page no: 374-377)
(2) Direct inverse filtering (Refer Gonzalez page no: 373-374)
(3) Estimating the degradation function ( by observation,
experimentation and modelling)
(4) Periodic noise reduction by frequency domain filtering (
make understand what is periodic noise also)
(5) Noise models ( Gaussian, Rayleigh, exponential, erlang,
uniform,impulse)
(6) Restoration in the presence of noise-only spatial filtering
(Mean filters, order statistic filters, adaptive filters)
(7) Image degradation/restoration model