Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.03708 v2 pith:TQNH5L5J submitted 2023-04-07 eess.IV cs.CV

classification eess.IVcs.CV
keywords segmentationmulti-levelautomaticbranchchallengeefficientmainparse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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/}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 11 citations worldwide. Full citation record

  1. VesselTok: Tokenizing Vessel-like 3D Biomedical Graph Representations for Reconstruction and Generation

    cs.CV 2026-03 conditional novelty 6.0 of 10

    VesselTok learns compact continuous tokens of large tubular biomedical graphs from centerline points plus a fixed pseudo-radius, enabling reconstruction, generation, and link prediction across anatomies.

  2. Trexplorer Super: Topologically Correct Centerline Tree Tracking of Tubular Objects in CT Volumes

    cs.CV 2025-07 conditional novelty 5.0 of 10

    Trexplorer Super improves centerline tree tracking in CT volumes using Super Trajectory Training, Focal Cross Attention, and Target Augmentation, and outperforms prior models on new synthetic and real datasets.

Pith tools