A non-rigid cardiac image registration method based on an optical flow model

According to non-rigid medical image registration, new method of classification registration is proposed. First, Feature points are extracted based on SIFT (Scale Invariant Feature Transform) from reference images and floating images to match feature points. And the coarse registration is performed using the least square method. Then the precise registration is achieved using the optical flow model algorithm. SIFT algorithm is based on local image features that are with good scale, rotation and illumination invariance. Optical flow algorithm does not extract features and use the image gray information directly, and its registration speed is faster. The both algorithms are complementary. SIFT algorithm is used for improving the convergence speed of optical flow algorithm, and optical flow algorithm makes the registration result more accurate. The experimental results prove that the algorithm can improve the accuracy of the non-rigid medical image registration and enhance the convergence speed. Therefore, the algorithm has some advantages in the image registration.     

Super-resolution reconstruction face recognition based on multi-level FFD registration

Super-resolution (SR) reconstruction is an effective method to solve the problem, that the face image resolution is too low to be recognized in video, but the non-rigid change of deformed face and expression changes greatly affect the accuracy of registration and reconstruction. To solve these problems, a method of multi-level model free form deformation (FFD) elastic registration algorithm based on B spline is proposed. It first use low-resolution FFD grid for global registration, to emphasize the contribution of edge information for registration, we introduce edge registration measure into the sum of squared difference (SSD) criterion. Then divide the global registration image and reference image into a series of corresponding sub-image pairs and calculate the correlation coefficient of each pair; at the same time, we do local registration with high-resolution FFD grid to the small value correlation coefficient sub-image pairs. In the registration process of optimization, the paper uses adaptive step length gradient descent method algorithm based on chaotic variables to improve optimization efficiency. After registration, the algorithm of project onto convex sets (POCS) is used to reconstruct SR face image through several low resolution image sequences, and then recognized these SR face images by support vector machines (SVM) classifier. Experimental results from standard video database and self-built video database show that this method can register and reconstruct face image accurately in the condition of great face deformation and expression change, while the face recognition accuracy is also improved.     

基于局部血管结构特征的眼底图像二级配准

提出了一种结合全局配准和局部配准技术的眼底图像二级配准算法,该算法采用4个相连的分叉点组成的局部血管结构来代替单独的分叉点作为配准特征,通过减少配对点集,提高了配准效率.同时针对非线性形变造成的局部配准偏移较大的问题,在全局配准基础上进一步采用局部配准技术,提升了配准的准确度.实验结果表明,该算法以很高的配准效率和准确度有效实现了眼底图像的配准.     

基于局部血管结构特征的眼底图像二级配准

提出了一种结合全局配准和局部配准技术的眼底图像二级配准算法,该算法采用4个相连的分叉点组成的局部血管结构来代替单独的分叉点作为配准特征,通过减少配对点集,提高了配准效率.同时针对非线性形变造成的局部配准偏移较大的问题,在全局配准基础上进一步采用局部配准技术,提升了配准的准确度.实验结果表明,该算法以很高的配准效率和准确度有效实现了眼底图像的配准.     

扫频光学相干层析视网膜图像配准去噪算法

多帧叠加平均处理是去除扫频光学相干层析系统散斑噪声、获得较为清晰结构信息的有效方法,但眼睛的震颤、漂移、微眼跳等生理特性和系统光路特性会使图像之间存在错位,导致叠加效果不佳、结构稳定性差,为此本文提出一种基于灰度分布信息和目标几何信息相结合的配准算法。该方法根据图像平均灰度分布提取包含目标信息的感兴趣区域,通过相位相关算法和基于分段拟合的灰度投影算法的双重作用校正图像的平移变换;通过拟合视网膜上边界作为特征点迭代确定最佳旋转参数,并再次重新估计平移参数,实现图像的刚性配准;最后通过轴向扫描一对一映射法以能量函数为约束条件实现图像的非刚性配准。对活体兔眼进行实验,结果表明,本文算法配准后的叠加图像边界清晰,结构信息增强,信噪比和对比度平均有效提高一倍多。本算法适用于强噪声视网膜B-Scans图像的配准,能满足多种类型OCT系统的叠加成像需要,具有较高的鲁棒性和图像配准精度。     

