3.1. Overview of the Proposed Framework
This study proposes a hybrid framework that integrates the FCM clustering algorithm with ICA for segmenting brain tumor MRI images. The primary objective is to improve the accuracy and stability of the clustering process by combining the soft-clustering capability of fuzzy logic with the global optimization potential of evolutionary algorithms. Because brain tumor images are characterized by uncertainty, noise, and intensity overlap between healthy and pathological tissues, hard-clustering methods often fail to yield reliable results.
The proposed framework comprises three main stages:
Preprocessing: MRI images are preprocessed and mapped to an appropriate feature space to enhance features relevant to the tumor region.
FCM clustering: The FCM algorithm is used to partition pixels into clusters by assigning fuzzy membership degrees.
Optimization via ICA: ICA acts as an evolutionary optimization layer to determine the optimal initial cluster centers, thereby improving the convergence behavior of FCM.
This hybridization mitigates the risk of entrapment in local minima and improves final segmentation accuracy.
3.2. Data Acquisition and Preprocessing
The study used MRI sequences from the BraTS 2024 benchmark dataset (
21). Because MRI scans are affected by systemic noise, intensity inhomogeneity, and inter-subject variability, preprocessing is essential to ensure data quality and clustering performance.
Initially, input images were converted to grayscale, when necessary, and pixel intensities were normalized to mitigate amplitude variation. Intensity normalization scales pixel values within a specific range, ensuring stability during the fuzzy clustering process. After normalization, each image was mapped to a set of pixels, with each pixel represented as a feature vector. In the simplest configuration, the feature vector for a pixel consists of its gray-level intensity. Thus, each pixel was treated as a sample in a one-dimensional feature space. This vector representation enables direct application of the fuzzy clustering algorithm. Although spatial or local statistical features can be appended to the vector to enhance differentiation, this study primarily focused on intensity features to demonstrate the efficacy of the proposed initialization method. The extracted feature vectors served as input for the subsequent FCM algorithm.
3.3. Fuzzy C-Means Clustering Algorithm
Fuzzy C-Means is a widely established method in medical image analysis that models inherent data uncertainty through membership degrees. In brain tumor MRI, boundaries between healthy tissue and tumor are often indistinct because of the partial volume effect; therefore, fuzzy clustering provides more flexible and accurate results than hard clustering.
Let X={x1, x2, …, xN} be a set of N pixels, where the goal is to partition these pixels into C clusters. Unlike hard clustering, FCM allows each pixel to belong to multiple clusters simultaneously. The objective function of FCM is defined as follows:
Where:
xi is the feature vector of the i-th pixel.
vj is the center of the j-th cluster.
uij represents the degree of membership of pixel i in cluster j.
m>1 is the fuzzification parameter (weighting exponent) that controls the softness of clustering.
To minimize the objective function, the membership matrix and cluster centers are iteratively updated using the following equations:
This process is repeated until a stopping criterion, such as the maximum number of iterations or a minimal change in cluster centers, is met. Despite its utility, FCM is highly sensitive to the random initialization of cluster centers because of the non-convex nature of its objective function. This sensitivity often leads to convergence at local minima, thereby reducing segmentation accuracy in complex MRI images.
3.4. Optimization via the Imperialist Competitive Algorithm
The Imperialist Competitive Algorithm is a population-based optimization method inspired by sociopolitical processes such as imperialistic competition, assimilation, and the collapse of empires. ICA uses evolutionary mechanisms to search the solution space effectively and has demonstrated robustness in solving nonlinear, complex, and multidimensional problems.
In ICA, each candidate solution is modeled as a country. The population is divided into two groups: imperialists, which are the countries with the lowest cost or best fitness, and colonies. Empires are formed by assigning colonies to imperialists according to the power of the imperialists. The main evolutionary steps include the following:
Assimilation: Colonies move toward their corresponding imperialist, improving their position in the search space.
Competition: Imperialistic competition occurs as weaker empires gradually lose their colonies to stronger empires.
Elimination: Empires that lose all colonies eventually collapse.
This continuous competition drives the population toward promising regions of the search space, substantially increasing the probability of finding the global optimum. In this study, ICA was used to overcome the initialization sensitivity of FCM. By intelligently searching for the optimal initial cluster centers that minimize the fuzzy objective function, ICA ensures robust convergence and stability.
3.5. Proposed Hybrid FCM-ICA Framework
To address the limitations of conventional FCM, particularly its dependence on initial values, this study introduces a hybrid FCM-ICA framework. The core concept is to use the global search capability of ICA to determine the optimal initial cluster centers (vj) before executing the standard FCM iterations.
Encoding strategy:
In the proposed framework, each country in the ICA population represents a candidate solution for the cluster centers. Mathematically, a country is defined as a vector containing all cluster centers:
Country =[v1,v2, …, vC]
where each element represents a cluster center in the feature space, and the number of elements depends on the number of clusters.
Fitness function:
The quality of each country is evaluated using the FCM objective function (Jm). The goal of the ICA is to minimize this value. Countries that yield a lower Jm are considered more powerful and are more likely to be selected as imperialists.
Execution flow:
After the population is initialized, the ICA process, including assimilation, competition, and elimination, iterates until a stopping criterion is met. The best country found by ICA, or the global best, is then extracted as the set of optimal initial cluster centers. Finally, the standard FCM algorithm is initialized with these optimized centers and run to fine-tune membership degrees and produce the final segmentation. This hybrid approach ensures that FCM starts from a near-optimal point, avoids local minima, and improves segmentation stability, particularly in noisy MRI data.
The procedural steps of the proposed method are detailed in Algorithm 1, and the overall process flow is illustrated in
Figure 1.
Overall process flow of the hybrid FCM-ICA clustering method for brain tumor segmentation.
3.1. Algorithm 1. Hybrid FCM-ICA Clustering for Brain Tumor Segmentation
Input:
MRI image dataset
Number of clusters C
Fuzzification parameter m
Maximum number of ICA iterations T_ICA
Maximum number of FCM iterations T_FCM
Output:
Final segmented image
1. Preprocess the MRI image and extract feature vectors Xi.
2. Initialize a population of countries in ICA.
3. Represent each country as a set of cluster centers.
4. Country =[v1,v2, …, vC]
5. For each country, compute the fitness value using the FCM objective function Jm.
6. Form initial empires based on country fitness values.
7. While the ICA stopping criterion is not satisfied:
7.1. Assimilate colonies toward their imperialist.
7.2. Perform imperialistic competition.
7.3. Eliminate weak empires.
7.4. Update the fitness values of all countries.
8. end while
9. Select the best country as the optimal initial cluster centers.
8. Initialize FCM using the optimized cluster centers.
9.11. for t=1t = 1t=1 to TFCMT_{FCM}TFCM do
9.1. Update membership values Uij.
9.2. Update cluster centers Vj.
10. Generate the final segmented MRI image.
3.6. Implementation and Computational Environment
The proposed algorithms were implemented in Python 3.9 using the NumPy and Scikit-learn libraries. All experiments were conducted on a workstation equipped with an Intel Core i7 processor and 16 GB of RAM. Statistical analyses and performance evaluations were performed in the same computational environment to ensure consistency and reproducibility.