Hypothesis testing: a framework for analysing and optimising Hough transform performance

A formal, quantitative approach to designing optimal Hough transform (HT) algorithms is proposed. This approach takes the view that a HT is a hypothesis testing method. This view allows the performance of HT algorithms to be quantified. The power function, which gives the probability of rejection as a function of the underlying parametric distribution of data points, is shown to be the fundamentally important characteristic of HT behavior. Attempting to make the power function narrow is a formal approach to optimizing HT performance. To illustrate how this framework is useful the particular problem of line detection is discussed. It is shown that the hypothesis testing framework leads to a redefinition of HT in which the values are a measure of the distribution of points around a curve rather than the number of points on a curve. The solution to many HT design problems can be posed within the framework, including optimal quantizations and optimum sampling of the parameter space. Consideration is given to the design of optimum 1-D filters which can be used to sharpen the peak structure in parameter space. Results on several real images illustrate the improvements obtained.<<ETX>>

[1]  Sahibsingh A. Dudani,et al.  Locating straight-line edge segments on outdoor scenes , 1978, Pattern Recognit..

[2]  John Princen Hough Transform Methods for Curve Detection and Parameter Estimation , 1990 .

[3]  Josef Kittler,et al.  A survey of the hough transform , 1988, Comput. Vis. Graph. Image Process..

[4]  Josef Kittler,et al.  Optimal Edge Detectors for Ramp Edges , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Frans C. A. Groen,et al.  Discretization errors in the Hough transform , 1981, Pattern Recognit..

[6]  Werner A. Stahel,et al.  Robust Statistics: The Approach Based on Influence Functions , 1987 .

[7]  Stanley M. Dunn,et al.  Approximating point-set images by line segments using a variation of the Hough transform , 1983, Comput. Vis. Graph. Image Process..

[8]  Guido Gerig,et al.  FAST CONTOUR IDENTIFICATION THROUGH EFFICIENT HOUGH TRANSFORM AND SIMPLIFIED INTERPRETATION STRATEGY. , 1986 .

[9]  Christopher M. Brown Inherent Bias and Noise in the Hough Transform , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  R. Serfling Approximation Theorems of Mathematical Statistics , 1980 .

[11]  E. Lehmann,et al.  Testing Statistical Hypothesis. , 1960 .

[12]  D. Fraser Nonparametric methods in statistics , 1957 .

[13]  M. B. Clowes,et al.  Finding Picture Edges Through Collinearity of Feature Points , 1973, IEEE Transactions on Computers.

[14]  Josef Kittler,et al.  On the Optimal Edge Detector , 1988, Alvey Vision Conference.

[15]  Libor Spacek,et al.  Edge detection and motion detection , 1986, Image Vis. Comput..

[16]  M. Kendall,et al.  The advanced theory of statistics , 1945 .