基于主元分析和聚类的直线检测算法

针对现有的直线检测算法中,基于霍夫变换类算法开销大且易产生虚假结果,基于链码跟踪类方法鲁棒性和适应性较差的问题,提出一种新的直线检测算法。对边缘图像做分块链码跟踪产生链码串,然后对链码串做主元分析(PCA)构造线段,最后采用聚类方法合并线段以产生直线。实验结果表明,该算法速度较快,检测结果较理想,且对较复杂、细节丰富的图像也具有良好的检测结果。     

A novel Hough transform method for line detection by enhancing accumulator array

In this paper, an improved Hough transform (HT) method is proposed to robustly detect line segments in images with complicated backgrounds. The work focuses on detecting line segments of distinct lengths, totally independent of prior knowledge of the original image. Based on the characteristics of accumulation distribution obtained by conventional HT, a local operator is implemented to enhance the difference between the accumulation peaks caused by line segments and noise. Through analysis of the effect of the operator, a global threshold is obtained in the histogram of the enhanced accumulator to detect peaks. Experimental results are provided to demonstrate the efficiency and robustness of the proposed method.     

Detecting line segments in an image – a new implementation for Hough Transform

The conventional Hough Transform is a technique for detecting line segments in an image. The conventional Hough Transform transforms image points into lines in the parameter space. If there are collinear image points, the lines transformed from the points intersect at a point in the parameter space. Determining the intersection is generally carried out through the “voting method”, which partitions the parameter space into squared meshes. A problem with the voting method involves determining the resolution required for partitioning the parameter space. In this paper, we present a solution to this problem. We propose to transform an image point into a belt, whose width is a function of the width of a line in the image. We then determine the intersection of numerous belts to detect a line segment. An iterated algorithm based the transformation for detecting line segments is presented in this paper.     

A binary Hough transform and its efficient implementation in a systolic array architecture

This letter presents a binary Hough transform (BHT) derived from the conventional Hough transform with slope/ intercept parameterization and a systolic architecture for its efficient implementation using only adders and delay-elements.     

基于最小二乘修正的随机Hough变换直线检测

利用Hough变换进行直线检测时,由于直线在参数空间中的映射容易受到邻近目标、噪声以及本身非理想状态的干扰,算法中的投票过程较易出现无效累积,进而导致虚检、漏检及端点定位不准等问题.针对传统方法的上述缺陷,提出了一种基于 ρ-θ 域最小二乘拟合修正的随机Hough变换的直线检测方法.首先, 在随机抽样时利用像素-长度比值对抽样的有效性进行判定,剔除不在直线上的抽样点对;然后, 对邻域相关点进行 ρ-θ 域的最小二乘拟合,得到修正后的直线参数用于累加投票,投票过程中设定累加阈值,通过检测峰值点逐次检出疑似长直线;最后, 通过设定断裂阈值对每条长直线进行筛选和分段,定位出直线段的端点.仿真实验表明,所提方法在投票时有效抑制了复杂环境对局部最大值的干扰,使直线检测的准确率得到显著提升.     

Straight line extraction via multi-scale Hough transform based on pre-storage weight matrix

Considering the low efficiency and accuracy of existing straight line extraction methods from large-scale imagery, a multi-scale Hough transform (HT) method based on the pre-storage weight matrix is proposed. Improvements of the proposed HT include: using the pre-storage weight matrix to save storage space and improve the efficiency of the HT, applying a multi-scale method to enable the detection of smaller features from large-size images, using overlapping adjacent tiles to avoid the fragmented lines, optimizing the dimensions of the discrete transform domain, normalizing the accumulator to extract off-centred lines and using a dual threshold for distributed line detection. The experimental results show that the proposed algorithm is not only more efficient and robust but also can obtain richer and more accurate information about features, especially for large-size images.     

使用非均匀量化的Hough空间进行直线段检测

分析图像中最近邻直线间距离和夹角的非均匀性,得到这两个参数与线段方向和长度的相关关系,并由此提出了非均匀量化Hough空间的直线检测算法NUHT (Nonuniform Hough Transform).实验结果表明,NUHT在不降低运算效率的情况下,有2倍于标准Hough变换SHT (Standard Hough Transform)的直线段检测能力,同时误报率低于SHT的1/2.     

基于Hough变换和Fisher准则的垄线识别算法

