基于全局与局部相似性测度的非刚性点集配准

非刚性点集配准算法中，能否找到正确的对应关系对配准结果起着至关重要的作用，而通常两个点集中的对应点除了距离比较接近之外还具有相似的邻域结构，因此提出基于全局与局部相似性测度的非刚性点集配准算法。首先，使用一致性点漂移（CPD）算法作为配准框架，采用高斯混合模型对点集进行建模。然后，对全局局部混合距离进行改进，形成全局与局部相似性测度准则。最后，采用期望最大化（EM）算法迭代地求解对应关系和变换公式：在迭代初期局部相似性所占比重较大，从而能够尽快地找到正确的对应关系；随着迭代的进展全局相似性比重逐渐增大，从而确保得到较小的配准误差。实验结果表明，与薄板样条鲁棒点匹配（TPS-RPM）算法、高斯混合模型点集配准（GMMREG）算法、基于L₂E估计的鲁棒点匹配算法（RPM-L2E）、基于全局局部混合距离与薄板样条的点集配准算法（GLMDTPS）和CPD算法相比，所提算法的均方根误差（RMSE）分别下降了39.93%、42.45%、32.51%、22.36%和11.76%，说明该算法具有较好的配准效果。     

基于多通道稀疏编码的非刚性多模态医学图像配准

针对稀疏编码相似性测度在非刚性医学图像配准中对灰度偏移场具有较好的鲁棒性,但只适用于单模态医学图像配准的问题,提出基于多通道稀疏编码的非刚性多模态医学图像配准方法。该方法将多模态配准问题视为一个多通道配准问题来解决,每个模态在一个单独的通道下运行;首先对待配准的两幅图像分别进行合成和正则化,然后划分通道和图像块,使用K奇异值分解（K-SVD）算法训练每个通道中的图像块得到分析字典和稀疏系数,并对每个通道进行加权求和,采用多层P样条自由变换模型来模拟非刚性几何形变,结合梯度下降法优化目标函数。实验结果表明,与局部互信息、多通道局部方差和残差复杂性（MCLVRC）、多通道稀疏诱导的相似性测度（MCSISM）、多通道Rank Induced相似性测度（MCRISM）多模态相似性测度相比,均方根误差分别下降了30.86%、22.24%、26.84%和16.49%。所提方法能够有效克服多模态医学图像配准中灰度偏移场对配准的影响,提高配准的精度和鲁棒性。     

基于机器学习的肺部CT图像非刚性配准误差预测方法

配准误差评估通常由人工完成,耗时费力;常用的Dice测度只关注组织边缘的配准误差,难以评估组织内部配准结果。针对以上问题,提出一种基于机器学习的肺部CT图像非刚性配准误差预测方法(PREML)。该方法首先构建形变场统计特征、形变场物理保真度特征和图像相似性特征三类特征,然后通过池化方法扩充特征数量,最后使用随机森林回归方法预测非刚性配准误差,并且使用自适应随机扰动方法模拟肺部配准误差空间分布,进一步提升形变场统计特征的配准误差表征能力。在三个肺部CT图像数据集上进行训练与测试,其配准误差预测结果与金标准之间的平均绝对差异为1.245±2.500 mm,预测性能优于基线方法。结果表明,PREML方法具有预测精度高、鲁棒性强的特点,可提升配准算法在临床应用的有效性和安全性。     

基于改进的Zernike矩的局部描述符与图割离散优化的非刚性多模态脑部图像配准

针对脑部图像中存在噪声和强度失真时，基于结构信息的方法不能同时准确提取图像强度信息和边缘、纹理特征，并且连续优化计算复杂度相对较高的问题，根据图像的结构信息，提出了基于改进Zernike距的局部描述符（IZMLD）和图割（GC）离散优化的非刚性多模态脑部图像配准方法。首先，将图像配准问题看成是马尔可夫随机场（MRF）的离散标签问题，并且构造能量函数，两个能量项分别由位移矢量场的像素相似性和平滑性组成。其次，采用变形矢量场的一阶导数作为平滑项，用来惩罚相邻像素间有较大变化的位移标签；用基于IZMLD计算的相似性测度作为数据项，用来表示像素相似性。然后，在局部邻域中用图像块的Zernike矩来分别计算参考图像和浮动图像的自相似性并构造有效的局部描述符，把描述符之间的绝对误差和（SAD）作为相似性测度。最后，将整个能量函数离散化，并且使用GC的扩展优化算法求最小值。实验结果表明，与基于结构表示的熵图像的误差平方和（ESSD）、模态独立邻域描述符（MIND）和随机二阶熵图像（SSOEI）的配准方法相比，所提算法目标配准误差的均值分别下降了18.78%、10.26%和8.89%，并且比连续优化算法缩短了约20 s的配准时间。所提算法实现了在图像存在噪声和强度失真时的高效精确配准。     

