Hough transform for feature detection in panoramic images

Omni-directional sensors are useful in obtaining a 360° field-of-view. With a radially symmetric mirror and conventional lens system this can be achieved with a single camera. There are several proposed profiles for the mirror, but most violate the single viewpoint (SVP) criteria necessary to allow functional equivalence to the standard perspective projection, posing challenges that have not yet been addressed in the literature. Such a imaging system with a non-SVP optical system do not benefit from the affine quality of straight line features being represented as collinear points in the image plane. To utilize these non-SVP mirrors, a new method to recognize such features is required. This work describes an approach to detecting features in panoramic non-SVP images using a modified Hough transform. A mathematical model for this feature extraction process is given. Experimental results are presented to validate this model and show robust performance in identifying line features with only estimated calibration.     

用两步Hough变换检测圆

Hough变换在图像处理中占有重要地位,是一种检测曲线的有效方法。但使用传统的Hough变换来检测圆,具有存储空间大计算时间长的缺点。为此提出了采用两步Hough变换的圆检测方法,利用圆的斜率特性,降低了Hough参数空间的维度,提高了运算效率,并推广到椭圆的检测之中。     

基于Hough变换的圆检测方法

总结了圆检测的几种常用方法,如经典HT、随机HT和广义HT.结合几种方法的优缺点,提出了一种基于经典HT的改进Hough变换圆检测方法.该方法先对图像进行预处理,如灰度化、去噪滤波、边缘检测以及运用数学形态学等,然后进行Hough变换.其主要思想是用多维数组来代替经典的循环过程.把Hough变换应用到织物防水性能自动测试的真实图像中,通过对经典Hough变换与改进后的Hough变换的比较,可以看出检测速度有所提高,检测精度也达到了令人满意的程度.     

基于Hough变换的植物叶脉检测新方法

针对植物叶脉的特点,提出了利用灰度拉伸、Hough变换与边缘生长、图像腐蚀与膨胀进行植物叶脉检测的新方法。在该方法中,Hough变换检测植物叶脉图像的同时也较好的消除了图像噪声,该方法应用到植物叶脉检测中效果较好。     

基于Hough变换的煤岩界面识别方案

根据煤层与岩石层分界明显且呈线状的煤岩图像特征,提出一种基于Hough变换的煤岩界面识别方案。首先对煤岩图像进行去噪与增强预处理,然后去除煤与岩石边缘的孤立点与虚假边缘,最后采用Hough变换识别煤岩分界线。实验结果表明,该方案能够较快、较准确地检测出煤岩分界线。     

Computing the Hough transform on a pyramid architecture

An algorithm to implement the Hough transform for the detection of a straight line on a pyramidal architecture is presented. The algorithm consists of two phases. The first phase, called block-projection, takes constant time. The second phase, called block-combination, is repeated logn times and takes a total ofO(n ^1/2) time for the detection of all straight lines having a given slope on an n×n image; if there arep different slopes to be detected, then the total time becomesO(pn ^1/2).     

基于HPF和Hough变换的人眼精确定位

眼睛定位是人脸识别的非常重要的一个环节,常采用基于Hough变换的方法,但这种方法计算量大、运算速度慢,对存储空间需求大。提出一种人眼快速定位的新方法。首先用混合投影法检测到眼睛瞳孔的大致位置,再利用基于圆的Hough变换快速定位出人眼,实验证明此方法大大提高了人眼定位的效率。     

一种基于Hough变换求解无人机滚转角的方法

提出了一种在无人机进场着陆段中根据机器视觉所得的数字图像获取无人机滚转角的方法。首先对摄像机所获得图像进行一系列预处理(中值滤波、边缘检测等),然后利用Hough变换获取图像中的直线,并根据其他的约束条件从这些直线中获得地平线,最后通过最小二乘法获得无人机滚转角。     

On improving the accuracy of the Hough transform

The subject of this paper is very high precision parameter estimation using the Hough transform. We identify various problems that adversely affect the accuracy of the Hough transform and propose a new, high accuracy method that consists of smoothing the Hough arrayH(, ) prior to finding its peak location and interpolating about this peak to find a final sub-bucket peak. We also investigate the effect of the quantizations and ofH(, ) on the final accuracy. We consider in detail the case of finding the parameters of a straight line. Using extensive simulation and a number of experiments on calibrated targets, we compare the accuracy of the method with results from the standard Hough transform method of taking the quantized peak coordinates, with results from taking the centroid about the peak, and with results from least squares fitting. The largest set of simulations cover a range of line lengths and Gaussian zero-mean noise distributions. This noise model is ideally suited to the least squares method, and yet the results from the method compare favorably. Compared to the centroid or to standard Hough estimates, the results are significantly better—for the standard Hough estimates by a factor of 3 to 10. In addition, the simulations show that as and are increased (i.e., made coarser), the sub-bucket interpolation maintains a high level of accuracy. Experiments using real images are also described, and in these the new method has errors smaller by a factor of 3 or more compared to the standard Hough estimates.     

