【24h】

Finding Dense Supervoxel Correspondence of Cone-Beam Computed Tomography Images

机译:查找锥形束计算机断层扫描图像的密集Supervoxel对应关系

获取原文

摘要

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.
机译:锥形束计算机断层扫描(CBCT)图像的密集对应建立是临床正畸中属性转移和形态学变化评估的关键步骤。但是,对于颅面CBCT图像,传统的大规模非线性优化方法进行配准非常耗时。有监督的随机森林以其快速的在线性能而闻名,认为有限的训练数据会削弱泛化能力。在本文中,我们为CBCT图像的超体素方向对应提出了一种无监督的基于随机森林的方法。特别是,我们针对无监督随机森林的聚类假设提出了理论复杂性分析,并提供了与数据相关的学习保证。提出了一种新颖的树修剪算法,通过去除局部琐碎和不一致的叶节点来精炼森林,其中学习界限可作为最佳选择树形结构的指导。所提出的方法已经在临床捕获的CBCT图像的标签传播上进行了测试。实验表明,与基于监督和无监督的基于随机森林的方法的变体相比,所提出的方法可提高性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号