Using atlas prior with graph cut methods for right ventricle segmentation from cardiac MRI

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

Abstract

Right ventricle segmentation helps quantify many functional parameters of the heart and construct anatomical models for intervention planning. Here we propose a fast and accurate graph cut segmentation algorithm to extract the right ventricle from cine cardiac MRI sequences. A shape prior obtained by propagating the right ventricle label from an average atlas via affine registration is incorporated into the graph energy. The optimal segmentation obtained from the graph cut is iteratively refined to produce the final right ventricle blood pool segmentation. We evaluate our segmentation results against gold-standard expert manual segmentation of 16 cine MRI datasets available through the MICCAI 2012 Cardiac MR Right Ventricle Segmentation Challenge. Our method achieved an average Dice Index 0.83, a Jaccard Index 0.75, Mean absolute distance of 5.50 mm, and a Hausdorff distance of 10.00 mm.

Cite

CITATION STYLE

APA

Dangi, S., & Linte, C. A. (2017). Using atlas prior with graph cut methods for right ventricle segmentation from cardiac MRI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10263 LNCS, pp. 83–94). Springer Verlag. https://doi.org/10.1007/978-3-319-59448-4_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