为了提高农业机械自主作业视觉导航的精度,基于田间作物垄行的特点,首先选择作物的绿色为特征提取垄行结构;然后针对Hough变换原理提取垄线存在的问题,根据垄线点空间关系,运用Fisher准则函数进行反压缩处理,并将Fisher准则函数值作为垄线样本点疏密程度和方向势大小的度量,优化了Hough变换识别多垄线的条件,得出了多垄识别统一模型。试验结果表明,作物垄线定位的准确性、适应性均得到提高,而且能够避免较大面积杂草等影响,从而克服了传统Hough变换提取多垄线的不足,对农田机器视觉导航应用具有一定参考价值。     

结合LTS和Hough变换的直线检测算法

为提高Hough变换检测直线的精度,提出一种结合Hough变换与截断最小二乘法的直线检测算法。利用Hough变换确定图像中直线所在的大致区域,提取候选区域内的特征点集,采用截断最小二乘法拟合得到精确的直线参数。实验结果表明,该算法的检测率和检测精度较高,对Hough变换的分辨率要求较低,整体空间开销较小。     

The modified adaptive Hough transform (MAHT)

A fast and robust algorithm for extracting line segments from an image through use of the Hough Transform is presented. The framework for our algorithm comes from the work of Illingworth and Kittler. We have extended their Adaptive Hough Transform algorithm to handle lines of arbitrary slope, multiple lines, and lines in very low signal to noise environments. We present our Modified Adaptive Hough Transform along with experimental results obtained with data from a tactile sensor.     

The adaptive hough transform

We introduce the Adaptive Hough Transform, AHT, as an efficient way of implementing the Hough Transform, HT, method for the detection of 2-D shapes. The AHT uses a small accumulator array and the idea of a flexible iterative "coarse to fine" accumulation and search strategy to identify significant peaks in the Hough parameter spaces. The method is substantially superior to the standard HT implementation in both storage and computational requirements. In this correspondence we illustrate the ideas of the AHT by tackling the problem of identifying linear and circular segments in images by searching for clusters of evidence in 2-D parameter spaces. We show that the method is robust to the addition of extraneous noise and can be used to analyze complex images containing more than one shape.     

Real-time precise detection of regular grids and matrix codes

The traditional approach in detecting sets of concurrent and/or parallel lines is to first detect lines in the image and then find such groups of them which meet the concurrence condition. The Hough Transform can be used for detecting the lines and variants of HT such as the Cascaded Hough Transform can be used to detect the vanishing points. However, these approaches disregard much of the information actually accumulated to the Hough space. This article proposes using the Hough space as a 2D signal instead of just detecting the local maxima and processing them. On the example of QRcode detection, it is shown that this approach is computationally cheap, robust, and accurate. The proposed algorithm can be used for efficient and accurate detection and localization of matrix codes (QRcode, Aztec, DataMatrix, etc.) and chessboard-like calibration patterns.     

A neural implementation of the Hough transform and the advantages of explaining away

The Hough transform (HT) is widely used for feature extraction and object detection. However, during the HT individual image elements vote for many possible parameter values. This results in a dense accumulator array and problems identifying the parameter values that correspond to image features. This article proposes a new method for implementing the voting process in the HT. This method employs a competitive neural network algorithm to perform a form of probabilistic inference known as “explaining away”. This results in a sparse accumulator array in which the parameter values of image features can be more accurately identified. The proposed method is initially demonstrated using the simple, prototypical, task of straight line detection in synthetic images. In this task it is shown to more accurately identify straight lines, and the parameter of those lines, compared to the standard Hough voting process. The proposed method is further assessed using a version of the implicit shape model (ISM) algorithm applied to car detection in natural images. In this application it is shown to more accurately identify cars, compared to using the standard Hough voting process in the same algorithm, and compared to the original ISM algorithm.     

Matching 3-D line segments with applications to multiple-objectmotion estimation

A two-stage algorithm for matching line segments using three-dimensional data is presented. In the first stage, a tree-search based on the orientation of the line segments is applied to establish potential matches. the sign ambiguity of line segments is fixed by a simple congruency constraint. In the second stage, a Hough clustering technique based on the position of line segments is applied to verify potential matches. Any paired line segments of a match that cannot be brought to overlap by the translation determined by the clustering are removed from the match. Unlike previous methods, this algorithm combats noise more effectively, and ensures the global consistency of a match. While the original motivation for the algorithm is multiple-object motion estimation from stereo image sequences, the algorithm can also be applied to other domains, such as object recognition and object model construction from multiple views     