检测井壁图像上平面地质特征的改进霍夫变换

为实现井壁图像上平面地质特征的自动提取,研究了图像中单周期正弦曲线的检测方法。提出一种改进的霍夫变换,该方法基于正弦曲线上的三个相关联点在二维累加器中进行投票,从而确定相位与基线深度;然后在一维累加器中投票,确定振幅。对模拟图像及井壁图像进行了处理,并与传统霍夫变换、快速霍夫变换进行了对比。结果表明,该方法不仅提高了检测速度,而且具有较高的准确率。     

一种用Hough变换检测圆的快速算法

为了克服传统Hough变换检测圆时耗时巨大的缺陷,给出了一种新的基于Hough变换检测圆的快速算法.新算法与传统的方法相比具有以下特点:计算量少,提高了检测的速度;保留了传统Hough变换识别率高、抗噪性强、对不完整边缘具有鲁棒性等所有优点;不需要任何特殊的限定条件.实验表明,新的快速算法可以快速进行目标识别,在实时目标识别系统中具有良好的表现.     

A formal definition of the Hough transform: Properties and relationships

Shape, in both 2D and 3D, provides a primary cue for object recognition and the Hough transform (P.V.C. Hough, U.S. Patent 3,069,654, 1962) is a heuristic procedure that has received considerable attention as a shape-analysis technique. The literature that covers application of the Hough transform is vast; however, there have been few analyses of its behavior. We believe that one of the reasons for this is the lack of a formal mathematical definition. This paper presents a formal definition of the Hough transform that encompasses a wide variety of algorithms that have been suggested in the literature. It is shown that the Hough transform can be represented as the integral of a function that represents the data points with respect to a kernel function that is definedimplicitly through the selection of a shape parameterization and a parameter-space quantization. The kernel function has dual interpretations as a template in the feature space and as a point-spread function in the parameter space. A novel and powerful result that defines the relationship between parameterspace quantization and template shapes is provided. A number of interesting implications of the formal definition are discussed. It is shown that the Radon transform is an incomplete formalism for the Hough transform. We also illustrate that the Hough transform has the general form of a generalized maximum-likelihood estimator, although the kernel functions used in estimators tend to be smoother. These observations suggest novel ways of implementing Hough-like algorithms, and the formal definition forms the basis of work for optimizing aspects of Hough transform performance (see J. Princen et. al.,Proc. IEEE 3rd Internat. Conf. Comput. Vis., 1990, pp. 427–435).This work was supported by the Ministry of Defence, Royal Aerospace Establishment, U.K.     

Fuzzy cell Hough transform for curve detection

In this paper a new variation of Hough Transform is proposed. It can be used to detect shapes or contours in an image, with better accuracy, especially in noisy images. The parameter space of Hough Transform is split into fuzzy cells which are defined as fuzzy numbers. This fuzzy split provides the advantage to use the uncertainty of the contour point location which is increased when noisy images are used. By using fuzzy cells, each contour point in the spatial domain contributes in more than one fuzzy cell in the parameter space. The array that is created after the fuzzy voting process is smoother than in the crisp case and the effect of noise is reduced. The curves can now be detected with better accuracy. The computation time that is slightly increased by this method, can be minimized in comparison with classical Hough Transform, by using recursively the fuzzy voting process in a roughly split parameter space, to create a multiresolution fuzzily split parameter space.     

基于Hough变换的金刚石颗粒测量方法研究

针对金刚石颗粒图像分析时的颗粒边缘非闭合性问题,本文提出了一种基于Hough变换的金刚石颗粒测量新方法。该方法首先对图像进行形态学去噪、平滑滤波和Canny边缘检测等预处理,得到金刚石颗粒图像的初始边缘曲线,然后采用Hough变换提取边缘曲线的直线特征,并通过极径和极角对多个直线特征进行判断和图形识别,得到确定的金刚石颗粒边缘轮廓,最后对得到的边缘轮廓进行拟合,测量出金刚石颗粒的粒径、椭圆度和圆度等参数大小。该方法在VC+ 环境下,用OpenCV编程技术对其进行了实验验证,结果表明：该方法可以准确快速地测量出金刚石颗粒特征参数,为金刚石颗粒的等级评定提供了技术支持。     

