3D Graph-Connectivity Constrained Network for Hepatic Vessel Segmentation

计算机科学 推论 分割 人工智能 卷积神经网络 切割 图形 人工神经网络 图像分割 计算机视觉 模式识别(心理学) 特征提取 血管 医学影像学 图论 数据挖掘 数学形态学 图形模型 图像(数学) 构造(python库) 深度学习
作者
Ruikun Li,Yi-Jie Huang,Huai Chen,Xiaoqing Liu,Yizhou Yu,Dahong Qian,Lisheng Wang
出处
期刊:IEEE Journal of Biomedical and Health Informatics [Institute of Electrical and Electronics Engineers]
卷期号:26 (3): 1251-1262 被引量:32
标识
DOI:10.1109/jbhi.2021.3118104
摘要

Segmentation of hepatic vessels from 3D CT images is necessary for accurate diagnosis and preoperative planning for liver cancer. However, due to the low contrast and high noises of CT images, automatic hepatic vessel segmentation is a challenging task. Hepatic vessels are connected branches containing thick and thin blood vessels, showing an important structural characteristic or a prior: the connectivity of blood vessels. However, this is rarely applied in existing methods. In this paper, we segment hepatic vessels from 3D CT images by utilizing the connectivity prior. To this end, a graph neural network (GNN) used to describe the connectivity prior of hepatic vessels is integrated into a general convolutional neural network (CNN). Specifically, a graph attention network (GAT) is first used to model the graphical connectivity information of hepatic vessels, which can be trained with the vascular connectivity graph constructed directly from the ground truths. Second, the GAT is integrated with a lightweight 3D U-Net by an efficient mechanism called the plug-in mode, in which the GAT is incorporated into the U-Net as a multi-task branch and is only used to supervise the training procedure of the U-Net with the connectivity prior. The GAT will not be used in the inference stage, and thus will not increase the hardware and time costs of the inference stage compared with the U-Net. Therefore, hepatic vessel segmentation can be well improved in an efficient mode. Extensive experiments on two public datasets show that the proposed method is superior to related works in accuracy and connectivity of hepatic vessel segmentation.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
复杂的含蕾完成签到 ,获得积分10
1秒前
完美世界应助小小采纳,获得10
2秒前
难过花瓣发布了新的文献求助10
3秒前
drz完成签到,获得积分10
4秒前
yyjw完成签到,获得积分10
5秒前
LKW完成签到,获得积分10
5秒前
须眉交白完成签到,获得积分10
5秒前
今后应助gyx采纳,获得10
7秒前
7秒前
闪闪似狮完成签到,获得积分10
8秒前
freedommm发布了新的文献求助30
12秒前
桐桐应助qinser采纳,获得30
14秒前
elmqs完成签到,获得积分10
16秒前
斯文败类应助Fancy采纳,获得10
19秒前
webmaster完成签到,获得积分10
20秒前
Lucas应助EricXu采纳,获得10
21秒前
Komorebi完成签到,获得积分0
21秒前
Dafuer完成签到,获得积分10
21秒前
22秒前
DreamLover完成签到,获得积分10
23秒前
24秒前
层次感完成签到,获得积分20
25秒前
科研通AI6.3应助闪闪似狮采纳,获得10
25秒前
徐子昂发布了新的文献求助10
26秒前
李健的粉丝团团长应助xhy采纳,获得10
27秒前
层次感发布了新的文献求助10
28秒前
Suoe完成签到,获得积分10
28秒前
29秒前
gyx发布了新的文献求助10
29秒前
29秒前
Kyrie 11发布了新的文献求助10
31秒前
wwy727完成签到,获得积分10
32秒前
我是老大应助迅速听白采纳,获得10
34秒前
35秒前
董家旭发布了新的文献求助10
35秒前
37秒前
难过花瓣发布了新的文献求助10
37秒前
Sun1c7发布了新的文献求助10
39秒前
风格的好的完成签到,获得积分20
40秒前
Kyrie 11完成签到,获得积分10
42秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
PowerCascade: A Synthetic Dataset for Cascading Failure Analysis in Power Systems 2000
Picture this! Including first nations fiction picture books in school library collections 1500
Instituting Science: The Cultural Production of Scientific Disciplines 666
Signals, Systems, and Signal Processing 610
The Organization of knowledge in modern America, 1860-1920 / 600
Unlocking Chemical Thinking: Reimagining Chemistry Teaching and Learning 555
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6360525
求助须知:如何正确求助?哪些是违规求助? 8174711
关于积分的说明 17218701
捐赠科研通 5415599
什么是DOI,文献DOI怎么找? 2866032
邀请新用户注册赠送积分活动 1843248
关于科研通互助平台的介绍 1691336