The Adaptive Hough Transform
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-9 (5) , 690-698
- https://doi.org/10.1109/tpami.1987.4767964
Abstract
We introduce the Adaptive Hough Transform, AHT, as an efficient way of implementing the Hough Transform, HT, method for the detection of 2-D shapes. The AHT uses a small accumulator array and the idea of a flexible iterative "coarse to fine" accumulation and search strategy to identify significant peaks in the Hough parameter spaces. The method is substantially superior to the standard HT implementation in both storage and computational requirements. In this correspondence we illustrate the ideas of the AHT by tackling the problem of identifying linear and circular segments in images by searching for clusters of evidence in 2-D parameter spaces. We show that the method is robust to the addition of extraneous noise and can be used to analyze complex images containing more than one shape.Keywords
This publication has 6 references indexed in Scilit:
- An iterative hough procedure for three-dimensional object recognitionPattern Recognition, 1984
- A new three-dimensional connected components algorithmComputer Vision, Graphics, and Image Processing, 1983
- A new connected components algorithm for virtual memory computersComputer Vision, Graphics, and Image Processing, 1983
- Discretization errors in the Hough transformPattern Recognition, 1981
- Generalizing the Hough transform to detect arbitrary shapesPattern Recognition, 1981
- On the detection of structures in noisy picturesPattern Recognition, 1977