OAK

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

Metadata Downloads
Abstract
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.
Author(s)
Yu, JeongminLee, Sung-HeeJeon, Moongu
Issued Date
2012-06
Type
Article
URI
https://scholar.gist.ac.kr/handle/local/15920
Publisher
ICIC INTERNATIONAL
Citation
International Journal of Innovative Computing Information and Control, v.8, no.6, pp.3907 - 3918
ISSN
1349-4198
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.