Automated Lumen Segmentation in Carotid Artery Ultrasound Images Based on Adaptive Generated Shape Prior.

Ultrasound imaging is vital for diagnosing carotid artery vascular lesions, highlighting the importance of accurately segmenting lumens in ultrasound images to prevent, diagnose and treat vascular diseases. However, noise artifacts, blood residue and discontinuous lumens significantly affect segmentation accuracy. To achieve accurate lumen segmentation in low-quality images, we propose a novel segmentation algorithm which is guided by an adaptively generated shape prior. To tackle the above challenges, we introduce a shape-prior-based segmentation method for carotid artery lumen walls. The shape prior in this study is adaptively generated based on the evolutionary trend of vessel growth. Shape priors guide and constrain the active contour, resulting in precise segmentation. The efficacy of the proposed model was confirmed using 247 carotid artery ultrasound images, with experimental results showing an average Dice coefficient of 92.38%, demonstrating superior segmentation performance compared to existing mathematical models. Our method can quickly and effectively perform accurate lumen segmentation on low-quality carotid artery ultrasound images, which is of great significance for the diagnosis of cardiovascular and cerebrovascular diseases.

Shape prior-constrained deep learning network for medical image segmentation.

We propose a shape prior representation-constrained multi-scale features fusion segmentation network for medical image segmentation, including training and testing stages. The novelty of our training framework lies in two modules comprised of the shape prior constraint and the multi-scale features fusion. The shape prior learning model is embedded into a segmentation neural network to solve the problems of low contrast and neighboring organs with intensities similar to the target organ. The latter can provide both local and global contexts to address the issues of large variations in patient postures as well as organ's shape. In the testing stage, we propose a circular collaboration framework strategy which combines a shape generator auto-encoder network model with a segmentation network model, allowing the two models to collaborate with each other, resulting in a cooperative effect that leads to accurate segmentations. Our proposed method is evaluated and demonstrated on the ACDC MICCAI'17 Challenge Dataset, CT scans datasets, namely, in COVID-19 CT lung, and LiTS2017 liver from three different datasets, and its results are compared with the recent state of the art in these areas. Our method ranked 1st on the ACDC Dataset in terms of Dice score and achieved very competitive performance on COVID-19 CT lung and LiTS2017 liver segmentation.

Multi-target landmark detection with incomplete images via reinforcement learning and shape prior embedding.

Medical images are generally acquired with limited field-of-view (FOV), which could lead to incomplete regions of interest (ROI), and thus impose a great challenge on medical image analysis. This is particularly evident for the learning-based multi-target landmark detection, where algorithms could be misleading to learn primarily the variation of background due to the varying FOV, failing the detection of targets. Based on learning a navigation policy, instead of predicting targets directly, reinforcement learning (RL)-based methods have the potential to tackle this challenge in an efficient manner. Inspired by this, in this work we propose a multi-agent RL framework for simultaneous multi-target landmark detection. This framework is aimed to learn from incomplete or (and) complete images to form an implicit knowledge of global structure, which is consolidated during the training stage for the detection of targets from either complete or incomplete test images. To further explicitly exploit the global structural information from incomplete images, we propose to embed a shape model into the RL process. With this prior knowledge, the proposed RL model can not only localize dozens of targets simultaneously, but also work effectively and robustly in the presence of incomplete images. We validated the applicability and efficacy of the proposed method on various multi-target detection tasks with incomplete images from practical clinics, using body dual-energy X-ray absorptiometry (DXA), cardiac MRI and head CT datasets. Results showed that our method could predict whole set of landmarks with incomplete training images up to 80% missing proportion (average distance error 2.29 cm on body DXA), and could detect unseen landmarks in regions with missing image information outside FOV of target images (average distance error 6.84 mm on 3D half-head CT). Our code will be released via https://zmiclab.github.io/projects.html.

Lens structure segmentation from AS-OCT images via shape-based learning.

