基于跨接约束的高分辨率SAR 影像与光学影像配准

为了实现高分辨率SAR 影像与光学影像之间自动/半自动配准, 提出了一种新颖、稳健的匹配算法。算法首先利用仿射变换进行SAR 影像和光学影像粗匹配, 简化了整体算法的处理复杂度;然后利用影像边缘稳健性, 使用边缘提取算子分别对SAR 影像和光学影像进行边缘提取, 为后续精匹配做好了数据准备; 最后使用基于边缘纹理跨接约束进行影像之间精匹配, 方法引入了邻域配准约束机制, 很好的解决了经典匹配多峰值效应, 提高了算法稳健性和实用性。以国内机载高分辨率SAR 数据和SPOT 25 PAN 数据为例进行算法验证, 实验结果表明该算法能实现自动/半自动的高分辨率SAR 和光学影像之间的像素级配准。     

A Novel Representation and Feature Matching Algorithm for Automatic Pairwise Registration of Range Images

Automatic registration of range images is a fundamental problem in 3D modeling of free-from objects. Various feature matching algorithms have been proposed for this purpose. However, these algorithms suffer from various limitations mainly related to their applicability, efficiency, robustness to resolution, and the discriminating capability of the used feature representation. We present a novel feature matching algorithm for automatic pairwise registration of range images which overcomes these limitations. Our algorithm uses a novel tensor representation which represents semi-local 3D surface patches of a range image by third order tensors. Multiple tensors are used to represent each range image. Tensors of two range images are matched to identify correspondences between them. Correspondences are verified and then used for pairwise registration of the range images. Experimental results show that our algorithm is accurate and efficient. Moreover, it is robust to the resolution of the range images, the number of tensors per view, the required amount of overlap, and noise. Comparisons with the spin image representation revealed that our representation has more discriminating capabilities and performs better at a low resolution of the range images. This work has been provisionally patented under Australian patent number 2004902436 and is sponsored by ARC grant number DP0344338.     

Projecting registration error for accurate registration of overlapping range images

In this paper, we propose a novel algorithm for the automatic registration of two overlapping range images. Since it is relatively difficult to compare the registration errors of different point matches, we project them onto a virtual image plane for more accurate comparison using the classical pin-hole perspective projection camera model. While the traditional ICP algorithm is more interested in the points in the second image close to the sphere centred at the transformed point, the novel algorithm is more interested in the points in the second image as collinear as possible to the transformed point. The novel algorithm then extracts useful information from both the registration error and projected error histograms for the elimination of false matches without any feature extraction, image segmentation or the requirement of motion estimation from outliers corrupted data and, thus, has an advantage of easy implementation. A comparative study based on real images captured under typical imaging conditions has shown that the novel algorithm produces good registration results.     

基于SURF特征提取的遥感图像自动配准

基于SURF（Speeded UpRobust Features）特征点提取是目前比较流行的图像配准方法．本文在SURF基础上,提出一种基于分块策略的改进方法：首先采用分水岭分割法确定图像的分块数量,然后对图像进行分块,每个子块提取一定数量的特征点,以便实现特征点的均匀提取;再通过稀疏特征树法找出匹配的特征点对;最后用RANSAC算法剔除错误匹配特征点对,同时计算参考图像与待配准图像的变换关系．实验表明,该方法能够高效、快速地解决遥感图像的自动配准问题．     

A fast and automatic stereotactic registration with a single CT-slice

The paper presents an algorithm for the automatic registration of a stereotactic frame from a single slice captured by a computed tomography (CT) scanner. Such registration is needed in interventional radiology for CT-image guidance of a robotic assistant. Stereotactic registration is based on a set of line fiducials that produce a set of image points. Our objective is to achieve the automatic registration of a stereotactic frame in the presence of noisy data and outliers. To this end, a new formulation of the stereotactic registration problem with a single image is proposed, for any configuration of the fiducials. With very few fiducials, closed-form and numerical solutions are presented. This comes in useful for building a robust automatic line to point matching algorithm based on the RANSAC statistical method. Simulation and experimental results are presented and highlight the robustness properties of the algorithm. They show that the registration is accurate with moderate computing requirements even for a large amount of outliers.     

