Automatic Localization and Segmentation of Left Ventricle from Short Axis Cine MR Images: An Image Driven Method
01 Jan 2012-pp 87-99
TL;DR: This work focuses on a method to automatically localize the heart region, and segment the left ventricle from 4D cardiac cine MR images with no user input.
Abstract: This work focuses on a method to automatically localize the heart region, and segment the left ventricle from 4D cardiac cine MR images with no user input. Initial estimate of the heart region, relies on temporal variation of intensity values over one cardiac cycle along with the prior knowledge on spatial geometry. The estimated region is threshold and a sequence of morphological operations applied to crop the region of interest. Level set based segmentation framework developed in this paper is fully automatic, and does not require manually drawn initial contour. The method was evaluated on MRI short axis cine slices of 15 subjects from MICCAI 2009 LV challenge database.
Citations
More filters
TL;DR: In this paper, the authors proposed a deep learning network using a residual block for the segmentation of the heart and a random data augmentation strategy to reduce the training time and the problem of overfitting.
Abstract: Objectives. The purpose of this study was to segment the left ventricle (LV) blood pool, LV myocardium, and right ventricle (RV) blood pool of end-diastole and end-systole frames in free-breathing cardiac magnetic resonance (CMR) imaging. Automatic and accurate segmentation of cardiac structures could reduce the postprocessing time of cardiac function analysis. Method. We proposed a novel deep learning network using a residual block for the segmentation of the heart and a random data augmentation strategy to reduce the training time and the problem of overfitting. Automated cardiac diagnosis challenge (ACDC) data were used for training, and the free-breathing CMR data were used for validation and testing. Results. The average Dice was 0.919 (LV), 0.806 (myocardium), and 0.818 (RV). The average IoU was 0.860 (LV), 0.699 (myocardium), and 0.761 (RV). Conclusions. The proposed method may aid in the segmentation of cardiac images and improves the postprocessing efficiency of cardiac function analysis.
23 citations
TL;DR: Cardiovascular diseases are leading cause of death worldwide and timely and accurate detection of disease is required to reduce load on healthcare system and number of deaths.
Abstract: Cardiovascular diseases are leading cause of death worldwide. Timely and accurate detection of disease is required to reduce load on healthcare system and number of deaths. For this, accurate and f...
17 citations
TL;DR: The proposed technique utilizes the convolutional neural network to locate the left ventricle and to obtain the end-diastole and theend-systole frames from the respiratory motion signal and demonstrates a high degree of accuracy and stability.
Abstract: Free-breathing cardiac magnetic resonance (CMR) imaging has short examination time with high reproducibility. Detection of the end-diastole and the end-systole frames of the free-breathing cardiac magnetic resonance, supplemented by visual identification, is time consuming and laborious. We propose a novel method for automatic identification of both the end-diastole and the end-systole frames, in the free-breathing CMR imaging. The proposed technique utilizes the convolutional neural network to locate the left ventricle and to obtain the end-diastole and the end-systole frames from the respiratory motion signal. The proposed procedure works successfully on our free-breathing CMR data, and the results demonstrate a high degree of accuracy and stability. Convolutional neural network improves the postprocessing efficiency greatly and facilitates the clinical application of the free-breathing CMR imaging.
16 citations
References
More filters
TL;DR: This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.
Abstract: A snake is an energy-minimizing spline guided by external constraint forces and influenced by image forces that pull it toward features such as lines and edges. Snakes are active contour models: they lock onto nearby edges, localizing them accurately. Scale-space continuation can be used to enlarge the capture region surrounding a feature. Snakes provide a unified account of a number of visual problems, including detection of edges, lines, and subjective contours; motion tracking; and stereo matching. We have used snakes successfully for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest.
18,095 citations
TL;DR: The PSC algorithm as mentioned in this paper approximates the Hamilton-Jacobi equations with parabolic right-hand-sides by using techniques from the hyperbolic conservation laws, which can be used also for more general surface motion problems.
13,020 citations
20 Jun 1995
TL;DR: A novel scheme for the detection of object boundaries based on active contours evolving in time according to intrinsic geometric measures of the image, allowing stable boundary detection when their gradients suffer from large variations, including gaps.
Abstract: A novel scheme for the detection of object boundaries is presented. The technique is based on active contours deforming according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric as defined by the image content. This geodesic approach for object segmentation allows to connect classical "snakes" based on energy minimization and geometric active contours based on the theory of curve evolution. Previous models of geometric active contours are improved as showed by a number of examples. Formal results concerning existence, uniqueness, stability, and correctness of the evolution are presented as well. >
5,566 citations
20 Jun 2005
TL;DR: A new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and therefore completely eliminates the need of the costly re-initialization procedure.
Abstract: In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and therefore completely eliminates the need of the costly re-initialization procedure. Our variational formulation consists of an internal energy term that penalizes the deviation of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image features, such as object boundaries. The resulting evolution of the level set function is the gradient flow that minimizes the overall energy functional. The proposed variational level set formulation has three main advantages over the traditional level set formulations. First, a significantly larger time step can be used for numerically solving the evolution partial differential equation, and therefore speeds up the curve evolution. Second, the level set function can be initialized with general functions that are more efficient to construct and easier to use in practice than the widely used signed distance function. Third, the level set evolution in our formulation can be easily implemented by simple finite difference scheme and is computationally more efficient. The proposed algorithm has been applied to both simulated and real images with promising results.
2,005 citations
TL;DR: A new model to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah functional for segmentation and level sets, which can detect objects whose boundaries are not necessarily defined by gradient is proposed.
Abstract: In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. The model is a combination between more classical active contour models using mean curvature motion techniques, and the Mumford-Shah model for segmentation. We minimize an energy which can be seen as a particular case of the so-called minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature flow"-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. Finally, we will present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable.
487 citations