Finding dense supervoxel correspondence of cone-beam computed tomography images

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dense correspondence establishment of cone-beam computed tomography (CBCT) images is a crucial step for attribute transfers and morphological variation assessments in clinical orthodontics. However, the registration by the traditional large-scale nonlinear optimization is time-consuming for the craniofacial CBCT images. The supervised random forest is known for its fast online performance, thought the limited training data impair the generalization capacity. In this paper, we propose an unsupervised random-forest-based approach for the supervoxel-wise correspondence of CBCT images. In particular, we present a theoretical complexity analysis with a data-dependent learning guarantee for the clustering hypotheses of the unsupervised random forest. A novel tree-pruning algorithm is proposed to refine the forest by removing the local trivial and inconsistent leaf nodes, where the learning bound serves as guidance for an optimal selection of tree structures. The proposed method has been tested on the label propagation of clinically-captured CBCT images. Experiments demonstrate the proposed method yields performance improvements over variants of both supervised and unsupervised random-forest-based methods.

Cite

CITATION STYLE

APA

Pei, Y., Yi, Y., Ma, G., Guo, Y., Chen, G., Xu, T., & Zha, H. (2017). Finding dense supervoxel correspondence of cone-beam computed tomography images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10541 LNCS, pp. 114–122). Springer Verlag. https://doi.org/10.1007/978-3-319-67389-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free