ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2304.03708
11
16

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

7 April 2023
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
Zhaoqi Zhang
Ziwei Zhao
Naishen Gao
Nan An
A. Pakzad
B. Rangelov
Jiaqi Dou
Song Tian
Zeyu Liu
Yi Wang
Ampatishan Sivalingam
K. Punithakumar
Zhaowen Qiu
Xing-bao Gao
ArXivPDFHTML
Abstract

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/}.

View on arXiv
Comments on this paper