본문 바로가기
  • Home

Noisy Image Segmentation via Swarm-based Possibilistic C-means

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2018, 23(12), pp.35-41
  • DOI : 10.9708/jksci.2018.23.12.035
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : November 12, 2018
  • Accepted : December 10, 2018
  • Published : December 31, 2018

Yu Jeong Min 1

1한국전통문화대학교

Accredited

ABSTRACT

In this paper, we propose a swarm-based possibilistic c-means(PCM) algorithm in order to overcome the problems of PCM, which are sensitiveness of clustering performance due to initial cluster center’s values and producing coincident or close clusters. To settle the former problem of PCM, we adopt a swam-based global optimization method which can be provided the optimal initial cluster centers. Furthermore, to settle the latter problem of PCM, we design an adaptive thresholding model based on the optimized cluster centers that yields preliminary clustered and un-clustered dataset. The preliminary clustered dataset plays a role of preventing coincident or close clusters and the un-clustered dataset is lastly clustered by PCM. From the experiment, the proposed method obtains a better performance than other PCM algorithms on a simulated magnetic resonance(MR) brain image dataset which is corrupted by various noises and bias-fields.

Citation status

* References for papers published after 2023 are currently being built.