H.5.7. Segmentation
Ali Fahmi Jafargholkhanloo; Mousa Shamsi; Mahdi Bashiri Bawil
Abstract
Magnetic Resonance Imaging (MRI) often suffers from noise and Intensity Non-Uniformity (INU), making segmentation a challenging task. The Fuzzy C-Means (FCM) algorithm, a widely used clustering method for image segmentation, is highly sensitive to noise and its convergence rate depends on data distribution. ...
Read More
Magnetic Resonance Imaging (MRI) often suffers from noise and Intensity Non-Uniformity (INU), making segmentation a challenging task. The Fuzzy C-Means (FCM) algorithm, a widely used clustering method for image segmentation, is highly sensitive to noise and its convergence rate depends on data distribution. FCM employs the Euclidean distance metric, which fails to adapt to variations in data point distributions within compact and similarly shaped clusters. Additionally, this metric is not locally adaptive to different cluster shapes. This paper introduces a Conditional Spatial Gustafson-Kessel Clustering Algorithm based on Information Theory (CSGKIT) to address these challenges. First, information theory is incorporated to enhance the algorithm's robustness against noise and improve segmentation accuracy. Second, the Mahalanobis distance replaces the Euclidean distance to better accommodate cluster shapes during the clustering process. Finally, a conditional spatial approach uses a fuzzy-weighted membership matrix to incorporate local spatial interactions between neighboring pixels. The proposed CSGKIT algorithm is evaluated on two datasets: the BrainWeb simulated dataset and the Open Access Series of Imaging Studies (OASIS) dataset. Experimental results indicate that CSGKIT outperforms other FCM-based algorithms in segmentation accuracy across various tissue types.
Seyedeh R. Mahmudi Nezhad Dezfouli; Y. Kyani; Seyed A. Mahmoudinejad Dezfouli
Abstract
Due to the small size, low contrast, variable position, shape, and texture of multiple sclerosis lesions, one of the challenges of medical image processing is the automatic diagnosis and segmentation of multiple sclerosis lesions in Magnetic resonance images. Early diagnosis of these lesions in the first ...
Read More
Due to the small size, low contrast, variable position, shape, and texture of multiple sclerosis lesions, one of the challenges of medical image processing is the automatic diagnosis and segmentation of multiple sclerosis lesions in Magnetic resonance images. Early diagnosis of these lesions in the first stages of the disease can effectively diagnose and evaluate treatment. Also, automated segmentation is a powerful tool to assist professionals in improving the accuracy of disease diagnosis. This study uses modified adaptive multi-level conditional random fields and the artificial neural network to segment and diagnose multiple sclerosis lesions. Instead of assuming model coefficients as constant, they are considered variables in multi-level statistical models. This study aimed to evaluate the probability of lesions based on the severity, texture, and adjacent areas. The proposed method is applied to 130 MR images of multiple sclerosis patients in two test stages and resulted in 98% precision. Also, the proposed method has reduced the error detection rate by correcting the lesion boundaries using the average intensity of neighborhoods, rotation invariant, and texture for very small voxels with a size of 3-5 voxels, and it has shown very few false-positive lesions. The proposed model resulted in a high sensitivity of 91% with a false positive average of 0.5.
H.5.7. Segmentation
V. Naghashi; Sh. Lotfi
Abstract
Image segmentation is a fundamental step in many of image processing applications. In most cases the image’s pixels are clustered only based on the pixels’ intensity or color information and neither spatial nor neighborhood information of pixels is used in the clustering process. Considering ...
Read More
Image segmentation is a fundamental step in many of image processing applications. In most cases the image’s pixels are clustered only based on the pixels’ intensity or color information and neither spatial nor neighborhood information of pixels is used in the clustering process. Considering the importance of including spatial information of pixels which improves the quality of image segmentation, and using the information of the neighboring pixels, causes enhancing of the accuracy of segmentation. In this paper the idea of combining the K-means algorithm and the Improved Imperialist Competitive algorithm is proposed. Also before applying the hybrid algorithm, a new image is created and then the hybrid algorithm is employed. Finally, a simple post-processing is applied on the clustered image. Comparing the results of the proposed method on different images, with other methods, shows that in most cases, the accuracy of the NLICA algorithm is better than the other methods.
H.3.2.2. Computer vision
M. H. Khosravi
Abstract
Image segmentation is an essential and critical process in image processing and pattern recognition. In this paper we proposed a textured-based method to segment an input image into regions. In our method an entropy-based textured map of image is extracted, followed by an histogram equalization step ...
Read More
Image segmentation is an essential and critical process in image processing and pattern recognition. In this paper we proposed a textured-based method to segment an input image into regions. In our method an entropy-based textured map of image is extracted, followed by an histogram equalization step to discriminate different regions. Then with the aim of eliminating unnecessary details and achieving more robustness against unwanted noises, a low-pass filtering technique is successfully used to smooth the image. As the next step, the appropriate pixons are extracted and delivered to a fuzzy c-mean clustering stage to obtain the final image segments. The results of applying the proposed method on several different images indicate its better performance in image segmentation compared to the other methods.
H.5. Image Processing and Computer Vision
A.M. Shafiee; A. M. Latif
Abstract
Fuzzy segmentation is an effective way of segmenting out objects in images containing both random noise and varying illumination. In this paper, a modified method based on the Comprehensive Learning Particle Swarm Optimization (CLPSO) is proposed for pixel classification in HSI color space by selecting ...
Read More
Fuzzy segmentation is an effective way of segmenting out objects in images containing both random noise and varying illumination. In this paper, a modified method based on the Comprehensive Learning Particle Swarm Optimization (CLPSO) is proposed for pixel classification in HSI color space by selecting a fuzzy classification system with minimum number of fuzzy rules and minimum number of incorrectly classified patterns. In the CLPSO-based method, each individual of the population is considered to automatically generate a fuzzy classification system. Afterwards, a population member tries to maximize a fitness criterion which is high classification rate and small number of fuzzy rules. To reduce the multidimensional search space for an M-class classification problem, centroid of each class is calculated and then fixed in membership function of fuzzy system. The performance of the proposed method is evaluated in terms of future classification within the RoboCup soccer environment with spatially varying illumination intensities on the scene. The results present 85.8% accuracy in terms of classification.
