A FAST HOUGH TRANSFORM FOR SEGMENT DETECTION

被引：87

作者：

GUIL, N

VILLALBA, J

ZAPATA, EL

机构：

[1] Department Arquitectura de Computadores, University of Málaga, Plaza El Ejido, Málaga

来源：

IEEE TRANSACTIONS ON IMAGE PROCESSING | 1995年 / 4卷 / 11期

关键词：

D O I：

10.1109/83.469935

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, we will describe a new algorithm for the fast Hough transform (FHT) that satisfactorily solves the problems other fast algorithms propose in the literature-erroneous solutions, point redundance, scaling, and detection of straight lines of different sizes-and needs less storage space. By using the information generated by the algorithm for the detection of straight lines, we manage to detect the segments of the image without appreciable computational overhead. We will also discuss the performance and the parallelization of the algorithm we present and will show its efficiency with some examples.

引用

页码：1541 / 1548

页数：8

共 13 条

[1]

Albanesi M. G., 1991, Proceedings. Advanced Computer Technology, Reliable Systems and Applications. 5th Annual European Computer Conference CompEuro '91 (Cat. No.91CH3001-5), P253, DOI 10.1109/CMPEUR.1991.257392

[2] A COMBINATORIAL HOUGH TRANSFORM [J].