BACKGROUND AND OBJECTIVES: The lens is one of the important refractive media in the eyeball. Abnormality of the nucleus or cortex in the lens can lead to ocular disorders such as cataracts and presbyopia. To achieve an accurate diagnosis, segmentation of these ocular structures from anterior segment optical coherence tomography (AS-OCT) is essential. However, weak-contrast boundaries of the object in the images present a challenge for accurate segmentation. The state-of-the-art (SOTA) methods, such as U-Net, treat segmentation as a binary classification of pixels, which cannot handle pixels on weak-contrast boundaries well. METHODS: In this paper, we propose to incorporate shape prior into a deep learning framework for accurate nucleus and cortex segmentation. Specifically, we propose to learn a level set function, whose zero-level set represents the object boundary, through a convolutional neural network. Moreover, we design a novel shape-based loss function, where the shape prior knowledge can be naturally embedded into the learning procedure, leading to improvement in performance. We collect a high-quality AS-OCT image dataset with precise annotations to train our model. RESULTS: Abundant experiments are conducted to verify the effectiveness of the proposed framework and the novel shape-based loss. The mean Intersection over Unions (MIoUs) of the proposed method for lens nucleus and cortex segmentation are 0.946 and 0.957, and the mean Euclidean Distance (MED) measure, which can reflect the accuracy of the segmentation boundary, are 6.746 and 2.045 pixels. In addition, the proposed shape-based loss improves the SOTA models on the nucleus and cortex segmentation tasks by an average of 0.0156 and 0.0078 in the MIoU metric and 1.394 and 0.134 pixels in the MED metric. CONCLUSION: We transform the segmentation from a classification task to a regression task by making the model learn the level set function, and embed shape information in deep learning by designing loss functions. This allows the proposed method to be more efficient in the segmentation of the object with weak-contrast boundaries. CONCISE ABSTRACT: We propose to incorporate shape priors into a deep learning framework for accurate nucleus and cortex segmentation from AS-OCT images. Specifically, we propose to learn a level set function, where the zero-level set represents the boundary of the target. Meanwhile, we design a novel shape-based loss function in which additional convex shape prior can be embedded in the learning process, leading to an improvement in performance. The IOUs for nucleus and cortex segmentation are 0.946 and 0.957, while the MED that reflects the accuracy of the boundary are 6.746 and 2.045 pixels. The proposed shape-based loss improves the SOTA model for nucleus and cortex segmentation by an average of 0.0156 and 0.0078 in IOU, and 1.394 and 0.134 pixels in MED. We transform segmentation from classification to regression by making the model learn a level set function, resulting in improved performance at the boundary with weak contrast.

Lung tumor segmentation using dual-coupling net with shape prior based on lung and mediastinal window images from chest CT images.

BACKGROUND: Volumetric lung tumor segmentation is difficult due to the diversity of the sizes, locations and shapes of lung tumors, as well as the similarity in the intensity with surrounding tissue structures. OBJECTIVE: We propose a dual-coupling net for accurate lung tumor segmentation in chest CT images regardless of sizes, locations and shapes of lung tumors.METHODSTo extract shape information from lung tumors and use it as shape prior, three-planar images including axial, coronal, and sagittal planes are trained on 2D-Nets. Two types of window images, lung and mediastinal window images, are trained on 2D-Nets to distinguish lung tumors from the thoracic region and to better separate the boundaries of lung tumors from adjacent tissue structures. To prevent false-positive outliers to adjacent structures and to consider the spatial information of lung tumors, pairs of tumor volume-of-interest (VOI) and tumor shape prior are trained on 3D-Net.RESULTSIn the first experiment, the dual-coupling net had the highest Dice Similarity Coefficient (DSC) of 75.7%, considering the shape prior as well as mediastinal window images to prevent the leakage of adjacent structures while maintaining the shape of the lung tumor, with 18.23% p, 3.7% p, 1.1% p, and 1.77% p higher DSCs than in the 2D-Net, 2.5D-Net, 3D-Net, and single-coupling net results, respectively. In the second experiment with annotations for two clinicians, the dual-coupling net showed outcomes of 67.73% and 65.07% regarding the DSC for each annotation. In the third experiment, the dual-coupling net showed 70.97% for the DSC.CONCLUSIONSThe dual-coupling net enables accurate segmentation by distinguishing lung tumors from surrounding tissue structures and thus yields the highest DSC value.

