线性拟合联合参数法在图像配准中的应用

提出了一种基于仿透视函数模型和相机响应参数模型共同作用下图像配准算法。首先估算角点匹配以加强匹配精度和速度；由受约束条件控制的分段线性函数近似相机的非线性响应函数，建立起全局参数模型；应用最小二乘法，得到较为精确的参数初始值；最后应用迭代算法降低配准误差。实验结果表明,该算法很好地解决了曝光差异图像配准问题，提高了迭代速度和精确度。     

改进的RANSAC算法在图像配准中的应用

为了提高图像配准的速度,提出了一种基于改进的随机抽样一致性（RANSAC）算法的快速图像配准方法。该方法首先采用Harris角点检测算法提取出参考图像和目标图像的特征角点,然后利用灰度相关性进行特征角点的匹配,最后采用基于预检测的RANSAC算法快速而精确地估计变换矩阵,进行图像配准。该算法中采用预检测的方法快速抛弃那些不是候选模型的临时模型,提高了算法的速度。同时使用随机块选取法选择样本,很好地消除外点的影响进而保证精度。实验结果表明,此方法在得到较高的精度和鲁棒性的情况下,还大幅度减少了运算量,提高了图像配准的速度。     

基于特征的自适应正则化配准算法*

Andriy Myronenko提出了一种自适应正则化的方法并将其应用于非刚性图像的配准,该方法在配准速度和配准精确度方面都取得了比较好的效果。但该方法对变形场初始值比较敏感,选择不当则会陷入局部极小值而不能得到理想的配准结果。为了使原始算法得到更广泛的应用,本文引入了基于特征点的粗配准方法,得到了与真实变形场更加接近的初始变形场,从而摆脱了局部极小值的困扰,得到了正确的配准结果。实验证明,改进后的算法在应用范围和配准精度上都有了提高。     

改进的区域互信息和小波变换的图像配准

为提高图像配准的速度和精度,对基于区域互信息配准算法进行了改进,运用了两层小波分解策略的配准方法,小波分解得到的最顶层图像采用粒子群优化全局寻优算法,利用搜索的结果作为下一层Powell寻优方法的起点,另外,对待配准图像应用形态学方法去除噪音。针对不同分解层的特点,采用不同的测度方法,得到的顶层图像采用改进后的区域互信息为相似性测度,而底层采用归一化互信息测度和相位一致性的相结合的方法,不仅提高了速度,还克服了图像间明暗对比的影响。实验结果表明,提出的配准算法对图像噪声有较高的鲁棒性,可达到亚像素精度,在配准速度上也有了很大的提高。     

Demons非刚性配准算法拓扑保持性的研究

在基于配准的图像分割应用中, 拓扑保持性是非刚性图像配准算法的一个重要约束. 本文从矢量场特性出发, 分析了Demons非刚性图像配准算法导致目标拓扑改变时变形场的特点. 根据变形场特点与其雅可比行列式之间的关系, 给出了校正该算法拓扑保持性的方法. 实验表明, 改进后的变形场具有了拓扑保持性.     

基于SIFT和TPS算法的四旋翼无人机图像自动配准

针对四旋翼无人机图像姿态倾角大、图像变形明显等特点,采用尺度不变特征变换(SIFT)算法和薄板样条模型(TPS)对四旋翼无人机图像进行特征点匹配和配准实验研究,从拼接图像的目视效果和配准均方差方面比较分析了TPS模型与常用的仿射变换及多项式变换模型的图像配准效果。结果表明:在SIFT算法精确的同名点匹配下,TPS变换模型能够兼顾四旋翼无人机图像的整体刚性变形及局部的非刚性变形,无论是目视效果还是均方差定量分析,TPS变换的图像配准精度最高\,效果最好,能够满足四旋翼无人机图像的快速配准、拼接要求。     

一种新的卫星多光谱图像自动配准算法

针对小卫星独立相机多光谱成像系统波段间配准的非线性误差问题,提出了一种多光谱图像波段间自动配准算法,该算法综合利用互信息、遗传算法和MQ几何校正模型进行多光谱图像的自动配准。在算法中,以互信息作为配准的相似性度量,获得了很高的配准精度;利用遗传算法的快速搜索特性,可以较快的完成搜索并获得整体的最优解;利用MQ几何模型可以精确的建立图像之间的几何关系。试验表明该算法对于多光谱图像波段间非线性几何关系,能够取得非常高的波段间自动配准精度,整体配准误差在一个像元以内。     