基于小波的遥感图像全局配准算法研究及其并行实现

随着遥感技术的发展,遥感图像处理领域对自动图像配准技术的需求越来越迫切. 首先提出了点匹配和全局配准相结合的自动图像配准算法;从实现快速配准的途径出发，提 出了利用多分辨率小波缩小搜索空间及进行全局配准的自动算法;详细设计了逐级求精的搜 索策略,并比较总结了算法的特点;在此基础上,提出了两种可行的数据并行方案;最后在一 个小规模的机群系统上实现了上述串、并行算法,给出了客观的性能评价.实验结果表明文 中提出的算法达到了预期的目标,即针对多传感器、大数据量的遥感图像,在保证精度的前 提下,进行快速高效的自动配准.     

基于SIFT图像特征匹配的多视角深度图配准算法

为有效地解决多视角深度图配准问题,提出一种新的配准算法.首先给出一种深度图数据图像化方法,根据深度图包含的像素信息和网格顶点处的曲率值创建特征图像;然后通过对特征图像进行SIFT特征检测与匹配来获得特征点与匹配关系,从而得到原始深度图上的特征点与匹配关系;最后采用投票和预配准方法去除误匹配,实现递增式多视角深度图配准.模拟噪声实验和多个实际测量深度图的配准实验结果验证了该算法的鲁棒性和有效性.     

基于不变特征的运动视频序列自动配准算法

快速、鲁棒的图像配准是运动视频处理的基础,也是制约后继应用稳定性及可靠性的关键。针对运动视频中存在的图像平移、旋转、尺度及光照变化,提出一种基于不变特征的快速图像配准算法,包括特征点检测、描述和匹配。首先通过多层箱式滤波器构建图像多尺度空间,并同时考虑质量与空间分布检测特征点;然后用主成分分析法对SIFT(scale invariant feature transform)特征进行降维,用于特征描述;最后根据描述子主成分的差异设计层叠分类器,加速特征匹配。定量分析实验和对视觉监视系统中球形摄像机和无人机航拍视频的实验结果表明,该算法具有良好的匹配性能,为后继运动载台上的运动目标检测、跟踪、分类等处理提供了坚实基础。     

高分辨率SAR影像同名点自动匹配技术

由于SAR工作原理跟光学遥感成像技术截然不同，而经典同名点匹配方法已不能完全满足SAR自动配准需要。为了快速有效地进行SAR影像配准，基于SAR影像自动配准技术的发展，提出了一种新颖的高分辨率SAR影像同名点自动匹配算法，该算法首先创建金字塔影像，同时在金字塔影像上回溯搜索，以确定初始变换函数类型及相应的变换参数；然后通过分层回溯逐层加密控制点来解求最佳变换函数类型及相应变换参数；最后在原始影像分辨率下修正同名点坐标，以获取最终匹配同名点对。这种分层回溯策略不仅很好地解决了同名点搜索计算复杂度问题，使获取的同名点对分布更趋均匀、精度更高，而且能确保每层变换函数达到全局最小二乘最优。另外，以高分辨率SAR影像为实验数据进行的实验结果表明，该同名点搜索算法不仅计算时间可由221s缩短至34s，而且可达到0．284636 pixels的配准精度。     

Full anatomical labeling of magnetic resonance images of human brain by registration with multiple atlases

The problem of automatic segmentation of magnetic resonance (MR) images of human brain into anatomical structures is considered. Currently, the most popular segmentation algorithms are based on the registration (matching) of the input image with (to) an atlas—an image for which an expert labeling is known. Segmentation on the basis of registration with multiple atlases allows one to better take into account anatomical variability and thereby to compensate, to some extent, for the errors of matching to each individual atlas. In this work, a more efficient (in speed and memory) implementation is proposed of one of the best multiatlas label fusion algorithms in order to obtain a labeling of the input image. The algorithm is applied to the problem of segmentation of brain MR images into 43 anatomical regions with the use of the publicly available IBSR database, in contrast to the original work, where the authors provide test results for the problem of extraction of a single anatomical structure, the hippocampus.     

