首页> 外文会议>MICCAI 2011;International conference on medical image computing and computer-assisted intervention >Fast Shape-Based Nearest-Neighbor Search for Brain MRIs Using Hierarchical Feature Matching
【24h】

Fast Shape-Based Nearest-Neighbor Search for Brain MRIs Using Hierarchical Feature Matching

机译:使用分层特征匹配的基于快速形状的基于最近的大脑MRI的搜索

获取原文

摘要

This paper presents a fast method for quantifying shape differences/similarities between pairs of magnetic resonance (MR) brain images. Most shape comparisons in the literature require some kind of deformable registration or identification of exact correspondences. The proposed approach relies on an optimal matching of a large collection of features, using a very fast, hierarchical method from the literature, called spatial pyramid matching (SPM). This paper shows that edge-based image features in combination with SPM results in a fast similarity measure that captures relevant anatomical information in brain MRI. We present extensive comparisons against known methods for shape-based, k-nearest-neighbor lookup to evaluate the performance of the proposed method. Finally, we show that the method compares favorably with more computation-intensive methods in the construction of local atlases for use in brain MR image segmentation.
机译:本文提出了一种快速的方法来量化成对的磁共振(MR)脑图像对之间的形状差异/相似性。文献中大多数形状比较都需要某种可变形的套准或精确对应的标识。所提出的方法依赖于文献中使用非常快速的分层方法(称为空间金字塔匹配(SPM))的大量特征的最佳匹配。本文表明,基于边缘的图像特征与SPM结合使用可实现快速的相似性度量,该度量可捕获脑MRI中的相关解剖信息。我们提出了与基于形状的k最近邻查找的已知方法的广泛比较,以评估所提出方法的性能。最后,我们证明了该方法在构建用于脑部MR图像分割的局部地图集方面比计算量更大的方法优越。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号