参数空间分解法

Ｈｏｕｇｈ变换是目前文献中应用最广泛的特征提取方法。然而,Ｈｏｕｇｈ变换空间开销大的缺陷严重地限制了它的进一步应用。空间开销大的缺陷不仅在标准Ｈｏｕｇｈ变换中存在,而且在近年来新提出的随机Ｈｏｕｇｈ变换、概率Ｈｏｕｇｈ变换以及动态Ｈｏｕｇｈ变换中同样存在。这一缺陷在３０多年来的Ｈｏｕｇｈ变换研究过程中始终没有得到很好的解决。该文提出的参数空间分解法旨在从根本上克服Ｈｏｕｇｈ变换空间开销大的缺陷。参     

Generalized Fuzzy Hough Transform for Detecting Arbitrary Shapes in a Vague and Noisy Image

A generalized Hough transform is an effective method for an arbitrary shape detection in a contour image. However, the conventional generalized Hough transform is not suitable for a noisy and blurred image. This paper describes a generalized fuzzy Hough transform which is derived by fuzzifying the vote process in the Hough transform. The present generalized fuzzy Hough transform enables a detection of an arbitrary shape in a very noisy, blurred, and even distorted image. The effectiveness of the present method has been confirmed by some preliminary experiments for artificially produced images and for actual digital images taken by an ordinary digital camera     

Image processing on the OTIS-mesh optoelectronic computer

We develop algorithms for histogramming, histogram modification, Hough transform, and image shrinking and expanding on an OTIS-mesh optoelectronic computer. Our algorithm for the Hough transform is based upon a mesh algorithm for the Hough transform which is also developed in this paper. This new mesh algorithm improves upon the previous mesh Hough transform algorithms     

宽线段Hough变换及其在箭靶识别上的应用

Hough变换是用于检测图像中直线段的有力工具。论文提出的宽线段Hough变换针对传统Hough变换进行了改进,使之适用于多条宽线段同时存在的情况,并且解决了端点提取的问题。该方法应用于箭靶识别取得了很好的效果,实验表明对比传统方法具有较大优势。     

On the inverse Hough transform

In this paper, an inverse Hough transform algorithm is proposed. This algorithm reconstructs correctly the original image, using only the data of the Hough transform space and it is applicable to any binary image. As a first application, the inverse Hough transform algorithm is used for straight-line detection and filtering. The lines are detected not just as continuous straight lines, which is the case of the standard Hough transform, but as they really appear in the original image, i.e., pixel by pixel. To avoid the quantization effects in the Hough transform space, inversion conditions are defined, which are associated only with the dimensions of the images. Experimental results indicate that the inverse Hough transform algorithm is robust and accurate     

A convolution approach to the circle Hough transform for arbitrary radius

The Hough transform is a well-established family of algorithms for locating and describing geometric figures in an image. However, the computational complexity of the algorithm used to calculate the transform is high when used to target complex objects. As a result, the use of the Hough transform to find objects more complex than lines is uncommon in real-time applications. We describe a convolution method for calculating the Hough transform for finding circles of arbitrary radius. The algorithm operates by performing a three-dimensional convolution of the input image with an appropriate Hough kernel. The use of the fast Fourier transform to calculate the convolution results in a Hough transform algorithm with reduced computational complexity and thus increased speed. Edge detection and other convolution-based image processing operations can be incorporated as part of the transform, which removes the need to perform them with a separate pre-processing or post-processing step. As the Discrete Fourier Transform implements circular convolution rather than linear convolution, consideration must be given to padding the input image before forming the Hough transform.     

Real-time detection of lines using parallel coordinates and CUDA

