首页> 外文会议>MICCAI 2011;International conference on medical image computing and computer-assisted intervention >Spatially Adaptive Log-Euclidean Polyaffine Registration Based on Sparse Matches
【24h】

Spatially Adaptive Log-Euclidean Polyaffine Registration Based on Sparse Matches

机译:基于稀疏匹配的空间自适应对数-欧式聚仿射配准

获取原文

摘要

Log-euclidean polyaffine transforms have recently been introduced to characterize the local affine behavior of the deformation in principal anatomical structures. The elegant mathematical framework makes them a powerful tool for image registration. However, their application is limited to large structures since they require the pre-definition of affine regions. This paper extends the polyaffine registration to adaptively fit a log-euclidean polyaffine transform that captures deformations at smaller scales. The approach is based on the sparse selection of matching points in the images and the formulation of the problem as an expectation maximization iterative closest point problem. The efficiency of the algorithm is shown through experiments on inter-subject registration of brain MRI between a healthy subject and patients with multiple sclerosis.
机译:最近引入了对数欧式聚仿射变换,以表征主要解剖结构中变形的局部仿射行为。优雅的数学框架使它们成为图像配准的强大工具。但是,由于它们需要预定义仿射区域,因此它们的应用仅限于大型结构。本文扩展了聚仿射配准,以自适应地拟合对数-欧几里德式聚仿射变换,该变换可捕获较小规模的变形。该方法基于图像中匹配点的稀疏选择以及将问题表示为期望最大化迭代最近点问题。通过在健康受试者与多发性硬化症患者之间进行脑MRI的受试者间配准实验,证明了该算法的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号