A feature-based, robust, hierarchical algorithm for registeringpairs of images of the curved human retina

This paper describes a robust hierarchical algorithm for fully-automatic registration of a pair of images of the curved human retina photographed by a fundus microscope. Accurate registration is essential for mosaic synthesis, change detection, and design of computer-aided instrumentation. Central to the algorithm is a 12-parameter interimage transformation derived by modeling the retina as a rigid quadratic surface with unknown parameters. The parameters are estimated by matching vascular landmarks by recursively tracing the blood vessel structure. The parameter estimation technique, which could be generalized to other applications, is a hierarchy of models and methods, making the algorithm robust to unmatchable image features and mismatches between features caused by large interframe motions. Experiments involving 3,000 image pairs from 16 different healthy eyes were performed. Final registration errors less than a pixel are routinely achieved. The speed, accuracy, and ability to handle small overlaps compare favorably with retinal image registration techniques published in the literature     

基于肺部组织特征的图像弹性配准研究

图像配准是一种建立两幅图像空间对应关系的过程,它被广泛应用于计算机视觉、遥感数据分析及图像处理中,特别是在影像引导放射治疗领域,图像配准发挥着巨大作用。但由于受呼吸运动的影响,精确的肺部影像配准依然是一个充满挑战的难题。目前,尺度不变特征变换(Scale-Invariant Feature Transform,SIFT)已被用于医学图像配准中,并且取得了较理想的结果。然而,SIFT检测到的仅是图像的块特征,不能有效的反映肺部的运动。文章提出了一种基于Harris和SIFT算子的杂交型特征检测方法,这种方法能有效检测肺部的组织特征,如血管分叉点和肺部边界等。除此之外,为了有效去除特征匹配过程中产生的错配点,还提出了一种基于互相关和组织结构不变性的滤除错配点方法。文章最后采用一系列不同呼吸周期的肺部CT影像来对所提出的算法进行验证。定性和定量的结果表明,该算法较传统的SIFT算法更具优越性。     

A robust hybrid method for nonrigid image registration

A nonrigid registration method is proposed to automatically align two images by registering two sets of sparse features extracted from the images. Motivated by the paradigm of Robust Point Matching (RPM) algorithms [1] and [2], which were originally proposed for shape registration, we develop Robust Hybrid Image Matching (RHIM) algorithm by alternatively optimizing feature correspondence and spatial transformation for image registration. Our RHIM algorithm is built to be robust to feature extraction errors. A novel dynamic outlier rejection approach is described for removing outliers and a local refinement technique is applied to correct non-exactly matched correspondences arising from image noise and deformations. Experimental results demonstrate the robustness and accuracy of our method.     

Fingerprint image mosaicking by recursive ridge mapping.

To obtain a large fingerprint image from several small partial images, mosaicking of fingerprint images has been recently researched. However, existing approaches cannot provide accurate transformations for mosaics when it comes to aligning images because of the plastic distortion that may occur due to the nonuniform contact between a finger and a sensor or the deficiency of the correspondences in the images. In this paper, we propose a new scheme for mosaicking fingerprint images, which iteratively matches ridges to overcome the deficiency of the correspondences and compensates for the amount of plastic distortion between two partial images by using a thin-plate spline model. The proposed method also effectively eliminates erroneous correspondences and decides how well the transformation is estimated by calculating the registration error with a normalized distance map. The proposed method consists of three phases: feature extraction, transform estimation, and mosaicking. Transform is initially estimated with matched minutia and the ridges attached to them. Unpaired ridges in the overlapping area between two images are iteratively matched by minimizing the registration error, which consists of the ridge matching error and the inverse consistency error. During the estimation, erroneous correspondences are eliminated by considering the geometric relationship between the correspondences and checking if the registration error is minimized or not. In our experiments, the proposed method was compared with three existing methods in terms of registration accuracy, image quality, minutia extraction rate, processing time, reject to fuse rate, and verification performance. The average registration error of the proposed method was less than three pixels, and the maximum error was not more than seven pixels. In a verification test, the equal error rate was reduced from 10% to 2.7% when five images were combined by our proposed method. The proposed method was superior to other compared methods in terms of registration accuracy, image quality, minutia extraction rate, and verification.     

