基于边缘特征点对对齐度的图像配准方法

针对基于特征的图像配准方法存在特征提取的多样性和相似度计算的复杂性等问题,在定义边缘特征点对的角度直方图和对齐度的基础上,提出了一种基于边缘特征点对对齐度的图像配准方法。该方法首先利用小波多尺度积准确地提取边缘图像和特征点,然后根据特征点的角度直方图得到的旋转角度,并通过计算所有特征点对在边缘图像中的对齐度来精确地确定匹配点对。大量的实验结果表明,该方法具有较强的适用性、精确性和有效性。     

A modified medical image registration

Medical image registration is commonly used in clinical diagnosis, treatment, quality assurance, evaluation of curative efficacy and so on. In this paper, the edges of the original reference and floating images are detected by the B-spline gradient operator and then the binarization images are acquired. By computing the binarization image moments, the centroids are obtained. Also, according to the binarization image coordinates, the rotation angles of the reference and floating images are computed respectively, on the foundation of which the initial values for registering the images are produced. When searching the optimal geometric transformation parameters, the modified peak signal-to-noise ratio (MPSNR) is viewed as the similarity metric between the reference and floating images. At the same time, the simplex method is chosen as multi-parameter optimization one. The experimental results show that, this proposed method has a fairly simple implementation, a low computational load, a fast registration and good registration accuracy. It also can effectively avoid trapping in the local optimum and is adapted to both mono-modality and multi-modality image registrations. Also, the improved iterative closest point algorithm based on acquiring the initial values for registration from the least square method (LICP) is introduced. The experiments reveal that the measure acquiring the initial values for registration from image moments and the least square method (LSM) is feasible and resultful strategy.     

Using Normalized Compression Distance for image similarity measurement: an experimental study

Similarity metrics are widely used in computer graphics. In this paper, we will concentrate on a new, algorithmic complexity-based metric called Normalized Compression Distance. It is a universal distance used to compare strings. This measure has also been used in computer graphics for image registration or viewpoint selection. However, there is no previous study on how the measure should be used: which compressor and image format are the most suitable. This paper presents a practical study of the Normalized Compression Distance (NCD) applied to color images. The questions we try to answer are: Is NCD a suitable metric for image comparison? How robust is it to rotation, translation, and scaling? Which are the most adequate image formats and compression algorithms? The results of our study show that NCD can be used to address some of the selected image comparison problems, but care must be taken on the compressor and image format selected.     

显式重定向的扩散张量图像配准

扩散张量图像配准算法是近年图像配准研究的热点与难点之一.针对配准中容易出现的局部极值和张量重定向问题,以欧氏距离为相似性测度,将张量重定向显式融入目标函数,采用模拟退火算法与Powell算法法相结合的混合优化策略,对临床使用的扩散张量图像DTI(Diffusion Tensor Images)进行配准实验.实验结果表明,该算法稳定性良好,在对扩散张量图像进行配准时,能有效保持扩散张量主特征方向与纤维走向的一致性,同时成功解决了局部极值的困扰,是一种实用的扩散张量图像配准方法.     

Affine-based registration of CT and MR modality images of human brain using multiresolution approaches: comparative study on genetic algorithm and particle swarm optimization

We present a non-linear 2-D/2-D affine registration technique for MR and CT modality images of section of human brain. Automatic registration is achieved by maximization of a similarity metric, which is the correlation function of two images. The proposed method has been implemented by choosing a realistic, practical transformation and optimization techniques. Correlation-based similarity metric should be maximal when two images are perfectly aligned. Since similarity metric is a non-convex function and contains many local optima, choice of search strategy for optimization is important in registration problem. Many optimization schemes are existing, most of which are local and require a starting point. In present study we have implemented genetic algorithm and particle swarm optimization technique to overcome this problem. A comparative study shows the superiority and robustness of swarm methodology over genetic approach.     

基于GPU的快速三维医学图像刚性配准技术*

