Noise-robust neural networks for medical image segmentation by dual-strategy sample selection

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-08-26 DOI:10.1002/cpe.8271
Jialin Shi, Youquan Yang, Kailai Zhang
{"title":"Noise-robust neural networks for medical image segmentation by dual-strategy sample selection","authors":"Jialin Shi,&nbsp;Youquan Yang,&nbsp;Kailai Zhang","doi":"10.1002/cpe.8271","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Deep neural networks for medical image segmentation often face the problem of insufficient clean labeled data. Although non-expert annotations are more readily accessible, these low-quality annotations lead to significant performance degradation of existing neural network methods. In this paper, we focus on robust learning of medical image segmentation with noisy annotations and propose a novel noise-tolerant framework based on dual-strategy sample selection, which selects the informative samples to provide effective supervision information. First, we propose the first round of sample selection by designing a novel joint loss, which includes conventional supervised loss and regularization loss. To further select information-rich samples, we propose confidence-based pseudo-label sample selection from a novel perspective as the complement. The dual strategies are used in a collaborative manner and the network is optimized with mined informative samples. We conducted extensive experiments on datasets with both simulated noisy labels and real-world noisy labels. For instance, on a simulated dataset with 25% noise ratio, our method achieves segmentation Dice value with 90.56% <span></span><math>\n <semantics>\n <mrow>\n <mo>±</mo>\n </mrow>\n <annotation>$$ \\pm $$</annotation>\n </semantics></math> 0.03%. Furthermore, increasing the noise ratio to 95%, our method still maintains a high Dice value of 73.85% <span></span><math>\n <semantics>\n <mrow>\n <mo>±</mo>\n </mrow>\n <annotation>$$ \\pm $$</annotation>\n </semantics></math> 0.28% compared to other baselines. Extensive results have demonstrated that our method can weaken the effects of noisy labels on medical image segmentation.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 25","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8271","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Deep neural networks for medical image segmentation often face the problem of insufficient clean labeled data. Although non-expert annotations are more readily accessible, these low-quality annotations lead to significant performance degradation of existing neural network methods. In this paper, we focus on robust learning of medical image segmentation with noisy annotations and propose a novel noise-tolerant framework based on dual-strategy sample selection, which selects the informative samples to provide effective supervision information. First, we propose the first round of sample selection by designing a novel joint loss, which includes conventional supervised loss and regularization loss. To further select information-rich samples, we propose confidence-based pseudo-label sample selection from a novel perspective as the complement. The dual strategies are used in a collaborative manner and the network is optimized with mined informative samples. We conducted extensive experiments on datasets with both simulated noisy labels and real-world noisy labels. For instance, on a simulated dataset with 25% noise ratio, our method achieves segmentation Dice value with 90.56% ± $$ \pm $$ 0.03%. Furthermore, increasing the noise ratio to 95%, our method still maintains a high Dice value of 73.85% ± $$ \pm $$ 0.28% compared to other baselines. Extensive results have demonstrated that our method can weaken the effects of noisy labels on medical image segmentation.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过双策略样本选择实现用于医学图像分割的降噪神经网络
摘要用于医学图像分割的深度神经网络经常面临标注数据不足的问题。虽然非专家注释更容易获得,但这些低质量注释导致现有神经网络方法的性能显著下降。在本文中,我们将重点放在有噪声注释的医学图像分割的鲁棒学习上,并提出了一种基于双策略样本选择的新型噪声容限框架,该框架可选择有信息量的样本来提供有效的监督信息。首先,我们通过设计一种新颖的联合损失(包括传统的监督损失和正则化损失)来进行第一轮样本选择。为了进一步选择信息丰富的样本,我们从新颖的角度提出了基于置信度的伪标签样本选择作为补充。我们以协作的方式使用双重策略,并利用挖掘出的信息样本对网络进行优化。我们在具有模拟噪声标签和真实噪声标签的数据集上进行了大量实验。例如,在噪声率为 25% 的模拟数据集上,我们的方法实现了 90.56% 0.03% 的分割骰子值。此外,将噪声比提高到 95%,与其他基线相比,我们的方法仍然保持了 73.85% 0.28% 的高 Dice 值。大量结果表明,我们的方法可以削弱噪声标签对医学图像分割的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1