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.
H.3.7. Learning
M. Farhid; M. Shamsi; M. H. Sedaaghi
Abstract
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of ...
Read More
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defined based on previously calculated signal to noise ratio (SNR), is assumed to be the informed nodes that collect data and perform in-network processing, while the remaining nodes are assumed to be uninformed and only participate in the processing tasks. As our simulation results show, the proposed algorithm not only considerably improves the performance of the Distributed Incremental LMS algorithm in a same condition, but also proves a good accuracy of estimation in cases where some of the nodes make unreliable observations (noisy nodes). Also studied is the application of the same algorithm on the cases where node failure happens