面向复杂地形的无人机集群遥感图像自动几何配准算法

为了提高无人机集群遥感图像自动几何配准精度,设计一个面向复杂地形的无人机集群遥感图像自动几何配准算法。首先获取遥感图像的特征点,然后计算图像特征向量,在此基础上,建立尺度空间模型找到图形间的连接关系,同时,建立图像匹配原则,通过匹配原则建立变换空间,确定两点之间的联系,最后建立配准模型,实现无人机集群遥感图像自动几何配准。实验结果表明,所研究的配准算法提高了配准精度与配准效率。     

基于空间注意力与过滤网络的遥感图像配准

针对部分遥感图像配准算法存在特征提取能力不足,存在较多误匹配点的问题,提出了一个算法。在特征提取阶段加入改进的空间注意力机制关注图像的重要区域以及显著特征,增强网络的特征表达能力。匹配阶段提出粗过滤加细过滤双层过滤的方式,提高模型的鲁棒性和配准精度。同时改进了损失函数,提高模型的泛化性和拟合能力。仿真中,与多种先进的方法相比,所提算法能获得更高的配准精度和更低的配准误差,并且针对不同类型的图像也能取得较好的配准效果。     

基于平衡系数的Active Demons非刚性配准算法

经典的Active demons算法利用参考图像和浮动图像的梯度信息作为驱动力,并使用均化系数调节两种驱动力之间的强度.该算法克服了Demons算法单一使用参考图像的梯度信息作为驱动力的缺点,但是Active demons算法中的均化系数无法同时兼顾大形变和小形变区域的准确配准,还会导致配准的收敛速度和精确度相互制约的问题.为此,本文提出一种新的Active demons非刚性配准算法.提出的算法在Active demons扩散方程中引入一个称为平衡系数的新参数,与均化系数联合调整驱动力,不仅可以兼顾图像中同时具有的大形变和小形变区域的准确配准,而且在一定程度上缓和了收敛速度和精确度相互制约的问题.为了进一步提高配准的收敛速度和精确度,避免陷入局部极值,在新的配准算法的实现中引入由粗到细的多分辨率策略.在Checkboard测试图像、自然图像和医学图像上的实验结果表明,提出的算法较经典的Active demons算法收敛速度更快,配准精度平均提高了54.28%,接近最新的TV-L1光流场图像配准算法的配准精度,解决了Active demons算法存在的问题.     

A Gauss–Newton approach to joint image registration and intensity correction

We develop a new efficient numerical methodology for automated simultaneous registration and intensity correction of images. The approach separates the intensity correction term from the images being registered in a regularized expression. Our formulation is consistent with the existing non-parametric image registration techniques, however, an extra additive intensity correction term is carried throughout. An objective functional is formed for which the corresponding Hessian and Jacobian is computed and employed in a multi-level Gauss–Newton minimization approach. In this paper, our experiments are based on elastic regularization on the transformation and total variation on the intensity correction. Validations on dynamic contrast enhanced MR abdominal images for both real and simulated data verified the efficacy of the model.     

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.     

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

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

Fair relay selection in decode-and-forward cooperation based on outage priority

The opportunistic cooperation schemes,where only the "best" relay is selected to forward the message,have been widely investigated recently for their good performance in terms of outage probability.However,the unfair selections of relays may cause unbalance power consumptions among relays,which reduces the lifetime of energy constrained networks.In this paper,we introduce a novel concept of outage priority based fairness(OPF),aiming at improving the selection fairness among relays appropriately without outage performance deterioration.Then,a cooperation scheme is proposed to meet this concept,and corresponding theoretical analysis is also provided.Afterward,based on OPF,the achievable upper bound of the fairness is derived,and an optimal cross-layer designed scheme is also provided to achieve the bound.Numerical simulations are carried out finally,which not only validate the theoretical analysis,but also show that taking advantages of the proposed schemes,the fairness among all relays,as well as the network lifetime,can be greatly improved without any loss of outage performance,especially in high SNR regime.     

Evaluation of the registration of temporal series of contrast-enhanced perfusion magnetic resonance 3D images of the liver