6D scan registration using depth-interpolated local image features

This paper describes a novel registration approach that is based on a combination of visual and 3D range information. To identify correspondences, local visual features obtained from images of a standard color camera are compared and the depth of matching features (and their position covariance) is determined from the range measurements of a 3D laser scanner. The matched depth-interpolated image features allow one to apply registration with known correspondences. We compare several ICP variants in this paper and suggest an extension that considers the spatial distance between matching features to eliminate false correspondences. Experimental results are presented in both outdoor and indoor environments. In addition to pair-wise registration, we also propose a global registration method that registers all scan poses simultaneously.     

Parametric estimation of affine deformations of planar shapes

We consider the estimation of affine transformations aligning a known 2D shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the shapes and then compute the transformation parameters from these landmarks. Here we propose a novel approach where the exact transformation is obtained as the solution of a polynomial system of equations. The method has been tested on synthetic as well as on real images and its robustness in the presence of segmentation errors and additive geometric noise has also been demonstrated. We have successfully applied the method for the registration of hip prosthesis X-ray images. The advantage of the proposed solution is that it is fast, easy to implement, has linear time complexity, works without established correspondences and provides an exact solution regardless of the magnitude of transformation.     

Using photo-consistency to register 2D optical images of the humanface to a 3D surface model

The authors propose a novel method to register two or more optical images to a 3D surface model. The potential applications of such a registration method could be in medicine for example, in image guided interventions, surveillance and identification, industrial inspection, or telemanipulation in remote or hostile environments. Registration is performed by optimizing a similarity measure with respect to the transformation parameters. We propose a novel similarity measure based on "photo-consistency." For each surface point, the similarity measure computes how consistent the corresponding optical image information in each view is with a lighting model. The relative pose of the optical images must be known. We validate the system using data from an optical-based surface reconstruction system and surfaces derived from magnetic resonance (MR) images of the human face. We test the accuracy and robustness of the system with respect to the number of video images, video image noise, errors in surface location and area, and complexity of the matched surfaces. We demonstrate the algorithm working on 10 further optical-based reconstructions of the human head and skin surfaces derived from MR images of the heads of five volunteers. Matching four optical images to a surface model produced a 3D error of between 1.45 and 1.59 mm, at a success rate of 100 percent, where the initial misregistration was up to 16 mm or degrees from the registration position     

The registration of CT image to the patient head by using an automated laser surface scanning system--a phantom study

In this paper, a practical methodology of surface-based registration supported by an automated laser surface scanning system to achieve good mapping performance is reported. The laser scanning system is used to digitize the facial feature of a phantom so as to mesh the physical space into triangular frame. The image space is established by translating the corresponding CT image into point set through using the medical image software tools. The image-to-physical registration task is carried out by a direct searching mechanism together with the objective function in an optimal fashion. The unconstrained nonlinear optimization algorithm performs the optimal searching iteration to find those parameters in the rigid-body transformation until the sum of the squared normal distances is minimized. Considering mapping the massive points in registration task would consume the computation time, there is only a suitable sample size to stand for the entire population with sufficient confidence and accuracy are extracted statistically from the CT point space to map to the laser scanning space. Registration results evaluated by gauging the position errors of the landmarks on phantom forehead show the proposed methodology has good ability to perform the image-to-physical registration.     

基于SIFT的遥感图像配准方法

针对多传感器遥感图像配准问题,改进了一种基于SIFT的图像自动配准方法.首先提取图像中适应尺度变化的局部不变特征点,提出了利用最近邻特征点距离与次近邻特征点距离之比的互对应约束得到初始匹配点对,然后利用RANSAC(Random Sample Concensus)算法删除误匹配特征点对.试验结果表明:该方法能够实现多传感器遥感图像和不同分辨率图像的自动配准.     

Spatial transformation and registration of brain images using elastically deformable models.

