Cone beam computed tomography (CBCT) is a medical imaging technique employed for diagnosis and treatment of patients with cranio-maxillofacial deformities. CBCT 3D reconstruction and segmentation of bones such as mandible or maxilla are essential procedures in surgical and orthodontic treatments. However, CBCT image processing may be impaired by features such as low contrast, inhomogeneity, noise and artifacts. Besides, values assigned to voxels are relative Hounsfield units unlike traditional computed tomography (CT). Such drawbacks render CBCT segmentation a difficult and time-consuming task, usually performed manually with tools designed for medical image processing. We present an interactive two-stage method for the segmentation of CBCT: (i) we first perform an automatic segmentation of bone structures with super-voxels, allowing a compact graph representation of the 3D data; (ii) next, a user-placed seed process guides a graph partitioning algorithm, splitting the extracted bones into mandible and skull. We have evaluated our segmentation method in three different scenarios and compared the results with ground truth data of the mandible and the skull. Results show that our method produces accurate segmentation and is robust to changes in parameters. We also compared our method with two similar segmentation strategy and showed that it produces more accurate segmentation. Finally, we evaluated our method for CT data of patients with deformed or missing bones and the segmentation was accurate for all data. The segmentation of a typical CBCT takes in average 5 min, which is faster than most techniques currently available.

No abstract

This article introduces an automatic approach for the segmentation of coloured natural scene images based on graphs and the propagation of labels originally designed for communities detection in complex networks. Images are initially pre‐segmented with super‐pixels, followed by feature extraction using colour information of each super‐pixels. The resulting graph consists of vertices which represent super‐pixels, whereas the edge weights are a measure of similarity between super‐pixels. The resulting segmentation corresponds to the propagation of labels among the vertices. In this article, three strategies for propagating labels have been formulated: (i) iterative propagation (ILP), (ii) recursive propagation (RLP) and (iii) a weighted recursive propagation (WRLP). The experiments have shown that the proposed methods, when compared to other state‐of‐the‐art methods, produce better results in terms of segmentation quality and processing time.