基于SIFT和改进的RANSAC图像配准算法

为解决RANSAC算法迭代次数过多导致图像配准精确率不高的问题,提出了一种改进的RANSAC图像配准算法。首先将参考图像和待配准图像进行NSCT变换分解成低频子带和高频子带。然后对高频子带运用矢量夹角算法和结构相似性（SSIM）来提取图像边缘特征点,对低频子带运用SIFT算法并设定合适的距离阈值来提取特征点。最后利用改进的RANSAC算法提高特征点匹配精度,选择出精匹配点对,实现图像配准。实验结果表明,该算法能有效地找到较多的匹配点对,准确地去除误匹配点对,明显地提高了配准精确度。     

图像特征匹配中一种高效的鲁棒估计算法

在图像特征匹配过程中,误匹配不可避免。提出一种新的基于拓扑约束（顺序约束和仿射不变约束）的外点去除算法,用于快速地去除图像粗匹配结果中的误配点。该算法 对随机采样集进行拓扑过滤,只对满足拓扑约束的采样集进行计算。实验表明,该算法相比于传统的鲁棒估计算法RANSAC和改进的PROSAC算法,大大提高了计算效率并保持很高的 计算精度,有助于提升图像匹配性能及3维重建的精度和鲁棒性。     

一种新型遥感图像配准方法

提出了一种新型全自动稳健的遥感图像配准算法。首先,在图像二维平面空间和尺度空间中同时检测局部极值作为特征点,并在特征点邻域提取局部不变特征描述子一尺度不变特征变换（SIFT）。然后,利用距离测度进行SIFT特征匹配得到初步的匹配集合。最后,运用稳健的随机采样一致性（RANSAC）算法将匹配点集划分为内点和外点,在内点域上精确地估计出图像变换模型。实验利用仿真数据测试了SIFT特征的可重复性和可匹配性,利用卫星图像验证了该自动配准算法的有效性和稳健性。     

一种基于SIFT特征的快速逐层遥感图像配准方法

当前SIFT特征分层配准方法中存在特征点匹配复杂度高以及不同时相地物变化导致特征点误匹配等问题,提出一种基于SIFT特征的“低分辨率配准\,高分辨率验证”快速逐层遥感图像配准方法。该方法针对同源同分辨率不同时相的遥感图像,通过在金字塔的低分辨率图层匹配特征点对并建立仿射变换模型,在金字塔的高分辨率图层评估并修正模型。实验表明：提出的方法在保证配准精度的前提下,有效提高了配准算法的效率。
     

一种快速的三维扫描数据自动配准方法

研究了两幅和多幅深度图像的自动配准问题.在配准两幅深度图像时,结合二维纹理图像配准深度图像,具体过程是:首先,从扫描数据中提取纹理图像,特别地,针对不包含纹理图像的扫描数据提出了一种根据深度图像直接生成纹理图像的方法;然后,基于SIFT(scale-invariant feature transform)特征提取纹理图像中的兴趣像素,并通过预过滤和交叉检验兴趣像素等方法从中找出匹配像素对的候选集;之后,使用RANSAC(random sample consensus)算法,根据三维几何信息的约束找出候选集中正确的匹配像素对和相对应的匹配顶点对,并根据这些匹配顶点对计算出两幅深度图像间的刚体置换矩阵;最后,使用改进的ICP(iterative closest point)算法优化这一结果.在配准多幅深度图像时,提出了一种快速构建模型图的方法,可以避免对任意两幅深度图像作配准,提高了配准速度.该方法已成功应用于多种文物的三维逼真建模.     

基于特征区域的图像自动配准

