对比硬聚类与软聚类在脑肿瘤分割中的表现,发现软聚类更准但慢。
Comparative Evaluation of Hard and Soft Clustering for Precise Brain Tumor Segmentation in MR Imaging
- 用K-Means(硬聚类)和FCM(软聚类)对MRI图像进行像素分类
- FCM平均Dice系数达0.67,显著高于K-Means的0.43,但耗时1.3秒
- 适合需要高精度边界、可接受较慢速度的临床分割任务
脑肿瘤在磁共振成像(MRI)中的分割因肿瘤形态与信号分布的异质性仍具挑战。精准勾画肿瘤边界对临床决策、放疗规划及疾病监测至关重要。本研究系统比较了两类聚类方法:硬聚类(以K-Means为代表)将每个像素唯一归属一个类别,而软聚类(以模糊C均值,FCM为代表)允许像素以不同隶属度属于多个类别。实验基于BraTS2020数据集,采用高斯滤波与对比度受限自适应直方图均衡化(CLAHE)预处理。评估指标包括骰子相似系数(DSC)与处理时间。结果表明,K-Means平均运行时间仅0.3秒/图像,速度更快;而FCM平均DSC达0.67,显著优于K-Means的0.43,但耗时1.3秒/图像。该结果凸显了计算效率与边界精度之间的权衡。
原文摘要 · Abstract (English)
Segmentation of brain tumors from Magnetic Resonance Imaging (MRI) remains a pivotal challenge in medical image analysis due to the heterogeneous nature of tumor morphology and intensity distributions. Accurate delineation of tumor boundaries is critical for clinical decision-making, radiotherapy planning, and longitudinal disease monitoring. In this study, we perform a comprehensive comparative analysis of two major clustering paradigms applied in MRI tumor segmentation: hard clustering, exemplified by the K-Means algorithm, and soft clustering, represented by Fuzzy C-Means (FCM). While K-Means assigns each pixel strictly to a single cluster, FCM introduces partial memberships, meaning each pixel can belong to multiple clusters with varying degrees of association. Experimental validation was performed using the BraTS2020 dataset, incorporating pre-processing through Gaussian filtering and Contrast Limited Adaptive Histogram Equalization (CLAHE). Evaluation metrics included the Dice Similarity Coefficient (DSC) and processing time, which collectively demonstrated that K-Means achieved superior speed with an average runtime of 0.3s per image, whereas FCM attained higher segmentation accuracy with an average DSC of 0.67 compared to 0.43 for K-Means, albeit at a higher computational cost (1.3s per image). These results highlight the inherent trade-off between computational efficiency and boundary precision.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。