利用Hough变换的匹配对提纯

目的 针对传统的匹配对提纯算法存在容错性差、效率低等问题,提出了一种利用Hough变换的匹配对提纯算法。方法 假设正确的匹配对一致性地服从一个变换模型。首先,为两幅图像的变换关系选择一个合适的数学模型,利用Hough变换确定模型方程参数的解。然后检验原始匹配对,保留符合模型方程的匹配对,从而达到提纯的目的。结果 与传统的RANSAC(random sample consensus)等算法相比,本文算法具有更高的容错率、召回率与更优的运行效率,且是稳定的。实验结果表明,在误配率低于85%时算法能完全剔除误匹配,且误配率高达95%时依然有50%的可能性成功剔除误匹配。结论 把Hough变换引入到匹配对提纯的应用中,该算法在所选模型准确或近似准确的情况下能鲁棒地提纯匹配对。由于模型方程参数个数决定参数空间维数,维数高导致投票及搜索最大值点的时间、空间复杂度大,因此该算法适用于模型参数较少(不大于4)的情况。     

基于Hough变换的圆检测方法

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

随机Hough变换实现角点检测

为实现角点的有效检测,提高检测速度,提出一种基于随机 Hough变换的角点检测方法。利用随机 Hough变换求取出直线参数;根据角点在 Hough空间中的特征,利用反 Hough变换的反演原理对参数空间中的峰值进行反变换,定位图像空间中的直线交点;为避免虚假角点,将那些附近不包含任何边缘的交点删除,得到正确的角点。实验结果表明,该方法相对于 Harris算法和SUSAN具有更好的准确性、鲁棒性和稳定性,实时性也有一定提高。     

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.     

Randomized or probabilistic Hough transform: unified performance evaluation

Rapid computation of the Hough transform is necessary in very many computer vision applications. One of the major approaches for fast Hough transform computation is based on the use of a small random sample of the data set rather than the full set. Two different algorithms within this family are the randomized Hough transform (RHT) and the probabilistic Hough transform (PHT). There have been contradictory views on the relative merits and drawbacks of the RHT and the PHT. In this paper, a unified theoretical framework for analyzing the RHT and the PHT is established. The performance of the two algorithms is characterized both theoretically and experimentally. Clear guidelines for selecting the algorithm that is most suitable for a given application are provided. We show that, when considering the basic algorithms, the RHT is better suited for the analysis of high quality low noise edge images, while for the analysis of noisy low quality images the PHT should be selected.     

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.     

The 3-D Hough shape transform

The 3-D Hough shape transform is described which is used for the localization in space of 3-D objects defined in terms of the spatial organization of their features.     

Accurate and efficient curve detection in images: the importance sampling Hough transform

The Hough transform is a well known technique for detecting parametric curves in images. We place a particular group of Hough transforms, the probabilistic Hough transforms, in the framework of importance sampling. This framework suggests a way in which probabilistic Hough transforms can be improved: by specifying a target distribution and weighting the sampled parameters accordingly to make identification of curves easier. We investigate the use of clustering techniques to simultaneously identify multiple curves in the image. We also use probabilistic arguments to develop stopping conditions for the algorithm. Results from applying our method and two popular versions of the Hough transform to both simulated and real data are shown.     

An unsupervised generalized Hough transform for natural shapes

The Hough transform was originally designed to recognize artifical objects in images. A Hough transform for natural shapes (HTNS) was subsequently proposed, but necessitates the supervised learning of the class of shapes. Here, we extend HTNS to unsupervised pattern recognition, the variability of the object class being coded with tools originating from mathematical morphology (erosion, dilation and distance functions).     

用两步Hough变换检测圆

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

Analysis of textual images using the Hough transform

The analysis of images of printed pages of text is considered. Since printed text can be viewed as textured line, the use of the Hough transform for detecting straight lines is proposed as an analysis tool. Methods for handling several discretization problems that arise in mapping the rectangular image space to the (, ) accumulator array are described. Several applications of analyzing the accumulator array are proposed. They include detecting the text skew angle, determining the signature of a text line so as to accept or reject a block as containing only text, using profile analysis to segment text into lines, and determining whether a textual block is rightside-up or otherwise.     

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

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

A New Definition of the Hough Transform

This paper‘s main contributions are three-fold.Firstly,it is shown that the two existing template matching-like definitions of the Hough transform in the literature are inadequate.Secondly,an inherent probabilistic aspect of the Hough transform embedded in the transformation process from image space to parameter space is clarified.Thirdly,a new definition of the Hough transform is proposed which takes into account both the intersection scheme between the mapping curve(or mapping surface) and accumulator cells and the inherent probabilistic characteristics.     

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).     

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 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.     

A method for detection of circular arcs based on the Hough transform

The circular arc is a very useful feature for object detection and recognition in industrial environments. In this paper, a method for detection of circular arcs is described that is based on the Hough transform. The method estimates all five arc parameters and is robust in the presence of a moderate amount of noise. It has a computational and memory complexity ofO(n·m·R) andO(n·m) respectively, wheren andm are the sizes in thex andy directions andR is the maximum expected arc radius in pixels. Arcs as small as 45 degrees and radii down to 4 pixels can be detected. The computing time is almost independent of the number of circular arcs in the image.This work was supported by the Swedish Board for Technical Development, Grant No. 87-01954P.     

An improved generalized Hough transform for the recognition of overlapping objects

The generalized Hough transform (GHT) is a powerful method for recognizing arbitrary shapes as long as the correct match accounts for both much of the model and much of the sensory object. For moderate levels of occlusion, however, the GHT can hypothesize many false solutions. In this paper, we present an improved two-stage GHT procedure for the recognition of overlapping objects. Each boundary point in the image is described by three features including the concavity, radius and normal direction of the curve segment in the neighborhood of the point. The first stage of the voting process determines the rotational angle of the sensory object with respect to the model by matching those points that have the same concavity and radii. The second stage then determines the centroid of the sensory object by matching those points that have the same concavity, radii and rotational angles. The three point features remove the false contribution of votes in the vote generation phase. Experimental results have shown that the proposed algorithm works well for complex objects under severely overlapping conditions.     

A Hough transform based line recognition method utilizing both parameter space and image space

Hough Transform (HT) is recognized as a powerful tool for graphic element extraction from images due to its global vision and robustness in noisy or degraded environment. However, the application of HT has been limited to small-size images for a long time. Besides the well-known heavy computation in the accumulation, the peak detection and the line verification become much more time-consuming for large-size images. Another limitation is that most existing HT-based line recognition methods are not able to detect line thickness, which is essential to large-size images, usually engineering drawings. We believe these limitations arise from that these methods only work on the HT parameter space. This paper therefore proposes a new HT-based line recognition method, which utilizes both the HT parameter space and the image space. The proposed method devises an image-based gradient prediction to accelerate the accumulation, introduces a boundary recorder to eliminate redundant analyses in the line verification, and develops an image-based line verification algorithm to detect line thickness and reduce false detections as well. It also proposes to use pixel removal to avoid overlapping lines instead of rigidly suppressing the N×N neighborhood. We perform experiments on real images with different sizes in terms of speed and detection accuracy. The experimental results demonstrate the significant performance improvement, especially for large-size images.     

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

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