TDCAU-Net: retinal vessel segmentation using transformer dilated convolutional attention-based U-Net method

分割 计算机科学 人工智能 预处理器 图像分割 眼底(子宫) 模式识别(心理学) 计算机视觉 眼科 医学
作者
Chunyang Li,Zhigang Li,Weikang Liu
出处
期刊:Physics in Medicine and Biology [IOP Publishing]
卷期号:69 (1): 015003-015003
标识
DOI:10.1088/1361-6560/ad1273
摘要

Retinal vessel segmentation plays a vital role in the medical field, facilitating the identification of numerous chronic conditions based on retinal vessel images. These conditions include diabetic retinopathy, hypertensive retinopathy, glaucoma, and others. Although the U-Net model has shown promising results in retinal vessel segmentation, it tends to struggle with fine branching and dense vessel segmentation. To further enhance the precision of retinal vessel segmentation, we propose a novel approach called transformer dilated convolution attention U-Net (TDCAU-Net), which builds upon the U-Net architecture with improved Transformer-based dilated convolution attention mechanisms. The proposed model retains the three-layer architecture of the U-Net network. The Transformer component enables the learning of contextual information for each pixel in the image, while the dilated convolution attention prevents information loss. The algorithm efficiently addresses several challenges to optimize blood vessel detection. The process starts with five-step preprocessing of the images, followed by chunking them into segments. Subsequently, the retinal images are fed into the modified U-Net network introduced in this paper for segmentation. The study employs eye fundus images from the DRIVE and CHASEDB1 databases for both training and testing purposes. Evaluation metrics are utilized to compare the algorithm's results with state-of-the-art methods. The experimental analysis on both databases demonstrates that the algorithm achieves high values of sensitivity, specificity, accuracy, and AUC. Specifically, for the first database, the achieved values are 0.8187, 0.9756, 0.9556, and 0.9795, respectively. For the second database, the corresponding values are 0.8243, 0.9836, 0.9738, and 0.9878, respectively. These results demonstrate that the proposed approach outperforms state-of-the-art methods, achieving higher performance on both datasets. The TDCAU-Net model presented in this study exhibits substantial capabilities in accurately segmenting fine branching and dense vessels. The segmentation performance of the network surpasses that of the U-Net algorithm and several mainstream methods.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
KennyS发布了新的文献求助10
2秒前
zero完成签到,获得积分10
3秒前
4秒前
fhhkckk3发布了新的文献求助10
4秒前
彭于晏应助知性的雪糕采纳,获得10
4秒前
科研通AI2S应助优雅逍遥采纳,获得10
5秒前
5秒前
脑洞疼应助俭朴绿蕊采纳,获得10
7秒前
7秒前
Akim应助末岛采纳,获得10
8秒前
所所应助咚咚采纳,获得10
10秒前
Mr.Stars完成签到,获得积分10
10秒前
lalal发布了新的文献求助20
10秒前
Hh完成签到,获得积分10
10秒前
小何同学发布了新的文献求助10
10秒前
10秒前
12秒前
阿衡发布了新的文献求助10
12秒前
陈子怡发布了新的文献求助10
12秒前
14秒前
热忱未减应助酥酥采纳,获得10
14秒前
17秒前
今后应助finerain7采纳,获得10
17秒前
18秒前
哔哔鱼发布了新的文献求助10
18秒前
19秒前
20秒前
lxr发布了新的文献求助30
20秒前
kzz完成签到,获得积分10
22秒前
阿衡完成签到,获得积分10
22秒前
23秒前
上官若男应助知性的雪糕采纳,获得10
24秒前
汉堡包应助科研通管家采纳,获得20
24秒前
香蕉觅云应助科研通管家采纳,获得10
24秒前
完美世界应助科研通管家采纳,获得10
24秒前
脑洞疼应助科研通管家采纳,获得10
24秒前
充电宝应助科研通管家采纳,获得10
24秒前
24秒前
24秒前
高分求助中
Manual of Clinical Microbiology, 4 Volume Set (ASM Books) 13th Edition 1000
Edestus (Chondrichthyes, Elasmobranchii) from the Upper Carboniferous of Xinjiang, China 500
Chinese-English Translation Lexicon Version 3.0 500
Electronic Structure Calculations and Structure-Property Relationships on Aromatic Nitro Compounds 500
マンネンタケ科植物由来メロテルペノイド類の網羅的全合成/Collective Synthesis of Meroterpenoids Derived from Ganoderma Family 500
薩提亞模式團體方案對青年情侶輔導效果之研究 400
[Lambert-Eaton syndrome without calcium channel autoantibodies] 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2380233
求助须知:如何正确求助?哪些是违规求助? 2087519
关于积分的说明 5241567
捐赠科研通 1814664
什么是DOI,文献DOI怎么找? 905317
版权声明 558734
科研通“疑难数据库(出版商)”最低求助积分说明 483303