New parallel Hough transform for circles
New parallel Hough transform for circles
复制标题
圆的新并行霍夫变换
DOI：
10.1049/ip-e.1991.0046
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
R. T. Chan
中科院分区：
文献类型：
--
作者：
R. T. Chan
霍夫变换是一种用于检测曲线的众所周知的中级图像识别技术。传统的Hough技术(I，21)需要三维累加器阵列(AA)来检测圆。由于累加器阵列的形状参数和数据结构对任何硬件或软件实现的存储空间和计算负载要求有很大影响，所以对于任何快速有效的算法，都应该仔细选择它们。提出了一种只使用一对二维累加器阵列就可将存储和计算时间减少一个数量级或更多的新方案。该方法能够在复杂的真实图像中描述多个(包括同心)圆，识别率为95%-100%。讨论了在通用的MIMD(可重构的Transputer网络)机器上圆的Hough格式的各种并行实现，并在执行时间和识别率的基础上比较了它们与传统方法的性能。
The Hough transform is a well known medium-level image recognition technique for the detection of curves. The conventional Hough tech- nique (I, 21 requires a three-dimensional accumu- lator array (AA) for the detection of circles. Because shape parameterisation and data struc- ture of the accumulator array significantly affect the memory space and computation loading requirements of any hardware or software realisa- tion, they should be carefully selected for any fast and efficient algorithm. A new scheme which uses only a pair of two-dimensional accumulator arrays to reduce the storage and computation time by an order of magnitude or more is pro- posed. This new scheme is capable of discrimin- ating multiple (including concentric) circles in a complex real life image with a recognition rate of 95-100%. Various parallel realisations of this Hough scheme for circles on a general purpose MIMD (a reconfigurable transputer network) machine are discussed and a comparison of their performances with the conventional approach on the basis of execution time and recognition rate is presented.