DBMF: Dual Branch Multiscale Feature Fusion Network for polyp segmentation

分割 计算机科学 人工智能 模式识别(心理学) 特征(语言学) 图像分割 计算机视觉 语言学 哲学
作者
Fangjin Liu,Zhen Hua,Jinjiang Li,Linwei Fan
出处
期刊:Computers in Biology and Medicine [Elsevier]
卷期号:151: 106304-106304 被引量:12
标识
DOI:10.1016/j.compbiomed.2022.106304
摘要

Accurate and reliable segmentation of colorectal polyps is important for the diagnosis and treatment of colorectal cancer. Most of the existing polyp segmentation methods innovatively combine CNN with Transformer. Due to the single combination approach, there are limitations in establishing connections between local feature information and utilizing global contextual information captured by Transformer. Still not a better solution to the problems in polyp segmentation. In this paper, we propose a Dual Branch Multiscale Feature Fusion Network for Polyp Segmentation, abbreviated as DBMF, for polyp segmentation to achieve accurate segmentation of polyps. DBMF uses CNN and Transformer in parallel to extract multi-scale local information and global contextual information respectively, with different regions and levels of information to make the network more accurate in identifying polyps and their surrounding tissues. Feature Super Decoder (FSD) fuses multi-level local features and global contextual information in dual branches to fully exploit the potential of combining CNN and Transformer to improve the network's ability to parse complex scenes and the detection rate of tiny polyps. The FSD generates an initial segmentation map to guide the second parallel decoder (SPD) to refine the segmentation boundary layer by layer. SPD consists of a multi-scale feature aggregation module (MFA) and parallel polarized self-attention (PSA) and reverse attention fusion modules (RAF). MFA aggregates multi-level local feature information extracted by CNN Brach to find consensus regions between multiple scales and improve the network's ability to identify polyp regions. PSA uses dual attention to enhance the fine-grained nature of segmented regions and reduce the redundancy introduced by MFA and interference information. RAF mines boundary cues and establishes relationships between regions and boundary cues. The three RAFs guide the network to explore lost targets and boundaries in a bottom-up manner. We used the CVC-ClinicDB, Kvasir, CVC-300, CVC-ColonDB, and ETIS datasets to conduct comparison experiments and ablation experiments between DBMF and mainstream polyp segmentation networks. The results showed that DBMF outperformed the current mainstream networks on five benchmark datasets.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
思源应助11采纳,获得10
刚刚
zero完成签到,获得积分10
1秒前
4秒前
大白发布了新的文献求助10
4秒前
yangyajie发布了新的文献求助10
5秒前
LX发布了新的文献求助10
5秒前
领导范儿应助高小猴儿采纳,获得10
6秒前
脑洞疼应助过于傻逼采纳,获得10
7秒前
没假期关注了科研通微信公众号
7秒前
李健的小迷弟应助kc采纳,获得10
8秒前
1128发布了新的文献求助10
10秒前
12秒前
12秒前
misihaoyu完成签到,获得积分10
14秒前
17秒前
18秒前
你会飞么应助xr采纳,获得10
19秒前
20秒前
22秒前
顶峰发布了新的文献求助10
22秒前
英姑应助霸气的不评采纳,获得10
22秒前
22秒前
陈秋发布了新的文献求助10
24秒前
nnnnnn完成签到,获得积分10
24秒前
研友_仇颤发布了新的文献求助10
25秒前
nnnnnn发布了新的文献求助20
28秒前
29秒前
YOKO发布了新的文献求助20
31秒前
cc123完成签到,获得积分10
32秒前
35秒前
35秒前
yang完成签到 ,获得积分10
35秒前
俞秋烟完成签到,获得积分10
35秒前
36秒前
38秒前
小路发布了新的文献求助10
39秒前
没假期发布了新的文献求助10
39秒前
40秒前
hh完成签到,获得积分10
42秒前
高分求助中
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 1000
Corrosion and Oxygen Control 600
Yaws' Handbook of Antoine coefficients for vapor pressure 500
Python Programming for Linguistics and Digital Humanities: Applications for Text-Focused Fields 500
Love and Friendship in the Western Tradition: From Plato to Postmodernity 500
Heterocyclic Stilbene and Bibenzyl Derivatives in Liverworts: Distribution, Structures, Total Synthesis and Biological Activity 500
重庆市新能源汽车产业大数据招商指南(两链两图两池两库两平台两清单两报告) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2549770
求助须知:如何正确求助?哪些是违规求助? 2177066
关于积分的说明 5607767
捐赠科研通 1897890
什么是DOI,文献DOI怎么找? 947477
版权声明 565447
科研通“疑难数据库(出版商)”最低求助积分说明 504108