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

A comprehensive lung CT landmark pair dataset for evaluating deformable image registration algorithms

地标 图像配准 计算机视觉 人工智能 计算机科学 算法 图像(数学) 模式识别(心理学)
作者
Edward Robert Criscuolo,Yabo Fu,Yao Hao,Zhendong Zhang,Deshan Yang
出处
期刊:Medical Physics [Wiley]
卷期号:51 (5): 3806-3817 被引量:2
标识
DOI:10.1002/mp.17026
摘要

Abstract Purpose Deformable image registration (DIR) is a key enabling technology in many diagnostic and therapeutic tasks, but often does not meet the required robustness and accuracy for supporting clinical tasks. This is in large part due to a lack of high‐quality benchmark datasets by which new DIR algorithms can be evaluated. Our team was supported by the National Institute of Biomedical Imaging and Bioengineering to develop DIR benchmark dataset libraries for multiple anatomical sites, comprising of large numbers of highly accurate landmark pairs on matching blood vessel bifurcations. Here we introduce our lung CT DIR benchmark dataset library, which was developed to improve upon the number and distribution of landmark pairs in current public lung CT benchmark datasets. Acquisition and Validation Methods Thirty CT image pairs were acquired from several publicly available repositories as well as authors’ institution with IRB approval. The data processing workflow included multiple steps: (1) The images were denoised. (2) Lungs, airways, and blood vessels were automatically segmented. (3) Bifurcations were directly detected on the skeleton of the segmented vessel tree. (4) Falsely identified bifurcations were filtered out using manually defined rules. (5) A DIR was used to project landmarks detected on the first image onto the second image of the image pair to form landmark pairs. (6) Landmark pairs were manually verified. This workflow resulted in an average of 1262 landmark pairs per image pair. Estimates of the landmark pair target registration error (TRE) using digital phantoms were 0.4 mm ± 0.3 mm. Data Format and Usage Notes The data is published in Zenodo at https://doi.org/10.5281/zenodo.8200423 . Instructions for use can be found at https://github.com/deshanyang/Lung‐DIR‐QA . Potential Applications The dataset library generated in this work is the largest of its kind to date and will provide researchers with a new and improved set of ground truth benchmarks for quantitatively validating DIR algorithms within the lung.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
乔治韦斯莱完成签到 ,获得积分10
7秒前
14秒前
16秒前
hhhhh完成签到 ,获得积分10
19秒前
葛怀锐完成签到 ,获得积分10
21秒前
想学习发布了新的文献求助20
22秒前
32秒前
性温雅完成签到 ,获得积分10
36秒前
鳗鱼行天发布了新的文献求助30
39秒前
40秒前
木木彡发布了新的文献求助10
45秒前
能干的山雁完成签到 ,获得积分10
46秒前
47秒前
3080完成签到 ,获得积分10
47秒前
l98916发布了新的文献求助10
52秒前
aniywn完成签到 ,获得积分10
57秒前
鳗鱼行天完成签到,获得积分10
57秒前
科研通AI5应助Ni采纳,获得10
1分钟前
1分钟前
1分钟前
1分钟前
RUSeries发布了新的文献求助10
1分钟前
1分钟前
ding应助meng采纳,获得10
1分钟前
Ni发布了新的文献求助10
1分钟前
fengliurencai完成签到,获得积分10
1分钟前
姜忆霜完成签到 ,获得积分10
1分钟前
优秀的学习崽完成签到,获得积分10
1分钟前
1分钟前
miaomiaomiao发布了新的文献求助10
1分钟前
sam发布了新的文献求助200
1分钟前
Nakacoke77完成签到,获得积分10
1分钟前
Murphy完成签到 ,获得积分10
1分钟前
顾矜应助冷傲的灯泡采纳,获得10
1分钟前
包容东蒽完成签到 ,获得积分10
1分钟前
1分钟前
赘婿应助科研通管家采纳,获得10
1分钟前
科研通AI2S应助科研通管家采纳,获得10
1分钟前
SciGPT应助科研通管家采纳,获得10
1分钟前
morena应助科研通管家采纳,获得10
1分钟前
高分求助中
Production Logging: Theoretical and Interpretive Elements 2700
Neuromuscular and Electrodiagnostic Medicine Board Review 1000
こんなに痛いのにどうして「なんでもない」と医者にいわれてしまうのでしょうか 510
The First Nuclear Era: The Life and Times of a Technological Fixer 500
岡本唐貴自伝的回想画集 500
Distinct Aggregation Behaviors and Rheological Responses of Two Terminally Functionalized Polyisoprenes with Different Quadruple Hydrogen Bonding Motifs 450
Ciprofol versus propofol for adult sedation in gastrointestinal endoscopic procedures: a systematic review and meta-analysis 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3671180
求助须知:如何正确求助?哪些是违规求助? 3228098
关于积分的说明 9778330
捐赠科研通 2938347
什么是DOI,文献DOI怎么找? 1609853
邀请新用户注册赠送积分活动 760473
科研通“疑难数据库(出版商)”最低求助积分说明 735976