
Decomposition of the Hough Transform: Curve Detection with Efficient Error
Propagation
Clark F. Olson In Proceedings of the European Conference on Computer Vision, pages 263272, 1996. Download (205 K) 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) worstcase 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. 