Integrating atlas and graph cut methods for left ventricle segmentation from cardiac cine MRI

6Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Magnetic Resonance Imaging (MRI) has evolved as a clinical standard-of-care imaging modality for cardiac morphology, function assessment, and guidance of cardiac interventions. All these applications rely on accurate extraction of the myocardial tissue and blood pool from the imaging data. Here we propose a framework for left ventricle (LV) segmentation from cardiac cine MRI. First, we segment the LV blood pool using iterative graph cuts, and subsequently use this information to segment the myocardium. We formulate the segmentation procedure as an energy minimization problem in a graph subject to the shape prior obtained by label propagation from an average atlas using affine registration. The proposed framework has been validated on 30 patient cardiac cine MRI datasets available through the STACOM LV segmentation challenge and yielded fast, robust, and accurate segmentation results.

Cite

CITATION STYLE

APA

Dangi, S., Cahill, N., & Linte, C. A. (2017). Integrating atlas and graph cut methods for left ventricle segmentation from cardiac cine MRI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10124 LNCS, pp. 76–86). Springer Verlag. https://doi.org/10.1007/978-3-319-52718-5_9

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