Multimodal genetic algorithms-based algorithm for automatic point correspondence

In this paper, the problem of automatic determination of point correspondence between two images is formulated as a multimodal function optimization and the usefulness of genetic algorithms (GAs) as a multimodal optimizer is explored. Initially, a number of variations of GAs, capable of simultaneously discovering multiple extremes of an objective function are evaluated on a mathematical benchmark objective function with multiple unequal maxima. The variation of the GAs that performs best on the benchmark function, in terms of the number of maxima discovered, is selected for the determination of automatic point correspondence between two images. The selected variation of the GAs involves an iterative procedure for the formation of a genetic population of individuals (or chromosomes). Each individual encodes the position of a point of interest on one of the available images as well as parameters of a local transformation that generates the position of the corresponding point on the other image. The proposed algorithm aims to discover individuals that corresponds to local maxima of an objective function that measures the similarity between patches of the two images. When the GAs-based multimodal optimization algorithm terminates, pairs of corresponding points between the two images are obtained that can be used for the generation of a dense deformation field by means of the thin plate splines model.The proposed algorithm is applied to 2D medical images (dental and retinal images) under known transformations (similarity and elastic transformation) and is also assessed on medical images with unknown transformations (computer tomography transverse slices). The proposed algorithm is compared against the iterative closest point (ICP) algorithm, and a well-known non-rigid registration algorithm, based on free-form deformations (FFD) using various quantitative criteria. The obtained results indicate that in case of known similarity transformations, the proposed multimodal GAs-based algorithm and the ICP algorithm present equivalent performance, whereas the FFD algorithm is clearly outperformed. In the case of known sinousoidal deformations, the proposed multimodal GAs-based and the FFD algorithm achieve equivalent performance and clearly outperform the ICP algorithm. Finally, in the case of unknown elastic deformations, the proposed GAs-based algorithm appears to perform marginally better than the FFD algorithm, whereas it clearly outperforms the ICP algorithm.     

An invariant approach for image registration in digital subtraction angiography

In modern medicine, digital subtraction angiography is a powerful technique for the visualization of blood vessels in a sequence of X-ray images. A serious problem encountered in this technique is misregistration of images due to patient motion. The resulting artifacts which arise from the misalignment of successive images in the sequence frequently reduce the diagnostic value of the images. In this paper, a new approach to the registration of digital angiographic image sequences is proposed. It is based on local similarity detection by means of template matching according to a combined invariants-based similarity measure and on thin-plate spline image warping. This technique is fully automatic and very efficient to correct for patient motion artifacts. The proposed algorithm for this technique has been successfully applied to register several clinical data sets including coronary applications. It works perfectly well for both slow and sudden motions and is both effective and fast.     

An iterative thresholding algorithm for image segmentation

A thresholding technique is developed for segmenting digital images with bimodal reflectance distributions under nonuniform illumination. The algorithm works in a raster format, thus making it an attractive segmentation tool in situations requiring fast data throughput. The theoretical base of the algorithm is a recursive Taylor expansion of a continuously varying threshold tracking function.     

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

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

An automatic optical and SAR image registration method with iterative level set segmentation and SIFT

Although optical image registration methods have been successfully developed over the past decades, the registration of optical and synthetic aperture radar (SAR) images is still a challenging problem in remote sensing. Feature-based methods are considered to be more effective for multi-source image registration. However, almost all of these methods rely on the feature extraction algorithms. In this article, a simultaneous segmentation and feature-based registration method based on an iterative level set and scale-invariant feature transform (ILS-SIFT) is proposed. The core idea consists of three aspects: (1) an iterative procedure that combines image segmentation and matching is proposed to avoid registration failure caused by poor feature extraction; (2) a uniform level set segmentation model for optical and SAR images is presented to segment conjugate features; and (3) an improved SIFT algorithm is employed to determine whether the registration was successful. Experimental results have shown the effectiveness and universality of the proposed method.     

An automatic image registration and overlay system

In this paper we present an automatic algorithm for registering and overlaying imagery. The algorithm basically attempts to find by successive approximations the best affine transformation or second order polynomial relating to the two images. The method requires the specification of only a matching pair of control points, then new control points are found approximately by extrapolating the old affine transformation to larger areas and then using correlation to find the best match. Thus an obvious advantage of this algorithm lies in its automatic features in locating and matching more potential ground control points. This paper also discusses the effect of the distribution of control points on the affine transformation. Finally, the method is tested on Landsat data and the results are discussed.     

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     

参考轨迹更新的点到点迭代学习控制算法优化及应用

针对受非重复扰动作用的离散线性系统的输出跟踪控制问题,提出一种基于参考轨迹更新的点到点迭代学习控制算法.首先通过构建性能指标函数对控制器进行范数优化,并给出相应的收敛性条件,使得系统输出能够跟踪上更新后参考轨迹处的期望点.其次,当系统输出端受到某批次非重复扰动的影响时,进一步通过引入拉格朗日乘子算法构造多目标性能指标函数,以优化鲁棒迭代学习控制器,达到提高收敛速度和跟踪精度的目的.最后将该算法应用于电机驱动的单机械臂控制系统中,仿真结果验证了算法的合理性和有效性.     

一种新的自动图像配准技术*

提出了一种自动图像配准方法.该方法首先使用模板匹配获得图像间的粗匹配点,然后利用这些粗匹配点估计图像之间的变换参数,并通过统计这些变换参数的适用情况,选取出一组最佳的图像变换参数,从而实现了图像间的自动配准.实验验证,该方法在两幅图像间存在平移、转动且重叠区域较少时,仍能准确得匹配这两幅图像.     

