A Comparative Study of MRI Image Segmentation based on Fast Kernel Clustering Analysis

Kernel-based clustering provides a better analysis tool for pattern classification, which implicitly maps input samples to a highdimensional space for improving pattern separability. For this implicit space map, the kernel trick is believed to elegantly tackle the problem of “curse of dimensionality”, which has actually been more challenging for kernel-based clustering in terms of computational complexity and classification accuracy, which traditional kernelized algorithms cannot effectively deal with. In this paper, we have analyzed the merits and deficiencies of KFCM-I/KFCM-II, and KFMC-III and pointed out the connections of these three algorithms.