Study of mutual information multimodality medical image registration based on modified simplex optimization method

Because of a different imaging mechanism and highly complexity of body tissues and structures. Different modality medical images provide non-overlay complementary information. This has very important significance for multimodal medical image registration. Image registration is the first and key part of problem to be solved in the integrations. When the spatial position of two medical images is same, the registration could be achieved. For two CT and PET images, the principal axis method is adopted to achieve the rough registration. The modified simplex algorithm is employed to implement global search using the mutual information as similarity measure. The initial registration parameters are achieved through principal axis Based on the results of test, improved simplex method can adjust reflecting distance. Stepped-up optimization algorithm on the new experimental points through the methods of “reflection”, “enlargement”, “shrinkage” or “global systolic”. A mutual information registration based on modified simplex optimization method is presented in this paper to improve the speed of medical image registration.Results indicate that the proposed registration method prevents the optimizing process from falling into local extremum and improves the convergence speed while keeping the precision. The accurate registration of multimodal image with different resolutions is achieved.     

多探测器拼接成像系统实时图像配准

依据已设计完成的基于同心球透镜的四镜头多探测器阵列拼接成像系统,对该系统图像拼接配准过程所采用的特征检测提取、特征向量匹配与筛选、空间变换模型参数估计等算法进行了研究。首先,采用Fast-Hessian检测子提取参考图像和待配准图像的特征点,并生成加速鲁棒特征(SURF)描述向量。接着,采用快速近似最近邻(FANN)逼近搜索算法获得初始的匹配点对,并对匹配点对特征向量的欧式距离进行排序。然后,参照成像系统光学设计参数设定合理的阈值,筛选并保留下较好的匹配点对。最后,提出了一种改进的渐进式抽样一致性(IPROSAC)算法对空间变换矩阵模型进行参数估计,从而得到参考图像与待配准图像的空间几何变换关系。实验结果表明:该算法对图像尺寸、旋转和光照变化都具有一定的不变性,特征匹配时间为0.542 s,配准变换时间0.031 s,配准误差精度小于0.1 pixel,可以满足成像系统关于图像配准实时性和准确性的要求,具有一定的工程应用价值。     

基于CSIFT的彩色图像配准技术研究

图像配准在计算机视觉、遥感、医学诊断与治疗、环境监测等领域有广泛的研究应用.目前,多数算法是将彩色图像转化为灰度图后再配准,色彩信息的丢失可能会引起误配准.为此,提出一种基于CSIFT(Colored scale invariant feature transform)的彩色图像配准方法,求出彩色图像各个位置处的颜色不变最,以颜色不变量作为输入图像,再提取特征点并描述特征点周围的信息,通过最近邻匹配法求出图像问的匹配对,最后利用匹配的特征求取图像间的变换参数及配准后图像.实验结果表明,对彩色图像进行已知参数值变换时,该算法能得到精度高、误差小的计算结果;对变换关系末知的彩色图像,也能准确地求出图像间的映射关系;且多数情况下运行速度较SIFT(Scale invariant feature transform)快.     

基于特征点匹配的图像配准算法精度提升方法研究

图像配准是多种图像后续处理的基础,较为常见的有图像融合,图像拼接、图像的三维重建等,这些后续操作都需要在一个好的配准前提下才能完成,因此,对于图像配准精度改进的研究具有很重要的实际应用价值。对基于特征点匹配的图像配准算法提出了几个配准精度提升的方法,这些方法分别针对特征检测精度的提升和特征匹配精度的提升来达到图像配准精度提升的目的。     

一种稳健的特征点配准算法

