Minimum average-cost path for real time 3D coronary artery segmentation of CT images

N/ACitations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we propose a Minimum Average-cost Path (MACP) model for segmenting 3D coronary arteries by minimizing the average edge cost along path in discrete 4D graph constructed by image voxels and associated radii. Prim's Minimum Spanning Tree method is used for efficient optimization of the MACP model. The centerline and the radii of the cross sections of the coronary artery are extracted simultaneously during the optimization. The method does not need any image preprocessing steps and has been intensively validated as an effective approach with the Rotterdam Coronary Artery Algorithm Evaluation Framework [1]. The computational cost of the proposed method is particularly low (7.467 seconds per segment, 18.5mm/s on average), which makes real time segmentation of coronary artery possible. Shortcut problem, which is a classic issue of the minimal path techniques, can also be overcome by the proposed method. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhu, N., & Chung, A. C. S. (2011). Minimum average-cost path for real time 3D coronary artery segmentation of CT images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6893 LNCS, pp. 436–444). https://doi.org/10.1007/978-3-642-23626-6_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free