Scribd
Upload
12 views5 pages

Adobe Scan 09-Sept-2024

Uploaded by

Kabilan .s
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views5 pages

Adobe Scan 09-Sept-2024

Uploaded by

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

4.5.

REGION BASED SEGMENTATION


Segmentation is the process of partitioning an image into multiple regions.
Regions are a group of connected Pixels with similar properties. Aregion in an image
can b defined by its border (edge) or its interior. If we know the interior
we can always define the border and vice versa.
In most cases, segmentation should provide a set of regions having the following
properties.
1. Connectivity and Compactness
2. Regularity of boundaries
3. Homogeneity in terms of color or texture
4. Differentiation from neighbor regions.
4.26| Digital Image Processing
region. We want to partition
Let R represent the entire image R
n subregions, R,. R, .... R, such that inio
region.
a. Summation of R, =R-allpixels must belong to a
must be
b. R, is aconnected region for ii =1,2... n-pixeBs in aregion
C. R, nR=. for all i and /. i *j - Regions must be disjoint
connetd
region must allshare the same property
d. P(R)= True for all i-pixels in aregion
P(R,UR) =False, for all i andj, ij, and R, R, are adjacent.
P(R) is a logical predicate defined over all points in R It must be true for olt
pixels inside the region and false for pixels in other regions. Regions R, and R. rs
neighbors if their union forms a connected component.
Types
There are two types of region based segmentation, namely.
1. Region Growing
2. Region Splitting and merging
4.5.1. REGION GROWING

Region growing is aprocedure that groups pixels or sub regions into larger regions
based on predefined criteria for growth. It has the following steps.
An initial set of small areas is iteratively merged according to similarity
constraints.
Start by choosing an arbitrary seed pixel and compare it with neighboring
pixels.
§ Region is grown from the seed pixel by adding in neighboring pixels that are
similar, increasing the size of the region.
When the growth of one region stops we simply choose another seed pixel
which does not yet belong to any region and start again.
This whole process is continued until all pixels belong to some region. It is a
bottom up method.

RegionGrowing algorithm
Let f(x, y) denote an input array, S(*, y) denote aseed array containing 1S at the
locations of seed points and OS elsewhere, and Qdenote a predicate to be applied at
ageSegmetation 4.27

cchlocation ( , y). Arrays j and S are assumed to be of the same size. A basic
region growing algorithm based on
8-connectivity may be stated as follows.
Siep 1
: Find all connected components in S(x, y) and erode cach connected
component to one pixel, label all such pixels found as 1. AIl other
pixels in S are labeled 0.
: Form an image fo such that, at a pair of coordinates (x, y), Let
Step2
fo (I, y)=1 if the input image satisfies the given predicate, Q at
those coordinates, otherwise letfo (x, y) =0
Step 3 : Let g be an image formed by appending to each seed point in S all
the 1-valued points info that are 8-connected to that seed point.
Step 4 : Label each connected component in g with a different region label
i.e., segmented image obtained by region growing
However, starting with a particular seed pixel and letting this region grow
completely before trying other seeds biases the segmentation in favour of the regions
which are segmented first.
This can have several undesirable effects.
Current region dominates the growth process-ambiguities around edges
of adjacent regionsmay not be resolved correctly.
Different choices of seeds may give different segmentation results.
Problems can occur if the (arbitrarily chosen) seed point lies on an edge.

Simultaneous Region Growing


To counter the above problems, simultaneous region growing techniques have
been developed.
& Similarities of neighboring regions are taken into account in the growing
process.
Nosingle region is allowed to completely dominate the proceedings.
A number of regions are allowed to grow at same time.
*Similar regions will gradually coalesce into expanding regions.
Advantages
Easy and efficient to implement on parallel computers.
4.28 Digital Image Processing
4.5.2. REGION SPLITTING AND MERGING
which an
Region Splitting and Merging 0s asegnentation process in reoi, iage
is
regions and then the
initially subdivided into a of arbitrary, disjoint
regions
merged and'or split to satisfy the basic conditions. This is an alternative approachareto
the negion growing method.
lo illustrate the basic principle of split and merge methods, let us consider
imaginary image.
LetR represent the whole innage shown in fig 4.15 (a).
* Not all the pixels in fig 4.15 (a) are similar. So he region is split in
tig 4.15 (b). (ie.,) Q(R) = FALSE
3 Assume that all pixels within each of the regions R, R, and R, are similar
but those in R are not.
3 Therefore R, is split nest, as shown in fig 4.15 (c).

R1 R2 R1 R2
R
R41| R42
Rs R& R3 R4s| R44
(a) whole image (b) First split (c) Second split
Fig. 4.15.
Quadtree
We can also describe the splitting of the image
using a tree structure called quad
tree that is trees in which each node has exactly four
descendants.
The images coiresponding to the nodes of a
quad tree sometimes are called quad
regions or quad images.

R1 R2
Ra1 R42 Ra RA
R43 R44
Ra1 R42 (Ras)
R43 (Ra)
R44)
Fig. 4.16. Quad tree structure of partitioned image
geSegmentation 4.29

the process is stopped only with splitting, the result may have adjacent regions
.-th identical properties. Therefore, further merging as well as splitting is needed.
When the combined pixels of two adjacent regions satisfy the predicate Q, that is,
o adjacent regions R, and R are merged only if
Q(R,UR) = TRUE
Split and Merge Algorithm
Step 1 Split into four disjoint quadrants any region R, for which
Q(R) = FALSE
Step 2 When no further splitting is possible, merge any adjacent regions R
and R for which Q R,UR)= TRUE.
Step 3 Stop when no further merging is possible.

You might also like