基于Hough圆卷积变换的孔组检测

为降低孔组测量的成本,提高测量的精确度,提出一种基于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.     

A Bayesian approach to the Hough transform for line detection

This paper explains how to associate a rigorous probability value to the main straight line features extracted from a digital image. A Bayesian approach to the Hough Transform (HT) is considered. Under general conditions, it is shown that a probability measure is associated to each line extracted from the HT. The proposed method increments the HT accumulator in a probabilistic way: first calculating the uncertainty of each edge point in the image and then using a Bayesian probabilistic scheme for fusing the probability of each edge point and calculating the line feature probability.     

改进的随机Hough变换圆检测算法

针对随机Hough变换会产生大量无效累积的问题,提出了一种改进的随机Hough变换算法来检测圆,该算法利用梯度来预先判断随机采样的三个点是否在同一个圆上,从而大大减少了无效累积;另外,该算法还在圆参数的计算、阈值的确定、候选圆的确认等方面进行了改进.实验结果表明,该算法精度高,速度快,检测性能有了较大提高.     

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

随机Hough变换是检测圆的一种有效方法,但在处理复杂图像时随机采样带来的大量无效积累会导致计算量过大。提出一种快速的随机Hough变换圆检测算法,对证据积累的计算从三方面进行研究,有效地提高了计算速度,具有较好的应用价值。     

A new algorithm for ball recognition using circle Hough transform and neural classifier

A large number of methods for circle detection have been studied in the last years for several image processing applications. The context application considered in this work is the soccer game. In the sequences of soccer images it is very important to identify the ball in order to verify the goal event. This domain is a challenging one as a great number of problems have to be faced, such as occlusions, shadows, objects similar to the ball, real-time processing and so on. In this work a visual framework trying to solve the above-stated problems, mainly considering real-time computational aspects, has been developed. The ball detection algorithm has to be very simple in terms of time processing and also has to be efficient in terms of false positive rate. Our framework consists of two sequential steps for solving the ball recognition problem: the first step uses a modified version of the directional circle Hough transform to detect the region of the image that is the best candidate to contain the ball; in the second step a neural classifier is applied on the selected region to confirm if the ball has been properly detected or a false positive has been found. Some tricks like background subtraction and ball tracking have been applied in order to maintain the search of the ball only in limited areas of the image. Different light conditions have been considered as they introduce strong modifications on the appearance of the ball in the image: when the image sequences are taken with natural light, as the light source is strictly directional, the ball, due to self-shades, appears as a spherical cap; this case has been taken in account and the search of the ball has been modified in order to manage this situation. A large number of experiments have been carried out showing that the proposed method obtains a high detection score.     

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

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

A new convolution approach for the time-delay identification of systems with arbitrary entries

In this paper, an online delay identification approach of continuous-time linear systems with unstructured entries is achieved via a new algebraic technique. The arbitrary input and output trajectories are chosen with close and abundant crossing zero. Initial conditions and static disturbances are taken into account in the design of the identification approach. The proposed method is based on a distributional algebraic technique and a convolution approach. A proposed theorem is hence enounced to identify a single time-delay of such systems. The effectiveness of the proposed approach is demonstrated by an illustrative example. The obtained results show the high performances of the proposed time-delay identification approach in severe operation conditions of the considered system.     

A real-time processor for the Hough transform

The Hough transform method for recognition can cope effectively with noisy backgrounds and gaps in boundaries. However, long computation time and large memory requirements have prevented it from being used in real-time applications. An architecture devised to solve those problems, with a focus on detecting straight lines, is presented. Examples are given of the use of an experimental hardware model for automatic inspection and measurement of objects in factories and laboratories. It took less than one second from picture input to straight line parameter reproduction for these examples     

基于格局变换策略的不等圆Packing问题求解算法*

采用基于格局变换策略的算法ACP-Solver求解不等圆Packing问题。ACP-Solver由连续优化方法、格局变换算子和接收准则组成。连续优化方法可从任一初始格局收敛至对应的局部最优格局。格局变换算子将当前格局变换为新格局。接收准则决定是否接收变换所得格局。基于24个国际公开算例的计算实验表明,ACP-Solver能在可接受的计算时间内改进或持平绝大多数算例的当前最优记录。实验结果表明了ACP-Solver的高效性能。     

A modified Hough scheme for general circle location

This paper analyses how the Hough transform can be used for the simultaneous detection of circles with a variety of radii. It is found that this is possible using just one instead of a large number of planes in parameter space. A further small amount of computation is necessary to ascertain the radii of circles thus located. This result should save computation in automated inspection and other applications.     

Error propagation for the Hough transform

In this paper, a statistically efficient Hough transform (HT) technique with improved performance in accuracy and robustness is described. The proposed technique analytically computes the uncertainty of each feature point based on image noise, the procedure used for estimating edge orientation, and the specific parametric representation scheme of a line. Using the estimated uncertainty of each feature point, a Bayesian probabilistic scheme is introduced to compute the contribution of each feature point to the accumulator. A performance evaluation of our technique reveals its improved performance, especially for noisy images.     

Hough transform from the radon transform

An appropriate special case of a transform developed by J. Radon in 1917 is shown to have the major properties of the Hough transform which is useful for finding line segments in digital pictures. Such an observation may be useful in further efforts to generalize the Hough transform. Techniques for applying the Radon transform to lines and pixels are developed through examples, and the appropriate generalization to arbitrary curves is discussed.     

Antialiasing the Hough transform

The discretization of the Hough transform parameter plane is considered. It is shown that the popular accumulator method implies sampling of a nonbandlimited signal. The resultant aliasing accounts for several familiar difficulties in the algorithm. Bandlimiting the parameter plane would allow Nyquist sampling, thus aliasing could be avoided. An effectively alias-free Hough algorithm is presented and analyzed. The uncertainty principle of signal representation induces a compromise between image-space localization and parameter-space sampling density, as well as an upper bound on the performance of the algorithm. These results contribute to the development of a design methodology for hierarchical “coarse to fine” Hough algorithms.     

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.     

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     

一种面向FPGA的快速Hough变换

在FPGA上设计并实现了一种用于直线检测的快速Hough变换方法。使用分类滤波器把直线目标分成多个方向,使多个方向上的运算在空间上实现了并行处理;在每个方向上,设计实现了一种用于Hough变换的流水线处理结构;提出了一种基于直方图统计的两阶段搜索算法。大量的实验验证了提出的Hough变换实现方法的可行性,结果证明该方法占用空间少,实时性高。     

用两步Hough变换检测圆

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

A new framework for analysing the properties of the generalised Hough transform

Certain problems are identified relating to optimal use of the generalised Hough transform for object detection. A new framework is developed which permits these problems to be tackled systematically. It is found that the transform is not a simple matched filter and that it has sub-optimal signal detection capability; however, sensitivity is improved by gradient weighting of points in parameter space, when it becomes proportional to image contrast.