Clustering is a fundamental problem for a great variety fields such as pattern recognition, computer vision. A popular
technique for clustering is based on K-means. However, it suffers from the four main disadvantages. Firstly, it is slow
and scales poorly on the time. Secondly, it is often impractical to expect a user to specify the number of clusters. Thirdly,
it may find worse local optima. Lastly, its performance heavily depends on the initial clustering centers. To overcome the
above four disadvantages simultaneously, an effectively adaptive K-means clustering algorithm (AKM) is proposed in
this paper. The AKM estimates the correct number of clusters and obtains the initial centers by the segmentation of the
norm histogram in the linear normed space consisting of the data set, and then performs the local improvement heuristic
algorithm for K-means clustering in order to avoid the local optima. Moreover, the kd-tree is used to store the data set for
improving the speed. The AKM was tested on the synthetic data sets and the real images. The experimental results
demonstrate the AKM outperforms the existing methods.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.