为了能准确快速提取特征和可靠匹配特征点对,提出一种稳健的基于特征点的配准算法。首先改进了Plessey角点检测算法,有效提高所提取特征点的速度和精度。然后利用相似测度归一化互相关(Normalized cross correlation,NCC),通过双向最大相关系数匹配的方法提取出初始特征点对,用随机采样符合法(Random sample consensus,RANSAC)来剔除伪特征点对,实现特征点对的精确匹配。最后用正确匹配特征点对实现图像的配准。实验表明,该方法能够快速准确地提取两幅图像间的对应特征点,大大降低了误匹配的概率,两幅图像光照不一致、重复性纹理、旋转角度比较大等较难自动匹配情形下,仍能有效地实现图像的配准。     

基于特征点的对数极坐标变换图像配准算法

介绍了一种新的图像配准算法,可以很好地解决图像配准中的平移、旋转和缩放问题。算法的实现是首先使用SUSAN算子提取两幅图像的特征角点,剔除虚假的特征点(噪声点),然后使用改进对数极坐标变换和投影相关匹配算法实现特征点匹配;结合亚像素定位技术,可以进一步提高算法的精度。     

基于线性不变矩的特征图象配准算法研究

针对图象差异较大的光学图象与合成孔径雷达图象(SAR)的特点,设计了一种基于特征的图象配准的算法,包括特征提取、匹配、控制点选取、变换系数计算和误差计算等步骤.在特征提取中,对于雷达图象需要进行预处理并采用LOG提取图象轮廓.在匹配算法中,以线性不变矩作为特征量,对现有基于图象轮廓特征的匹配算法进行了改进.采用上海浦东地区的Radarsat-1S2模式图象与LandsatTM-5波段图象作为待配准图象.实验结果表明,该方法可以较好地完成光学图象与SAR图象的配准,有着较高的应用价值.     

基于无人机载的光电与SAR图像融合技术研究

为了提高无人机侦察识别能力,提出基于小波变换方法的无人机载光电与SAR的图像融合技术。经时间配准算法生成图像配准源,采用SIFT算法提取图像特征点,BBF算法计算生成匹配点集,依据匹配点集计算图像间透视变换模型完成图像配准,利用小波变换算法实现配准图像融合。经实验验证以及利用Matlab分析图像灰度直方图和计算信息量,结果表明:融合图像保留了光电图像95.7%的细节(熵),相比于光电图像平均梯度提高了1.52倍,增强了光电图像目标区对比度,降低了随机性噪点;融合图像相比于SAR图像信息量提高了1.44倍。     

Image registration guided,sparsity constrained reconstructions for dynamic MRI

It is generally a challenging task to reconstruct dynamic magnetic resonance (MR) images with high spatial and high temporal resolutions, especially with highly incomplete k-space sampling. In this work, a novel method that combines a non-rigid image registration technique with sparsity-constrained image reconstruction is introduced. Employing a multi-resolution free-form deformation technique with B-spline interpolations, the non-rigid image registration accurately models the complex deformations of the physiological dynamics, and provides artifact-suppressed high spatial-resolution predictions. Based on these prediction images, the sparsity-constrained data fidelity-enforced image reconstruction further improves the reconstruction accuracy. When compared with the k-t FOCUSS with motion estimation/motion compensation (MEMC) technique on volunteer scans, the proposed method consistently outperforms in both the spatial and the temporal accuracy with variously accelerated k-space sampling. High fidelity reconstructions for dynamic systolic phases with reduction factor of 10 and cardiac perfusion series with reduction factor of 3 are presented.     

基于Shape Context和尺度不变特征变换的多模图像自动配准方法