Structure boundary-preserving U-Net for prostate ultrasound image segmentation.

Prostate cancer diagnosis is performed under ultrasound-guided puncture for pathological cell extraction. However, determining accurate prostate location remains a challenge from two aspects: (1) prostate boundary in ultrasound images is always ambiguous; (2) the delineation of radiologists always occupies multiple pixels, leading to many disturbing points around the actual contour. We proposed a boundary structure-preserving U-Net (BSP U-Net) in this paper to achieve precise prostate contour. BSP U-Net incorporates prostate shape prior to traditional U-Net. The prior shape is built by the key point selection module, which is an active shape model-based method. Then, the module plugs into the traditional U-Net structure network to achieve prostate segmentation. The experiments were conducted on two datasets: PH2 + ISBI 2016 challenge and our private prostate ultrasound dataset. The results on PH2 + ISBI 2016 challenge achieved a Dice similarity coefficient (DSC) of 95.94% and a Jaccard coefficient (JC) of 88.58%. The results of prostate contour based on our method achieved a higher pixel accuracy of 97.05%, a mean intersection over union of 93.65%, a DSC of 92.54%, and a JC of 93.16%. The experimental results show that the proposed BSP U-Net has good performance on PH2 + ISBI 2016 challenge and prostate ultrasound image segmentation and outperforms other state-of-the-art methods.

AHU-MultiNet: Adaptive loss balancing based on homoscedastic uncertainty in multi-task medical image segmentation network.

Medical image segmentation is an important field in medical image analysis and a vital part of computer-aided diagnosis. Due to the challenges in acquiring image annotations, semi-supervised learning has attracted high attention in medical image segmentation. Despite their impressive performance, most existing semi-supervised approaches lack attention to ambiguous regions (e.g., some edges or corners around the organs). To achieve better performance, we propose a novel semi-supervised method called Adaptive Loss Balancing based on Homoscedastic Uncertainty in Multi-task Medical Image Segmentation Network (AHU-MultiNet). This model contains the main task for segmentation, one auxiliary task for signed distance, and another auxiliary task for contour detection. Our multi-task approach can effectively and sufficiently extract the semantic information of medical images by auxiliary tasks. Simultaneously, we introduce an inter-task consistency to explore the underlying information of the images and regularize the predictions in the right direction. More importantly, we notice and analyze that searching an optimal weighting manually to balance each task is a difficult and time-consuming process. Therefore, we introduce an adaptive loss balancing strategy based on homoscedastic uncertainty. Experimental results show that the two auxiliary tasks explicitly enforce shape-priors on the segmentation output to further generate more accurate masks under the adaptive loss balancing strategy. On several standard benchmarks, the 2018 Atrial Segmentation Challenge and the 2017 Liver Tumor Segmentation Challenge, our proposed method achieves improvements and outperforms the new state-of-the-art in semi-supervised learning.

Shape prior generation and geodesic active contour interactive iterating algorithm (SPACIAL): fully automatic segmentation for 3D lumen in intravascular optical coherence tomography images.

PURPOSE: Fully automatic lumen segmentation in intravascular optical coherence tomography (OCT) images can assist physicians in quickly estimating the health status of vessels. However, OCT images are usually degraded by residual blood, catheter walls, guide wire artifacts, etc., which significantly reduce the quality of segmentation. To achieve accurate lumen segmentation in low-quality images, we propose a novel segmentation algorithm named SPACIAL: Shape Prior generation and geodesic Active Contour Interactive iterAting aLgorithm, which is guided by an adaptively generated shape prior. METHODS: In this framework, the active contour evolves under the guidance of shape prior, while the shape prior is automatically and adaptively generated based on the active contour. The active contour and the shape prior interactively iterate each other, which can generate the adaptive shape prior and consequently lead to accurate segmentation results. In addition, a fast algorithm is introduced to accelerate the segmentation in 3D images. RESULTS: The validity of the model is verified in 3240 images from 12 OCT pullbacks. The experimental results show satisfactory segmentation accuracy and time efficiency: the average Dice coefficient of SPACIAL is 93.6(2.4)%, and 5.7 times faster than that of the classical level set method. CONCLUSION: The proposed SPACIAL can quickly and efficiently perform accurate lumen segmentation on low quality OCT images, which is of great importance to cardiovascular disease diagnosis . The SPACIAL method shows great potential in clinical applications.

