Scribd
Upload
470 views13 pages

Digital Image Processing - Region Based Splitting & Merging

Region-based segmentation involves dividing an image into smaller regions based on predetermined rules, such as pixel intensity. The process includes region splitting and merging, where an image is first subdivided into disjoint regions and then connected regions are merged based on logical predicates. The quad tree representation illustrates the hierarchical structure of these regions and their subdivisions.

Uploaded by

Jeya Bright
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
470 views13 pages

Digital Image Processing - Region Based Splitting & Merging

Region-based segmentation involves dividing an image into smaller regions based on predetermined rules, such as pixel intensity. The process includes region splitting and merging, where an image is first subdivided into disjoint regions and then connected regions are merged based on logical predicates. The quad tree representation illustrates the hierarchical structure of these regions and their subdivisions.

Uploaded by

Jeya Bright
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/ 13

REGION BASED SEGMENTATION:

The process of dividing an image into smaller


regions is based upon some predetermined rule that
how to group the pixels into one logical region.

Example:
All pixels within region must be exactly
the same gray level.

All pixels greater than a given threshold


are combined together to form one region.
Basic Rules for Segmentation:

R is the entire region, R is subdivided into n


number of sub regions (i.e) R1, R2, R3 and R4

n
(i). U Ri = R, the segmentation process is completed.
i=1

(ii). Ri is a connected region for i = 0,1,2……n


(iii). Ri ∩ Rk = Ф for all I and k it shows that , the region
must be disjoint.

(iv). P(Ri) = True for i = 0,1,2……n it shows that all the


pixels in the region have same intensity.

(v). P(Ri U Rk) = False for i≠k it shows that, the regions Ri
and Rk are different in the sense of the predicate P.
REGION SPLITTING AND MERGING:

Region splitting and merging an image is divided


into various sub images of disjoint regions and then
merge the connected regions together.

R is the entire region of an image.

The predicate P(Ri) is used to check the conditions in any


region P(Ri) = True.
An image is sub divided into various sub image if
P(Ri) = False, then divided the image into quadrants,
then further divide the quadrant into sub quadrant.

R R
1 2
R
R R
3 4
R Region is sub divided in to subdivided images
R1, R2, R3 and R4again the Region R4 is divided into
quadrants

R R
1 2
R
R4 R4
1 2
R
R4 R4
3 3 4
R

R3
R1 R4
R2
R41
R44
R42
R43
Example for split and merge algorithm is shown below

Initially an image is divided into four regions R1,


R2, R3 and R4.

R1, R2, R3 and R4 are divided into 16 sub


regions, in the region R2 and R23 can be further sub
divided shown below.

Its corresponding quad tree representation


is given below
R

R4 R44

R1
R43

R14
R11 R41 R42

R12
R13 R2
R24
R21

R22
R3 R34
R23

R31
R231 R33
R234
R32
R232 R233
Quad tree gives the region division of the image r
is the four-overlapping of the image. in the next level is
the sub division of these four regions into four smaller
regions.

The final level shows the sub division of R23 into


four regions.
After the image has been split into regions that
meet the logical predicate requirement. Regions which
have the same predicate requirement are merged to form
a new enlarged region.

The process of splitting an image into small


regions and then merging connected regions together is
known as region segmentation by splitting and merging.
Thank you

You might also like