The development of algorithms for the spatial transformation and registration of tomographic brain images is a key issue in several clinical and basic science medical applications, including computer-aided neurosurgery, functional image analysis, and morphometrics. This paper describes a technique for the spatial transformation of brain images, which is based on elastically deformable models. A deformable surface algorithm is used to find a parametric representation of the outer cortical surface and then to define a map between corresponding cortical regions in two brain images. Based on the resulting map, a three-dimensional elastic warping transformation is then determined, which brings two images into register. This transformation models images as inhomogeneous elastic objects which are deformed into registration with each other by external force fields. The elastic properties of the images can vary from one region to the other, allowing more variable brain regions, such as the ventricles, to deform more freely than less variable ones. Finally, the framework of prestrained elasticity is used to model structural irregularities, and in particular the ventricular expansion occurring with aging or diseases, and the growth of tumors. Performance measurements are obtained using magnetic resonance images.     

基于边缘最优映射的红外和可见光图像自动配准算法

针对同一场景的红外和可见光图像间一致特征难以提取和匹配的难题, 提出了一种在多尺度空间中基于边缘最优映射的自动配准算法. 在由粗至细的尺度空间中, 算法分别采用仿射模型和投影模型作为参考图像和待配准图像间的空间变换模型. 在每个尺度层上, 首先基于相位一致性方法提取两幅图像的边缘结构, 并在相应的空间变换模型下将在待配准图像中提取的二值边缘映射到参考图像的边缘强度图上; 接着采用并行遗传算法寻找一组全局最优的模型参数, 使两幅图像间的结构相似度最大. 在各层的寻优结束之后, 使用Powell算法对全局寻优后的模型参数进行局部精化. 实验结果表明, 该算法能够充分利用图像间的视觉相似结构, 有效地实现红外和可见光图像的自动配准.     

基于改进平衡优化器的医学2D/3D图像快速配准算法

医学三维图像(如CT、MRI等)和二维图像(如X光)的配准技术已经被广泛应用于临床诊断和手术规划中. 医学图像配准的实质为使用优化算法寻找某种空间变换, 使两张图像在空间以及结构上对齐. 配准过程中往往由于优化算法寻优精度不高、易陷入局部极值的问题导致配准质量低. 针对此问题, 提出一种改进的平衡优化器算法(improved equilibrium optimizer based on Logistic-Tent chaos map and Levy flight, LTEO), 首先针对种群初始化容易分布不均匀, 且随机性太高的问题, 引入Logistic-Tent混沌映射对种群进行初始化, 提高种群多样性, 使它们尽可能地分布于搜索空间内; 对迭代函数进行更新, 使得优化算法更注重全局范围的搜索, 提高算法收敛速度并利于找到全局最优解; 引入Levy飞行策略对停滞粒子进行扰动, 防止算法陷入局部极值. 最后将改进的平衡优化器算法用于2D/3D医学图像配准任务, 并对配准过程中数据的频繁传输进行优化, 降低配准耗时. 通过基准函数测试和临床配准实验对算法进行验证, 改进后的平衡优化器可有效提高寻优精度和稳定性, 并提高医学图像配准的质量.     

基于移动最小二乘法的医学图像配准

提出一种基于移动最小二乘法变形模型的医学图像配准技术.首先用蛇模型的方法分割图像感兴趣区域;其次在分割后的图像上半自动地选取对应标记点;最后基于这些标记点采用移动最小二乘法的变形模型对图像进行变形,从而实现医学图像的配准.实验结果表明,该方法克服了手动选点难度大的缺点,提高了配准的精度,是一种有效的医学图像配准方法.     

自适应变异差分算法与Powell算法相结合的医学图像配准

图像配准是医学图像处理中的关键技术。文中提出一种自适应差分算法(Difference Algorithm,DE)和Powell算法相结合的多分辨率医学图像配准方法,其不仅可以克服Powell算法依赖初始点的缺点,还可以降低陷入局部极值的几率。首先,对源图像进行多分辨处理,获得包括源图像在内的三层图像;然后,在低分辨率图像上使用自适应DE算法进行全局变换参数的搜索,获得的变换参数作为Powell算法的初始点;最后,在高分辨率图像及源图像上使用Powell算法进行配准。与传统实验相比,该方法具有更高的精确度,能够有效避免局部收敛问题。     

