基于广义Hough变换的手写汉字文档关键词提取

提出了一种基于广义Hough变换的手写汉字文档关键词提取技术.对于待提取的手写文档图像,采用字符像素逐点匹配和投票的方式进行广义Hough变换,在参数空间中定位出手写关键词图像的位置.本技术对传统的广义Hough变换进行了修改,突破了形状匹配需要完整轮廓信息的局限,简化了局部特征的计算,对手写汉字文档图像中具有局部形变、部分旋转和缩放的手写关键词能够有效提取.对于提取的相同关键词建立训练集,用签名识别的方法对书写者建模,能够达到书写者身份鉴别的目的.     

基于综合特征的虹膜定位的算法

提出了利用虹膜边缘图像的几何特征以及相交弦的性质进行虹膜定位的快速算法.首先利用虹膜图像的整体灰度分布信息,利用边缘检测算子提取虹膜的内边缘图像,然后利用圆的相交弦性质以及投票策略提取虹膜中心,最后利用Hough变换的半径直方图投票提取虹膜内外径.实验结果证明其算法提高了虹膜定位的速度并具有较强的抗干扰能力.     

U弦长曲率:一种离散曲率计算方法

数字曲线的离散曲率计算在图像分析和计算机视觉的各个领域都有广泛应用.文中提出一种离散曲率计算方法——U弦长曲率.数字曲线上的每个点,它的支持领域由距离该点为给定弦长的两点确定,再在这个支持领域内估算当前点的U弦长曲率,理论分析论证U弦长曲率与曲线的真实曲率之间存在一种明确联系.与现有的离散曲率计算方法相比,U弦长曲率具有更强的抗旋转性和抗噪性,适用于完成曲线匹配等对曲率计算稳定性要求高的一类任务.仿真实验结果验证文中方法的有效性.     

基于改进Hough森林的对象检测方法

基于Hough森林的对象检测是隐式形状模型（ISM）的改进,它借助随机森林完成广义Hough变换。为了进一步提高其检测效果,充分利用训练图像中对象位置是已知的知识,改进了经典的偏移量不确定性度量方法,并优化随机森林的投票,使在Hough空间中真正对象的位置获得更多投票和更高的投票值。实验验证了该方法相比于经典的方法,具有更准确的对象检测效果。     

基于综合特征的虹膜定位的算法

提出了利用虹膜边缘图像的几何特征以及相交弦的性质进行虹膜定位的快速算法，首先利用虹膜图像的整体灰度分布信息，利用边缘检测算子提取虹膜的内边缘图像，然后利用圆的相交弦性质以及投票策略提取虹膜中心，最后利用Hough交换的半径直方图投票提取虹膜内外径，实验结果证明了算法提高了虹膜定位的速度并具有较强的抗干扰能力。     

基于模糊随机广义霍夫变换的目标匹配

为了提高工业检测中图像匹配精度和速度,提出了一种用于二维目标匹配的新算法--模糊随机广义霍夫变换(FRGHT)。此算法结合了模糊推理系统(FIS)和随机广义霍夫变换(RGHT)。模糊推理系统引入模糊集合概念,计算待配准图像中边缘点对配准参数的投票,从而可以抑制噪声,解决扭曲问题,提高了匹配精度;随机抽取待配准图像中边缘点进行投票,实现了多对一的映射,从而减少了内存需求,提高计算速度。实验表明,该方法计算速度快,匹配精度高,不受噪声污染、扭曲、遮挡、混乱等情况的影响。     

一种面向密封条长度检测的模板匹配优化算法

针对现有的汽车密封条长度测量设备中使用模板匹配算法检测特征点位置时,密封条自身旋转导致匹配效果差的问题,提出一种基于Hough变换的自适应模板更新算法。该算法在传统模板匹配方法的基础上,通过设定阈值对模板匹配效果进行判断;对于匹配效果不好的图像进行Hough变换,结合特征点的几何特征进行识别;通过特征点的位置与尺寸信息,将其转化为新的模板用于下一次的模板匹配,实现模板的自适应更新。试验结果表明,该算法弥补了传统模板匹配法对图像旋转异常敏感的问题,提高了识别的稳定性,同时保证了检测效率满足现场的要求。     

