Computer Vision
COURSE CODE BAI151A
CREDITS 03
KOUSHIK G
Module 3
Image Restoration and Reconstruction
A model of Image degradation/restoration process,
Restoration in the presence of noise only, periodic noise reduction by
frequency domain filtering.
Image Segmentation
Fundamentals, Point, Line and edge detection, thresholding
(Foundation & Basic global thresholding only),
Segmentation by region growing & region splitting & merging.
Image Degradation Model
Periodic noise
• Periodic noise in an image arises typically from electrical or
electromechanical interference during image acquisition.
• Periodic noise can be significantly reduced via frequency domain filtering.
• The parameters of periodic noise typically are estimated by inspection of the
Fourier spectrum of the image.
• The simplest way to use the data from the image strips is to calculate the
mean and variance of the gray levels.
Restoration in the presence of Noise only- Spatial filtering:
When the only degradation present in an image is noise, i.e.
g(x,y)=f(x,y)+η(x,y)
or
G(u,v)= F(u,v)+ N(u,v)
The noise terms are unknown, so subtracting them from g(x,y) or G(u,v) is not
realistic.
In the case of periodic noise, it is possible to estimate N(u,v) from the spectrum
G(u,v).
So N(u,v) can be subtracted from G(u,v) to obtain an estimate of the original
image. Spatial filtering can be done when only additive noise is present.
The following techniques can be used to reduce the noise effect:
i) Mean Filter: (ii) Order Statistics Filter (iii) Adaptive Filters
Arithmetic Mean filter:
It is the simplest mean filter. Let Sxy represents the set of coordinates in the sub-
image of size m*n centered at point (x,y).
The arithmetic mean filter computes the average value of the corrupted image
g(x,y) in the area defined by Sxy. The value of the restored image f at any point
(x,y) is the arithmetic mean computed using the pixels in the region defined by
Sxy.
This operation can be using a convolution mask in which all coefficients have a
value 1/mn
A mean filter smoothers local variations in the image Noise is reduced as a result
of blurring.
For every pixel in the image, the pixel value is replaced by the mean value of its
neighboring pixels with a weight.
This will resulted in a smoothing effect in the image.
Geometric Mean filter:
An image restored using a geometric mean filter is given by the expression
Here, each restored pixel is given by the product of the pixel in the sub-image
window, raised to the power 1/mn.
A geometric mean filters but it to loose image details in the process.
Harmonic Mean filter:
The harmonic mean filtering operation is given by the expression
The harmonic mean filter works well for salt noise but fails for pepper noise. It
does well with Gaussian noise also.
Order statistics filter:
Order statistics filters are spatial filters whose response is based on ordering the
pixel contained in the image area encompassed by the filter. The response of the
filter at any point is determined by the ranking result.
Median filter:
It is the best-order statistic filter; it replaces the value of a pixel by the median of
gray levels in the Neighborhood of the pixel.
The original pixel is included in the computation of the median of the filter are
quite possible because for certain types of random noise, they provide excellent
noise reduction capabilities with considerably less blurring than smoothing filters
of similar size. These are effective for bipolar and unipolar impulse noise.
Max and Min filter:
Using the l00th percentile of a ranked set of numbers is called the max filter and
is given by the equation
It is used for finding the brightest point in an image. Pepper noise in the image
has very low values, it is reduced by max filter using the max selection process in
the sublimated area sky.
The 0th percentile filter is min filter This filter is useful for flinging the darkest
point in image. Also, it reduces salt noise of the min operation.
This filter works best for randomly distributed noise like Gaussian or
uniform noise.
Periodic Noise by Frequency domain filtering
BAND REJECT FILTER
These filters are mostly used when the location of noise component in the frequency
domain is known. Sinusoidal noise can be easily removed by using these kinds of filters
because it shows two impulses that are mirror images of each other about the origin. Of
the frequency transform.
BAND PASS FILTER
NOTCH FILTER
OPTIMUM NOTCH FILTER
The differences between the image enhancement and image restoration.
❖ Image enhancement techniques are heuristic procedures designed to manipulate
an image in order to take advantage of the psychophysical aspects of the human
system. Whereas image restoration techniques are basically reconstruction
techniques by which a degraded image is reconstructed by using some of the prior
knowledge of the degradation phenomenon.
❖ Image enhancement can be implemented by spatial and frequency domain
technique, whereas image restoration can be implement by frequency domain and
algebraic techniques.
❖ The computational complexity for image enhancement is relatively less when
compared to the computational complexity for image restoration, since algebraic
methods requires manipulation of large number of simultaneous equation. But,
under some condition computational complexity can be reduced to the same level
as that required by traditional frequency domain technique.
❖ Image enhancement techniques are problem oriented, whereas image
restoration techniques are general and are oriented towards modeling the
degradation and applying the reverse process in order to reconstruct the
original image.
❖ Masks are used in spatial domain methods for image enhancement, whereas
masks are not used for image restoration techniques.
❖ Contrast stretching is considered as image enhancement technique because it
is based on the pleasing aspects of the review, whereas removal of ’ image blur
by applying a deblurring function is considered as a image restoration
technique.
Segmentation
Segmentation subdivides an image into its constituent regions or objects, until the objects of interest in an application
have been isolated.
• A Step edge is characterized by a transition
between 2 intensity levels occurring ideally over
the distance of one pixel.
• Ideal edge – occur over the distance of one pixel,
provided that no additional processing is used
• The slop of the ramp is inversely proportional to
the degree to which the edge is blurred
A Step edge is characterized by a transition between 2 intensity
levels occurring ideally over the distance of one pixel.
Ideal edge – occur over the distance of one pixel, provided that
no additional processing is used
The slop of the ramp is inversely proportional to the degree to
which the edge is blurred
Two principal approaches
• Edge-based segmentation
– partition an image based on abrupt changes in intensity (edges)
• Region-based segmentation
– partition an image into regions that are similar according to a set of predefined
criteria.
Module 4
Color Image Processing
Color fundamentals, colour models, Pseudo color image processing, full-
colour image processing, colour transformations, colour image smoothing
and sharpening, Using colour in image segmentation, and Noise in
colour images.
Module 5
Morphological Image Processing
Preliminaries, Erosion and Dilation, opening and closing, Hit-or miss transform
some basic morphological algorithms.
Feature Extraction
Background, Boundary preprocessing (Boundary following & Chain codes only).
Image pattern Classification
Background, Patterns and classes, Pattern classification by prototype matching
(Minimum distance classifier only).