The Hough transform is a well-known and popular algorithm for detecting lines in raster images. The standard Hough transform is rather slow to be usable in real time, so different accelerated and approximated algorithms exist. This study proposes a modified accumulation scheme for the Hough transform, using a new parameterization of lines “PClines”. This algorithm is suitable for computer systems with a small but fast read-write memory, such as today’s graphics processors. The algorithm requires no floating-point computations or goniometric functions. This makes it suitable for special and low-power processors and special-purpose chips. The proposed algorithm is evaluated both on synthetic binary images and on complex real-world photos of high resolutions. The results show that using today’s commodity graphics chips, the Hough transform can be computed at interactive frame rates, even with a high resolution of the Hough space and with the Hough transform fully computed.     

Hough变换及其在几何特征检测中的应用

介绍Hough变换原理,分析应用Hough变换检测直线的原理,并对Hough变换进行推广,用于检测圆的圆心、半径。Hough变换在几何特征检测中有着独特的性能,它将检测目标从目标空间转换到参数空间,避免了在目标空间检测时的目标分类、目标编码等复杂运算,使得被测参数的测量变得简单易行。     

一种新的基于Hough变换的椭圆轮廓检测方法

Hough变换是一种检测曲线的有效方法,但使用传统的Hough变换来检测椭圆计算量过大。为此提出了一种新的基于Hough变换的椭圆轮廓检测方法,该方法利用椭圆中心是平面上所有点中距离椭圆轮廓上点最大距离最小的点这一几何性质,降低了Hough参数空间的维度,从而有效地降低了计算量。使用该方法可以快速地判断一个输入图形的轮廓是否为椭圆。     

用两步Hough变换检测圆

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

Hough forests for object detection, tracking, and action recognition

Abstract—The paper introduces Hough forests, which are random forests adapted to perform a generalized Hough transform in an efficient way. Compared to previous Hough-based systems such as implicit shape models, Hough forests improve the performance of the generalized Hough transform for object detection on a categorical level. At the same time, their flexibility permits extensions of the Hough transform to new domains such as object tracking and action recognition. Hough forests can be regarded as task-adapted codebooks of local appearance that allow fast supervised training and fast matching at test time. They achieve high detection accuracy since the entries of such codebooks are optimized to cast Hough votes with small variance and since their efficiency permits dense sampling of local image patches or video cuboids during detection. The efficacy of Hough forests for a set of computer vision tasks is validated through experiments on a large set of publicly available benchmark data sets and comparisons with the state-of-the-art.     

Real-time CAM-based Hough transform algorithm and its performance evaluation

Abstract. This paper proposes a highly parallel Hough transform algorithm for real-time straight-line extraction and its hardware implementation on a content-addressable memory (CAM). To achieve high-speed processing, incrementation for voting, which composes the Hough transform, and calculations for coordinate updating are carried out for the every scan line, not every edge pixel, and extracting maxima in Hough space is executed by parallel comparing. Moreover, variously weighted voting achieves more accurate line extraction in spite of the quantization error and noise in the image space. In the implementation, the CAM acts as a PE (processing-element) array that effectively performs highly parallel processing for the Hough transform and also as a memory for two-dimensional Hough space, and both voting and peak extraction are directly executed by the CAM. Evaluations of CAM hardware size, processing time and the accuracy of line extraction show that a real-time and high-resolution Hough transform for a 256256 picture can be achieved using a single CAM chip with current VLSI technology. This CAM-based Hough transform algorithm promises to be an important step towards the realization of a real-time and compact image-understanding system. Received: 15 August 1998 / Accepted: 15 March 2000     

基于弦中点Hough变换的同心圆检测方法

给出了一种基于Hough变换的同心圆检测方法,其核心思想是降低经典Hough变换圆检测中的Hough累积维数,将经典Hough变换圆检测时的三维参量统计,转变成基于弦中点的圆心和半径的参量统计。根据圆上所有点的内切圆必经过圆中心的事实,提取黑白边缘图像来建立二维数组累加器,依照像素点分布扫描边缘图像,累加器计数,计算出圆心位置,对每个圆心进行半径累积,确定同心圆半径集。与经典的Hough变换检测方法相比,该方法降低了计算复杂度。     

