Randomized Hough transform (RHT)
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. i, 631-635
- https://doi.org/10.1109/icpr.1990.118177
Abstract
A method is developed for calculating the Hough transform (HT) and completing the task of finding global features from binary edge images. The method is based on the fact that a single parameter space point can be determined uniquely with a pair, triple, or generally n-tuple of points from the original picture. Such n-tuples of points can be chosen randomly from the edge image, giving the method the name randomized Hough transform (RHT). The new algorithm reduces the computation time and memory use of the HT drastically. In the standard HT one must calculate one parameter curve in the parameter space for one pixel, whereas in the RHT only one parameter point has to be solved for one n-tuple of points, and the presence of a specific curve in the image is quickly revealed by the accumulation of a small number of parameter points.Keywords
This publication has 7 references indexed in Scilit:
- A new curve detection method: Randomized Hough transform (RHT)Pattern Recognition Letters, 1990
- Hough transform for line recognition: Complexity of evidence accumulation and cluster detectionComputer Vision, Graphics, and Image Processing, 1989
- Self-Organization and Associative MemoryPublished by Springer Nature ,1988
- Parallel guessing: A strategy for high-speed computationPattern Recognition, 1987
- A Survey of Efficient Hough Transform MethodsPublished by British Machine Vision Association and Society for Pattern Recognition ,1987
- Fast Hough transform: A hierarchical approachComputer Vision, Graphics, and Image Processing, 1986
- Finding circles by an array of accumulatorsCommunications of the ACM, 1975