Professional Documents
Culture Documents
INTRODUCTION
PROBLEM DESCRIPTION
388
image
segmentation
SELECTED SEGMENTATION
TECHNIQUES
A. K-means Clustering
K-means clustering technique is a well known and an
elementary method that computes the k-means of any number
of clusters in any data sets. Here, it is used for color image
segmentation, where it partitions the colors of the image into
k-clusters and calculates the center of each cluster by taking
its mean to represent it. It is an intuitive way of classifying
image pixels into classes or groups (provided the number of
classes is known a priori). It depends on using Euclidean
distance between the pixel and class means based on the
nearest neighbor approach for classification. The basic idea
behind the nearest neighbor rule is that pixels, which fall,
close together are likely to belong to the same class [5]. The
sum of the squared distance between the pixel vector and the
class mean vectors is used as a method of distance
comparison. In this work k-means clustering performs the
segmentation process based on partitioning the color map
into only three clusters (colors are their centers).
B. Rough Set
Dealing with vagueness (i.e. intrinsic uncertainty) is an
important part in reasoning and data analysis logic. A concept
is vague (i.e. not crisp), if it cannot be expressed by some
certain or true concept. Vague concepts have attracted the
attention of researchers for long time since crisp concepts
cannot deal with the uncertain matter of the universe. Rough
sets introduced by Pawlak [6-7] and its extensions are a new
mathematical concept meant to be used in reasoning about
uncertain or vague knowledge. It is used to analyze
incomplete, imprecise, and uncertain and vague data [8].
Data grouping is one of the strong assets of this approach
where it allows the organization of data into easily
recognizable and defined partitions (groups) and gives a
measure of closeness and inclusion of groups in an infinite
universe. In addition to partitioning of data, rough set
determines the boundary region of vagueness. A boundary
region consists of all elements which cannot be defined by
the available concepts [9-10].
When we know what characteristics differ one object from
the other, we are able to qualify objects by looking at their
attribute values [11]. So it is necessary to search for
differences between objects. If we list all objects on the row
axis and the column axis, the discernibility matrix is
constructed. In each entry of the matrix, we state the
differences between the object corresponding to the row axis
and the object corresponding to the column axis. Details for
the implementation of this approach are available in [12].
C. Topological Derivative
Topological Derivative (TD) allows us to quantify the
sensitivity of a problem when the domain under consideration
is perturbed by the introduction of a heterogeneity (hole,
(1)
389
390
0.7
TP R
0.6
0.5
0.4
0.3
0.2
0.1
0
0.1
0.2
0.3
0.4
0.5
FP R
0.6
0.7
0.8
0.9
0.7
REFRENCES
TP R
0.6
0.5
K -m eans
Rough S et
TD
W aters hed
0.4
0.3
[1]
0.2
0.1
0
0.1
0.2
0.3
0.4
0.5
FP R
0.6
0.7
0.8
0.9
TPR
CONCLUSION
0.5
K -m eans
Rough S et
TD
W atershed
0.4
0.3
0.2
0.1
0
0.1
0.2
0.3
0.4
0.5
FP R
0.6
0.7
0.8
0.9
391
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
392