Liver segmentation in abdominal CT images via auto-context neural network and self-supervised contour attention.

OBJECTIVE: Accurate image segmentation of the liver is a challenging problem owing to its large shape variability and unclear boundaries. Although the applications of fully convolutional neural networks (CNNs) have shown groundbreaking results, limited studies have focused on the performance of generalization. In this study, we introduce a CNN for liver segmentation on abdominal computed tomography (CT) images that focus on the performance of generalization and accuracy. METHODS: To improve the generalization performance, we initially propose an auto-context algorithm in a single CNN. The proposed auto-context neural network exploits an effective high-level residual estimation to obtain the shape prior. Identical dual paths are effectively trained to represent mutual complementary features for an accurate posterior analysis of a liver. Further, we extend our network by employing a self-supervised contour scheme. We trained sparse contour features by penalizing the ground-truth contour to focus more contour attentions on the failures. RESULTS: We used 180 abdominal CT images for training and validation. Two-fold cross-validation is presented for a comparison with the state-of-the-art neural networks. The experimental results show that the proposed network results in better accuracy when compared to the state-of-the-art networks by reducing 10.31% of the Hausdorff distance. Novel multiple N-fold cross-validations are conducted to show the best performance of generalization of the proposed network. CONCLUSION AND SIGNIFICANCE: The proposed method minimized the error between training and test images more than any other modern neural networks. Moreover, the contour scheme was successfully employed in the network by introducing a self-supervising metric.

LRVRG: a local region-based variational region growing algorithm for fast mandible segmentation from CBCT images.

OBJECTIVES: To segment the mandible from cone-beam computed tomography (CBCT) images efficiently and accurately for the 3D mandible model is essential for subsequent research and diagnosis. METHODS: This paper proposes a local region-based variational region growing algorithm, which integrates local region and shape prior to segment the mandible accurately. Firstly, we select initial seeds in the CBCT image and then calculate candidate point sets and the local region energy function of each point. If a point reduces the energy, it is selected to be a pixel of the foreground region. By multiple iterations, the mandible segmentation of the slice can be obtained. Secondly, the segmented result of the previous slice is adopted as the shape prior to the next slice until all of the slices in CBCT are segmented. At last, the final mandible model is reconstructed by the Marching Cubes algorithm. RESULTS: The experimental results on CBCT datasets illustrate the LRVRG algorithm can obtain satisfied 3D mandible models from CBCT images and it can solve the fuzzy problem effectively. Furthermore, quantitative comparisons with other methods demonstrate the proposed method achieves the state-of-the-art performance in mandible segmentation. CONCLUSIONS: Experiments demonstrate that our method is efficient and accurate for the mandible model segmentation.

Automatic Segmentation of the Prostate on MR Images based on Anatomy and Deep Learning.

Accurate segmentation of the prostate has many applications in the detection, diagnosis and treatment of prostate cancer. Automatic segmentation can be a challenging task because of the inhomogeneous intensity distributions on MR images. In this paper, we propose an automatic segmentation method for the prostate on MR images based on anatomy. We use the 3D U-Net guided by anatomy knowledge, including the location and shape prior knowledge of the prostate on MR images, to constrain the segmentation of the gland. The proposed method has been evaluated on the public dataset PROMISE2012. Experimental results show that the proposed method achieves a mean Dice similarity coefficient of 91.6% as compared to the manual segmentation. The experimental results indicate that the proposed method based on anatomy knowledge can achieve satisfactory segmentation performance for prostate MRI.

Shape prior model via dual subspace segment projection learning.

BACKGROUND AND OBJECTIVE: Shape prior models play a vital role for segmentation in medical image analysis. These models are most effective when shape variations can be captured by a parametric distribution, and sufficient training data is available. However, in the absence of these conditions, results are invariably much poorer. In this paper, we propose a novel shape prior model, via dual subspace segment projection learning (DSSPL), to address these challenges. METHODS: DSSPL serves to compose shapes from an ensemble of shape segments where each segment is formed using two subspaces: global shape subspace and segment-specific subspace, each necessary for extracting global shape patterns and local patterns, respectively. This ensures the proposed approach has general shape plausibility in regions of signal drop-out or missing boundary information, and also more localized flexibility. The learned projections are constrained with l2,1 sparse norm terms to extract the most distinguishable features, while the reconstructive properties of DSSPL reduces information loss and leverages the subspaces to provide contiguous shapes without any post-processing. RESULTS: Extensive analysis is performed on three databases from different medical imaging systems across X-Ray, MRI, and ultrasound. DSSPL outperforms all compared benchmarks in terms of shape generalization ability and segmentation performance. CONCLUSIONS: We propose a new shape prior model for segmentation in medical image analysis to address the challenges of modelling complex organ shapes with low sample size training data.

Convexity shape constraints for retinal blood vessel segmentation and foveal avascular zone detection.

Diabetic retinopathy (DR) has become a major worldwide health problem due to the increase in blindness among diabetics at early ages. The detection of DR pathologies such as microaneurysms, hemorrhages and exudates through advanced computational techniques is of utmost importance in patient health care. New computer vision techniques are needed to improve upon traditional screening of color fundus images. The segmentation of the entire anatomical structure of the retina is a crucial phase in detecting these pathologies. This work proposes a novel framework for fast and fully automatic blood vessel segmentation and fovea detection. The preprocessing method involved both contrast limited adaptive histogram equalization and the brightness preserving dynamic fuzzy histogram equalization algorithms to enhance image contrast and eliminate noise artifacts. Afterwards, the color spaces and their intrinsic components were examined to identify the most suitable color model to reveal the foreground pixels against the entire background. Several samples were then collected and used by the renowned convexity shape prior segmentation algorithm. The proposed methodology achieved an average vasculature segmentation accuracy exceeding 96%, 95%, 98% and 94% for the DRIVE, STARE, HRF and Messidor publicly available datasets, respectively. An additional validation step reached an average accuracy of 94.30% using an in-house dataset provided by the Hospital Sant Joan of Reus (Spain). Moreover, an outstanding detection accuracy of over 98% was achieved for the foveal avascular zone. An extensive state-of-the-art comparison was also conducted. The proposed approach can thus be integrated into daily clinical practice to assist medical experts in the diagnosis of DR.

A Combined Deep-Learning and Lattice Boltzmann Model for Segmentation of the Hippocampus in MRI.

Segmentation of the hippocampus (HC) in magnetic resonance imaging (MRI) is an essential step for diagnosis and monitoring of several clinical situations such as Alzheimer's disease (AD), schizophrenia and epilepsy. Automatic segmentation of HC structures is challenging due to their small volume, complex shape, low contrast and discontinuous boundaries. The active contour model (ACM) with a statistical shape prior is robust. However, it is difficult to build a shape prior that is general enough to cover all possible shapes of the HC and that suffers the problems of complicated registration of the shape prior and the target object and of low efficiency. In this paper, we propose a semi-automatic model that combines a deep belief network (DBN) and the lattice Boltzmann (LB) method for the segmentation of HC. The training process of DBN consists of unsupervised bottom-up training and supervised training of a top restricted Boltzmann machine (RBM). Given an input image, the trained DBN is utilized to infer the patient-specific shape prior of the HC. The specific shape prior is not only used to determine the initial contour, but is also introduced into the LB model as part of the external force to refine the segmentation. We used a subset of OASIS-1 as the training set and the preliminary release of EADC-ADNI as the testing set. The segmentation results of our method have good correlation and consistency with the manual segmentation results.

Training of head and neck segmentation networks with shape prior on small datasets.

PURPOSE: Cancer in the head and neck area is commonly treated with radiotherapy. A key step for low-risk treatment is the accurate delineation of organs at risk in the planning imagery. The success of deep learning in image segmentation led to automated algorithms achieving human expert performance on certain datasets. However, such algorithms require large datasets for training and fail to segment previously unseen pathologies, where human experts still succeed. As pathologies are rare and large datasets costly to generate, we investigate the effect of: reduced training data, batch sizes and incorporation of prior knowledge. METHODS: The small data problem is studied by training a full-volume segmentation network with the reduced amount of data from the MICCAI 2015 head and neck segmentation challenge. To improve the segmentation, we evaluate the batch size as a hyper-parameter and first study and then incorporate a stacked autoencoder as shape prior into the training process. RESULTS: We found that using half of the training data (12 images of 25) results in an accuracy drop of only 3% for the segmentation of organs at risk. Also, the batch size turns out to be relevant for the quality of the segmentation when trained with less than half of the data. By applying PCA on the autoencoder's latent space we achieve a compact and accurate shape model, which is used as a regularizer and significantly improves the segmentation results. CONCLUSION: Small training data of up to 12 training images is enough to train accurate head and neck segmentation models. By using a shape prior for regularization, the performance of the segmentation can be improved significantly on the full dataset. When training on fewer than 12 images, the batch size is relevant and models have to be trained much longer until convergence.

Two-Steps Coronary Artery Segmentation Algorithm Based on Improved Level Set Model in Combination with Weighted Shape-Prior Constraints.

Due to the complex topological structure of the coronary artery and the uneven distribution of the contrast agent, the angiography images are inevitably blurred and has low contrast, which causes great difficulty in process of segmentation. For this problem, a two-steps segmentation algorithm based on Hessian matrix and level set is proposed in this paper. Firstly, potential blood vessels of coronary images are preliminary extracted via Hessian matrix eigenvalues feature vectors of the geometric features and the response function. Then a novel regularization and area constraint is introduced into the local data energy fitting functional. Finally, the precision of Coronary Artery image is obtained in the evolution of the level set function. Experiments show that our proposed algorithm has better performance to these comparison segmentation algorithms.

Inferior vena cava segmentation with parameter propagation and graph cut.

PURPOSE: The inferior vena cava (IVC) is one of the vital veins inside the human body. Accurate segmentation of the IVC from contrast-enhanced CT images is of great importance. This extraction not only helps the physician understand its quantitative features such as blood flow and volume, but also it is helpful during the hepatic preoperative planning. However, manual delineation of the IVC is time-consuming and poorly reproducible. METHODS: In this paper, we propose a novel method to segment the IVC with minimal user interaction. The proposed method performs the segmentation block by block between user-specified beginning and end masks. At each stage, the proposed method builds the segmentation model based on information from image regional appearances, image boundaries, and a prior shape. The intensity range and the prior shape for this segmentation model are estimated based on the segmentation result from the last block, or from user- specified beginning mask if at first stage. Then, the proposed method minimizes the energy function and generates the segmentation result for current block using graph cut. Finally, a backward tracking step from the end of the IVC is performed if necessary. RESULTS: We have tested our method on 20 clinical datasets and compared our method to three other vessel extraction approaches. The evaluation was performed using three quantitative metrics: the Dice coefficient (Dice), the mean symmetric distance (MSD), and the Hausdorff distance (MaxD). The proposed method has achieved a Dice of [Formula: see text], an MSD of [Formula: see text] mm, and a MaxD of [Formula: see text] mm, respectively, in our experiments. CONCLUSION: The proposed approach can achieve a sound performance with a relatively low computational cost and a minimal user interaction. The proposed algorithm has high potential to be applied for the clinical applications in the future.

Random walks with shape prior for cochlea segmentation in ex vivo µCT.

PURPOSE: Cochlear implantation is a safe and effective surgical procedure to restore hearing in deaf patients. However, the level of restoration achieved may vary due to differences in anatomy, implant type and surgical access. In order to reduce the variability of the surgical outcomes, we previously proposed the use of a high-resolution model built from [Formula: see text] images and then adapted to patient-specific clinical CT scans. As the accuracy of the model is dependent on the precision of the original segmentation, it is extremely important to have accurate [Formula: see text] segmentation algorithms. METHODS: We propose a new framework for cochlea segmentation in ex vivo [Formula: see text] images using random walks where a distance-based shape prior is combined with a region term estimated by a Gaussian mixture model. The prior is also weighted by a confidence map to adjust its influence according to the strength of the image contour. Random walks is performed iteratively, and the prior mask is aligned in every iteration. RESULTS: We tested the proposed approach in ten [Formula: see text] data sets and compared it with other random walks-based segmentation techniques such as guided random walks (Eslami et al. in Med Image Anal 17(2):236-253, 2013) and constrained random walks (Li et al. in Advances in image and video technology. Springer, Berlin, pp 215-226, 2012). Our approach demonstrated higher accuracy results due to the probability density model constituted by the region term and shape prior information weighed by a confidence map. CONCLUSION: The weighted combination of the distance-based shape prior with a region term into random walks provides accurate segmentations of the cochlea. The experiments suggest that the proposed approach is robust for cochlea segmentation.

Fast segmentation of anterior segment optical coherence tomography images using graph cut.

BACKGROUND: Optical coherence tomography (OCT) is a non-invasive imaging system that can be used to obtain images of the anterior segment. Automatic segmentation of these images will enable them to be used to construct patient specific biomechanical models of the human eye. These models could be used to help with treatment planning and diagnosis of patients. METHODS: A novel graph cut technique using regional and shape terms was developed. It was evaluated by segmenting 39 OCT images of the anterior segment. The results of this were compared with manual segmentation and a previously reported level set segmentation technique. Three different comparison techniques were used: Dice's similarity coefficient (DSC), mean unsigned surface positioning error (MSPE), and 95% Hausdorff distance (HD). A paired t-test was used to compare the results of different segmentation techniques. RESULTS: When comparison with manual segmentation was performed, a mean DSC value of 0.943 ± 0.020 was achieved, outperforming other previously published techniques. A substantial reduction in processing time was also achieved using this method. CONCLUSIONS: We have developed a new segmentation technique that is both fast and accurate. This has the potential to be used to aid diagnostics and treatment planning.

Sparse group composition for robust left ventricular epicardium segmentation.

Left ventricular (LV) epicardium segmentation in cardiac magnetic resonance images (MRIs) is still a challenging task, where the a-priori knowledge like those that incorporate the heart shape model is usually used to derive reasonable segmentation results. In this paper, we propose a sparse group composition (SGC) approach to model multiple shapes simultaneously, which extends conventional sparsity-based single shape prior modeling to incorporate a-priori spatial constraint information among multiple shapes on-the-fly. Multiple interrelated shapes (shapes of epi- and endo-cardium of myocardium in the case of LV epicardium segmentation) are regarded as a group, and sparse linear composition of training groups is computed to approximate the input group. A framework of iterative procedure of refinement based on SGC and segmentation based on deformation model is utilized for LV epicardium segmentation, in which an improved shape-constraint gradient Chan-Vese model (GCV) acted as deformation model. Compared with the standard sparsity-based single shape prior modeling, the refinement procedure has strong robust for relative gross and not much sparse errors in the input shape and the initial epicardium location can be estimated without complicated landmark detection due to modeling spatial constraint information among multiple shapes effectively. Proposed method was validated on 45 cardiac cine-MR clinical datasets and the results were compared with expert contours. The average perpendicular distance (APD) error of contours is 1.50±0.29mm, and the dice metric (DM) is 0.96±0.01. Compared to the state-of-the-art methods, our proposed approach appealed competitive segmentation performance and improved robustness.