一种改进的稀疏迭代最近点算法

稀疏迭代最近点算法是针对含有噪声点的点云配准提出的,但它却存在对目标点云中的离群点敏感、运行效率低等问题。针对这些问题,基于邻域信息的对应点对寻找方法提出了一种改进的稀疏迭代最近点算法。改进的稀疏迭代最近点算法首先使用改进的基于PCA的点云初始配准调整两片点云的位置,而后使用基于邻域信息的对应点对寻找方法为精配准寻找对应点对,针对对应点对,使用乘法器的交替方向法(ADMM)求得最优的变换矩阵。实验表明,对含离群点的斯坦福兔子、盆栽等点云来说,改进后的算法能够处理目标点云含有离群点的情况,并且算法的配准速度平均提高了30%。     

一种改进的医学图像配准插值算法研究

提出一种基于统计学的插值算法,依据所要进行插值点的方向性进行搜索插值,以确定该点是平滑区域还是边缘区域,根据预先设定的阈值进行插值处理.通过仿真实验,该算法很好地解决了边缘模糊和效果不佳的问题.     

An iterative closest point approach for the registration of volumetric human retina image data obtained by optical coherence tomography

Multimedia Tools and Applications - This paper introduces an improved approach for the volume data registration of human retina. Volume data registration refers to calculating out a near-optimal...     

An automatic fuzzy c-means algorithm for image segmentation

Fuzzy c-means (FCM) algorithm is one of the most popular methods for image segmentation. However, the standard FCM algorithm must be estimated by expertise users to determine the cluster number. So, we propose an automatic fuzzy clustering algorithm (AFCM) for automatically grouping the pixels of an image into different homogeneous regions when the number of clusters is not known beforehand. In order to get better segmentation quality, this paper presents an algorithm based on AFCM algorithm, called automatic modified fuzzy c-means cluster segmentation algorithm (AMFCM). AMFCM algorithm incorporates spatial information into the membership function for clustering. The spatial function is the weighted summation of the membership function in the neighborhood of each pixel under consideration. Experimental results show that AMFCM algorithm not only can spontaneously estimate the appropriate number of clusters but also can get better segmentation quality.     

基于改进特征点检测的快速图像配准算法

针对传统特征点配准算法效率过慢、对特征点存在误检的现象,提出了一种基于特征点检测的图像配准算法.对特征点检测方法进行了改进,利用像素点与周围像素点的灰度关系滤除非特征点;对剩余的点使用提出的菱形模版进行精确检测,建立了特征点集合;利用迭代最近点(ICP)算法对特征点集合进行配准.实验结果表明:改进算法在特征点检测准确性和检测时间上明显提高,并且具有良好配准效果.     

An orientation reliability matrix for the iterative closest point algorithm

This paper proposes a matrix which represents the reliability of the rotation components of the iterative closest point (ICP) algorithm in range image registration. We show that the reliability of the ICP algorithm depends on the surface normal vectors of the object.     

Single point iterative weighted fuzzy C-means clustering algorithm for remote sensing image segmentation

In this paper, a remote sensing image segmentation procedure that utilizes a single point iterative weighted fuzzy C-means clustering algorithm is proposed based upon the prior information. This method can solve the fuzzy C-means algorithm's problem that the clustering quality is greatly affected by the data distributing and the stochastic initializing the centrals of clustering. After the probability statistics of original data, the weights of data attribute are designed to adjust original samples to the uniform distribution, and added in the process of cyclic iteration, which could be suitable for the character of fuzzy C-means algorithm so as to improve the precision. Furthermore, appropriate initial clustering centers adjacent to the actual final clustering centers can be found by the proposed single point adjustment method, which could promote the convergence speed of the overall iterative process and drastically reduce the calculation time. Otherwise, the modified algorithm is updated from multidimensional data analysis to color images clustering. Moreover, with the comparison experiments of the UCI data sets, public Berkeley segmentation dataset and the actual remote sensing data, the real validity of proposed algorithm is proved.     

一种改进的航拍图像序列自动排序算法

为实现无人机航拍图像中图像序列自动排序,提出了一种基于相位相关法改进的图像序列自动排序算法。该算法利用对数极坐标的方式来表示图像间的平移、旋转、尺度缩放的关系,并利用最大相关度准则以及峰值坐标判断相邻图像的位置关系。实验结果表明,此算法能有效地解决全景图像拼接中序列图像混乱的问题,避免了人工干预,增强了算法的应用范围,具有很强的实用价值。     

改进仿射尺度不变特征变换算法的图像配准

为了更好地处理匹配效率、重复纹理匹配和仿射不变性匹配等问题,对完全仿射不变特征变换（ASIFT）算法进行两方面改进。匹配框架中特征提取的改进提高了ASIFT算法的匹配效率;利用优化随机采样算法（ORSA）结合以单应矩阵为几何线性约束模型的随机抽样一致性（RANSAC）改进匹配算法,提高了匹配精度和重复纹理结构的适应能力。实验结果表明,提出的改进算法能较好地匹配高度相似纹理,计算量小,计算速度快且精度高。     

一种新的虹膜图像配准算法*

提出了新的虹膜配准算法。该算法以虹膜外边界为基准,对虹膜图像的平移和伸缩进行校正。在较好保持虹膜纹理特征分布的前提下,快速有效地得到了虹膜的矩形展开。仿真实验证明,使用该算法预处理虹膜图像,可以获得较好的分类效果。算法为虹膜识别及相关研究提供了新思路。