Hough transformation

An approach to detect straight lines (or curves) in an image (a picture), by applying a coordinate transformation to the image such that all the points belonging to a line (or a curve) are mapped into a single point in the transformed space.

The method to detect lines may be explained as follows [a2]. The set of all straight lines in the -image plane gives rise to a two-parameter family. When using the normal parametrization (cf. also Normal equation), the equation of a line is given by

(a1)

where is the oriented angle of the normal onto the line, and where is the algebraic distance of the line from the origin. Restricting to the interval , the normal parameters for a line are unique. Taking the -space as the transformed space, every line in the -plane corresponds to a unique point in the transformed space (in the original Hough-transform method the slope-intercept representation of a line, namely , was used, and the -space was the transformed space; as both the slope and the intercept may become infinite, the technique is more involved, [a3]).

Taking now a fixed point in the -plane, this point gives rise in the -space to a curve defined by

(a2)

Clearly, when one has a set of picture points that are collinear in the -plane, the curves in the -space corresponding to these points according to (a2) have a common point of intersection, say . Writing (a1) with and , one obtains the equation of a line in the -plane passing through the points.

Having now a digital picture in the -plane, and mapping all these points to their corresponding curves in the parameter space, collinear subsets of picture points can be found by searching coincident points of intersection in the parameter space. In practice this is done by quantizing both parameters and , and treating the quantized region as a two-dimensional array of accumulators. For each point in the -picture plane, the curve corresponding to it by (a2) gives rise to incrementing the count in some cells of the array. After all picture points have been treated, the array is inspected to find cells having high counts. When in some cell there are counts, then the line with normal parameters passes (approximately) through picture points.

The Hough-transform method as explained above to detect straight lines in a picture can, in principle, be generalized to detect analytic curves involving more than two parameters. For instance, as the equation of a circle in the -plane is given by

(a3)

a point on that circle determines a subset of the three-dimensional -parameter space. When a number of picture points are arranged on a circle with parameters , the corresponding subsets in the -parameter space will intersect at the point , and this point may be detected by using a three-dimensional array. As methods to detect curves in a picture are usually applied to find out if edge points are situated on a particular curve, it is often possible to reduce the number of points to be checked, while also the use of directional information may reduce the computational burden [a1].

References

[a1]	D.H. Ballard, "Generalizing the Hough transform to detect arbitrary shapes" Pattern Recognition , 13 (1981) pp. 111–122
[a2]	H. Bässmann, PH.W. Besslich, "Konturorientierte Verfahren in der digitalen Bildverarbeitung" , Springer (1989)
[a3]	A. Rosenfeld, A.C Kak, "Digital picture processing" , 2 , Acad. Press (1982)