Lecture 3 Image Segmentation
Lecture 3 Image Segmentation
groups.
being solved.
tasks.
How Does Image Segmentation Work?
Cont...
There are various neural network designs and implementations suitable
for image segmentation. They usually contain the same basic
components:
An encoder—a series of layers that extract image features using
progressively deeper, narrower filters. The encoder might be pre-
trained on a similar task (e.g., image recognition), allowing it to
leverage its existing knowledge to perform segmentation tasks.
A decoder—a series of layers that gradually convert the encoder’s
output into a segmentation mask corresponding with the input image’s
pixel resolution.
Skip connections—multiple long-range neural network connections
allowing the model to identify features at different scales to enhance
model accuracy.
Why segmentation is useful ?
A. THRESHOLDING
Thresholding is the simplest, powerful and most
frequently/widely used technique for image segmentation
It is useful in discriminating foreground from the
background.
Thresholding operation is used to convert a multilevel/gray
scale image into binary image
The advantage of obtaining first a binary image is that it
reduces the complexity of the data and simplifies the
process of recognition and classification.
Thresholding
The most common way to convert a gray-level image into
a binary image is to select a single threshold
value(T).Then all the gray level values below T will be
classified as black(0) i.e. background and those above T
will be white(1) i.e. objects.
The Thresholding operation is a grey value remapping
operation g defined by:
0 if f(x,y) < T
g(x,y)= Where (x,y) represents a gray value/
1 if f(x,y) ≥ T, are the coordinates of the threshold value poin
T represent threshold value
g(x,y) represents threshold image
f(x,y) represents gray level image pixels/
input image
Thresholding
5 THRESHOLDING TECHNIQUES
1. MEAN TECHNIQUE- This technique used the mean value of the
pixels as the threshold value and works well in strict cases of the
images that have approximately half to the pixels belonging to the
objects and other half to the background.
2. P-TILE TECHNIQUE- Uses knowledge about the area size of the
desired object to the threshold an image.
3. HISTOGRAM DEPENDENT TECHNIQUE (HDT)- separates the two
homogonous region of the object and background of an image.
4. EDGE MAXIMIZATION TECHNIQUE (EMT)- Used when there are
more than one homogenous region in image or where there is a
change of illumination between the object and its background.
5. VISUAL TECHNIQUE- Improve people’s ability to accurately search
for target items.
Segmentation Techniques
B.CLUSTERING
Defined as the process of identifying groups of similar image primitive.
It is a process of organizing the objects into groups based on its
attributes.
An image can be grouped based on keyword (metadata) or its
content (description)
KEYWORD- Form of font which describes about the image
keyword of an image refers to its different features
CONTENT- Refers to shapes, textures or any other information
that can be inherited from the image itself. Image texture is a set
of metrics calculated in image processing designed to quantify the
perceived texture of an image. It gives us information about the
spatial arrangement of colour or intensities in an image or
selected region of an image.
Another Segmentation Approaches
2. Delineate watersheds
From the surface image, pixels within a homogeneous
region form a watershed
3. Merge Segments
Adjacent watershed may be merged to form a new segment
with larger size according to their spectral similarity and a
given generalization level
Region-Oriented Segmentation
Region Splitting
Region growing starts from a set of seed points. Seed points are grid
points selected to agglomerate the surrounding control volumes.
An alternative is to start with the whole image as a single region and
subdivide the regions that do not satisfy a condition of homogeneity.
Region Merging
Region merging is the opposite of region splitting.
Start with small regions (e.g. 2x2 or 4x4 regions) and merge the
regions that have similar characteristics (such as gray level, variance).
Typically, splitting and merging approaches are used iteratively.
19
Split and Merge Approach:
This is a 2 step procedure:
top-down: split image into
homogeneous quadrant regions
bottom-up: merge similar adjacent
regions
The algorithm includes:
Top-down
successively subdivide image into
quadrant regions R i
B. REGION-GROW APPROACH
This approach relies on the homogeneity of spatially
localized features
It is a well-developed technique for image segmentation.
It postulates that neighbouring pixels within the same
region have similar intensity values.
The general idea of this method is to group pixels with the
same or similar intensities to one region according to a
given homogeneity criterion.
Segmentation Approaches
C. EDGE-BASED METHODS
Edge-based methods center around contour detection:
their weakness in connecting together broken contour
lines make them, too, prone to failure in the presence of
blurring.
Segmentation Approaches
D. CONNECTIVITY-PRESERVING RELAXATION-
BASED METHOD
Referred as active contour model
The main idea is to start with some initial boundary shape
represented in the form of spline curves, and iteratively
modify it by applying various shrink/expansion operations
according to some energy function.