Abstract
Background: The kernelled possibilistic C-means clustering algorithm (KPCM) can effectively cluster hyper-sphere data with noise and outliers by introducing the kernelled method to the possibilistic C-means clustering (PCM) algorithm. However, the KPCM still suffers from the same coincident clustering problem as the PCM algorithm due to the lack of between-class relationships.
Introduction: This paper introduces the cut-set theory into the KPCM and proposes a novel cutsettype kernelled possibilistic C-means clustering (C-KPCM) algorithm to solve the coincident clustering problem of the KPCM.
Methods: In the C-KPCM, the memberships of some data samples in a cluster core which is generated by the cut-set theory are selected. Then the values of the selected memberships are modified in the iterative process to introduce the between-class relationship in the KPCM. Simultaneously an adaptive method of estimating the cut-set threshold is also given by averaging inter-class distances. Additionally, a cutset-type kernelled possibilistic C-means clustering segmentation algorithm based on the SLIC super-pixels (SS-C-KPCM) is also proposed to improve the segmentation quality and efficiency of the color images
Results: Several experimental results on artificial data sets and image segmentation simulation results prove the excellent performance of the proposed algorithms in this paper.
Conclusion: The proposed C-KPCM can overcome the coincident clustering problem of the KPCM algorithm and the proposed SS-C-KPCM can reduce the misclassification points and improve the color segmentation performance.
Keywords: Possibilistic clustering, kernelled possibilistic clustering, cut-set theory, super-pixels, image segmentation, Cmeans clustering.
[http://dx.doi.org/10.1016/j.asoc.2016.01.040]
[http://dx.doi.org/10.1007/s00500-007-0231-6]
[http://dx.doi.org/10.1016/j.fss.2003.11.009]
[http://dx.doi.org/10.1109/TFUZZ.2004.840099]
[http://dx.doi.org/10.1016/j.ins.2019.05.089]
[http://dx.doi.org/10.1109/TFUZZ.2004.825079]
[http://dx.doi.org/10.1109/ICASSP.2014.6854165]
[http://dx.doi.org/10.1109/TFUZZ.2016.2543752]
[http://dx.doi.org/10.1109/TFUZZ.2017.2659739]
[http://dx.doi.org/10.1016/j.asoc.2017.12.024]
[http://dx.doi.org/10.1109/TCYB.2015.2501848] [PMID: 26672055]
[http://dx.doi.org/10.1109/JSTARS.2018.2792841]
[http://dx.doi.org/10.1109/MIS.2017.3711645]
[http://dx.doi.org/10.1109/TPAMI.2012.120] [PMID: 22641706]
[http://dx.doi.org/10.1023/B:NEPL.0000011135.19145.1b]