Scribd
Upload
22 views107 pages

Unit 4-Image Restoration

Uploaded by

Harry Muller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views107 pages

Unit 4-Image Restoration

Uploaded by

Harry Muller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 107

Digital Image Processing

Chapter 4: Image Restoration


A Model of the Image
Degradation/Restoration Process
⚪ Degradation
●Degradation function H
●Additive noise
●Spatial domain

●Frequency domain
⚪ Restoration
Noise Models
⚪ Sources of noise
●Image acquisition, digitization,
transmission
⚪ White noise
●The Fourier spectrum of noise is
constant
⚪ Assuming
●Noise is independent of spatial
coordinates
●Noise is uncorrelated with respect to
the image itself
⚪ Gaussian noise
●The PDF of a Gaussian random variable,
z,

●Mean:
●Standard deviation:
●Variance:
●70% of its values will be in the range

●95% of its values will be in the range


⚪ Rayleigh noise
●The PDF of Rayleigh noise,

●Mean:

●Variance:
⚪ Erlang (Gamma) noise
●The PDF of Erlang noise, , is
a positive integer,

●Mean:

●Variance:
⚪ Exponential noise
●The PDF of exponential noise, ,

●Mean:

●Variance:
⚪ Uniform noise
●The PDF of uniform noise,

●Mean:

●Variance:
⚪ Impulse (salt-and-pepper) noise
●The PDF of (bipolar) impulse noise,

● : gray-level will appear as a


light dot, while level will appear like
a dark dot
●Unipolar: either or is zero
●Usually, for an 8-bit image, =0
(black) and =0 (white)
⚪ Modeling
●Gaussian
⚪Electronic circuit noise, sensor noise due
to poor illumination and/or high
temperature
●Rayleigh
⚪Range imaging
●Exponential and gamma
⚪Laser imaging
●Impulse
⚪Quick transients, such as faulty switching
●Uniform
⚪Least descriptive
⚪Basis for numerous random number
generators
⚪ Periodic noise
●Arises typically from electrical or
electromechanical interference
●Reduced significantly via frequency
domain filtering
⚪ Estimation of noise parameters
●Inspection of the Fourier spectrum
●Small patches of reasonably constant
gray level
⚪For example, 150*20 vertical strips
⚪Calculate , , , from
Restoration in the Presence of Noise
Only-Spatial Filtering

⚪ Degradation
●Spatial domain

●Frequency domain
⚪ Mean filters
●Arithmetic mean filter

●Geometric mean filter


●Harmonic mean filter
⚪Works well for salt noise, but fails fpr
pepper noise
●Contraharmonic mean filter
⚪ : eliminates pepper noise
⚪ : eliminates salt noise
⚪ Usage
●Arithmetic and geometric mean filters:
suited for Gaussian or uniform noise
●Contraharmonic filters: suited for
impulse noise
⚪ Order-statistics filters
●Median filter
⚪Effective in the presence of both bipolar
and unipolar impulse noise
●Max and min filters
⚪max filters reduce pepper noise

⚪min filters salt noise


●Midpoint filter
⚪Works best for randomly distributed noise,
like Gaussian or uniform noise
●Alpha-trimmed mean filter
⚪Delete the d/2 lowest and the d/2 highest
gray-level values
⚪Useful in situations involving multiple
types of noise, such as a combination of
salt-and-pepper and Gaussian noise
⚪ Adaptive, local noise reduction filter
●If is zero, return simply the value of
●If , return a value close to

●If , return the arithmetic mean


value
●Algorithm:
●Level A: A1=
● A2=
● If A1>0 AND A2<0, Go to
● level B
● Else increase the window size
● If window size
● repeat level A
● Else output
●Level B: B1=
● B2=
● If B1>0 AND B2<0, output
● Else output
●Purposes of the algorithm
⚪Remove salt-and-pepper (impulse) noise
⚪Provide smoothing
⚪Reduce distortion, such as excessive
thinning or thickening of object
boundaries
Periodic Noise Reduction by
Frequency Domain Filtering

⚪ Bandreject filters
●Ideal bandreject filter
●Butterworth bandreject filter of order n

●Gaussian bandreject filter


⚪ Bandpass filters
⚪ Notch filters
●Ideal notch reject filter
⚪ Butterworth notch reject filter of
order n
⚪ Gaussian notch reject filter
⚪ Notch pass filter
⚪ Optimum notch filtering
●Interference noise pattern

●Interference noise pattern in the spatial


domain

●Subtract from a weighted


portion of to obtain an
estimate of
●Minimize the local variance of
●The detailed steps are listed in Page
251
●Result
Linear, Position-Invariant Degradations

⚪ Input-output relationship
⚪ H is linear if

●Additivity
●Homogeneity

●Position (or space) invariant


●In terms of a continuous impulse
function
●Impulse response of H

●In optics, the impulse becomes a point


of light
●Point spread function (PSF)

●All physical optical systems blur


(spread) a point of light to some degree
●Superposition (or Fredholm) integral of
the first kind
●If H is position invariant

●Convolution integral
⚪ In the presence of additive noise

●If H is position invariant


●If H is position invariant

●Restoration approach
⚪Image deconvolution
⚪Deconvolution filter
Estimating the Degradation Function

⚪ Estimation by image observation


●In order to reduce the effect of noise in
our observation, we would look for
areas of strong signal content
⚪ Estimation by experimentation
●Obtain the impulse response of the
degradation by imaging an impulse
(small dot of light) using the same
system settings

●Observed image
●The strength of the impulse
⚪ Estimation by modeling
●Hufnagel and Stanley
●Physical characteristic of atmospheric
turbulence
●Image motion
●Where
●If and
●If and
Inverse Filtering

⚪ Direct inverse filtering


●Limiting the analysis to frequencies
near the origin
Minimum Mean Square Error (Wiener)
Filtering

⚪ Minimize

⚪ Terms
● = degradation function
●
● = complex conjugate of
●
● =
●
● = power spectrum of
the noise
● = power spectrum of
the undegraded image
⚪ Wiener filter
●White noise
Constrained Least Squares Filtering

⚪ Vector-matrix form

● , , :
● :
⚪ Minimize

●Subject to
⚪ The solution

●Where is the Fourier transform


of the function
⚪ Computing by iteration

●Adjust so that
●Computation
●Algorithm
●1: Specify an initial value of
●2: Compute
●3: Stop if is satisfied;
otherwise return to Step 2 after
increasing if or

●decreasing if .
Geometric Mean FIlter
Geometric Transformations

⚪ Spatial transformations

●Tiepoints
●Bilinear equations
⚪ Gray-level interpolation

You might also like