【24h】

Ischemic Stroke Segmentation from CT Perfusion Scans Using Cluster-Representation Learning

机译:来自CT灌注扫描的缺血性卒中分割使用集群代表学习

获取原文

摘要

Computed Tomography Perfusion (CTP) images have drawn extensive attention in acute ischemic stroke assessment due to its imaging speed and ability to provide dynamic perfusion quantification. However, the cerebral ischemic infarcted core has high individual variability and low contrast, and multiple CTP parametric maps need to be referred for precise delineation of the core region. It has thus become a challenging task to develop automatic segmentation algorithms. The widely applied segmentation algorithms such as U-Net lack specific modeling for image subtype in the dataset, and thus the performance remains unsatisfactory. In this paper, we propose a novel cluster-representation learning approach to address these difficulties. Specifically, we first cluster the training samples based on their similarities of the segmentation difficulty. Each cluster represents a different subtype of training images and is then used to train its own cluster-representative model. The models will be capable of extracting cluster-representative features from training samples as clustering priors, which are further fused into an overall segmentation model (for all training samples). The fusion mechanism is able to adaptively select optimal subset(s) of clustering priors which can further guide the segmentation of each unseen testing image and reduce influences from high variability of CTP images. We have applied our method on 94 subjects of ISLES 2018 dataset. By comparing with the baseline U-Net, the experiments have shown an absolute increase of 8% in Dice score and a reduction of 10mm in Hausdorff Distance for ischemic infarcted core segmentation. This method can also be generalized to other U-Net-like architectures to further improve their representative capacity.
机译:由于其成像速度和提供动态灌注量化的能力,计算机断层摄影灌注(CTP)图像在急性缺血性卒中评估中绘制了广泛的关注。然而,脑缺血梗塞核心具有高个性变异性和低对比度,并且需要提及多个CTP参数图,以确切地描绘核心区域。因此,它成为开发自动分段算法的具有挑战性的任务。广泛应用的分割算法,例如U-Net缺少数据集中的图像子类型的特定建模,因此性能仍然不令人满意。在本文中,我们提出了一种新的集群代表学习方法来解决这些困难。具体而言,我们首先基于它们的分割难度的相似性集聚训练样本。每个群集代表训练图像的不同子类型,然后用于训练其自己的集群代表性模型。该模型能够从训练样本中提取集群代表特征作为聚类前沿,这进一步融合到整个分段模型(对于所有训练样本)。融合机制能够自适应地选择聚类电池的最佳子集,这可以进一步引导每个看不见的测试图像的分割并降低CTP图像的高可变性的影响。我们在94个isles 2018 DataSet中应用了我们的方法。通过与基线U-NET进行比较,实验表明骰子评分的绝对增加8%,并且在Hausdorff距离缺血梗死核心分割中的10mm。该方法还可以推广到其他U-Net的架构中,以进一步提高其代表性的能力。

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号