自动三维配准将多个图像数据映射到同一坐标系中,在医学影像分析中有广泛的应用。但现有主流三维刚性配准算法(如FLIRT)速度较慢,2563大小数据的刚性配准需要300 s左右,不能满足快速临床应用的需求。为此提出了一种基于CUDA(compute unified device architecture)架构的快速三维配准技术,利用GPU(gra-phic processing unit)并行计算实现配准中的坐标变换、线性插值和相似性测度计算。临床三维医学图像上的实验表明,该技术在保持配准精度的前提下将速度提     

一种基于广义互信息的图像配准算法

互信息作为图像配准中的相关度矩阵有着广泛的应用,通常采用的是基于Shannon熵的互信息。采用一个广义的信息熵——Renyi熵,提出了一种基于广义互信息的图像配准方法。在全局搜索阶段,采用q取较小值的Renyi熵,此时,Renyi熵可以消除局部极值,再通过局部优化方法对当前的局部最优解进行局部寻优,以找到全局最优解;在局部优化阶段,使用基于q→1时的Renyi熵的归一化互信息测度作为目标函数。实验结果表明:相对于归一化互信息图像配准算法,基于Renyi熵的互信息配准算法有良好的配准效果,且提高了配准速度。     

2D/3D image registration on the GPU

We present a method that performs a rigid 2D/3D image registration efficiently on the Graphical Processing Unit (GPU). As one main contribution of this paper, we propose an efficient method for generating realistic DRRs that are visually similar to x-ray images. Therefore, we model some of the electronic post-processes of current x-ray C-arm-systems. As another main contribution, the GPU is used to compute eight intensity-based similarity measures between the DRR and the x-ray image in parallel. A combination of these eight similarity measures is used as a new similarity measure for the optimization. We evaluated the performance and the precision of our 2D/3D image registration algorithm using two phantom models. Compared to a CPU + GPU algorithm, which calculates the similarity measures on the CPU, our GPU algorithm is between three and six times faster. In contrast to single similarity measures, our new similarity measure achieved precise and robust registration results for both phantom models.     

图像检索中的动态相似性度量方法

为提高图像检索的效率,近年来相关反馈机制被引入到了基于内容的图像检索领域。该文提出了一种新的相关反馈方法－－动态相似性度量方法。该方法建立在目前被广泛采用的图像相拟性度量方法的基础上,结合了相关反馈图像检索系统的时序特性,通过捕获用户的交互信息,动态地修正图像的相似性度量公式,从而把用户模型嵌入到了图像检索系统,在某种程度上使图像检索结果与人的主观感知更加接近。实验结果表明该方法的性能明显优于其它图像检索系统所采用的方法。     

Non-rigid registration using gradient of self-similarity response

Locally affine transformation with globally elastic interpolation is a common strategy for non-rigid registration. Current techniques improve the registration accuracy by only processing the sub-images that contain well-defined structures quantified by Moran's spatial correlation. As an indicator, Moran's metric successfully excludes noisy structures that result in misleading global optimum in terms of similarity. However, some well-defined structures with intensity only varying in one direction may also cause mis-registration. In this paper, we propose a new metric based on the response of a similarity function to quantify the ability of being correctly registered for each sub-image. Using receiver operating characteristic analysis, we show that the proposed metric more accurately reflects such ability than Moran's metric. Incorporating the proposed metric into a hierarchical non-rigid registration scheme, we show that registration accuracy is improved relative to Moran's metric.     

An iterative point correspondence algorithm for automatic image registration: an application to dental subtraction radiography

In this paper, an Automatic Iterative Point Correspondence (AIPC) algorithm towards image registration is presented. Given an image pair, distinctive points are extracted only in one of the images (reference image), and the corresponding points in the other image are obtained automatically by maximizing a similarity measure between regions of the two images with respect to the parameters of a local transformation. The maximization is accomplished by means of an iterative procedure, in which candidate solutions for the transformation parameters are tested at each iteration; these solutions are evaluated by the similarity measure between image regions. The detected point pairs by the application of the AIPC algorithm are then used to estimate the parameters of a global projective transformation for the registration of the image pair. The proposed AIPC algorithm was applied on 113 in vitro and in vivo dental image pairs providing improved registration accuracy against three widely used registration methods.     