基于改进Hough变换的车道线检测技术

为提高车道线识别的实时性和可靠性,提出了一种基于改进Hough变换的车道线检测方法;在图像预处理时对不同光照图像进行分类处理,得到二值化图像;利用极角约束Hough变换进行车道线初始定位;根据前一帧图像信息使用基于动态ROI的Hough变换进行车道跟踪;算法加入了车道线检测失效判别模块,以提高检测的可靠性;由于该方法减少了图像空间中被投票的目标点数,缩小Hough变换的投票空间,在一定程度上提高了车道检测的实时性和稳定性;实验结果表明,在结构化道路上,对于不同的路况,算法均具有较好的实时性和鲁棒性。     

基于几何特征的虹膜定位算法

提出了利用虹膜边缘图象的几何特征以及圆相交弦的性质进行虹膜定位算法 .首先根据虹膜图象的整体灰度分布信息 ,利用边缘检测算子提取虹膜的内边缘图象 ,然后利用圆的相交弦性质以及投票策略提取虹膜的中心 ,最后利用 Hough变换的半径直方图投票策略提取虹膜内外径 .通过仿真实验的对比结果表明 ,该算法提高了虹膜定位的速度 ,同时对噪声具有一定的鲁棒性     

基于线特征的机场跑道定位算法

提出了一种基于线特征的机场跑道识别定位算法。首先,将方向小波变换用于目标的边缘检测,得到了定位准确、边缘连续、背景较为干净的机场边缘图;然后,利用标定了梯度方向的边缘点作为Hough变换的基本元素,将Hough变换的全局"投票"过程变为目标方向上的局部投票,并且将直线段的检测和定位过程融为一体,从而得到跑道的描述信息。实验结果验证了该算法的有效性和稳健性。     

形变冗余的改进GHT目标双层定位方法研究

经典广义Hough变换可以较好地解决非形变目标定位问题,但对于存在形变的目标定位问题存在不少困难。为解决该问题,同时考虑如何提高检测定位速度与减少存储消耗, 在粗定位与精确定位两级框架下提出基于改进GHT形变目标两层定位快速算法。粗定位过程首先利用图像的局域二进制模式的直方图特征对图像进行全局搜索,检测出目标大致范围 ;在精确定位过程中,通过建立模板图像边缘像素的R表,使待检测图像边缘像素在约束的参数范围内依据该R表进行局部搜索,并通过一个投票结果散布窗对得到的累积矩阵进行 集中化处理,达到把每一点邻域内投票结果集中在某点的目的,从而给出最后的检测结果。实验表明,本文算法能够较好的解决一定程度形变目标的定位问题,同时减少了运算时 间以及存储消耗,检测稳定性高,具有一定应用意义。     

Wrong Matching Points Elimination after Scale Invariant Feature Transform and Its Application to Image Matching

When images are rotated and the scale varies or there are similar objects in the images, wrong matching points appear easily in the scale invariant feature transform (SIFT). To address the problem, this paper proposes a SIFT wrong matching points elimination algorithm. The voting mechanism of Generalized Hough Transform (GHT) is introduced to find the rotation and scaling of the image and locate where the template image appears in the scene in order to completely reject unmatched points. Through a discovery that the neighborhood diameter ratio and direction angle difference of correct matching pairs have a quantitative relationship with the image’s rotation and scaling information, we further remove the mismatching points accurately. In order to improve image matching efficiency, a method for finding the optimal scaling level is proposed. A scaling multiple is obtained through training of sample images and applied to all images to be matched. The experimental results demonstrate that the proposed algorithm can eliminate wrong matching points more effectively than the other three commonly used methods. The image matching tests have been conducted on images from the Inria BelgaLogos database. Performance evaluation results show that the proposed method has a higher correct matching rate and higher matching efficiency.     

Detection of arbitrary planar shapes with 3D pose

In this work, two new methods to detect objects under perspective and scaled orthographic projection are shown. They also calculate the parameters of the transformations the object has undergone. The methods are based on the use of the Generalized Hough Transform (GHT) that compares a template with a projected image. The computational requirements of the algorithms are reduced by restricting the transformation to the image edge points and using invariant information during the comparison process. Moreover, a multipass design of the algorithms speeds-up the parameter calculations.     

An efficient 2D deformable objects detection and location algorithm

This paper presents a complete method for the automatic detection and location of two-dimensional objects even in the presence of noise, occlusion, cluttering and/or deformations. This method is based on shape information extracted from the edges gradient and only needs a template of the object to be located. A new Generalized Hough Transform is proposed to automatically locate rigid objects in the presence of noise, occlusion and/or cluttering. A Bayesian scheme uses this rigid objects location algorithm to obtain the deformation of the object. The whole method is invariant to rotation, scale, displacement and minor deformations. Several examples with real images are presented to show the validity of the method.     

Edge connection based Canny edge detection algorithm

Double threshold method of traditional Canny operator detects the edge rely on the information of gradient magnitude, which has a lower edge connectivity and incomplete image information. Aiming at this problem, we proposed an edge detection algorithm based edge connection—the Hough Transform based Canny (HT-Canny) edge detection algorithm. HT-Canny algorithm guided by high threshold image, which obtains edge direction through calculating edge endpoint gradient and connects the edge by using the Hough Transform instead of traditional double threshold method. It avoids the limitation of traditional Canny algorithm, which must set the double threshold manually and protect the low intensity edge especially. The experimental results show that HT-Canny algorithm has stronger edge connectivity and can distinguish edge points and non-edge points effectively, which not only retain the advantages of the traditional Canny algorithm but also make the detection result more complete and comprehensive.     

基于机器视觉的公差检测系统算法研究与应用——自适应边缘检测与修正Hough变换

介绍了基于机器视觉的几何量和位置公差检测中常见的计算模型、图像处理和直线拟合一般算法，进一步介绍了一种自适应的边缘检测方法。着重分析了传统的Hough变换的优势和缺点，在此基础上提出了适应形位公差检测特点的修正Hough变换算法。自适应边缘检测方法被应用于检测实际工程的图像边缘，检测到的边缘区域在亚像素之内；修正的Hough变换算法也被运用于相应工程的直线拟合，与传统的Hough算法相比，结果表明其速度更快、精度更高，抗干扰能力更强，其拟合直线的极径精度可达到0．1个像素，极角精度可达0．01°。     

图像中网格直线的检测方法的研究

首先分析了图像边缘特性以及Laplacian算子检测图像边缘的基本原理,提出了一种新的边缘检测算法,能准确地检测出图像中的目标边缘;在确定直线参数时,先使用Hough变换检测第一条最为明显的直线,然后去掉该直线以及附近的点,然后再次对图像进行Hough变换,并重复此过程,直到找到所有的直线;使用此改进后的Hough变化能够准确地检测到图像中构成网格的直线的参数.     

An extension to the randomized hough transform exploiting connectivity

Finding global curve segments in an image is an important task. For such a task, a new branch of Hough Transform algorithms, called probabilistic Hough Transforms, has been actively developed in recent years. One of the first was a new and efficient probabilistic version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT). In this paper, a novel extension of the RHT, called the Connective Randomized Hough Transform (CRHT), is suggested to improve the RHT for line detection in complex and noisy pictures. The CRHT method combines the ability of the Hough Transform for global feature extraction with curve fitting techniques by exploiting the connectivity of local edge image points. Tests demonstrate the high speed and low memory usage of the CRHT, as compared both to the Standard Hough Transform and the basic RHT.