已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Dilated Adversarial U-Net Network for automatic gross tumor volume segmentation of nasopharyngeal carcinoma

分割 计算机科学 人工智能 鼻咽癌 特征(语言学) 直方图 深度学习 图像分割 模式识别(心理学) 体积热力学 放射治疗 图像(数学) 放射科 医学 语言学 哲学 物理 量子力学
作者
Yanhua Liu,Xiaoguang Yuan,Xin Jiang,Pei Wang,Jinqiao Kou,Haofeng Wang,Mingzhe Liu
出处
期刊:Applied Soft Computing [Elsevier]
卷期号:111: 107722-107722 被引量:18
标识
DOI:10.1016/j.asoc.2021.107722
摘要

Nasopharyngeal carcinoma (NPC) is a malignant tumor in the nasopharyngeal epithelium and is mainly treated by radiotherapy. The accurate delineation of the target tumor can greatly improve the radiotherapy effectiveness. However, due to the small size of the NPC imaging volume, the scarcity of labeled samples, the low signal-to-noise ratio in small target areas and the lack of detailed features, automatic gross tumor volume (GTV) delineation inspired by advances in domain adaption for high-resolution image processing has become a great challenge. In addition, since computed tomography (CT) images have the low resolution of soft tissues, it is difficult to identify small volume tumors, and segmentation accuracy of this kind of small GTV is very low. In this paper, we propose an automatic segmentation model based on adversarial network and U-Net for NPC delineation. Specifically, we embed adversarial classification learning into a segmentation network to balance the distribution differences between the small targets in the sample and the large target categories. To reduce the loss weight of large target categories with large samples, and simultaneously increase the weight of small target categories, we design a new U-Net based on focal loss as a GTV segmentation model for adjusting the effect of different categories on the final loss. This method can effectively solve the feature bias caused by the imbalance of the target volume distribution. Furthermore, we conduct a pre-processing of images using an algorithm based on distribution histograms to ensure that the same or approximate CT value represents the same organization. In order to evaluate our proposed method, we perform experiments on the open datasets from StructSeg2019 and the datasets provided by Sichuan Provincial Cancer Hospital. The results of the comparison with some typical up-to-date methods demonstrate that our model can significantly enhance detection accuracy and sensitivity for NPC segmentation.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
天涯完成签到 ,获得积分10
4秒前
哈楠发布了新的文献求助10
5秒前
LISU完成签到 ,获得积分10
9秒前
柳墨白发布了新的文献求助10
19秒前
22秒前
隔壁老王发布了新的文献求助10
28秒前
30秒前
真好发布了新的文献求助10
34秒前
绵绵完成签到 ,获得积分10
34秒前
wangxy发布了新的文献求助10
38秒前
38秒前
_是小满完成签到 ,获得积分10
38秒前
叾屾完成签到 ,获得积分10
40秒前
40秒前
42秒前
Owen应助真好采纳,获得10
42秒前
43秒前
Rzz发布了新的文献求助10
46秒前
吕博发布了新的文献求助10
47秒前
小白发布了新的文献求助10
50秒前
wangxy完成签到,获得积分10
50秒前
1分钟前
zsp完成签到 ,获得积分10
1分钟前
南巷清风给南巷清风的求助进行了留言
1分钟前
1分钟前
最最可爱发布了新的文献求助10
1分钟前
1分钟前
华仔应助科研通管家采纳,获得10
1分钟前
cctv18应助科研通管家采纳,获得10
1分钟前
cctv18应助科研通管家采纳,获得10
1分钟前
秋雪瑶应助科研通管家采纳,获得10
1分钟前
光头饼发布了新的文献求助30
1分钟前
cxin完成签到,获得积分20
1分钟前
光头饼完成签到,获得积分10
1分钟前
1分钟前
lalalala完成签到 ,获得积分10
1分钟前
1分钟前
zzzcx发布了新的文献求助10
1分钟前
VAIN39完成签到,获得积分10
1分钟前
隐形曼青应助小白采纳,获得10
1分钟前
高分求助中
Teaching Social and Emotional Learning in Physical Education 900
Plesiosaur extinction cycles; events that mark the beginning, middle and end of the Cretaceous 800
Chinese-English Translation Lexicon Version 3.0 500
Recherches Ethnographiques sue les Yao dans la Chine du Sud 500
Two-sample Mendelian randomization analysis reveals causal relationships between blood lipids and venous thromboembolism 500
[Lambert-Eaton syndrome without calcium channel autoantibodies] 460
Aspect and Predication: The Semantics of Argument Structure 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2395107
求助须知:如何正确求助?哪些是违规求助? 2098519
关于积分的说明 5288712
捐赠科研通 1825924
什么是DOI,文献DOI怎么找? 910364
版权声明 559972
科研通“疑难数据库(出版商)”最低求助积分说明 486551