Scribd
Upload
14 views23 pages

Chapter4 Region Segmentation

Uploaded by

anitasjadhav
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
14 views23 pages

Chapter4 Region Segmentation

Uploaded by

anitasjadhav
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/ 23

Region-Based Segmentation

Segmentation may be regarded as spatial clustering:


– clustering in the sense that pixels with similar values are
grouped together, and
– spatial in that pixels in the same category also form a single
connected component.

1
Why Region-Based Segmentation?

• Segmentation
– Edge detection and
Thresholding not always
effective.

• Homogenous regions
– Region-based segmentation.
– Effective in noisy images.
Definitions
• Based on sets.
R7

• Each image R is a set of R6

R1
regions Ri. R5

– Every pixel belongs to one R2 R3

R4
region.
– One pixel can only belong to a
S
single region.
R  Ri Ri R j  
i 1
R7
R6

R1
R5

R2
R3

R4
VC 14/15 - TP9 - Region-Based Segmentation
Basic Formulation
a) Every pixel must be in a region
b) Points in a region must be connected.
c) Regions must be disjoint.
d) All pixels in a region satisfy specific properties.
e) Different regions have different properties.
How do we form regions?
• Region Growing
• Region Merging
• Region Splitting
• Split and Merge
• Watershed
• ...

What a computer sees


Region Growing

1. Region growing is a procedure that groups pixels or subregions into larger regions.

2. The simplest of these approaches is pixel aggregation, which starts with a set of “seed”
points and from these grows regions by appending to each seed points those neighboring
pixels that have similar properties (such as gray level, texture, color, shape).

3. Region growing based techniques are better than the edge-based techniques in noisy
images where edges are difficult to detect.

7
07/15/2024
Region growing
• Groups pixels into larger • Iterative process
regions. – How to start?
• Starts with a seed region. – How to iterate?
• Grows region by merging – When to stop?
neighboring pixels.
Finish

Initial Stop
Iterations
Regions Condition
Similarity Criteria
• Homogeneity of regions is used as the main
segmentation criterion in region growing.
– gray level
– color, texture
– shape Choice of criteria
affects segmentation
– model results dramatically!
– etc.
11
07/15/2024
4-connectivity

12
07/15/2024
8-connectivity

13
07/15/2024
VC 14/15 - TP9 - Region-Based Segmentation
Example: Region Growing based on 8-connectivity

f ( x, y ) : input image array


S ( x, y ): seed array containing 1s (seeds) and 0s
Q( x, y ): predicate

TRUE if the absolute difference of the intensities



Q between the seed and the pixel at (x,y) is  T
 FALSE otherwise

07/15/2024 15
Example: Region Growing based on 8-connectivity
1. Find all connected components in S ( x, y) and erode each
connected components to one pixel; label all such pixels
found as 1. All other pixels in S are labeled 0.
2. Form an image fQ such that, at a pair of coordinates (x,y),
let fQ ( x, y )  1 if the Q is satisfied otherwise fQ ( x, y )  0.
3. Let g be an image formed by appending to each seed point
in S all the 1-value points in fQ that are 8-connected to that
seed point.
4. Label each connencted component in g with a different region
label. This is the segmented image obtained by region growing.
07/15/2024 17
Region splitting
• Algorithm
R1 R2
– One initial set that includes the
R1
whole image. R3 R4
– Similarity criteria.
– Iteratively split regions into sub-
regions.
– Stop when no more splittings are
R1 R2
possible. R1 R2 R3

R4 R5
R3
R4 R5 R6 R7 R6 R7

VC 14/15 - TP9 - Region-Based Segmentation


Region Split-and-Merge
• The algorithm operates in two stages:
• The first stage is the splitting one. Initially, the variance of the
whole image is calculated. If this variance exceeds the specified
limit, then the image is subdivided into four quadrants.
• Similarly, if the variance in any of these four quadrants exceeds
the limit it is further subdivided into four.
• This continues until the whole image consists of a set of squares
of varying sizes, all of which have variances below the limit.
• Squares are smaller in non-uniform parts of the image.
Region Split-and-Merge
• The second stage of the algorithm, the merging one, involves
amalgamating squares which have a common edge, provided that
by so doing the variance of the new region does not exceed the
limit.
• Once all amalgamations have been completed, the result is a
segmentation in which every region has a variance less than the set
limit.
• However, although the result of the first stage in the algorithm is
unique, that from the second is not - it depends on the order of
which squares are considered.
Quadtree Algorithm

21
07/15/2024
VC 14/15 - TP9 - Region-Based Segmentation

You might also like