A topology preserving non-rigid registration algorithm with integration shape knowledge to segment brain subcortical structures from MRI images

A new non-rigid registration method combining image intensity and a priori shape knowledge of the objects in the image is proposed. This method, based on optical flow theory, uses a topology correction strategy to prevent topological changes of the deformed objects and the a priori shape knowledge to keep the object shapes during the deformation process. Advantages of the method over classical intensity based non-rigid registration are that it can improve the registration precision with the a priori knowledge and allows to segment objects at the same time, especially efficient in the case of segmenting adjacent objects having similar intensities. The proposed algorithm is applied to segment brain subcortical structures from 15 real brain MRI images and evaluated by comparing with ground truths. The obtained results show the efficiency and robustness of our method.     

改进混合策略的多分辨率3D医学图像配准

基于混合策略的多分辨率算法是当前3D医学图像刚体配准中普遍采用的方法,不过其仅仅是优化算法的混合。通过研究不同分辨率对一阶互信息（常称为互信息）和二阶互信息配准的影响,在二级多分辨率策略的配准中,各级采用相对更适合的相似性测度,提出了混合优化算法和混合测度的改进算法。实验表明,改进算法在配准精度上达到了亚体素级,且明显优于基于单一测度的算法,在配准速度上远远快于基于二阶互信息单一测度的算法,略慢于基于一阶互信息单一测度的算法。     

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.     

图像非刚性配准技术及并行策略研究

图像非刚性配准是近几年配准方法的一个研究热点,由于其计算复杂度很高,它的并行化问题成为近几年来的研究热点。本文首先给出了图像非刚性配准的数学模型,并给出了形式化定义;其次分类总结了近年来图像非刚性配准串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。本文还详细分析了设计并行图像非刚性配准算算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。     

多元互信息在超光谱图像自动配准中的应用

文章提出了一种超光谱图像的高精度自动配准算法。该算法采用多元互信息作为相似性测度,能同时利用多个波段图像的可知信息,并能很好地克服图像光谱特征变化的影响;同时,随机优化算法二阶同步试探随机逼近算法(2SPSA)的应用解决了多元互信息的多参数优化问题;另外,算法的多分辨率实现形式,能明显加快搜索速度并增强优化算法的鲁棒性。实验结果表明该算法能有效地处理超光谱图像配准问题,并能达到亚像素的配准精度。     

基于 Nyström 低阶近似和谱特征的图像非刚性配准

图像非刚性配准在计算机视觉和医学图像有着重要的作用.然而存在的非刚性配准算法对严重扭曲变形的图像配准精度和效率都比较低.针对该问题,提出基于Nystrm低阶近似和谱特征的图像非刚性配准算法.算法首先提取像素的谱特征,并将谱特征与空间特征、灰度特征融合形成具有扭曲不变性的全局谱特征; 然后在微分同胚配准的框架内使用全局谱匹配,确保算法产生的变形场具有光滑性、可逆性、可微性,以提高配准的精度;其次采用Nystrm抽样方法,随机抽取拉普拉斯矩阵的行与列,低阶逼近该矩阵,降低高维矩阵谱分解的时间,从而提高配准的效率;最后提出基于小波分解的多分辨率图像配准方法,进一步提高配准的精度和效率.理论分析和实验结果均表明,该算法的配准精度和配准效率都有明显的提高.     

Feature-based registration of histopathology images with different stains: An application for computerized follicular lymphoma prognosis

Follicular lymphoma (FL) is the second most common type of non-Hodgkin’s lymphoma. Manual histological grading of FL is subject to remarkable inter- and intra-reader variations. A promising approach to grading is the development of a computer-assisted system that improves consistency and precision. Correlating information from adjacent slides with different stain types requires establishing spatial correspondences between the digitized section pair through a precise non-rigid image registration. However, the dissimilar appearances of the different stain types challenges existing registration methods.This study proposes a method for the automatic non-rigid registration of histological section images with different stain types. This method is based on matching high level features that are representative of small anatomical structures. This choice of feature provides a rich matching environment, but also results in a high mismatch probability. Matching confidence is increased by establishing local groups of coherent features through geometric reasoning. The proposed method is validated on a set of FL images representing different disease stages. Statistical analysis demonstrates that given a proper feature set the accuracy of automatic registration is comparable to manual registration.     

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

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

