首页> 外文会议>International conference on medical imaging computing and computer-assisted intervention >Multi-organ Segmentation Using Vantage Point Forests and Binary Context Features
【24h】

Multi-organ Segmentation Using Vantage Point Forests and Binary Context Features

机译:利用优势点森林和二值上下文特征进行多器官分割

获取原文

摘要

Dense segmentation of large medical image volumes using a labelled training dataset requires strong classifiers. Ensembles of random decision trees have been shown to achieve good segmentation accuracies with very fast computation times. However, smaller anatomical structures such as muscles or organs with high shape variability present a challenge to them, especially when relying on axis-parallel split functions, which make finding joint relations among features difficult. Recent work has shown that structural and contextual information can be well captured using a large number of simple pairwise intensity comparisons stored in binary vectors. In this work, we propose to overcome current limitations of random forest classifiers by devising new decision trees, which use the entire feature vector at each split node and may thus be able to find representative patterns in high-dimensional feature spaces. Our approach called vantage point forests is related to cluster trees that have been successfully applied to space partitioning. It can be further improved by discarding training samples with a large Hamming distance compared to the test sample. Our method achieves state-of-the-art segmentation accuracy of ≥90 % Dice for liver and kidneys in abdominal CT, with significant improvements over random forest, in under a minute.
机译:使用标记的训练数据集对大型医学图像进行密集分割需要强大的分类器。随机决策树的集合已经显示出可以以非常快的计算时间实现良好的分割精度。但是,较小的解剖结构,例如具有高形状变异性的肌肉或器官,对它们构成了挑战,尤其是在依赖于轴平行拆分功能时,这使得在特征之间寻找关节关系变得困难。最近的工作表明,使用存储在二进制向量中的大量简单的成对强度比较,可以很好地捕获结构和上下文信息。在这项工作中,我们建议通过设计新的决策树来克服随机森林分类器的当前限制,这些决策树在每个拆分节点上使用整个特征向量,因此可能能够在高维特征空间中找到代表性模式。我们的方法称为优势点林与集群树有关,集群树已成功应用于空间分区。与测试样本相比,通过丢弃具有较大汉明距离的训练样本可以进一步改善它。在腹部CT中,我们的方法对肝脏和肾脏的分割精度达到了≥90%的骰子,与随机森林相比,在一分钟之内有了显着改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号