A fast fuzzy c-means algorithm for colour image segmentation Online publication date: Thu, 19-Dec-2013
by Qigang Liu; Li Zhou; Xiangyang Sun
International Journal of Information and Communication Technology (IJICT), Vol. 5, No. 3/4, 2013
Abstract: Image segmentation as a big part of computer vision has been the hot research topic nowadays. Fuzzy c-means (FCM) algorithm, as the standard and basic approach, is widely adopted by most researchers. In this paper, authors deeply analyse some defects of this technique, such as presetting clustering centre, initialling cluster centres randomly and heavy computation load. To overcome these drawbacks, a novel approach is proposed based on the combination of hierarchal subtractive clustering and fuzzy c-means, in which hierarchal subtractive clustering is introduced for simplifying the cluster centres fixing process and speeding up convergence. A series steps has been offered to imply how to implement this approach, and finally, experiments on two colour images show that, without damaging clustering validity and effectiveness, the novel approach is superior on clustering speed compared to FCM, it is the better choice for dealing with today's high resolution colour images.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Information and Communication Technology (IJICT):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook