Clinically oriented automatic three-dimensional enamel segmentation via deep learning

BACKGROUND

Establishing accurate, reliable, and convenient methods for enamel segmentation and analysis is crucial for effectively planning endodontic, orthodontic, and restorative treatments, as well as exploring the evolutionary patterns of mammals. However, no mature, non-destructive method currently exists in clinical dentistry to quickly, accurately, and comprehensively assess the integrity and thickness of enamel chair-side. This study aims to develop a deep learning work, 2.5D Attention U-Net, trained on small sample datasets, for the automatical, efficient, and accurate segmentation of enamel across all teeth in clinical settings.

METHODS

We propose a fully automated computer-aided enamel segmentation model based on an instance segmentation network, 2.5D Attention U-Net. After data annotation and augmentation, the model is trained using manually annotated segmented enamel data, and its performance is evaluated using the Dice similarity coefficient metrics. A satisfactory image segmentation model is applied to generate a 3D enamel model for each tooth and to calculate the thickness value of individual enclosed 3D enamel meshes using a normal ray-tracing directional method.

RESULTS

The model achieves the Dice score on the enamel segmentation task of 96.6%. This study provides an intuitive visualization of irregular enamel morphology and a quantitative analysis of three-dimensional enamel thickness variations. The results indicate that enamel is thickest at the incisal edges of anterior teeth and the cusps of posterior teeth, thinning towards the roots. For posterior teeth, the enamel is thinnest at the central fossae area, with mandibular molars having thicker enamel in the central fossae compared to maxillary molars. The average enamel thickness of maxillary incisors, canines, and premolars is greater than that of mandibular incisors, while the opposite is true for molars. Although there are individual variations in enamel thickness, the average enamel thickness graduallly increases from the incisors to the molars among all teeth within the same quadrant.

CONCLUSIONS

This study introduces an automatic, efficient, and accurate 2.5D Attention U-Net system to enhance precise and efficient chair-side diagnosis and treatment of enamel-related diseases in clinical settings, marking a significant advancement in automated diagnostics for enamel-related conditions.

Automatic tooth periodontal ligament segmentation of cone beam computed tomography based on instance segmentation network

Objective

The three-dimensional morphological structures of periodontal ligaments (PDLs) are important data for periodontal, orthodontic, prosthodontic, and implant interventions. This study aimed to employ a deep learning (DL) algorithm to segment the PDL automatically in cone-beam computed tomography (CBCT).

Method

This was a retrospective study. We randomly selected 389 patients and 1734 axial CBCT images from the CBCT database, and designed a fully automatic PDL segmentation computer-aided model based on instance segmentation Mask R-CNN network. The labels of the model training were 'teeth' and 'alveolar bone', and the 'PDL' is defined as the region where the 'teeth' and 'alveolar bone' overlap. The model's segmentation performance was evaluated using CBCT data from eight patients outside the database.

Results

Qualitative evaluation indicates that the PDL segmentation accuracy of incisors, canines, premolars, wisdom teeth, and implants reached 100%. The segmentation accuracy of molars was 96.4%. Quantitative evaluation indicates that the mIoU and mDSC of PDL segmentation were 0.667 ± 0.015 (>0.6) and 0.799 ± 0.015 (>0.7) respectively.

Conclusion

This study analysed a unique approach to AI-driven automatic segmentation of PDLs on CBCT imaging, possibly enabling chair-side measurements of PDLs to facilitate periodontists, orthodontists, prosthodontists, and implantologists in more efficient and accurate diagnosis and treatment planning.

A Hybrid Level Set With Semantic Shape Constraint for Object Segmentation

This paper presents a hybrid level set method for object segmentation. The method deconstructs segmentation task into two procedures, i.e., shape transformation and curve evolution, which are alternately optimized until convergence. In this framework, only one shape prior encoded by shape context is utilized to estimate a transformation allowing the curve to have the same semantic expression as shape prior, and curve evolution is driven by an energy functional with topology-preserving and kernelized terms. In such a way, the proposed method is featured by the following advantages: 1) hybrid paradigm makes the level set framework possess the ability of incorporating other shape-related techniques about shape descriptor and distance; 2) shape context endows one single prior with semanticity, and hence leads to the competitive performance compared to the ones with multiple shape priors; and 3) additionally, combining topology-preserving and kernelization mechanisms together contributes to realizing a more reasonable segmentation on textured and noisy images. As far as we know, we propose a hybrid level set framework and utilize shape context to guide curve evolution for the first time. Our method is evaluated with synthetic, healthcare, and natural images, as a result, it shows competitive and even better performance compared to the counterparts.

LATE: A Level-Set Method Based on Local Approximation of Taylor Expansion for Segmenting Intensity Inhomogeneous Images

Intensity inhomogeneity is common in real-world images and inevitably leads to many difficulties for accurate image segmentation. Numerous level-set methods have been proposed to segment images with intensity inhomogeneity. However, most of these methods are based on linear approximation, such as locally weighted mean, which may cause problems when handling images with severe intensity inhomogeneities. In this paper, we view segmentation of such images as a nonconvex optimization problem, since the intensity variation in such an image follows a nonlinear distribution. Then, we propose a novel level-set method named local approximation of Taylor expansion (LATE), which is a nonlinear approximation method to solve the nonconvex optimization problem. In LATE, we use the statistical information of the local region as a fidelity term and the differentials of intensity inhomogeneity as an adjusting term to model the approximation function. In particular, since the first-order differential is represented by the variation degree of intensity inhomogeneity, LATE can improve the approximation quality and enhance the local intensity contrast of images with severe intensity inhomogeneity. Moreover, LATE solves the optimization of function fitting by relaxing the constraint condition. In addition, LATE can be viewed as a constraint relaxation of classical methods, such as the region-scalable fitting model and the local intensity clustering model. Finally, the level-set energy functional is constructed based on the Taylor expansion approximation. To validate the effectiveness of our method, we conduct thorough experiments on synthetic and real images. Experimental results show that the proposed method clearly outperforms other solutions in comparison.

Intrinsic Image Decomposition via Structure-Preserving Image Smoothing and Material Recognition

Decoupling shading and reflectance from complex scene-images is a long-standing problem in computer vision. We introduce a framework for decomposing an image into the product of an illumination component and a reflectance component. Due to the ill-posed nature of the problem, prior information on shading and reflectance is mandatory. The proposed method adopts the premise that pixels in a region with similar chromaticity values should have the same reflectance. This assumption was used to minimize the l2 norm of the local per-pixel reflectance gradients to extract the shading and reflectance components. To obtain smooth chromatic regions, texture was treated in a new style. Texture was removed in the first step of the algorithm and the smooth image was processed for intrinsic decomposition. In the final step, texture details were added to the intrinsic components based on the material of each pixel. In addition, user-assistance was used to further refine the results. The qualitative and quantitative evaluation on the MIT intrinsic dataset indicated that the quality of intrinsic image decomposition was improved in comparison with previous methods.

Learning A Superpixel-Driven Speed Function for Level Set Tracking

A key problem in level set tracking is to construct a discriminative speed function for effective contour evolution. In this paper, we propose a level set tracking method based on a discriminative speed function, which produces a superpixel-driven force for effective level set evolution. Based on kernel density estimation and metric learning, the speed function is capable of effectively encoding the discriminative information on object appearance within a feasible metric space. Furthermore, we introduce adaptive object shape modeling into the level set evolution process, which leads to the tracking robustness in complex scenarios. To ensure the efficiency of adaptive object shape modeling, we develop a simple but efficient weighted non-negative matrix factorization method that can online learn an object shape dictionary. Experimental results on a number of challenging video sequences demonstrate the effectiveness and robustness of the proposed tracking method.

A Level Set Approach to Image Segmentation With Intensity Inhomogeneity

It is often a difficult task to accurately segment images with intensity inhomogeneity, because most of representative algorithms are region-based that depend on intensity homogeneity of the interested object. In this paper, we present a novel level set method for image segmentation in the presence of intensity inhomogeneity. The inhomogeneous objects are modeled as Gaussian distributions of different means and variances in which a sliding window is used to map the original image into another domain, where the intensity distribution of each object is still Gaussian but better separated. The means of the Gaussian distributions in the transformed domain can be adaptively estimated by multiplying a bias field with the original signal within the window. A maximum likelihood energy functional is then defined on the whole image region, which combines the bias field, the level set function, and the piecewise constant function approximating the true image signal. The proposed level set method can be directly applied to simultaneous segmentation and bias correction for 3 and 7T magnetic resonance images. Extensive evaluation on synthetic and real-images demonstrate the superiority of the proposed method over other representative algorithms.

A Variational Approach to Simultaneous Image Segmentation and Bias Correction

This paper presents a novel variational approach for simultaneous estimation of bias field and segmentation of images with intensity inhomogeneity. We model intensity of inhomogeneous objects to be Gaussian distributed with different means and variances, and then introduce a sliding window to map the original image intensity onto another domain, where the intensity distribution of each object is still Gaussian but can be better separated. The means of the Gaussian distributions in the transformed domain can be adaptively estimated by multiplying the bias field with a piecewise constant signal within the sliding window. A maximum likelihood energy functional is then defined on each local region, which combines the bias field, the membership function of the object region, and the constant approximating the true signal from its corresponding object. The energy functional is then extended to the whole image domain by the Bayesian learning approach. An efficient iterative algorithm is proposed for energy minimization, via which the image segmentation and bias field correction are simultaneously achieved. Furthermore, the smoothness of the obtained optimal bias field is ensured by the normalized convolutions without extra cost. Experiments on real images demonstrated the superiority of the proposed algorithm to other state-of-the-art representative methods.

An improved joint optimization of multiple level set functions for the segmentation of overlapping cervical cells

In this paper, we present an improved algorithm for the segmentation of cytoplasm and nuclei from clumps of overlapping cervical cells. This problem is notoriously difficult because of the degree of overlap among cells, the poor contrast of cell cytoplasm and the presence of mucus, blood, and inflammatory cells. Our methodology addresses these issues by utilizing a joint optimization of multiple level set functions, where each function represents a cell within a clump, that have both unary (intracell) and pairwise (intercell) constraints. The unary constraints are based on contour length, edge strength, and cell shape, while the pairwise constraint is computed based on the area of the overlapping regions. In this way, our methodology enables the analysis of nuclei and cytoplasm from both free-lying and overlapping cells. We provide a systematic evaluation of our methodology using a database of over 900 images generated by synthetically overlapping images of free-lying cervical cells, where the number of cells within a clump is varied from 2 to 10 and the overlap coefficient between pairs of cells from 0.1 to 0.5. This quantitative assessment demonstrates that our methodology can successfully segment clumps of up to 10 cells, provided the overlap between pairs of cells is <;0.2. Moreover, if the clump consists of three or fewer cells, then our methodology can successfully segment individual cells even when the overlap is ~0.5. We also evaluate our approach quantitatively and qualitatively on a set of 16 extended depth of field images, where we are able to segment a total of 645 cells, of which only ~10% are free-lying. Finally, we demonstrate that our method of cell nuclei segmentation is competitive when compared with the current state of the art.

An efficient MRF embedded level set method for image segmentation

This paper presents a fast and robust level set method for image segmentation. To enhance the robustness against noise, we embed a Markov random field (MRF) energy function to the conventional level set energy function. This MRF energy function builds the correlation of a pixel with its neighbors and encourages them to fall into the same region. To obtain a fast implementation of the MRF embedded level set model, we explore algebraic multigrid (AMG) and sparse field method (SFM) to increase the time step and decrease the computation domain, respectively. Both AMG and SFM can be conducted in a parallel fashion, which facilitates the processing of our method for big image databases. By comparing the proposed fast and robust level set method with the standard level set method and its popular variants on noisy synthetic images, synthetic aperture radar (SAR) images, medical images, and natural images, we comprehensively demonstrate the new method is robust against various kinds of noises. In particular, the new level set method can segment an image of size 500 × 500 within 3 s on MATLAB R2010b installed in a computer with 3.30-GHz CPU and 4-GB memory.

A vessel active contour model for vascular segmentation

This paper proposes a vessel active contour model based on local intensity weighting and a vessel vector field. Firstly, the energy function we define is evaluated along the evolving curve instead of all image points, and the function value at each point on the curve is based on the interior and exterior weighted means in a local neighborhood of the point, which is good for dealing with the intensity inhomogeneity. Secondly, a vascular vector field derived from a vesselness measure is employed to guide the contour to evolve along the vessel central skeleton into thin and weak vessels. Thirdly, an automatic initialization method that makes the model converge rapidly is developed, and it avoids repeated trails in conventional local region active contour models. Finally, a speed-up strategy is implemented by labeling the steadily evolved points, and it avoids the repeated computation of these points in the subsequent iterations. Experiments using synthetic and real vessel images validate the proposed model. Comparisons with the localized active contour model, local binary fitting model, and vascular active contour model show that the proposed model is more accurate, efficient, and suitable for extraction of the vessel tree from different medical images.

Improving level set method for fast auroral oval segmentation

Auroral oval segmentation from ultraviolet imager images is of significance in the field of spatial physics. Compared with various existing image segmentation methods, level set is a promising auroral oval segmentation method with satisfactory precision. However, the traditional level set methods are time consuming, which is not suitable for the processing of large aurora image database. For this purpose, an improving level set method is proposed for fast auroral oval segmentation. The proposed algorithm combines four strategies to solve the four problems leading to the high-time complexity. The first two strategies, including our shape knowledge-based initial evolving curve and neighbor embedded level set formulation, can not only accelerate the segmentation process but also improve the segmentation accuracy. And then, the latter two strategies, including the universal lattice Boltzmann method and sparse field method, can further reduce the time cost with an unlimited time step and narrow band computation. Experimental results illustrate that the proposed algorithm achieves satisfactory performance for auroral oval segmentation within a very short processing time.

A Nonlinear Adaptive Level Set for Image Segmentation

In this paper, we present a novel level set method (LSM) for image segmentation. By utilizing the Bayesian rule, we design a nonlinear adaptive velocity and a probability-weighted stopping force to implement a robust segmentation for objects with weak boundaries. The proposed method is featured by the following three properties: 1) it automatically determines the curve to shrink or expand by utilizing the Bayesian rule to involve the regional features of images; 2) it drives the curve evolve with an appropriate speed to avoid the leakage at weak boundaries; and 3) it reduces the influence of false boundaries, i.e., edges far away from objects of interest. We applied the proposed segmentation method to artificial images, medical images and the BSD-300 image dataset for qualitative and quantitative evaluations. The comparison results show the proposed method performs competitively, compared with the LSM and its representative variants.

GPU accelerated edge-region based level set evolution constrained by 2D gray-scale histogram

Due to its intrinsic nature which allows to easily handle complex shapes and topological changes, the level set method (LSM) has been widely used in image segmentation. Nevertheless, LSM is computationally expensive, which limits its applications in real-time systems. For this purpose, we propose a new level set algorithm, which uses simultaneously edge, region, and 2D histogram information in order to efficiently segment objects of interest in a given scene. The computational complexity of the proposed LSM is greatly reduced by using the highly parallelizable lattice Boltzmann method (LBM) with a body force to solve the level set equation (LSE). The body force is the link with image data and is defined from the proposed LSE. The proposed LSM is then implemented using an NVIDIA graphics processing units to fully take advantage of the LBM local nature. The new algorithm is effective, robust against noise, independent to the initial contour, fast, and highly parallelizable. The edge and region information enable to detect objects with and without edges, and the 2D histogram information enable the effectiveness of the method in a noisy environment. Experimental results on synthetic and real images demonstrate subjectively and objectively the performance of the proposed method.

A fast and robust level set method for image segmentation using fuzzy clustering and lattice Boltzmann method

In the last decades, due to the development of the parallel programming, the lattice Boltzmann method (LBM) has attracted much attention as a fast alternative approach for solving partial differential equations. In this paper, we first designed an energy functional based on the fuzzy c-means objective function which incorporates the bias field that accounts for the intensity inhomogeneity of the real-world image. Using the gradient descent method, we obtained the corresponding level set equation from which we deduce a fuzzy external force for the LBM solver based on the model by Zhao. The method is fast, robust against noise, independent to the position of the initial contour, effective in the presence of intensity inhomogeneity, highly parallelizable and can detect objects with or without edges. Experiments on medical and real-world images demonstrate the performance of the proposed method in terms of speed and efficiency.

Intrinsic Image Decomposition Using Optimization and User Scribbles

In this paper, we present a novel high-quality intrinsic image recovery approach using optimization and user scribbles. Our approach is based on the assumption of color characteristics in a local window in natural images. Our method adopts a premise that neighboring pixels in a local window having similar intensity values should have similar reflectance values. Thus, the intrinsic image decomposition is formulated by minimizing an energy function with the addition of a weighting constraint to the local image properties. In order to improve the intrinsic image decomposition results, we further specify local constraint cues by integrating the user strokes in our energy formulation, including constant-reflectance, constant-illumination, and fixed-illumination brushes. Our experimental results demonstrate that the proposed approach achieves a better recovery result of intrinsic reflectance and illumination components than the previous approaches.

Image Cosegmentation by Incorporating Color Reward Strategy and Active Contour Model

The design of robust and efficient cosegmentation algorithms is challenging because of the variety and complexity of the objects and images. In this paper, we propose a new cosegmentation model by incorporating a color reward strategy and an active contour model. A new energy function corresponding to the curve is first generated with two considerations: the foreground similarity between the image pairs and the background consistency in each of the image pair. Furthermore, a new foreground similarity measurement based on the rewarding strategy is proposed. Then, we minimize the energy function value via a mutual procedure which uses dynamic priors to mutually evolve the curves. The proposed method is evaluated on many images from commonly used databases. The experimental results demonstrate that the proposed model can efficiently segment the common objects from the image pairs with generally lower error rate than many existing and conventional cosegmentation methods.