基于轮廓的刚体变换模型下多源图像配准算法

提出了一种刚体变换下基于轮廓的多源图像配准算法.首先提取待配准图像中的明显轮廓,然后对提取后的轮廓进行轮廓匹配.对于匹配后的开轮廓对,通过把开轮廓的两个端点用直线段连接的方法将开轮廓对转化为闭合轮廓对.最后求取闭合轮廓对中闭合轮廓的质心并作为控制点,根据控制点计算配准参数.     

基于视觉特征的多传感器图像配准

多传感器图像配准在空间图像处理中有非常重要的应用价值,但同时也面临着多源空间数据各异性困难。考虑到图像配准过程中的多分辨率视觉特征,采用基于小波的多分辨率图像分解来指导从粗到细的配准过程,利用扩展的轮廓跟踪算法提取满足视觉特征的轮廓,在轮廓链码曲率函数的基础上实现基于傅里叶变换的多分辨率形状特征匹配。与已有的基于特征的图像配准算法进行实验比较,实验结果表明该方法对于从多传感器得到的异质图像具有良好的配准效果。     

基于图像配准的零件轮廓修正方法

针对智能机床视觉系统提取待加工零件边缘轮廓时易受到背景干扰,导致其提取出的零件轮廓中包含异常区域的问题,提出一种基于图像配准的高精度零件轮廓修正方法。首先,从零件工程图与真实图像当中提取出零件模板特征点集与待匹配特征点集;其次,对仿射变换模型中的参数进行分解分析,并利用两图特征点集中的面积特征与边缘结构特征构建准则函数;然后,使用改进的遗传算法搜索两图像全局最高相似度所对应的仿射变换参数,在图像配准之后,再通过计算最优迁移后的模板轮廓点集与待匹配轮廓点集的分段Hausdorff距离来检测并替换待匹配轮廓中的异常轮廓段。实验结果表明,该方法能精确、稳定地检测出待匹配轮廓点集中的异常轮廓段,配准精度比联合特征均方和（SSJF）方法高出50%,修正后轮廓交接点处的距离不超过3像素值。     

一种综合的多分辨率医学图像配准方法

基于多分辩率的图像配准是提高配准算法效率的重要方法。论文提出一种基于多分辩率、多相似度函数以及多优化方法的图像配准框架,并提出新的具体解决方案,用于医学图像配准,并与已有的基于互信息的方法进行分析比较,实验结果显示,使用平均Hausdorff距离和互信息作为相似度度量的新方案在时间和精度的综合评价上有优势。     

基于轮廓与特征点的医学图像弹性配准方法

针对单一特征引导图像配准的准确度有限性,提出了一种同时使用轮廓与特征点的医学图像弹性配准方法。半自动的特征点提取方法既可以保证提取的精确性又能够避免繁琐的特征点对应关系建立过程。对于提取的轮廓,在保证外形的基础之上,通过轮廓直线化操作减少提取轮廓中关键点的数量,以提高计算效率。以两幅待配准图像中的特征点对间距离与轮廓对间距离累加和作为图像配准测度函数,选择ICP算法框架迭代地求解最优配准变换函数。通过与其他测度函数进行比较和真实图像实验结果对比,其结果表明,该算法由于采用轮廓与特征点同时引导图像配准,其配准效果好于单独使用特征点或者轮廓的图像配准算法。该算法既能匹配图像的整体结构信息(轮廓)又能对齐图像中感兴趣的生理解剖位置(特征点),更加准确地反映图像间差异情况,是一种快速、精确的医学图像配准方法。     

基于二维Gabor小波变换的角点匹配算法

图像配准研究的核心问题在于提高配准的速度和精度,而图像配准的结果主要取决于特征的匹配精度。为了提高特征匹配精度,本文提出了一种基于二维Gabor小波变换的角点匹配算法。该算法首先采用改进的Harris角点检测方法提取角点,得到角点位置的坐标,利用多个二维Gabor小波模板对参考图像和待配准图像进行滤波,从滤波图像中提取角点坐标处的复Gabor小波系数,并以此作为角点的特征描述,然后引入两种相似性度量因子对角点进行匹配。通过对不同图像进行大量的实验,该算法在选择合适的参数,同时采用最长公共子序列度量因子的情况下,能成功提取较多的同名点对,并且能够取得较高的匹配率。     

基于Hausdorff距离的图像配准快速算法

在图像配准过程中,传统Hausdorff距离算法的计算量较大。针对该问题,提出一种基于Hausdorff距离的图像配准快速算法。将参考图像和待配准图像进行边缘检测,在待配准图像上任意选取一个模板,通过设定一个变化的阈值对Hausdorff距离算法进行改进,以减少不必要点的计算,实现快速匹配,并根据匹配数据,对图像进行尺度变换及旋转操作,使2幅图像能在空间上配准。实验结果表明,与传统的配准算法相比,该算法的计算复杂度较低。     

一种基于结构特征边缘的多传感器图像配准方法

图像配准是多传感器图像融合等处理的前提. 本文以包含人造目标的合成孔径雷达(Synthetic aperture radar, SAR)图像和可见光图像为处理对象, 提出了一种基于结构特征边缘的多传感器图像配准方法. 该方法提取人造目标在两类图像中表现的共性特征---结构特征边缘, 并基于边缘匹配构造虚拟角点, 采用基于特征一致的粗配准方法和基于虚拟角点的精配准方法, 对待配准图像实现由粗到精的自动配准. 实验结果表明, 本文方法能够取得较高的配准精度.     

一种小目标的电视/红外图像配准方法

针对小目标成像及电视/红外图像配准的特点,首先利用传感器参数对空间分辨率进行配准,将仿射变换简化为刚体变换;再从视场配准后的电视、红外图像中提取角点作为特征点,然后运用Hausdorff距离对两特征点集进行匹配,并运用遗传算法求解变换参数,从而实现了可见光图像与红外图像的自动配准;实验证明,该算法能很好地实现小目标的配准,具有较强的实际应用价值.     

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

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

基于轮廓的图像检索

提出了一种针对多纹理图像的基于轮廓和纹理分割的检索策略.首先提取一幅图像中各个纹理基元的轮廓,计算轮廓的Fourier形状描绘子,根据形状描绘子对轮廓聚类分组.此时,原图像被分割成几组不同形状的纹理基元轮廓,采用Gabor小波变换分别提取各组纹理基元轮廓的特征,从而将原图像表示为Gabor小波特征空间中的特征点集.最后,采用对噪音不敏感的改进Hausdorff距离计算各特征点集之间的距离,便可实现多纹理图像的检索.与已有方法相比,实验结果表明,该方法具有更好的检索精度.     

结合边缘和区域的活动轮廓模型SAR图像目标轮廓提取

目的 目标轮廓表征了目标形状,可用于目标方位角估计、自动目标识别等,因此提取合成孔径雷达（SAR）图像中的目标轮廓受到了人们的广泛关注。受SAR图像乘性噪声的影响,传统的目标轮廓提取方法应用在SAR图像时失效。针对这一问题,提出一种将基于边缘的活动轮廓模型和基于区域的活动轮廓模型相结合的活动轮廓模型。方法 以真实SAR图像为基础,分析了向量场卷积（VFC）活动轮廓模型以及区域竞争（RC）活动轮廓模型各自的特点和优势,发现这两个模型存在一定的互补性,因此将这两个模型进行了结合,得到了一种新的SAR图像目标轮廓提取方法。结果 基于真实SAR图像的实验结果表明,本文方法能较好地应对SAR图像信噪比较低、目标边缘模糊等特点,能准确地获得SAR图像目标轮廓。结论 本文方法可用于执行实际的SAR图像轮廓提取任务,为后续的SAR图像自动识别和特征级图像融合等任务提供了较为优良的输入信息。     

基于图像轮廓分析的室内窗户检测

针对室内窗户检测的问题，提出一种基于图像轮廓分析的室内窗户检测方法。对预处理后的图像进行阈值分割和形态学处理；然后采用基于拓扑结构分析的边界跟踪算法，提取边界轮廓的一系列坐标点，根据窗户轮廓特点筛选出符合条件的轮廓，求各轮廓的最小外接矩形，计算两两最小外接矩形间的距离；最后利用最小生成树对各个矩形分类合并，确定窗户区域。实验结果表明，所提出的方法能有效地实现不同室内场景中窗户的检测。     

Contour matching using epipolar geometry

Matching features computed in images is an important process in multiview image analysis. When the motion between two images is large, the matching problem becomes very difficult. In this paper, we propose a contour matching algorithm based on geometric constraints. With the assumption that the contours are obtained from images taken from a moving camera with static scenes, we apply the epipolar constraint between two sets of contours and compute the corresponding points on the contours. From the initial epipolar constraints obtained from corner point matching, candidate contours are selected according to the epipolar geometry, contour end point constraints, and contour distance measures. In order to reduce the possibility of false matches, the number of match points on a contour is also used as a selection measure. The initial epipolar constraint is refined from the matched sets of contours. The algorithm can be applied to a pair or two pairs of images. All of the processes are fully automatic and successfully implemented and tested with various real images     

Coastline extraction from SAR images using spatial fuzzy clustering and the active contour method

Coastline extraction from synthetic aperture radar (SAR) data is difficult because of the presence of speckle noise and strong signal returns from the wind-roughened and wave-modulated sea surface. High resolution and weather change independent of SAR data lead to better monitoring of coastal sea. Therefore, SAR coastline extraction has taken up much interest. The active contour method is an efficient algorithm for the edge detection task; however, applying this method to high-resolution images is time-consuming. The current article presents an efficient approach to extracting coastlines from high-resolution SAR images. First, fuzzy clustering with spatial constraints is applied to the input SAR image. This clustering method is robust for noise and shows good performance with noisy images. Next, binarization is carried out using Otsu’s method on the fuzzification results. Third, morphological filters are used on the binary image to eliminate spurious segments after binarization. To extract the coastline, an active contour level set method is used on the initial contours and is applied to the input SAR image to refine the segmentation. Because the proposed approach is based on an active contour model, it does not require preprocessing for SAR speckle reduction. Another advantage of the proposed method is the ability to extract the coastline at full resolution of the input SAR image without degrading the resolution. The proposed approach does not require manual initialization for the level set method and the proposed initialization speeds up the level set evolution. Experimental results on low- and high-resolution SAR images showed good performance for coastline extraction. A criterion based on neighbourhood pixels for the coastline is proposed for the quantitative expression of the accuracy of the method.     

Automatic matching of high‐resolution SAR images

Based on high‐resolution SAR data, in this paper, a novel automatic matching model is proposed. The model, which employs a coarse to fine strategy as a whole, consists of three steps. In the first step, edge features are extracted on different levels of pyramid images and an efficient Hausdorff distance‐based method is used to yield a coarse global feature match. Due to bi‐tree searching, the bottleneck of Hausdorff distance's matching is well resolved. Secondly, SSDA (Sequence Similarity Detection Algorithm) is employed to acquire tie‐points using a cross‐searching approach which treats features extracted from master and slave images equally. Finally, local‐adaptive splitting algorithm with MMSE (Minimum Mean Square Error) is used to achieve a fine matching; local‐adaptive splitting algorithm is the essential process to achieve sub‐pixel matching accuracy, which enhances the process's flexibility and robustness.

Airborne SAR images with high resolution are provided by the Institute of Electronics, CAS and used for experiments—the results of the experiments demonstrate that the model proposed in this paper is robust, with high accuracy (up to a fraction of a pixel), and can be successfully applied to automatic matching of high‐resolution SAR images.     

Multiple Contour Finding and Perceptual Grouping using Minimal Paths

We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in the image. A new method to find complete curves from a set of contours or edge points is presented. Our approach is based on a previous work on finding contours as minimal paths between two end points using the fast marching algorithm (L. D Cohen and R. Kimmel, International Journal of Computer Vision, Vol. 24, No. 1, pp. 57–78, 1997). Given a set of key points, we find the pairs of points that have to be linked and the paths that join them. We use the saddle points of the minimal action map. The paths are obtained by backpropagation from the saddle points to both points of each pair.In a second part, we propose a scheme that does not need key points for initialization. A set of key points is automatically selected from a larger set of admissible points. At the same time, saddle points between pairs of key points are extracted. Next, paths are drawn on the image and give the minimal paths between selected pairs of points. The set of minimal paths completes the initial set of contours and allows to close them. We illustrate the capability of our approach to close contours with examples on various images of sets of edge points of shapes with missing contours.