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

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

快速随机Hough变换多圆检测算法

随机Hough变换是检测圆的一种有效方法,但在处理多圆复杂图像时随机采样带来的大量无效累积会导致计算量过大。文中提出一种基于随机Hough变换的快速多圆检测算法,除去三类噪声点,通过随机采样到的一点按照一定规则搜索另外两点来确定候选圆,用原始图像对候选圆进行证据积累以判断是否为真圆。理论分析和实验结果表明：该算法较其他算法能更快地检测出图像中的多个圆,具有较好的应用价值。     

一种随机Hough 变换检测圆的优化方法

随机Hough变换是常用的图像测圆方法,当图像数据杂乱时,随机Hough变换的结果不理想且检测实时性差.针对激光扫描检测直缝焊管焊缝噘嘴问题,提出了一种优化的随机Hough变换检测圆方法.首先计算激光扫描所得轮廓离散点的曲率值,然后采用K均值聚类法从轮廓图像中分离出圆弧数据点,最后使用随机Hough算法检测圆.实验表明,本文方法可以准确而快速地计算出焊管径向横截面二维轮廓圆的圆心和半径,可以满足工业实际应用需求.     

基于Hough变换的圆检测方法

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

基于Hough变换的汽车零件中圆形检测的改进算法

针对汽车零件中的圆检测实际需求,在分析了基本Hough变换和随机Hough变换进行圆检测的技术特征基础上,对基本Hough变换进行算法改进。采用Sobel算子提取图像边缘,利用圆参数范围已知的先验知识确定感兴趣区域和圆半径的检索范围,使得计算量大大减少,从而实现圆心坐标和半径的快速检测,满足工业生产实时性的要求。     

一种新的对随机Hough变换改进的检测圆的方法

从数字图像中检测出圆在计算机视觉中具有很重要的地位。随机Hough变换是检测圆的一种有效变换,但在处理复杂图像时,由于随机采样会引入大量的无效采样和积累。文章中提出一种在Teh-ChuanChenandKuo-LiangChung[4]的改进算法基础上,对随机Hough变换改进的检测圆的方法。     

一种基于梯度Hough变换的同心圆检测新方法

目前检测圆的方法很多,最常用的为Hough变换,另外还有一些改进的Hough变换和圆的快速检测方法,但是这些方法如果直接运用于存在同心圆的图像中,就不能检测出同心圆。目前对同心圆检测的算法较少,而且存在一定局限性,这里提出一种结合圆梯度信息和二次检测圆的新的检测同心圆的算法,改善了检测的局限性,不需要事先确定圆的一些参数仍然能准确检测同心圆,具有一定抗干扰性,且检测速度较快。本文通过实验仿真和应用实例,证明了该算法简单、准确,有效。     

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

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

随机Hough变换圆检测累计加速算法

随机Hough变换是一种检测圆的有效方法.为了进一步提升随机Hough变换圆检测算法的执行速度和抗噪声能力,提出一种基于有效继承的随机Hough变换圆检测累计加速算法.该算法在每次成功检测圆后不清空参数空间的累计值,继承了上次的有效采样,对没有通过验证的参数单元设定负累计值;通过数理统计分析,采用伯努利试验模型解释了加速原理,得出该算法可以减少总采样次数并节省清空参数空间所需时间的结论.实验结果表明,加速原理的理论分析是正确的,文中算法的加速效果是显著的,且具备更强的抗噪声能力.     

用两步Hough变换检测圆

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

一种基于随机Hough变换圆检测的改进算法

介绍了一种基于随机Hough变换(RHT)的圆检测的改进算法。该算法利用梯度方向信息来确定采样的三点是否进行累积,然后再利用确定候选圆范围的方法来缩小所要搜索的像素点的范围。此方法较好地解决了传统RHT中由于随机采样而造成的大量无效累积问题,并且改进后的算法使运行速度得到进一步的提高,检测性能也有较大的改善。该算法分别在加噪和不加噪的人工图像上做了实验,检测性能和处理速度方面都比传统的RHT有明显的改善和提高。     

Efficient sampling strategy and refinement strategy for randomized circle detection

Circle detection is fundamental in pattern recognition and computer vision. The randomized approach has received much attention for its computational benefit when compared with the Hough transform. In this paper, a multiple-evidence-based sampling strategy is proposed to speed up the randomized approach. Next, an efficient refinement strategy is proposed to improve the accuracy. Based on different kinds of ten test images, experimental results demonstrate the computation-saving and accuracy effects when plugging the proposed strategies into three existing circle detection methods.     

Automatic circle detection on digital images with an adaptive bacterial foraging algorithm