用于线段特征提取的改进Hough变换

线段是符号的一个具有旋转、平移和尺度不变的稳定性特征,正确提取符号的线段特征对于提高符号识别系统的识别率有很重要的意义。针对已有的基于Hough变换的线段提取算法的缺点,该文提出了一种用于线段特征提取的改进Hough变换算法。通过采用“多对一”映射;将Hough变换的投票过程和线段参数的检测过程融为一体;动态管理算法所需的临时存储空间等手段,使该算法具有较好的计算复杂度和空间复杂度。针对数字图像的量化特点,精心设计了用于检测在直线上点的条形区域,从而大大地降低了噪声对线段参数检测的影响,使该算法具有较好的检测性能和鲁棒性。实验表明,该文算法能正确提取出线段的端点坐标及其长度。     

Generalizing the Hough transform to detect arbitrary shapes

The Hough transform is a method for detecting curves by exploiting the duality between points on a curve and parameters of that curve. The initial work showed how to detect both analytic curves^(1,2) and non-analytic curves,⁽³⁾ but these methods were restricted to binary edge images. This work was generalized to the detection of some analytic curves in grey level images, specifically lines,⁽⁴⁾ circles⁽⁵⁾ and parabolas.⁽⁶⁾ The line detection case is the best known of these and has been ingeniously exploited in several applications.^(7,8,9)We show how the boundaries of an arbitrary non-analytic shape can be used to construct a mapping between image space and Hough transform space. Such a mapping can be exploited to detect instances of that particular shape in an image. Furthermore, variations in the shape such as rotations, scale changes or figure ground reversals correspond to straightforward transformations of this mapping. However, the most remarkable property is that such mappings can be composed to build mappings for complex shapes from the mappings of simpler component shapes. This makes the generalized Hough transform a kind of universal transform which can be used to find arbitrarily complex shapes.     

采用Hough变换的道路边界检测算法

基于计算机视觉的路况信息识别是当前智能交通领域的热点课题,对道路边界的检测能够有效去除路况图像中与路况特征无关的大面积区域,是提高路况信息获取实时性的关键技术之一,提出一种适用于一般场景中直线道路和弯曲道路的边界检测算法.该算法采用直方图均衡和Otsu二值分割增强道路边界特征,使用均值滤波降噪和二值形态学方法获取特征边界,最终利用分空间的Hough变换方法实现道路边界检测.实验结果表明,该方法能够准确地检测道路边界线并进行道路区域分割,为后续的路况分类工作提供了有效保障.     

Discretization errors in the Hough transform

Straight line-segments in a two-dimensional image can be detected with the Hough transform by searching peaks in a parameter space. The influence on the Hough transform of the quantization of the parameter space, the quantization of the image and the width of the line-segment is investigated in this paper.

The Hough transform was improved by O'Gorman and Clowes by taking into account the gradient direction. The resulting scatter of the peaks can be reduced by using a weighting function in the transform. Examples of asbestos preparations are given.     

A fast digital Radon transform—An efficient means for evaluating the Hough transform

A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N² log N additions for an N × N image. This transform can be used to evaluate the Hough transform to detect straight lines in a digital image. Whilst a parallel implementation of the Hough transform algorithm is difficult because of global memory access requirements, the fast digital Radon transform is vectorizable and therefore well suited for parallel computation. The structure of the fast algorithm is shown to be quite similar to the FFT algorithm for decimation in frequency. It is demonstrated that even for sequential computation the fast Radon transform is an attractive alternative to the classical Hough transform algorithm.     

基于数学形态学和Hough变换的车牌定位算法

针对复杂环境下的车牌定位率较低的问题,提出了一种基于数学形态学和Hough变换检测车牌区域的方法。首先,对车牌图像进行图像预处理,然后,利用数学形态学的高帽变换突出车牌字符区域,并对图像进行边缘检测和连通区域分析;最后,结合Hough变换和车牌的先验知识实现车牌的精确定位。实验结果表明,针对不同复杂背景下采集到的车辆图像,该算法具有很强的鲁棒性,准确率达97.3%,能够满足现代智能交通系统对车牌定位准确性和实时性的要求。