为了解决基于特征的图像配准中的特征点的定义和提取问题,提出了一种以特征区域替代特征点的定义和提取方法。该方法应用Moravec算子选择候选特征区域,使用具有旋转不变性的Zernike矩表征该区域的特性;采用二级匹配策略进行特征区域的匹配,即基于自组织映射神经网络的初始匹配及精细匹配;建立图像的配准框架并实现图像的配准。实验结果表明,该方法能有效地提取图像的特征点并能准确地进行特征点的匹配,整个配准过程完全自动进行。     

基于K-means聚类和RANSAC的图像配准算法研究

针对图像配准中特征点匹配方法存在实时性不高和精度低的问题,提出了一种基于K means聚类和RANSAC的图像配准算法。该算法根据匹配点对距离和方向特征的视差约束条件,首先利用K means聚类对匹配点对进行预处理,剔除大部分错误匹配点,然后利用RANSAC进行二次优化,实现了图像的快速和精确配准。实验结果表明,该算法不仅提高了图像配准的精确度,而且提高了图像配准的速度。     

基于改进CNN-RANSAC的水下图像特征配准方法

水对光的吸收和散射效应降低了水下图像的质量,水下图像的可视范围受到限制,复杂水下场景下的鲁棒性和精确性问题使得特征提取与匹配成为一项具有挑战性的任务。为了更好地配准水下图像,提出了一种改进CNN-RANSAC的水下图像特征配准方法,首先通过基于深度卷积神经网络的水下图像增强方法对水下图像进行增强预处理,通过水下图像分类数据集迁移学习训练VGGNet-16网络框架,利用修改后的网络框架进行特征提取,生成鲁棒的多尺度特征描述符与特征点,经过特征粗匹配与动态内点选择,使用改进的RANSAC方法剔除误匹配点。在大量水下图像数据集上进行了充分的特征提取和特征匹配实验,与基于SIFT和SURF的配准方法相比,该方法能够检测到更多的特征点,实现了匹配正确率的大幅度提高。     

基于特征的hausdorff距离图像配准

针对图像配准问题,提出了基于Harris及SIFT(Scale-invariant feature transform)特征的Hausdorff距离方法来实现图像配准。首先利用harris角点检测和SIFT特征提取参考图像和待配准图像的角点,通过两种方法获得的角点在融合之后获得更大的角点搜索范围,再利用相似一致性匹配原则剔除错误角点,进而通过改进的Hausdorff距离算法完成图像的配准操作。结果证明,改进算法比传统Hausdorff距离算法运行时间更短,算法时间降低约45%,具有较强的抗噪声能力和旋转鲁棒性,提高了图像配准的效率和精确性。     

Wavelet-based image registration technique for high-resolution remote sensing images

Image registration is the process of geometrically aligning one image to another image of the same scene taken from different viewpoints at different times or by different sensors. It is an important image processing procedure in remote sensing and has been studied by remote sensing image processing professionals for several decades. Nevertheless, it is still difficult to find an accurate, robust, and automatic image registration method, and most existing image registration methods are designed for a particular application. High-resolution remote sensing images have made it more convenient for professionals to study the Earth; however, they also create new challenges when traditional processing methods are used. In terms of image registration, a number of problems exist in the registration of high-resolution images: (1) the increased relief displacements, introduced by increasing the spatial resolution and lowering the altitude of the sensors, cause obvious geometric distortion in local areas where elevation variation exists; (2) precisely locating control points in high-resolution images is not as simple as in moderate-resolution images; (3) a large number of control points are required for a precise registration, which is a tedious and time-consuming process; and (4) high data volume often affects the processing speed in the image registration. Thus, the demand for an image registration approach that can reduce the above problems is growing. This study proposes a new image registration technique, which is based on the combination of feature-based matching (FBM) and area-based matching (ABM). A wavelet-based feature extraction technique and a normalized cross-correlation matching and relaxation-based image matching techniques are employed in this new method. Two pairs of data sets, one pair of IKONOS panchromatic images from different times and the other pair of images consisting of an IKONOS panchromatic image and a QuickBird multispectral image, are used to evaluate the proposed image registration algorithm. The experimental results show that the proposed algorithm can select sufficient control points semi-automatically to reduce the local distortions caused by local height variation, resulting in improved image registration results.