This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images without using the conventional Hough transform methods. The proposed algorithm is based on a recently developed swarm intelligence technique, known as the bacterial foraging optimization (BFO). A new objective function has been derived to measure the resemblance of a candidate circle with an actual circle on the edge map of a given image based on the difference of their center locations and radii lengths. Guided by the values of this objective function (smaller means better), a set of encoded candidate circles are evolved using the BFO algorithm so that they can fit to the actual circles on the edge map of the image. The proposed method is able to detect single or multiple circles from a digital image through one shot of optimization. Simulation results over several synthetic as well as natural images with varying range of complexity validate the efficacy of the proposed technique in terms of its final accuracy, speed, and robustness.     

随机Hough变换与Tabu搜索算法在基元提取中的比较

Ｈｏｕｇｈ变换（ＨＴ）是目前应用最广的几何基元提取方法,其基本思想在于通过证据积累来提取基元。最近不少人又提出了通过代价函数的全局优化来提取几何基元的思想。随机Ｈｏｕｇｈ变换（ＲＨＴ）和Ｔａｂｕ搜索（ＴＳ）分别是Ｈｏｕｇｈ变换和优化方法中的佼佼者。ＲＨＴ和ＴＳ分别基于不同的策略,两种方法的相互比较在许多文献中已有提及,但目前尚无较完整的理论分析和系统的比较。本文在提取单个基元所需对最小点集的采样次     

Multi-circle detection on images using artificial bee colony (ABC) optimization

Hough transform has been the most common method for circle detection, exhibiting robustness, but adversely demanding considerable computational effort and large memory requirements. Alternative approaches include heuristic methods that employ iterative optimization procedures for detecting multiple circles. Since only one circle can be marked at each optimization cycle, multiple executions ought to be enforced in order to achieve multi-detection. This paper presents an algorithm for automatic detection of multiple circular shapes that considers the overall process as a multi-modal optimization problem. The approach is based on the artificial bee colony (ABC) algorithm, a swarm optimization algorithm inspired by the intelligent foraging behavior of honeybees. Unlike the original ABC algorithm, the proposed approach presents the addition of a memory for discarded solutions. Such memory allows holding important information regarding other local optima, which might have emerged during the optimization process. The detector uses a combination of three non-collinear edge points as parameters to determine circle candidates. A matching function (nectar-amount) determines if such circle candidates (bee-food sources) are actually present in the image. Guided by the values of such matching functions, the set of encoded candidate circles are evolved through the ABC algorithm so that the best candidate (global optimum) can be fitted into an actual circle within the edge-only image. Then, an analysis of the incorporated memory is executed in order to identify potential local optima, i.e., other circles. The proposed method is able to detect single or multiple circles from a digital image through only one optimization pass. Simulation results over several synthetic and natural images, with a varying range of complexity, validate the efficiency of the proposed technique regarding its accuracy, speed, and robustness.     

Multi-circle detection on images inspired by collective animal behavior

Hough transform (HT) has been the most common method for circle detection that delivers robustness but adversely demands considerable computational efforts and large memory requirements. As an alternative to HT-based techniques, the problem of shape recognition has also been handled through optimization methods. In particular, extracting multiple circle primitives falls into the category of multi-modal optimization as each circle represents an optimum which must be detected within the feasible solution space. However, since all optimization-based circle detectors focus on finding only a single optimal solution, they need to be applied several times in order to extract all the primitives which results on time-consuming algorithms. This paper presents an algorithm for automatic detection of multiple circular shapes that considers the overall process as a multi-modal optimization problem. In the detection, the approach employs an evolutionary algorithm based on the way in which the animals behave collectively. In such an algorithm, searcher agents emulate a group of animals which interact to each other using simple biological rules. These rules are modeled as evolutionary operators. Such operators are applied to each agent considering that the complete group maintains a memory which stores the optimal solutions seen so-far by applying a competition principle. The detector uses a combination of three non-collinear edge points as parameters to determine circle candidates (possible solutions). A matching function determines if such circle candidates are actually present in the image. Guided by the values of such matching functions, the set of encoded candidate circles are evolved through the evolutionary algorithm so that the best candidate (global optimum) can be fitted into an actual circle within the edge-only image. Subsequently, an analysis of the incorporated memory is executed in order to identify potential local optima which represent other circles. Experimental results over several complex synthetic and natural images have validated the efficiency of the proposed technique regarding accuracy, speed and robustness.     

基于连通区域标记算法的圆检测算法的研究

针对传统Hough变换进行圆检测,计算量过大、检测同心圆精度不高、自动化程度低等缺点,提出一种基于连通区域标记算法的圆检测算法。该算法首先通过连通区域标记算法对图像进行处理得到一个圆,解决了传统Hough变换计算量过大的问题,再根据圆的特性确定其圆心及半径,从而避免了检测同心圆精度不高的问题。最后,分别取圆心的8邻域像素为圆心做圆,找到最优圆并将其与检测得出的圆进行比较来确定最终的圆,以达到自动化的目的。实验结果表明,提出的算法可以正确地检测出圆并具有很高的检测精度同时比Hough变换计算量小、自动化程度较高。