Segmentation of image sequences is an important task in medical image analysis, which enables clinicians to assess the anatomy and function of moving organs. However, direct application of a segmentation algorithm to each time frame of a sequence may ignore the temporal continuity inherent in the sequence. In this work, we propose an image sequence segmentation algorithm by combining a fully convolutional network with a recurrent neural network, which incorporates both spatial and temporal information into the segmentation task. A key challenge in training this network is that the available manual annotations are temporally sparse, which forbids end-to-end training. We address this challenge by performing non-rigid label propagation on the annotations and introducing an exponentially weighted loss function for training. Experiments on aortic MR image sequences demonstrate that the proposed method significantly improves both accuracy and temporal smoothness of segmentation, compared to a baseline method that utilises spatial information only. It achieves an average Dice metric of 0.960 for the ascending aorta and 0.953 for the descending aorta.
For aortic image sequence segmentation, a deformable model approach has been proposed @cite_10 , which requires a region of interest and the centre of aorta to be manually defined in initialisation. This work proposes a fully automated segmentation method.
@cite_10
1969202437 2000828905 1519413489 1972519108
Purpose: To assess if segmentation of the aorta can be accurately achieved using the modulus image of phase contrast (PC) magnetic resonance (MR) acquisitions. Materials and Methods: PC image sequences containing both the ascending and descending aorta of 52 subjects were acquired using three different MR scanners. An automated segmentation technique, based on a 2D+t deformable surface that takes into account the features of PC aortic images, such as flow-related effects, was developed. The study was designed to: 1) assess the variability of our approach and its robustness to the type of MR scanner, and 2) determine its sensitivity to aortic dilation and its accuracy against an expert manual tracing. Results: Interobserver variability in the lumen area was 0.59 ± 0.92 for the automated approach versus 10.09 ± 8.29 for manual segmentation. The mean Dice overlap measure was 0.945 ± 0.014. The method was robust to the aortic size and highly correlated (r = 0.99) with the manual tracing in terms of aortic area and diameter. Conclusion: A fast and robust automated segmentation of the aortic lumen was developed and successfully tested on images provided by various MR scanners and acquired on healthy volunteers as well as on patients with a dilated aorta. J. Magn. Reson. Imaging 2010;31:881–888. ©2010 Wiley-Liss, Inc. Abstract We present a machine learning approach called shape regression machine (SRM) for efficient segmentation of an anatomic structure that exhibits a deformable shape in a medical image, e.g., left ventricle endocardial wall in an echocardiogram. The SRM achieves efficient segmentation via statistical learning of the interrelations among shape, appearance, and anatomy , which are exemplified by an annotated database. The SRM is a two-stage approach. In the first stage that estimates a rigid shape to solve an automatic initialization problem, it derives a regression solution to object detection that needs just one scan in principle and a sparse set of scans in practice, avoiding the exhaustive scanning required by the state-of-the-art classification-based detection approach while yielding comparable detection accuracy. In the second stage that estimates the nonrigid shape, it again learns a nonlinear regressor to directly associate nonrigid shape with image appearance. The underpinning of both stages is a novel image-based boosting ridge regression (IBRR) method that enables multivariate, nonlinear modeling and accommodates fast evaluation. We demonstrate the efficiency and effectiveness of the SRM using experiments on segmenting the left ventricle endocardium from a B-mode echocardiogram of apical four chamber view. The proposed algorithm is able to automatically detect and accurately segment the LV endocardial border in about 120 ms . In this paper we present a new method for fully automatic left ventricle segmentation from 4D cardiac MR datasets. To deal with the diverse dataset, we propose a machine learning approach using two layers of spatio-temporal decision forests with almost no assumptions on the data nor explicitly specifying the segmentation rules. We introduce 4D spatio-temporal features to classification with decision forests and propose a method for context aware MR intensity standardization and image alignment. The second layer is then used for the final image segmentation. We present our first results on the STACOM LV Segmentation Challenge 2011 validation datasets. We present a new multiscale approach for deformable contour optimization. The method relies on a multigrid minimization method and a coarse-to-fine relaxation algorithm. This approach consists in minimizing a cascade of optimization problems of reduced and increasing complexity instead of considering the minimization problem on the full and original configuration space. Contrary to classical multiresolution algorithms, no reduction of image is applied. The family of defined energy functions are derived from the original (full resolution) objective function, ensuring that the same function is handled at each scale and that the energy decreases at each step of the deformable contour minimization process. The efficiency and the speed of this multiscale optimization strategy is demonstrated in the difficult context of the minimization of a region-based contour energy function ensuring the boundary detection of anatomical structures in ultrasound medical imagery. In this context, the proposed multiscale segmentation method is compared to other classical region-based segmentation approaches such as Maximum Likelihood or Markov Random Field-based segmentation techniques. We also extend this multiscale segmentation strategy to active contour models using a classical edge-based likelihood approach. Finally, time and performance analysis of this approach, compared to the (commonly used) dynamic programming-based optimization procedure, is given and allows to attest the accuracy and the speed of the proposed method.