Compression-basedImageRegistration.docVIP

Compression-based Image Registration 一种基于压缩的图像配准算法 Abstract—Image registration is an important component of image analysis used to align two or more images. In this paper, we present a new framework for image registration based on compression. The basic idea underlying our approach is the conjecture that two images are correctly registered when we can maximally compress one image given the information in the other. The contribution of this paper is twofold. First, we show that the image registration process can be dealt with from the perspective of a compression problem. Second, we demonstrate that the similarity metric, introduced by Li et al., performs well in image registration. Two different versions of the similarity metric have been used: the Kolmogorov version, computed using standard real-world compressors, and the Shannon version, calculated from an estimation of the entropy rate of the images. 摘要：图像配准是用来对两幅或者多幅图像进行图像分析的重要组成部分。在这篇论文中，我们基于压缩技术提出了一种新的图像配准框架。算法的主要思想就是如果我们能够鉴于其中一幅图像提供的信息，尽可能地压缩其中一幅图像，则能够准确估算出两幅图像的配准位置。这篇论文的贡献主要在两方面：一方面我们指出了如何通过压缩技术我们可以处理图像配准问题；另一方面我们证明由Li等提出的相似度度量法，在图像配准中应用良好。本文使用两种不同类型的相似度度量方法：一种是Kolmogorov（柯尔莫哥洛夫INTRODUCTION 图像配准的关键就是如何找到两幅图像在空间上相应的平移量。解决配准问题的常用方法就是将它看作一个数学上的最优化问题，然后利用相似度方法，对任意平移量的两幅图像的配准质量进行量化。 许多理论上的方法，例如交互信息法(mutual information)[1][2]，规格化交互信息法(NMI[3])，在医学图像领域表现出很高的准确性和健壮性。另外，信息距离的规格化处理方法，基于Kilmogorov复杂度的概念[5][6]，被引入用来处理测量序列间的相似性。这种方法已经成功应用在基因组测量、语言学和音乐信息分类获取等领域中。算法最基本的思想就是如果我们就能够鉴于其中一图像的信息，对另一图像进行压缩，则两幅图像是相似的。 In this paper, a normalized version of the informationdistance, called the similarity metric , is applied to image registration using two different versions. In the first case,the Kolmogorov complexity is computed using standard real-world compressors and, in the second case, an estimation of the entropy rate of the images is used. In both cases,experimental results demonstrate that the similarity metric performs well in image registration. However, the entropy rate approach is more accu