提出了基于修正的尺度不变特征变换（SIFT）特征提取和Shape Context特征描述算子相结合的多模图像自动配准算法,该算法利用修正的SIFT算法提取多模图像中的特征点,然后采用Shape Context算子描述特征点,利用特征点周围区域边缘点的梯度方向形成特征向量。采用欧氏距离作为匹配标准对多模图像中特征点进行初始匹配,然后通过RANSAC算法消除误匹配的特征点对,并采用最小二乘法计算仿射变换参数,最后通过仿射变换和双线性插值实现图像配准。对红外图像和可见光图像的配准实验结果表明了本算法的有效性和稳定性。     

基于特征点自动匹配的红外图像配准研究

在模糊和含噪声的红外图像配准中,利用角点检测实现特征点的选择,在提高角点提取效率的同时又保证了角点提取的精度。根据互相关的双向匹配实现对应特征点的自动匹配,然后由对应的特征点对估计出仿射变换的参数。实测的数据和计算结果表明,这种方法对于双波段红外图像的配准是有效的,而且有利于后续的图像融合。     

Registration and integration algorithm in structured light three-dimensional scanning based on scale-invariant feature matching of multi-source images

Based on the homography between a multi-source image and three-dimensional (3D) measurement points, this letter proposes a novel 3D registration and integration method based on scale-invariant feature matching. The matching relationships of two-dimensional (2D) texture gray images and two-and-a-half- dimensional (2.5D) range images are constructed using the scale-invariant feature transform algorithms. Then, at least three non-collinear 3D measurement points corresponding to image feature points are used to achieve a registration relationship accurately. According to the index of overlapping images and the local 3D border search method, multi-view registration data are rapidly and accurately integrated. Experimental results on real models demonstrate that the algorithm is robust and effective.     

Balanced multi-image demons for non-rigid registration of magnetic resonance images

A new approach is introduced for non-rigid registration of a pair of magnetic resonance images (MRI). It is a generalization of the demons algorithm with low computational cost, based on local information augmentation (by integrating multiple images) and balanced implementation. Specifically, a single deformation that best registers more pairs of images is estimated. All these images are extracted by applying different operators to the two original ones, processing local neighbors of each pixel. The following five images were found to be appropriate for MRI registration: the raw image and those obtained by contrast-limited adaptive histogram equalization, local median, local entropy and phase symmetry. Thus, each local point in the images is supplemented by augmented information coming by processing its neighbor. Moreover, image pairs are processed in alternation for each iteration of the algorithm (in a balanced way), computing both a forward and a backward registration.The new method (called balanced multi-image demons) is tested on sagittal MRIs from 10 patients, both in simulated and experimental conditions, improving the performances over the classical demons approach with minimal increase of the computational cost (processing time around twice that of standard demons). Specifically, a simulated deformation was applied to the MRIs (either original or corrupted by additive Gaussian or speckle noises). In all tested cases, the new algorithm improved the estimation of the simulated deformation (squared estimation error decreased by about 65% in the average). Moreover, statistically significant improvements were obtained in experimental tests, in which different brain regions (i.e., brain, posterior fossa and cerebellum) were identified by the atlas approach and compared to those manually delineated (in the average, Dice coefficient increased of about 6%).The conclusion is that a balanced method applied to multiple information extracted from neighboring pixels is a low cost approach to improve registration of MRIs.     

针对图像序列的快速低存储开销配准算法

针对序列图像配准问题，提出一种快速低存储开销配准算法。首先，生成一系列与具体图像内容无关的特征点。而后，使用正向-反向跟踪来获取稳定的特征点对,其中，正向跟踪用于获得所有可能的特征点对，反向跟踪用来得到正向-反向误差，并且利用此误差来获取最终稳定的特征点对。最后，在稳定特征点对的基础上通过归一化直接线性变换计算得到可用于图像配准的单应矩阵。实验表明该算法能够提供与优秀的传统算法相当的配准性能。由于该算法对序列中图像之间的连续性进行了充分利用，不仅降低了存储开销，还提高了运算速度。对480360的序列而言，该算法需要的存储开销仅为421 kB，且运算速度达到32 帧/s。