A kernelized fuzzy c-means algorithm for automatic magnetic resonance image segmentation

Authors:
E. A. Zanaty;Sultan Aljahdali;Narayan Debnath
Affiliations:
College of Computer Science, Taif University, Taif, Saudi Arabia;(Correspd. aljahdali@tu.edu.sa) College of Computer Science, Taif University, Taif, Saudi Arabia;Computer Science Department, Winona State University, Winona, MN 55987, USA
Venue:
Journal of Computational Methods in Sciences and Engineering
Year:
2009

Citing 6
Cited 4

An adaptive fuzzy C-means algorithm for image segmentation in the presence of intensity inhomogeneities

Pattern Recognition Letters
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
Clustering Incomplete Data Using Kernel-Based Fuzzy C-means Algorithm

Neural Processing Letters
Image segmentation by a fuzzy clustering algorithm using adaptive spatially constrained membership functions

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A novel kernelized fuzzy C-means algorithm with application in medical image segmentation

Artificial Intelligence in Medicine
A new kernel-based fuzzy clustering approach: support vector clustering with cell growing

IEEE Transactions on Fuzzy Systems

Novel segmentation algorithm in segmenting medical images

Journal of Systems and Software
Modified bias field fuzzy C-means for effective segmentation of brain MRI

Transactions on computational science VIII
Modified bias field fuzzy C-means for effective segmentation of brain MRI

Transactions on computational science VIII
Effective FCM noise clustering algorithms in medical images

Computers in Biology and Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present alternative Kernelized FCM algorithms (KFCM) that could improve magnetic resonance imaging (MRI) segmentation. Then we implement the proposed KFCM method with considering some spatial constraints on the objective function. The algorithms incorporate spatial information into the membership function and the validity procedure for clustering. We use the intra-cluster distance measure, which is simply the median distance between a point and its cluster centre. The number of the cluster increases automatically according the value of intra-cluster, for example when a cluster is obtained, it uses this cluster to evaluate intra-cluster of the next cluster as input to the KFCM and so on, stop only when intra-cluster is smaller than a prescribe value. The most important aspect of the proposed algorithms is actually to work automatically. Alterative is to improve automatic image segmentation. These methods are applied on two different sets: reference images, for objective evaluation based on estimation of segmentation accuracy and time, and non reference images, for objective evaluation based on combined judgment of opinions of specialists.