New algorithm for colour image segmentation using hybrid k-means clustering
by Abbas H. Hassin Alasadi; Moslem Mohsinn Khudhair
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 4, No. 4, 2012

Abstract: The traditional k-means algorithm is a classical clustering method which is widely used in variant application such as image processing, computer vision, pattern recognition and machine learning. However, the k-means method converges to one of many local minima. It is known that, the final result depends on the initial starting points (means). Generally initial cluster centres are selected randomly, so the algorithm could not lead to the unique result. In this paper, we present a new algorithm which includes three methods to compute initial centres for k-means clustering. First one is called geometric method which depends on equal areas of distribution. The second is called block method which segments the image into uniform areas. The last method is called hybrid and it is a combination between first and second methods. The experimental results appeared quite satisfactory.

Online publication date: Sun, 27-Jan-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com