This Article 
 Bibliographic References 
 Add to: 
Detection of Image Structures Using the Fisher Information and the Rao Metric
December 2004 (vol. 26 no. 12)
pp. 1579-1589
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.

[1] S.-I. Amari, Differential-Geometrical Methods in Statistics. 1985.
[2] V. Balasubramanian, “A Geometric Formulation of Occam's Razor for Inference of Parametric Distributions,” Report No. PUPT-1588, Dept. of Physics, Princeton Univ.,, 1996.
[3] I. Chavel, Eigenvalues in Riemannian Geometry. Academic Press, 1984.
[4] T.M. Cover and J.A. Thomas, Elements of Information Theory. Wiley, 1991.
[5] M.P. Do Carmo, Riemannian Geometry. Birkhauser, 1993.
[6] M.A. Fischler and R.C. Bolles, “Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,” Comm. ACM, pp. 381-395, 1981.
[7] R.A. Fisher, “On the Mathematical Foundations of Theoretical Statistics,” Philosophical Trans. Royal Soc. of London, Series A, vol. 222, pp. 309-368, 1922.
[8] D.A. Forsyth and J. Ponce, Computer Vision, a Modern Approach. Prentice Hall, 2003.
[9] S. Gallot, D. Hulin, and J. LaFontaine, Riemannian Geometry, second ed. Universitext, Springer, 1990.
[10] R.C. Gonzalez and R.E. Woods, Digital Image Processing. Prentice Hall, 2002.
[11] W.E.L. Grimson and D.P. Huttenlocher, “On the Sensitivity of the Hough Transform for Object Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 3, Mar. 1990.
[12] G. Hamarneh, K. Althoff, and R. Abu-Gharbieh, “Automatic Line Detection,” cvreporthtmlCV_report.htm, 1999.
[13] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge Univ. Press, 2000.
[14] J. Illingworth and J. Kittler, “A Survey of the Hough Transform,” Computer Vision, Graphics, and Image Processing, vol. 43, pp. 221-238, 1988.
[15] Breakthroughs in Statistics. Volume 1: Foundations and Basic Theory, S. Kotz and N.L. Johnson, eds., Springer-Verlag, 1992.
[16] W.C.Y. Lam, L.T.S. Lam, K.S.Y. Yuen, and D.N.K. Leung, “An Analysis on Quantizing the Hough Space,” Pattern Recognition Letters, vol. 15, pp. 1127-1135, 1994.
[17] V.F. Leavers, Shape Detection in Computer Vision Using the Hough Transform. Springer Verlag, 1992.
[18] A.B. Lee, D. Mumford, and J. Huang, “Occlusion Models for Natural Images: A Statistical Study of a Scale-Invariant Dead Leaves Model,” Int'l J. Computer Vision, vol. 41, pp. 35-59, 2001.
[19] S.J. Maybank, “Fisher Information and Model Selection for Projective Transformations of the Line,” Proc. Royal Soc. of London, Series A, vol. 459, pp. 1-21, 2003.
[20] C.W. Misner, K.S. Thorne, and J.A. Wheeler, Gravitation. W.H. Freeman, 1973.
[21] J. Myung, V. Balasubramanian, and M.A. Pitt, “Counting Probability Distributions: Differential Geometry and Model Selection,” Proc. Nat'l Academy of Science, vol. 97, pp. 11170-11175,
[22] C.R. Rao, “Information and the Accuracy Attainable in the estimation of Statistical Parameters,” Bull. Calcutta Math. Soc., vol. 37, pp. 81-91, 1945.
[23] C.V. Stewart, “MINPRAN: A New Robust Estimator for Computer Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, pp. 925-938, 1995.
[24] M. Werman and D. Keren, “A Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data,” Proc. Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 552-558, 1999.
[25] S. Wolfram, The Mathematica Book, fourth ed. Cambridge Univ. Press, 1999.
[26] S.Y.K. Yuen and V. Hlavac, “An Approach to Quantization of Hough Space,” Proc. Seventh Scandinavian Conf. Image Analysis, pp. 733-740, 1991.

Index Terms:
Analysis of algorithms, clustering, edge and feature detection, multivariate statistics, robust regression, sampling, search process.
Stephen J. Maybank, "Detection of Image Structures Using the Fisher Information and the Rao Metric," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 12, pp. 1579-1589, Dec. 2004, doi:10.1109/TPAMI.2004.122
Usage of this product signifies your acceptance of the Terms of Use.