A fast Hough transform for segment detection

The authors 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 th...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on image processing Vol. 4; no. 11; pp. 1541 - 1548
Main Authors:	Guil, N., Villalba, J., Zapata, E.L.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01-11-1995 Institute of Electrical and Electronics Engineers
Subjects:	Applied sciences Computer vision Detectors Exact sciences and technology Image edge detection Image recognition Image segmentation Information, signal and communications theory Noise generators Pattern recognition Piecewise linear techniques Signal processing Telecommunications and information theory Voting Image recognition Image processing Hough transformation Robustness Straight shape Digital image Fast algorithm Edge detection
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The authors 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, they manage to detect the segments of the image without appreciable computational overhead. They also discuss the performance and the parallelization of the algorithm and show its efficiency with some examples.< >
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2
ISSN:	1057-7149 1941-0042
DOI:	10.1109/83.469935