Академический Документы
Профессиональный Документы
Культура Документы
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
E-MAIL: juzengwei@hust.eud.cn.jzchen@hust.edu.cn.jlzhou@hust.edu.cn
Abstract:
On
the
base
of
edge
detection
using
the
K-means
image
proposed
segmentation
method
disadvantages
of
can
algorithm
enhance
edge-based
is
proposed.
advantages
and
clustering
and
The
avoid
methods
by
(AC)
algorithm
and
reduces
its
complexity.
Keywords:
Image
segmentation;
Edge
detection;
K-means;
1.
Introduction
297
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
application prospects. It will be introduced to tackle the
edge detection problem in this paper.
Based on aforementioned, we propose a simple and
efficient image segmentation algorithm which is based on
edge and clustering and takes the advantages of both. Of
particular importance is embedding clustering in
edge-based method. An improved ACO using k-means is
used to detect edge information. The proposed algorithm
based on superior edge detection achieves better
performance compared with the existing image
segmentation methods.
The contribution of this paper is threefold. Firstly, the
clustering is embedded in edge detection, combining
edge-based and clustering methods in a novel way.
Secondly, the combination and flexible use of various
algorithms enhance advantages and avoid disadvantages of
these methods. Thirdly, the algorithm determines clustering
centers roughly using K-means to address the problem of
slow convergence of the traditional AC algorithm.
The paper is organized as follows. Section 2 presents a
review of the existing approaches and motivations to
develop the new algorithm. Section 3 describes the
framework and procedure of the current work. In section 4,
the experiment is carried out to demonstrate the superiority
of the proposed approach. Finally, we conclude the current
work with brief discussion about the future directions in
Section 5.
2.
Proposed algorithm
298
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
the ant
choosing
x.
J
and fJ (
a >
)r(n:-1)
:
lJ
otherwise
(4)
3.3 The K-means algorithm
K-means clustering is an algorithm to classify or to
group the objects based on attributes or features into K
clusters. K is a positive integer number. The grouping is
done by minimizing the distances between data and the
corresponding cluster center. The K-means algorithm
basically consists of three steps:
for
coefficient.
...
-------
0i
ak
parameters
IJ
construction-step, and
(ri-I) r h,j Y
(n)_
((n-1)): \B
Pi,j - L En; ri,j J rhj J
,(n-l)
',J
X
1
jE 0i
(2)
otherwise
X"
J
going form
n. ,
'I,,
}
X'
j
C1,
. . .
minimum distance.
299
'
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
Ci, i
, ,
where C i
1
Nj
_
_
LX
XESj
and Ni is
X(x)
smoothed image
S(x)
and
E(x).
(5)
300
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
301
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
such as Sobel, Canny and AC. Therefore, the proposed
algorithm can achieve superior segmentation performance
among edge-based methods. Figure 3(a) and 3(b) illustrate
the segmentation using the proposed algorithm and
clustering respectively. Especially, black, white, light gray
and dark gray or more grays can be used to specify the
clusters and enhance visual comparison results in the latter
method.
Conclusions
[1]
[2]
[3]
[4]
(b) Clustering
Figure 3. Segmentation comparison
302
Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, Tianjin, 14-17 July, 2013
[5]
[6]
[7]
[8]
[9]
[ 1 0]
[1 1]
[ 1 2]
[ 1 3]
[ 1 4]
303
[ 1 5]
[ 1 6]
[ 1 7]
[18]
[ 1 9]
[20]
[21 ]
[22]
[23]