首页> 外文会议>International conference on medical imaging computing and computer-assisted intervention >Efficient Groupwise Registration of MR Brain Images via Hierarchical Graph Set Shrinkage
【24h】

Efficient Groupwise Registration of MR Brain Images via Hierarchical Graph Set Shrinkage

机译:通过分层图集收缩有效地对MR脑图像进行分组分组配准

获取原文

摘要

Accurate and efficient groupwise registration is important for population analysis. Current groupwise registration methods suffer from high computational cost, which hinders their application to large image datasets. To alleviate the computational burden while delivering accurate groupwise registration result, we propose to use a hierarchical graph set to model the complex image distribution with possibly large anatomical variations, and then turn the groupwise registration problem as a series of simple-to-solve graph shrinkage problems. Specifically, first, we divide the input images into a set of image clusters hierarchically, where images within each image cluster have similar anatomical appearances whereas images falling into different image clusters have varying anatomical appearances. After clustering, two types of graphs, i.e., intra-graph and inter-graph, are employed to hierarchically model the image distribution both within and across the image clusters. The constructed hierarchical graph set divides the registration problem of the whole image set into a series of simple-to-solve registration problems, where the entire registration process can be solved accurately and efficiently. The final deformation pathway of each image to the estimated population center can be obtained by composing each part of the deformation pathway along the hierarchical graph set. To evaluate our proposed method, we performed registration of a hundred of brain images with large anatomical variations. The results indicate that our method yields significant improvement in registration performance over state-of-the-art groupwise registration methods.
机译:准确有效的分组登记对于人口分析很重要。当前的逐组配准方法遭受高计算成本的困扰,这阻碍了它们在大图像数据集上的应用。为了减轻计算负担,同时提供准确的成组配准结果,我们建议使用分层图集来对可能具有较大解剖变化的复杂图像分布进行建模,然后将成组配准问题转变为一系列易于解决的图收缩问题。具体来说,首先,我们将输入图像按层次划分为一组图像簇,其中每个图像簇内的图像具有相似的解剖外观,而落入不同图像簇的图像具有不同的解剖外观。聚类后​​,采用两种类型的图,即图内图和图间图,对图像簇内和图像簇之间的图像分布进行分层建模。构造的层次图集将整个图像集的配准问题分为一系列易于解决的配准问题,可以准确有效地解决整个配准过程。每个图像到估计人口中心的最终变形路径可以通过沿着层次图集组合变形路径的​​每个部分来获得。为了评估我们提出的方法,我们对解剖学差异较大的一百张脑图像进行了配准。结果表明,与最新的分组注册方法相比,我们的方法在注册性能方面有显着提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号