Scribd
Upload
28 views1 page

Nt/split HTM

Splitting and merging attempts to divide an image into uniform regions by using a pyramidal structure. It starts by treating the whole image as a single region, then computes a homogeneity criterion to determine if the region should be split into four smaller sub-regions. This process repeats on each sub-region until no further splitting is needed. Uniformity is determined by comparing the standard deviation of pixel intensities to a threshold. Merging is more complex and compares pairs of regions based on the difference between their average intensities.

Uploaded by

Rajasekhar Nannapaneni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
28 views1 page

Nt/split HTM

Splitting and merging attempts to divide an image into uniform regions by using a pyramidal structure. It starts by treating the whole image as a single region, then computes a homogeneity criterion to determine if the region should be split into four smaller sub-regions. This process repeats on each sub-region until no further splitting is needed. Uniformity is determined by comparing the standard deviation of pixel intensities to a threshold. Merging is more complex and compares pairs of regions based on the difference between their average intensities.

Uploaded by

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

http://homepages.inf.ed.ac.

uk/rbf/CVonline/LOCAL_COPIES/MARBLE/medium/segme
nt/split.htm

Splitting and merging attempts to divide an image into uniform regions. The basic
representational structure is pyramidal, i.e. a square region of size m by m at one
level of a pyramid has 4 sub-regions of size by below it in the pyramid.
Usually the algorithm starts from the initial assumption that the entire image is a
single region, then computes the homogeneity criterion to see if it is TRUE. If
FALSE, then the square region is split into the four smaller regions. This process is
then repeated on each of the sub-regions until no further splitting is necessary.

Set ProcessList = IMAGE


Repeat
Extract the first element of ProcessList
If the region is uniform then add to RegionList
Else split the region into 4 sub-regions and add these to
ProcessList
Until ( all regions removed from ProcessList)

Uniformity is determined on the basis of homogeneity of property as in the


previous examples. For a grey level image, say, a region is said to be statistically
homogeneous if the standard deviation of the intensity less than some threshold
value, where the standard deviation is given by,

and is the mean intensity of the N pixels in the region. Whereas splitting is quite
simple, merging is more complex. Different algorithms are possible, some use the
same test for homogeneity but others use the difference in average values.
Generally, pairs of regions are compared, allowing more complex shapes to
emerge.

A program in use at Heriot-Watt is spam ( split and merge) which takes regions a
pair at a time and uses the difference of averages to judge similarity, i.e. merge
region A with neighbouring region B if the difference in average intensities of A
and B is below a threshold.

You might also like