Image Based NC Programming of Plane Contour Machining

Simplified Hough Transform (HT) and Adaptive Including Box (AIB) approach are proposed. The size of AIB is controlled according to the precision requirement of machining. The image data of part contour is turned into a set of line segments and then NC program for machining the contour is generated .     

Fast line segment grouping method for finding globally more favorable line segments

In this paper, we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantages over a Hough transform based approach in practical situations. However, since the process of the conventional line segment grouping approach is purely local, it does not provide a mechanism for finding more favorable line segments from a global point of view. Our method overcomes the local nature of the conventional line segment grouping approach, while retaining most of its advantages, by incorporating the useful concept of the Hough transform based approach into the line segment grouping approach. Our method is fast and allows elementary line segments to be shared simultaneously by several line segments, and the degree of sharing is determined by a user-specified threshold. We performed a series of tests to compare the performance of our method with that of six other methods. Throughout the tests our method ranked in the top two of the tested methods both in detection rate and computation time.     

局部PCA参数约束的Hough多椭圆分层检测算法

针对随机Hough变换(RHT)在复杂图像中检测圆及椭圆时随机采样所造成的大量无效采样、无效累积以及运算时间长等问题,提出基于局部PCA感兴趣参数约束Hough多椭圆分层检测思路。首先利用边缘检测算子获得边缘信息并去除边缘交叉点,在边缘图像中标记并提取出满足一定长度的连续曲线段;其次利用线段PCA方向分析确定是否属于有效曲线段;然后,对所有感兴趣曲线段按照标记顺序依次利用椭圆拟合办法初步得到感兴趣椭圆粗略参数,根据拟合结果进而模糊约束Hough变换参数搜索范围,得到精确椭圆参数;最后利用检测结果更新图像空间,删除已经检测到的椭圆,依次进行,直到所有椭圆检测完毕。实验结果表明,该算法在计算、存储消耗上均大大减少。     

A computationally efficient technique for real-time detection of particular-slope edges

Identification of oblique lines of a particular slope is needed for various applications such as motion tracking for smart cameras. Wavelets and gradient-based techniques, such as Sobel and Canny, do not classify edges based on their slopes. The Hough transform (HT) does classify edges based on their slopes but with high computational complexity, even using its most improved versions. This paper presents a computationally efficient technique for detecting edges of a particular slope. The angle of the required edges is converted into pixel increments over rows and columns. Using these two simple parameters, parallel, oblique lines of a particular slope are formed. A first-order, orthonormal Haar low-pass filter (LPF) is used over the formed lines to filter out undesired edges. The hardware architecture of the proposed technique is fully described, including processing time, based on the number of clock cycles, and fixed-point implementation. A line-based memory mechanism was used to minimize the memory requirements to two simple registers. To demonstrate the computational advantage of the proposed technique, it is compared to the Sobel, Canny and HT detectors.     

A Real-Time Image Segmentation on a Massively Parallel Architecture

The method described in this paper enables the two end points of a straight line to be obtained by a Modified Double Hough Transform (MDHT). It consists respectively of line detection, followed by segment extraction. The significance of this work is that the hardware implementation is based on the Content Addressable Memory (CAM) concept. Hence, during the first HT, voting is achieved for the every scan line of image, not every edge pixel. Therefore, all the steps which form the first HT: voting, thresholding and local maximum are achieved in a low constant time. The two end points of the line are extracted through the second HT. Here, a local neighbor parallel search is also achieved at the end of each scan line of the image not at every edge pixel. Therefore, the execution time is low since the neighboring range does not exceed a few lines. Experimental results are given to show the accuracy of our approach for use in high performance pattern recognition systems.     

基于多直线特征的电子图象稳定算法

提出了一种基于多直线特征的全局运动估计算法，同时也介绍了它在电子图象稳定（EIS）系统中的应用，首先，用全局运动估计技术来估计摄像机的运动，即通过小波变换法提取图象中的边缘，并利用Hough变换法提取图象中的直线段特征，然后按照直线段的特征参数和位置选择原则选择具有分布特性的多个直线段，并通过对应的直线段特征比较计算局部运动参数和全局运动参数；最后根据全局运动估计结果，利用滤波法进行抖动判别和补偿，实现对图象序列的稳定处理，实验结果表明，多直线特征可以准确且稳定地估计摄像机的运动参数，通过滤波法可以消除视频序列的抖动。