Skip to main content
Log in

Rationalising the Renormalisation Method of Kanatani

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

The renormalisation technique of Kanatani is intended to iteratively minimise a cost function of a certain form while avoiding systematic bias inherent in the common method of minimisation due to Sampson. Within the computer vision community, the technique has generally proven difficult to absorb. This work presents an alternative derivation of the technique, and places it in the context of other approaches. We first show that the minimiser of the cost function must satisfy a special variational equation. A Newton-like, fundamental numerical scheme is presented with the property that its theoretical limit coincides with the minimiser. Standard statistical techniques are then employed to derive afresh several renormalisation schemes. The fundamental scheme proves pivotal in the rationalising of the renormalisation and other schemes, and enables us to show that the renormalisation schemes do not have as their theoretical limit the desired minimiser. The various minimisation schemes are finally subjected to a comparative performance analysis under controlled conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P.T. Boggs and J.E. Rodgers, “Orthogonal distance regression,” Statistical Analysis of Measurement Error Models and Applications, Arcata, California, June 10–16, 1989. Contemporary Mathematics, Vol. 112, American Mathematical Society: Providence, RI, 1989, pp. 183–194.

    Google Scholar 

  2. F. Bookstein, “Fitting conic sections to scattered data,” Computer Graphics and Image Processing, Vol. 9, No. 1, pp. 56–71, 1979.

    Google Scholar 

  3. M.J. Brooks, W. Chojnacki, and L. Baumela, “Determining the egomotion of an uncalibrated camera from instantaneous optical flow,” Journal of the Optical Society of America A, Vol. 14, No. 10, pp. 2670–2677, 1997.

    Google Scholar 

  4. W. Chojnacki, M.J. Brooks, and A. van den Hengel, “Fitting surfaces to data with covariance information: Fundamental methods applicable to computer vision,” Technical Report TR 99-03, Department of Computer Science, University of Adelaide, South Australia, Aug. 1999, Available from http://www.cs.adelaide.edu.au/~mjb.

    Google Scholar 

  5. T. Ellis, “Ellipse detection and matching with uncertainty,” Image and Vision Computing, Vol. 10, No. 2, pp. 271–276, 1992.

    Google Scholar 

  6. O.D. Faugeras, Three-Dimensional Computer Vision: A Geometric Viewpoint, The MIT Press: Cambridge, Mass., 1993.

    Google Scholar 

  7. A. Fitzgibbon, M. Pilu, and R.B. Fisher, “Direct least square fitting of ellipses,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 21, No. 5, pp. 476–480, 1999.

    Google Scholar 

  8. A.W. Fitzgibbon and R.B. Fisher, “A buyer's guide to conic fitting,” in Proceedings of the Sixth British Machine Vision Conference, Birmingham, England, Sept. 11–14, 1995, (D. Pycock, ed.), Vol. 2, BMVA, 1995, pp. 513–522.

  9. W.A. Fuller, Measurement Error Models, John Wiley & Sons, New York, 1987.

    Google Scholar 

  10. W. Gander, G.H. Golub, and R. Strebel, “Least-square fitting of circles and ellipses,” BIT, Vol. 43, pp. 558–578, 1994.

    Google Scholar 

  11. K. Kanatani, “Statistical bias of conic fitting and renormalisation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 16, No. 3, pp. 320–326, 1994.

    Google Scholar 

  12. K. Kanatani, Statistical Optimization for Geometric Computation: Theory and Practice, Elsevier: Amsterdam, 1996.

    Google Scholar 

  13. Y. Leedan and P. Meer, “Heteroscedastic regression in computer vision: Problems with bilinear constraint,” International Journal of Computer Vision, Vol. 37, No. 2, pp. 127–150, 2000.

    Google Scholar 

  14. Q.-T. Luong and O.D. Faugeras, “The fundamental matrix: Theory, algorithm, and stability analysis,” International Journal of Computer Vision, Vol. 17, No. 1, pp. 43–75, 1996.

    Google Scholar 

  15. M. Mühlich and R. Mester, “The role of total least squares in motion analysis,” in Computer Vision—ECCV'98, Fifth European Conference on Computer Vision, Freiburg, Germany, June 2–6, 1998 (H. Burkhardt and B. Neumann, eds.). Lecture Notes in Computer Science, Vol. 1407, Springer: Berlin, 1998, pp. 305–321.

    Google Scholar 

  16. J. Porill, “Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter,” Image and Vision Computing, Vol. 8, No. 1, pp. 37–41, 1990.

    Google Scholar 

  17. P.L. Rosin, “Anote on the least square fitting of ellipses,” Pattern Recognition Letters, Vol. 14, No. 10, pp. 799–808, 1993.

    Google Scholar 

  18. P.L. Rosin and G.A. West, “Nonparametric segmentation of curves into various representations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 17, No. 12, pp. 1140–1153, 1995.

    Google Scholar 

  19. P.D. Sampson, “Fitting conic sections to ‘very scattered’ data: An iterative refinement of the Bookstein algorithm,” Computer Graphics and Image Processing, Vol. 18, No. 1, pp. 97–108, 1982.

    Google Scholar 

  20. G. Taubin, “Estimation of planar curves, surfaces and nonplanar space curves defined by implicit equations, with applications to edge and range image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, No. 11, pp. 1115–1138, 1991.

    Google Scholar 

  21. P.H.S. Torr and D.W. Murray, “The development and comparison of robust methods for estimating the fundamental matrix,” International Journal of Computer Vision, Vol. 24, No. 3, pp. 271–300, 1997.

    Google Scholar 

  22. B. Triggs, “A new approach to geometric fitting,”Available from http://www.inrialpes.fr/movi/people/Triggs.

  23. B. Triggs, “Optimal estimation of matching constraints,” in 3D Structure from Multiple Images of Large-Scale Environments (SMILE), Workshop Organised by the CUMULI, PANORAMA and VANGUARD Projects in Conjunction with ECCV'98, Freiburg, Germany, June 6–7, 1998 (R. Koch and L. Van Gool, eds.), Freiburg University, 1998, Full version available from http://www.inrialpes.fr/movi/people/Triggs.

  24. T. Viéville and O.D. Faugeras, “Motion analysis with a camera with unknown, and possibly varying intrinsic parameters,” in Proceedings of the Fifth International Conference on Computer Vision, Cambridge, MA, June 20–23, 1995, IEEE Computer Society Press: Los Alamitos, CA, 1995, pp. 750–756.

    Google Scholar 

  25. Z. Zhang, “Parameter estimation techniques: A tutorial with application to conic fitting,” Image and Vision Computing, Vol. 15, No. 1, pp. 57–76, 1997.

    Google Scholar 

  26. Z. Zhang, “On the optimization criteria used in two-viewmotion analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20, No. 7, pp. 717–729, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chojnacki, W., Brooks, M.J. & Hengel, A.V.D. Rationalising the Renormalisation Method of Kanatani. Journal of Mathematical Imaging and Vision 14, 21–38 (2001). https://doi.org/10.1023/A:1008355213497

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008355213497

Navigation