The registration of 2D and 3D images is one of the key tasks in medical image processing and analysis. Accurate registration is a crucial preprocessing step for many tasks; consequently, the evaluation of its accuracy becomes necessary. Unfortunately, this is a difficult task, especially when no golden pattern (true result) is available and when the signal values may have changed between successive images to be registered. This is the case this paper deals with: we have a series of 3D images, magnetic resonance images (MRI) of the liver and adjacent areas that have to be registered. They have been taken while a contrast is diffused through the liver tissue, so intensity of each observed point changes for two reasons: contrast diffusion/perfusion and deformation of the liver (due to body movement and breathing). In this paper, we introduce a new method to automatically compare two or more registration algorithms applied to the same case of a perfusion magnetic resonance dynamic image so that the best of them can be chosen when no ground truth is available. This is done by modeling the function that gives the intensity at a given point as a functional datum, and using statistical techniques to assess its change in comparison with other functions. An example of the application is shown by comparing two parametrizations of a B-spline based registration algorithm. The main result of the proposed method is a suggestive evidence to guide the physician in the process of selecting a registration algorithm, that recommends the algorithm of minimal complexity but still suitable for the case to be analyzed.     

Improved Susceptibility Artifact Correction of Echo-Planar MRI using the Alternating Direction Method of Multipliers

We present an improved technique for susceptibility artifact correction in echo-planar imaging (EPI), a widely used ultra-fast magnetic resonance imaging (MRI) technique. Our method corrects geometric deformations and intensity modulations present in EPI images. We consider a tailored variational image registration problem incorporating a physical distortion model and aiming at minimizing the distance of two oppositely distorted images subject to invertibility constraints. We derive a novel face-staggered discretization of the variational problem that renders the discretized distance function and constraints separable. Motivated by the presence of a smoothness regularizer, which leads to global coupling, we apply the alternating direction method of multipliers (ADMM) to split the problem into simpler subproblems. We prove the convergence of ADMM for this non-convex optimization problem. We show the superiority of our scheme compared to two state-of-the-art methods both in terms of correction quality and time-to-solution for 13 high-resolution 3D imaging datasets.     

非介入式手术导航中医学图像配准算法

提出一种用于非介入手术导航中基于自由变形模型的多模态医学图像非刚性配准方法,对术前MRI/CT和术中超声图像中都可见的血管结构进行配准.当图像对准时,一种图像中的血管中心点对应着另一种图像下灰度脊点;对于全局变换采用刚性变换、局部形变采用基于函数控制B样条的自由变形模型来描述;采用遗传算法和共轭梯度法相结合达到最小化目标函数.将文中算法应用于体模和临床数据,在配准精度和收敛速度上都取得了良好的效果.     

脑切片图像三维重建中的层间配准算法

在脑切片图像三维重建过程中,为了解决二维医学图像的层间配准问题,提出一种新的模板配准的算法.该算法根据序列图像的共同模板信息,在各图像中搜索匹配图,再将切片图像移动到理想对齐位置,经动态校正后,以目标质心为矩形左上角,截取图像用以重建。实验结果对比分析表明,本算法能精确处理数字人采集的原始数据,并能为后续的二次数据库开发、图像分割、重建和数字解剖等提供应用支持,优于同类算法。     

相位一致性和区域互信息量的医学图像配准

提出一种改进的多模态医学图像配准算法--基于相位一致性和区域互信息量,不仅使用了图像灰度,而且采用了能描述图像结构的特征。首先,引入区域互信息量代替传统的灰度直方图,可以将邻域信息考虑进去;其次,通过相位一致性得到的特征图像不受明暗对比度的影响;最后,将特征图像和原始图像引入到区域互信息量中,也就是结合了邻域信息和结构信息。结果表明算法具有精度高、鲁棒性强等特点,特别适合于医学图像配准。     

融合SIFT特征的熵图估计医学图像非刚性配准

配准准确性是医学图像配准算法的一项重要指标,像素灰度是目前图像配准中广泛使用的特征,但是灰度特征来源单一,而且忽略空间信息,在一些情况下容易产生误配。针对这个问题,本文提出一种融合SIFT特征的熵图估计医学图像非刚性配准算法。该算法首先使用基于互信息的刚性配准算法对两幅待配准图像进行粗配;然后,在采样点上提取像素灰度和SIFT高维特征,并在此基础上构造k-最邻近图(kNNG);最后,使用k-最邻近图来估计α互信息(αMI)。实验结果表明:和传统的基于互信息和像素灰度的刚性配准算法,基于熵图估计和单一像素灰度特征的非刚性配准算法相比,本文提出的算法具有更高的配准准确性。