一种基于互信息和小波分解的图像配准算法

为了寻找快速、精确、鲁棒性强的自动配准算法,论文提出了基于互信息和小波分解图像配准方法。假设实时图像和模板图像之间的变换为仿射变换,采用金字塔小波分解和边缘特征提取获得特征点,利用分层特征点方法进行配准,以互信息最大作为度量准则,在每层上利用互信息的最大值来获取变换参数,然后得到全局变换参数。仿真结果表明此方法具有很好的抗干扰性、鲁棒性和精确性。     

Learning non-metric visual similarity for image retrieval

Measuring visual similarity between two or more instances within a data distribution is a fundamental task in image retrieval. Theoretically, non-metric distances are able to generate a more complex and accurate similarity model than metric distances, provided that the non-linear data distribution is precisely captured by the system. In this work, we explore neural networks models for learning a non-metric similarity function for instance search. We argue that non-metric similarity functions based on neural networks can build a better model of human visual perception than standard metric distances. As our proposed similarity function is differentiable, we explore a real end-to-end trainable approach for image retrieval, i.e. we learn the weights from the input image pixels to the final similarity score. Experimental evaluation shows that non-metric similarity networks are able to learn visual similarities between images and improve performance on top of state-of-the-art image representations, boosting results in standard image retrieval datasets with respect standard metric distances.     

一种基于角点特征的图像自动配准方法

图像配准是图像处理和计算机视觉中的重要环节。提出了一种基于角点特征的图像自动配准方法来处理具有相似变换的图像配准问题。角点特征由改进的Harris算子提取,然后将提取的角点组成虚拟三角形,利用在相似变换下参考图像和待配准图像中对应的虚拟三角形相似的原理,找到最相似的两个虚拟三角形,以它们对应的顶点作为控制点,求出变换模型参数,从而配准两幅图像。该方法只要求两幅图像中提取的角点特征包含3个以上的对应角点,就能配准两幅图像。它的另一个优点是理论上对两幅图像之间发生的平移、旋转和尺度变化没有限制。实验结果表明:这种图像自动配准算法是正确和有效的。     

小物体3维重建中影像与几何模型的配准

目的 近景摄影测量中的目标几何形状复杂,且拍摄影像的角度变化大,给影像与几何模型的配准带来了困难。传统单幅影像与几何模型配准的做法,由于缺乏自动粗配准的方法,效率相对较低。将多视影像首先统一坐标系的做法,在近景目标的复杂背景下也难以实现。方法 为此,将近景目标置于平面标定板上,利用相机标定的方法同时解算出影像的内外方位元素,实现多视影像坐标系的统一。然后人工选取3组以上同名点,做多视影像与几何模型的绝对定向,得到初始配准参数。最后使用多视影像与几何模型漫反射渲染图之间的归一化互信息作为相似性测度,用Powell非线性优化方法得到配准参数的精确值。结果 实验结果表明,使用标定板可以稳定地获取多视影像的内外方位元素,用绝对定向得到的配准参数进行影像和几何模型的交替显示仍然可以看到明显的裂缝,在经过互信息优化后裂缝现象得到明显改善。结论 多视影像与几何模型配准相比传统单幅影像与几何模型配准,人工选取同名点的工作量大大减少,由于人工选点存在误差,影响绝对定向的精度,使用归一化互信息作为测度进行非线性优化,可以获得更高的精度。     

Registration and Analysis of Vascular Images

We have developed a method for rigidly aligning images of tubes. This paper presents an evaluation of the consistency of that method for three-dimensional images of human vasculature. Vascular images may contain alignment ambiguities, poorly corresponding vascular networks, and non-rigid deformations, yet the Monte Carlo experiments presented in this paper show that our method registers vascular images with sub-voxel consistency in a matter of seconds. Furthermore, we show that the method's insensitivity to non-rigid deformations enables the localization, quantification, and visualization of those deformations.Our method aligns a source image with a target image by registering a model of the tubes in the source image directly with the target image. Time can be spent to extract an accurate model of the tubes in the source image. Multiple target images can then be registered with that model without additional extractions.Our registration method builds upon the principles of our tubular object segmentation work that combines dynamic-scale central ridge traversal with radius estimation. In particular, our registration method's consistency stems from incorporating multi-scale ridge and radius measures into the model-image match metric. Additionally, the method's speed is due in part to the use of coarse-to-fine optimization strategies that are enabled by measures made during model extraction and by the parameters inherent to the model-image match metric.     

