arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.03708eess.IVcs.CV
收藏

多级肺动脉的高效自动分割:PARSE 挑战赛

Efficient automatic segmentation for multi-level pulmonary arteries: The PARSE challenge

School of Computer Science and Technology, Harbin Institute of Technology(哈尔滨工业大学计算机科学与技术学院);Case Western Reserve University(凯斯西储大学);Institute of Information and Computer Engineering, NorthEast Forestry University(东北林业大学信息与计算机工程学院);Infervision Medical Technology Co., Ltd.(Infervision医疗科技有限公司);Sensetime(商汤科技);Beijing Institute of Technology(北京理工大学)
Gongning Luo, Kuanquan Wang, Jun Liu, Shuo Li, Xinjie Liang, Xiangyu Li, Shaowei Gan, Wei Wang, Suyu Dong, Wenyi Wang, Pengxin Yu, Enyou Liu, Hongrong Wei, Na W… 展开作者

Gongning Luo, Kuanquan Wang, Jun Liu, Shuo Li, Xinjie Liang, Xiangyu Li, Shaowei Gan, Wei Wang, Suyu Dong, Wenyi Wang, Pengxin Yu, Enyou Liu, Hongrong Wei, Na Wang, Jia Guo, Huiqi Li, Zhao Zhang, Ziwei Zhao, Na Gao, Nan An, Ashkan Pakzad, Bojidar Rangelov, Jiaqi Dou, Song Tian, Zeyu Liu, Yi Wang, Ampatishan Sivalingam, Kumaradevan Punithakumar, Zhaowen Qiu, Xin Gao

AI总结:

该研究组织首届 PARSE 挑战赛,构建多级肺动脉分割基准,并在精度之外同等考核推理时间与 GPU 显存,总结顶尖算法以推动高效准确的临床自动分割。

摘要:

在 CTPA 图像中对多级(即主干和分支)肺动脉(PA)进行高效自动分割,在临床应用中具有重要作用。然而,现有大多数方法只分别关注主干 PA 或分支 PA 的分割,而忽视了分割效率。此外,目前没有聚焦于 PA 分割的公开大规模数据集,这使得不同方法之间的比较极具挑战性。为了对多级 PA 分割算法进行基准测试,我们组织了首届肺动脉分割(Pulmonary ARtery SEgmentation,PARSE)挑战赛。一方面,我们同时关注主干 PA 和分支 PA 的分割;另一方面,为了更好地服务临床应用,我们在保证 PA 分割精度的同时,赋予分割效率(主要是推理期间的运行时间和 GPU 显存消耗)相同的评分权重。本文总结了排名靠前的算法,并为高效且准确的多级 PA 自动分割提供了一些建议。我们向社区开放 PARSE 挑战赛,以便在 https://parse2022.grand-challenge.org/Parse2022/ 上对未来的算法开发进行基准测试。

英文摘要:

Efficient automatic segmentation of multi-level (i.e. main and branch) pulmonary arteries (PA) in CTPA images plays a significant role in clinical applications. However, most existing methods concentrate only on main PA or branch PA segmentation separately and ignore segmentation efficiency. Besides, there is no public large-scale dataset focused on PA segmentation, which makes it highly challenging to compare the different methods. To benchmark multi-level PA segmentation algorithms, we organized the first \textbf{P}ulmonary \textbf{AR}tery \textbf{SE}gmentation (PARSE) challenge. On the one hand, we focus on both the main PA and the branch PA segmentation. On the other hand, for better clinical application, we assign the same score weight to segmentation efficiency (mainly running time and GPU memory consumption during inference) while ensuring PA segmentation accuracy. We present a summary of the top algorithms and offer some suggestions for efficient and accurate multi-level PA automatic segmentation. We provide the PARSE challenge as open-access for the community to benchmark future algorithm developments at \url{https://parse2022.grand-challenge.org/Parse2022/}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