Curvature Based Image Registration

A fully automated, non-rigid image registration algorithm is presented. The deformation field is found by minimizing a suitable measure subject to a curvature based constraint. It is a well-known fact that non-rigid image registration techniques may converge poorly if the initial position is not sufficiently near to the solution. A common approach to address this problem is to perform a time consuming rigid pre-registration step. In this paper we show that the new curvature registration not only produces accurate and smooth solutions but also allows for an automatic rigid alignment. Thus, in contrast to other popular registration schemes, the new method no longer requires a pre-registration step. Furthermore, we present an implementation of the new scheme based on the numerical solution of the underlying Euler-Lagrange equations. The real discrete cosine transform is the backbone of our implementation and leads to a stable and fast O(N log N) algorithm, where N denotes the number of voxels. Finally, we report on some numerical test runs.     

基于兴趣边缘优化的壁画影像与激光扫描数据非刚性配准

将壁画影像与激光扫描数据配准,并进行定位和纠正在壁画的数字化保护中有非常重要的意义.本文以激光扫描数据强度信息为中介,提出了一种基于兴趣边缘优化的壁画影像与激光扫描数据的非刚性配准方法:由激光扫描数据生成强度影像,以壁画彩色影像的兴趣边缘和强度影像的梯度场作为配准基元,在影像刚性配准基础上,对每条兴趣边缘进行优化配准,然后以优化后边缘的特征点为控制点,构造影像之间的非刚性变换模型,完成壁画影像与激光扫描数据的配准.实验结果表明本方法在不同数据中都能获得较高的配准精度.     

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

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

Image registration by compression

Image registration consists in finding the transformation that brings one image into the best possible spatial correspondence with another image. 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 image registration can be formulated as a compression problem. Second, we demonstrate the good performance of the similarity metric, introduced by Li et al., in image registration. Two different approaches for the computation of this similarity metric are described: the Kolmogorov version, computed using standard real-world compressors, and the Shannon version, calculated from an estimation of the entropy rate of the images.     

基于人工免疫网络算法的图像配准方法

图像配准在很多领域得到了广泛应用,而且是其中不可缺少的步骤。该文提出了一种基于人工免疫网络算法的图像自动配准方法,该方法利用Partial Hausdorff距离作为相似测度,采用人工免疫网络算法寻找最优解。实验证明该方法可以很好地配准各种图像,为图像配准提供较好的解决方法。     

Deformable Registration of Digital Images

is paper proposes a novel elastic model and presents a deformable registration method based on the model.The method registers images without the need to extract reatures from the images,and therefore works directly on grey-level images.A new similarity metric is given on which the formation of external forces is based.The registration method,taking the coarse-to-fine strategy,constructs external forces in larger scales for the first few iterations to rely more on global evidence,and ther in smaller scales for later iterations to allow local refinements.The stiffness of the elastic body decreases as the process proceeds.To make it widely applicable,the method is not restricted to any type of transformation.The variations between images are thought as general free-form deformations.Because the elastic model designed is linearized,it can be solved very efficiently with high accuracy.The method has been successfully tested on MRI images.It will certainly find other uses such as matching time-varying sequences of pictures for motion analysis,fitting templates into images for non-rigid object recognition,matching stereo images for shape recovery,etc.     

用分层互信息和薄板样条实现医学图像弹性自动配准

提出了一种基于分层互信息和薄板样条自动确定标记对应点的选取方法,将图像按照由粗到精的原则,将每个图像分成若干个对应子块进行配准后,在每个子块图像中按照一定规则选取两个对应点,实现图像弹性自动配准．实验结果表明,该方法是一种理想的非刚性图像自动配准方法．     

基于B样条插值函数的人脑MR图像非刚体配准方法

提出了一种B样条插值函数结合图像特征标记的人脑MR图像非刚体配准方法。图像的特征标记选取图像的内外部轮廓来描述,目标和源特征之间的对应关系通过距离图来自动获得。形变过程采用B样条曲面函数插值来完成。通过多级B样条插值方法,即先全局计算后局部细化的方法来逐步优化形变结果。实验表明,该算法在不失准确度的前提下,具备较快的计算速度。