An approach to multimodal biomedical image registration utilizing particle swarm optimization

Biomedical image registration, or geometric alignment of two-dimensional and/or three-dimensional (3D) image data, is becoming increasingly important in diagnosis, treatment planning, functional studies, computer-guided therapies, and in biomedical research. Registration based on intensity values usually requires optimization of some similarity metric between the images. Local optimization techniques frequently fail because functions of these metrics with respect to transformation parameters are generally nonconvex and irregular and, therefore, global methods are often required. In this paper, a new evolutionary approach, particle swarm optimization, is adapted for single-slice 3D-to-3D biomedical image registration. A new hybrid particle swarm technique is proposed that incorporates initial user guidance. Multimodal registrations with initial orientations far from the ground truth were performed on three volumes from different modalities. Results of optimizing the normalized mutual information similarity metric were compared with various evolutionary strategies. The hybrid particle swarm technique produced more accurate registrations than the evolutionary strategies in many cases, with comparable convergence. These results demonstrate that particle swarm approaches, along with evolutionary techniques and local methods, are useful in image registration, and emphasize the need for hybrid approaches for difficult registration problems.     

两种基于灰度相似性测度的超声波图像配准方法的比较

图像配准是图像分析和处理的基本问题，其在医学影像分析、遥感遥测、计算机视觉等领域有着广泛的应用。为了能稳定、准确地进行超声波图像配准，基于灰度信息的提取、变换，提出了以下两种基于灰度相似性测度的超声波图像配准方法：第1种方法是利用Harris角点检测方法提取特征点，然后由特征点提供灰度信息，其配准中的相似性测度定义为一个评价函数（cost-function）。误差评价函数；第2种方法引用了相同的评价函数，但使用的有关唯一性控制和区域对应规则是与第1种方法不同的。在给定了相似性测度的情况下，参数化的超声波图像配准可以表述为最小化的问题。第1种方法还利用多项式映射的方法来变换整幅图像，并估计了其平方和误差。实验的结果表明，这两种算法都很稳定，且合乎图像配准的要求，仅仅是第2种方法比第1种方法的性能要好一些。     

Semi-supervised image clustering with multi-modal information

How to organize and retrieve images is now a great challenge in various domains. Image clustering is a key tool in some practical applications including image retrieval and understanding. Traditional image clustering algorithms consider a single set of features and use ad hoc distance functions, such as Euclidean distance, to measure the similarity between samples. However, multi-modal features can be extracted from images. The dimension of multi-modal data is very high. In addition, we usually have several, but not many labeled images, which lead to semi-supervised learning. In this paper, we propose a framework of image clustering based on semi-supervised distance learning and multi-modal information. First we fuse multiple features and utilize a small amount of labeled images for semi-supervised metric learning. Then we compute similarity with the Gaussian similarity function and the learned metric. Finally, we construct a semi-supervised Laplace matrix for spectral clustering and propose an effective clustering method. Extensive experiments on some image data sets show the competent performance of the proposed algorithm.     

用于图像Hash的视觉相似度客观评价测度

由于评价图像Hash性能时,要求对两幅图像是否在感知上相似做出判断,因此针对这一需求,提出了一种衡量感知相似程度的评价测度。该测度的确定是先对图像进行低通滤波,再进行图像重叠分块;然后运用相关系数检测法计算每一对分块的相似程度,并对相似系数归一化,再分别计算若干个最小和最大的归一化相似系数的乘积;最后用最小相似系数乘积与最大相似系数乘积的比值作为感知相似性的测度。实验结果表明,该测度不仅可有效反映图像视觉质量的变化,而且能较好地区分两幅图像是否存在重要的视觉差异,其对感知相似进行评价的性能优于峰值信噪比。