基于TBB的Hough变换并行检测直线

Hough变换存在着运算时间长的缺点,用了并行处理这种解决海量数据计算的有效方法来减少其运行时间。该文主要研究了：利用TBB（Threading Building Blocks）这种线程构建模块在多核机上对Hough变换中可并行的部分进行并行化;实验表明这种方法对Hough变换的并行化都有很好的加速效果。     

Extended Hough transform for linear feature detection

Improving the accuracy of line segment detection reduces the complexity of subsequent high-level processing common in cartographic feature detection. We developed a new extension to the Hough transform and reported on its application to building extraction. We expanded the Hough space by a third parameter, the horizontal or vertical coordinate of the image space, to provide incremental information as to the length of the lineal feature being sought. Using this extended HT transform allowed us to more accurately detect the true length of a line segment. In addition, we used a Bayesian probabilistic approach to process our extended Hough space that further increased the accuracy of our extended Hough transform.     

基于窗口Hough变换与阈值分割的矩形识别算法

提出一种基于窗口霍夫变换与阈值分割自动识别图像中的矩形策略： 通过图像窗口霍夫变换,提取霍夫图像的峰值（对应原始图像的线段）,当四个峰值满足某些几何条件时,则检测出矩形;对图像进行阈值分割,将分割结果与霍夫变换的矩形做拟合修正.对不同成像背景和光照环境下图像的集成测试结果表明,本策略能够很好地抑制在多种自然光照不均和拍摄角度造成的干扰.且采用了缩略图计算,降低了逐像素运算的时间复杂度,可满足实时性要求.该技术可运用在实时准确裁剪银行票据目标等各个需要快速识别矩形的工程领域.     

Demisting the Hough Transform for 3D Shape Recognition and Registration

In applying the Hough transform to the problem of 3D shape recognition and registration, we develop two new and powerful improvements to this popular inference method. The first, intrinsic Hough, solves the problem of exponential memory requirements of the standard Hough transform by exploiting the sparsity of the Hough space. The second, minimum-entropy Hough, explains away incorrect votes, substantially reducing the number of modes in the posterior distribution of class and pose, and improving precision. Our experiments demonstrate that these contributions make the Hough transform not only tractable but also highly accurate for our example application. Both contributions can be applied to other tasks that already use the standard Hough transform.     

行差列差投影变换及其在直线特征识别中的应用

本文首先介绍了行差列差投影变换及其反变换，然后与Hough变换和Radon变换作对比，分析了它们各自的优缺点，并得出了在直线特征识别中行差列差投影变换优于Hough变换和Radon变换的结论，最后给出了用行差投影变换算法识别直线特征的一般流程。     

A Fast Hough Transform for the Parametrisation of Straight Lines using Fourier Methods

The Hough transform is a useful technique in the detection of straight lines and curves in an image. Due to the mathematical similarity of the Hough transform and the forward Radon transform, the Hough transform can be computed using the Radon transform which, in turn, can be evaluated using the central slice theorem. This involves a two-dimensional Fourier transform, an x-y to r-θ mapping and a 1D Fourier transform. This can be implemented in specialized hardware to take advantage of the computational savings of the fast Fourier transform. In this paper, we outline a fast and efficient method for the computation of the Hough transform using Fourier methods. The maxima points generated in the Radon space, corresponding to the parametrisation of straight lines, can be enhanced with a post transform convolutional filter. This can be applied as a 1D filtering operation on the resampled data whilst in the Fourier space, so further speeding the computation. Additionally, any edge enhancement or smoothing operations on the input function can be combined into the filter and applied as a net filter function.     

基于Hough变换的建筑边缘特征检测的研究及其改进

Hough变换是对二值图像进行直线检测的有效方法,介绍了Hough变换直线检测对房屋边缘特征检测方法及实验结果,并根据其存在的缺点提出了检测矩形的Hough变换的改进算法.