AN ADAPTIVE ACO-BASED FUZZY CLUSTERING ALGORITHM FOR NOISY IMAGE SEGMENTATION

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 584
  • Download : 0
The fuzzy c-means (FCM) has been a well-known algorithm in machine learning/data mining area as a clustering algorithm. It can also be used for image segmentation, but the algorithm is not robust to noise. The possibilistic c-means (PCM) algorithm was proposed to overcome such a problem. However, the performance of PCM is too sensitive to the initialization of cluster centers, and often deteriorates due to the coincident clustering problem. To remedy these problems, we propose a new hybrid clustering algorithm that incorporates AGO (ant colony optimization)-based clustering into PCM, namely ACOPCM for noisy image segmentation. Our A CO PCM solves the coincident clustering problem by using pre-classified pixel information and provides the near optimal initialization of the number of clusters and their centroids. Quantitative and qualitative comparisons are performed on several images having different noise levels and bias-fields. Experimental results demonstrate that our proposed approach achieves higher segmentation accuracy than PCM and other hybrid fuzzy clustering approaches.
Publisher
ICIC INT
Issue Date
2012-06
Language
English
Article Type
Article
Keywords

PARTICLE SWARM OPTIMIZATION; C-MEANS ALGORITHM

Citation

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, v.8, no.6, pp.3907 - 3918

ISSN
1349-4198
URI
http://hdl.handle.net/10203/195818
Appears in Collection
GCT-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0