...
首页> 外文期刊>Image Processing, IEEE Transactions on >Groupwise Registration of Multimodal Images by an Efficient Joint Entropy Minimization Scheme
【24h】

Groupwise Registration of Multimodal Images by an Efficient Joint Entropy Minimization Scheme

机译:通过有效的联合熵最小化方案对多峰图像进行分组配准

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Groupwise registration is concerned with bringing a group of images into the best spatial alignment. If images in the group are from different modalities, then the intensity correspondences across the images can be modeled by the joint density function (JDF) of the cooccurring image intensities. We propose a so-called treecode registration method for groupwise alignment of multimodal images that uses a hierarchical intensity-space subdivision scheme through which an efficient yet sufficiently accurate estimation of the (high-dimensional) JDF based on the Parzen kernel method is computed. To simultaneously align a group of images, a gradient-based joint entropy minimization was employed that also uses the same hierarchical intensity-space subdivision scheme. If the Hilbert kernel is used for the JDF estimation, then the treecode method requires no data-dependent bandwidth selection and is thus fully automatic. The treecode method was compared with the ensemble clustering (EC) method on four different publicly available multimodal image data sets and on a synthetic monomodal image data set. The obtained results indicate that the treecode method has similar and, for two data sets, even superior performances compared to the EC method in terms of registration error and success rate. The obtained good registration performances can be mostly attributed to the sufficiently accurate estimation of the JDF, which is computed through the hierarchical intensity-space subdivision scheme, that captures all the important features needed to detect the correct intensity correspondences across a multimodal group of images undergoing registration.
机译:逐组配准与使一组图像达到最佳空间对齐有关。如果该组中的图像来自不同的模态,则可以通过同时出现的图像强度的联合密度函数(JDF)对整个图像的强度对应关系进行建模。我们提出了一种用于多模态图像按组对齐的所谓树码配准方法,该方法使用分层强度空间细分方案,通过该方案,可以基于Parzen核方法计算(高维)JDF的有效而足够准确的估计。为了同时对齐一组图像,采用了基于梯度的联合熵最小化方法,该方法也使用了相同的分层强度空间细分方案。如果将希尔伯特内核用于JDF估计,则树码方法不需要选择与数据相关的带宽,因此是全自动的。在四个不同的公共多模态图像数据集和一个合成的单模态图像数据集上,将树码方法与集成聚类(EC)方法进行了比较。所获得的结果表明,树码方法在注册错误和成功率方面与EC方法相比具有相似的性能,并且对于两个数据集,甚至具有更高的性能。获得的良好配准性能主要归因于JDF的足够准确的估算,该估算是通过分层强度空间细分方案计算的,该方案捕获了在跨多模态图像组中检测正确强度对应关系所需的所有重要特征。注册。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号