Abstract
This paper describes techniques to perform fast and accurate curve detection using a variant of the Hough transform. We show that the Hough transform can be decomposed into small subproblems that examine only a subset of the parameter space. Each subproblem considers only those curves that pass through some small subset of the data points. This property allows the efficient implementation of the Hough transform with respect to both time and space, and allows the careful propagation of the effects of localization error in the detection process. The use of randomization yields an O(n) worst-case computational complexity for this method, where n is the number of data points, if we are only required to find curves that are significant with respect to the complexity of the data. In addition, this method requires little memory and can be easily parallelized.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. R. Bergen and H. Shvaytser. A probabilistic algorithm for computing Hough transforms. Journal of Algorithms, 12:639–656, 1991.
A. Califano, R. M. Bolle, and R. W. Taylor. Generalized neighborhoods: A new approach to complex parameter feature extraction. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 192–199, 1989.
J. Illingworth and J. Kittler. A survey of the Hough transform. Computer Vision, Graphics, and Image Processing, 44:87–116, 1988.
V. F. Leavers. The dynamic generalized Hough transform: Its relationship to the probabilistic Hough transforms and an application to the concurrent detection of circles and ellipses. CVGIP: Image Understanding, 56(3):381–398, November 1992.
V. F. Leavers. Which Hough transform? CVGIP: Image Understanding, 58(2):250–264, September 1993.
J. Princen, J. Illingworth, and J. Kittler. A formal definition of the Hough transform: Properties and relationships. Journal of Mathematical Imaging and Vision, 1:153–168, 1992.
L. Xu, E. Oja, and P. Kultanen. A new curve detection method: Randomized Hough transform (RHT). Pattern Recognition Letters, 11:331–338, May 1990.
H. K. Yuen, J. Illingworth, and J. Kittler. Detecting partially occluded ellipses using the Hough transform. Image and Vision Computing, 7(1):31–37, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olson, C.F. (1996). Decomposition of the Hough transform: Curve detection with efficient error propagation. In: Buxton, B., Cipolla, R. (eds) Computer Vision — ECCV '96. ECCV 1996. Lecture Notes in Computer Science, vol 1064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015542
Download citation
DOI: https://doi.org/10.1007/BFb0015542
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61122-6
Online ISBN: 978-3-540-49949-7
eBook Packages: Springer Book Archive