亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

DFBU-Net: Double-branch flat bottom U-Net for efficient medical image segmentation

计算机科学 分割 人工智能 增采样 正确性 瓶颈 深度学习 模式识别(心理学) 图像(数学) 计算机视觉 算法 嵌入式系统
作者
Hao Yin,Yi Wang,Jing Wen,Guangxian Wang,Bo Lin,Weibin Yang,Jian Ruan,Yi Zhang
出处
期刊:Biomedical Signal Processing and Control [Elsevier BV]
卷期号:90: 105818-105818 被引量:7
标识
DOI:10.1016/j.bspc.2023.105818
摘要

In the field of medical image processing, segmenting tissues and organs in CT/MRI and other medical sequence images is a vital yet challenging task. Analyzing the MICCAI competition, we have identified two problems in current methods for medical image organ segmentation: (1) There is a bottleneck in organ segmentation, with marginal room for improvement, as algorithmic capabilities have already surpassed the task's inherent difficulty. (2) Most current research focuses on stacking and enhancing new modules for segmentation while overlooking the inherent characteristics of medical sequence images. To overcome these two problems, firstly, we have encapsulated the three characteristics of CT/MRI medical sequence image segmentation: semantic correctness, edge accuracy, and 3D structure. Secondly, we delved into the most information-rich downsampling stage in terms of detail and semantics. Subsequently, we designed a flat-bottom double-branch network (DFBU-Net) based on the U-Net architecture. The high-resolution flat bottom branch of this network maintained a 1/4 feature map size to ensure the preservation of rich detail information, while the low-resolution branch underwent progressive downsampling to capture more semantic information. To prevent information loss, cross-fusion was performed at each stage of the model's two branches. Finally, DFBU-Net was evaluated on the MICCAI FLARE2021 dataset (DSC:93.61%, NSD:85.01%). Particularly, in the challenging task of pancreatic segmentation, our model outperformed the first-place model by 0.72% in DSC and 2.92% in NSD. Furthermore, in the MICCAI PARSE2022 competition, DFBU-Net ranked ninth with a DICE score of 79.28%, demonstrating its excellent segmentation performance and generalization ability.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
光亮的成败完成签到,获得积分10
3秒前
3秒前
景胜杰发布了新的文献求助10
6秒前
Lucas应助STUBLE采纳,获得10
8秒前
O_0完成签到 ,获得积分10
12秒前
桐桐应助eth采纳,获得10
13秒前
14秒前
NexusExplorer应助科研通管家采纳,获得10
16秒前
orixero应助科研通管家采纳,获得10
16秒前
英俊的铭应助科研通管家采纳,获得10
16秒前
16秒前
sunshine完成签到,获得积分10
18秒前
Inshel完成签到 ,获得积分10
18秒前
留柿完成签到,获得积分10
19秒前
Xixi发布了新的文献求助10
21秒前
rarity完成签到 ,获得积分10
22秒前
25秒前
27秒前
30秒前
STUBLE发布了新的文献求助10
31秒前
31秒前
VISIN发布了新的文献求助10
34秒前
寻123完成签到,获得积分10
35秒前
eth发布了新的文献求助10
35秒前
周平平发布了新的文献求助10
43秒前
44秒前
44秒前
STUBLE发布了新的文献求助10
48秒前
Accepted完成签到 ,获得积分10
55秒前
juanmaoaaaaaaa完成签到,获得积分10
56秒前
可靠的嵩完成签到,获得积分10
58秒前
悦耳冰香完成签到,获得积分10
58秒前
1分钟前
1分钟前
科研通AI6.3应助STUBLE采纳,获得10
1分钟前
科研通AI6.4应助STUBLE采纳,获得10
1分钟前
JamesPei应助STUBLE采纳,获得10
1分钟前
1分钟前
1分钟前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 2000
Bend stiffness of submarine cables – an experimental and numerical investigation 1000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7535854
求助须知:如何正确求助?哪些是违规求助? 9121014
关于积分的说明 19485199
捐赠科研通 7134715
什么是DOI,文献DOI怎么找? 3257429
关于科研通互助平台的介绍 2424680
邀请新用户注册赠送积分活动 2245245