Automatic segmentation of cardiac MRI

24Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new method is proposed for automatic segmentation of cardiac MRI. The novelty is that we analyze motion to extract the information that other algorithms rely on users to input manually, such as an initial contour or seed points. The motion map, once computed, restricts subsequent processing to be constrained within a region of interest that envelops the heart. Focusing the computation in this manner resolves some of the ambiguity that causes the image segmentation problem to be an ill-posed one. The segmentation is then performed using a new contextual dependency network (CDN) that incorporates context via hierarchical processing. Within this framework, voxels are first classified as independent events with an EM approach to simultaneously correct for field inhomogeneity. The algorithm next considers neighborhood interactions using a Markov random field, followed by region-level properties, and finally, relationships between regions. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Gering, D. T. (2003). Automatic segmentation of cardiac MRI. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2878, 524–532. https://doi.org/10.1007/978-3-540-39899-8_65

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