ABSTRACT

In many detection problems, the structures to be detected are parameterized by the points of a parameter space. If the conditional probability density function for the measurements is known, then detection can be achieved by sampling the parameter space at a finite number of points and checking each point to see if the corresponding structure is supported by the data. The number of samples and the distances between neighboring samples are calculated using the Rao metric on the parameter space. The Rao metric is obtained from the Fisher information which is, in turn, obtained from the conditional probability density function. An upper bound is obtained for the probability of a false detection. The calculations are simplified in the low noise case by making an asymptotic approximation to the Fisher information. An application to line detection is described. Expressions are obtained for the asymptotic approximation to the Fisher information, the volume of the parameter space, and the number of samples. The time complexity for line detection is estimated. An experimental comparison is made with a Hough transform-based method for detecting lines.

INDEX TERMS

Analysis of algorithms, clustering, edge and feature detection, multivariate statistics, robust regression, sampling, search process.

CITATION

S. J. Maybank, "Detection of Image Structures Using the Fisher Information and the Rao Metric," in

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 26, no. , pp. 1579-1589, 2004.

doi:10.1109/TPAMI.2004.122

CITATIONS