优化U-Net配置,提升头颈癌MRI自动分割精度
Improving the U-Net Configuration for Automated Delineation of Head and Neck Cancer on MRI
- 用滑动窗口加块归一化改进U-Net训练与推理
- 调度数据增强使分割Dice达0.749(任务1)
- 适合医学图像分割研究者参考
在典型临床环境中,基于MRI的肿瘤体积分割仍依赖人工操作,耗时且具挑战性。本文针对MICCAI 2024年头颈肿瘤分割挑战赛(HNTS-MRG),提出一种基于传统U-Net架构的配置优化方案,不设计新网络。实验表明,训练和推理中采用块级归一化可显著提升性能;调度式数据增强策略有助于模型泛化;使用高斯加权融合滑动窗口预测结果可微调质量。最优单模型在五折交叉验证中,任务1和任务2的聚合Dice相似系数(DSCagg)分别为0.749和0.710。五个模型集成(每折一个最佳模型)在50例私有测试集上表现稳定,任务1和任务2的DSCagg分别为0.752和0.718(团队名:andrei.iantsen)。源代码与模型权重已公开于www.github.com/iantsen/hntsmrg。
原文摘要 · Abstract (English)
Tumor volume segmentation on MRI is a challenging and time-consuming process that is performed manually in typical clinical settings. This work presents an approach to automated delineation of head and neck tumors on MRI scans, developed in the context of the MICCAI Head and Neck Tumor Segmentation for MR-Guided Applications (HNTS-MRG) 2024 Challenge. Rather than designing a new, task-specific convolutional neural network, the focus of this research was to propose improvements to the configuration commonly used in medical segmentation tasks, relying solely on the traditional U-Net architecture. The empirical results presented in this article suggest the superiority of patch-wise normalization used for both training and sliding window inference. They also indicate that the performance of segmentation models can be enhanced by applying a scheduled data augmentation policy during training. Finally, it is shown that a small improvement in quality can be achieved by using Gaussian weighting to combine predictions for individual patches during sliding window inference. The model with the best configuration obtained an aggregated Dice Similarity Coefficient (DSCagg) of 0.749 in Task 1 and 0.710 in Task 2 on five cross-validation folds. The ensemble of five models (one best model per validation fold) showed consistent results on a private test set of 50 patients with an DSCagg of 0.752 in Task 1 and 0.718 in Task 2 (team name: andrei.iantsen). The source code and model weights are freely available at www.github.com/iantsen/hntsmrg.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。