基于ASIFT算法的低重叠度无人机影像拼接方法

在无人机平台上采用低重叠方式成像能够大大提高数据获取效率,可满足包括应急救援和航空侦察等时效性要求很高的特殊领域应用需求。然而,此类影像具有重叠度低和旋转角大的特点,利用常规正射影像镶嵌的方法进行拼接往往带来较大的拼接误差。提出了基于ASIFT算法的低重叠图像配准方法,并对序列影像做光束法平差处理,得到最优变换矩阵后,结合多分辨率样条融合算法进行全景影像输出。实验结果表明:该方法可以获取足够数量稳定的匹配点对,较好地约束了序列影像之间的几何关系,得到的拼接影像无缝清晰,适应于低重叠度无人机影像的快速拼接。     

基于图像深度信息的尺度不变特征变换算法误匹配点对剔除

特征点匹配是基于特征点的图像配准技术中的一个重要环节。针对现有基于尺度不变特征变换(SIFT）图像配准技术特征点匹配不理想,也无法较客观、快速地筛选正确匹配点对的问题,提出结合图像深度信息进行特征点误匹配筛选剔除的方法。该算法首先根据模糊聚焦线索和机器学习算法估计出待配准图像的深度信息图,再提取SIFT特征点,并在特征点匹配环节利用随机抽样一致性(RANSAC)算法迭代循环,结合深度局部连续性的原理来进一步提高匹配精度。实验结果表明,该算法具有很好的误匹配点对剔除功能。     

Layer-based video registration

Registration of a mission video sequence with a reference image without any metadata (camera location, viewing angles, and reference DEMs) is still a challenging problem. This paper presents a layer-based approach to registering a video sequence to a reference image of a 3D scene containing multiple layers. First, the robust layers from a mission video sequence are extracted and a layer mosaic is generated for each layer, where the relative transformation parameters between consecutive frames are estimated. Then, we formulate the image-registration problem as a region-partitioning problem, where the overlapping regions between two images are partitioned into supporting and nonsupporting (or outlier) regions, and the corresponding motion parameters are also determined for the supporting regions. In this approach, we first estimate a set of sparse, robust correspondences between the first frame and reference image. Starting from corresponding seed patches, the aligned areas are expanded to the complete overlapping areas for each layer using a graph-cut algorithm with level set, where the first frame is registered to the reference image. Then, using the transformation parameters estimated from the mosaic, we initially align the remaining frames in the video to the reference image. Finally, using the same partitioning framework, the registration is further refined by adjusting the aligned areas and removing outliers. Several examples are demonstrated in the experiments to show that our approach is effective and robust.Received: 16 September 2004, Accepted: 23 September 2004, Published online: 19 January 2005     

Multimodal registration of visible,SWIR and LWIR images in a distributed smart camera system

We present a multimodal registration algorithm between images in the visible, short-wave infrared and long-wave infrared spectra. The algorithm works with two reference-objective image pairs and operates in two stages: (1) A calibration phase between static frames to estimate the transformation parameters using histogram of oriented gradients and the Chi-square distance; (2) a frame-by-frame mapping with these parameters using a projective transformation and a bilinear interpolation to map the objective video stream to the coordinate system of the reference video stream. We present a distributed heterogeneous architecture that combines a programmable processor core and a custom hardware accelerator for each node. The software performs the calibration phase, whereas the hardware computes the frame-by-frame mapping. We implemented our design using a Xilinx Zynq XC7Z020 system-on-a-chip for each node. The prototype uses 2.38W of power, 25% of the logic resources and 65% of the available on-chip memory per node. Running at 100MHz, the core can register 640  ×  512-pixel frames in 4ms after initial calibration, which allows our module to operate at up to 250 frames per second.     

Robust point correspondence applied to two- and three-dimensionalimage registration

Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (correspondence by sensitivity to movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondences