This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Globally Convergent Autocalibration Using Interval Analysis
December 2004 (vol. 26 no. 12)
pp. 1633-1638
We address the problem of autocalibration of a moving camera with unknown constant intrinsic parameters. Existing autocalibration techniques use numerical optimization algorithms whose convergence to the correct result cannot be guaranteed, in general. To address this problem, we have developed a method where an interval branch-and-bound method is employed for numerical minimization. Thanks to the properties of Interval Analysis this method converges to the global solution with mathematical certainty and arbitrary accuracy and the only input information it requires from the user are a set of point correspondences and a search interval. The cost function is based on the Huang-Faugeras constraint of the essential matrix. A recently proposed interval extension based on Bernstein polynomial forms has been investigated to speed up the search for the solution. Finally, experimental results are presented.

[1] T.S. Huang and A.N. Netravali, “Motion and Structure from Feature Correspondences: A Review,” Proc. IEEE, vol. 82, no. 2, pp. 252-267, 1994.
[2] S.J. Maybank and O. Faugeras, “A Theory of Self-Calibration of a Moving Camera,” Int'l J. Computer Vision, vol. 8, no. 2, pp. 123-151, 1992.
[3] Q.-T. Luong and O. Faugeras, “Self-Calibration of a Moving Camera from Point Correspondences and Fundamental Matrices,” Int'l J. Computer Vision, vol. 22, no. 3, pp. 261-289, 1997.
[4] M.I. Lourakis and R. Deriche, “Camera Self-Calibration Using the Singular Value Decomposition of the Fundamental Matrix,” Proc. Fourth Asian Conf. Computer Vision, vol. 1, pp. 403-408, Jan. 2000.
[5] R.I. Hartley, “Kruppa's Equations Derived from the Fundamental Matrix,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 2, pp. 133-135, Feb. 1997.
[6] M. Pollefeys and L. van Gool, “A Stratified Approach to Metric Self-Calibration,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 407-412, 1997.
[7] A. Heyden and K. Åström, “Euclidean Reconstruction from Constant Intrinsic Parameters,” Proc. Int'l Conf. Pattern Recognition, pp. 339-343, 1996.
[8] B. Triggs, “Autocalibration and the Absolute Quadric,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 609-614, 1997.
[9] A. Fusiello, “Uncalibrated Euclidean Reconstruction: A Review,” Image and Vision Computing, vol. 18, no. 6-7, pp. 555-563, May 2000.
[10] A. Heyden and K. Åström, “Euclidean Reconstruction from Image Sequences with Varying and Unknown Focal Length and Principal Point,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 438-443, 1997.
[11] M. Pollefeys, R. Koch, and L. van Gool, “Self-Calibration and Metric Reconstruction in Spite of Varying and Unknown Internal Camera Parameters,” Proc. IEEE Int'l Conf. Computer Vision, pp. 90-95, 1998.
[12] P. Mendonça and R. Cipolla, “A Simple Techinique for Self-Calibration,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. I:500-505, 1999.
[13] R.I. Hartley, “Estimation of Relative Camera Position for Uncalibrated Cameras,” Proc. European Conf. Computer Vision, pp. 579-587, 1992.
[14] P. Sturm, “On Focal Length Calibration for Two Views,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 145-150, 2001.
[15] S. Bougnoux, “From Projective to Euclidean Space under Any Practical Situation, a Criticism of Self-Calibration,” Proc. IEEE Int'l Conf. Computer Vision, pp. 790-796, 1998.
[16] G. Roth and A. Whitehead, “Some Improvements on Two Autcalibration Algorithms Based on the Fundamental Matrix,” Proc. Int'l Conf. Pattern Recognition, vol. 2, pp. 312-315, 2002.
[17] J. Ponce, “On Computing Metric Upgrades of Projective Reconstructions under the Rectangular Pixel Assumption,” Proc. SMILE 2000 Workshop 3D Structure from Multiple Images of Large-Scale Environments, vol. 2018, pp. 52-67, 2002.
[18] J. Oliensis, “Fast and Accurate Self-Calibration,” Proc. IEEE Int'l Conf. Computer Vision, 1999.
[19] A. Heyden and K. Astrom, “Minimal Conditions on Intrinsic Parameters for Euclidean Reconstruction,” Proc. Asian Conf. Computer Vision, 1998.
[20] R. Hartley, E. Hayman, L. de Agapito, and I. Reid, “Camera Calibration and the Search for Infinity,” Proc. IEEE Int'l Conf. Computer Vision, 1999.
[21] A. Neumaier, Introduction to Numerical Analysis. Cambridge: Cambridge Univ. Press, 2001.
[22] E.R. Hansen, Global Optimization Using Interval Analysis. New York: Marcel Dekker, 1992.
[23] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge Univ. Press, 2000.
[24] Q.-T. Luong and O.D. Faugeras, “The Fundamental Matrix: Theory, Algorithms, and Stability Analysis,” Int'l J. Computer Vision, vol. 17, pp. 43-75, 1996.
[25] T. Huang and O. Faugeras, “Some Properties of the E Matrix in Two-View Motion Estimation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 12, pp. 1310-1312, Dec. 1989.
[26] Q.-T. Luong and T. Viéville, “Canonical Representations for the Geometries of Multiple Projective Views,” Computer Vision and Image Understanding, vol. 64, no. 2, pp. 193-229, 1996.
[27] R.E. Moore, Interval Analysis. Prentice-Hall, 1966.
[28] R.B. Kearfott, Rigorous Global Search: Continuous Problems. Kluwer, 1996.
[29] P.S.V. Nataraj and K. Kotecha, “An Algorithm for Global Optimization Using the Taylor-Bernstein Form as an Inclusion Function,” Int'l J. Global Optimization, vol. 24, pp. 417-436, 2002.
[30] R.B. Kearfott and K. Du, “The Cluster Problem in Multivariate Global Optimization,” J. Global Optimization, vol. 5, pp. 253-365, 1994.
[31] K. Makino and M. Berz, “Taylor Models and Other Validated Functional Inclusion Methods,” Int'l J. Pure and Applied Math., vol. 4, no. 4, pp. 379-456, 2003.
[32] D. Rogers and J.A. Adams, Mathematical Elements for Computer Graphics, second ed. McGraw-Hill, 1990.
[33] A. Neumaier, “Taylor Forms— Use and Limits,” Reliable Computing, vol. 9, pp. 43-79, 2002.
[34] A. Fusiello, A. Benedetti, M. Farenzena, and A. Busti, “Globally Convergent Autocalibration Using Interval Analysis,” Technical Report RR 09/2003, Dipartimento di Informatica, Università di Verona, 2003.
[35] R.I. Hartley, “In Defence of the 8-Point Algorithm,” Proc. IEEE Int'l Conf. Computer Vision, 1995.
[36] C. Zeller and O. Faugeras, “Camera Self-Calibration from Video Sequences: The Kruppa Equations Revisited,” Research Report 2793, INRIA, Feb. 1996.
[37] T. Ueshiba and F. Tomita, “A Factorization Method for Projective and Euclidean Reconstruction from Multiple Perspective Views via Iterative Depth Estimation,” Proc. European Conf. Computer Vision, pp. 296-310, 1998.
[38] Z. Zhang, “A Flexible New Technique for Camera Calibration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 11, pp. 1330-1334, Nov. 2000.
[39] P. Beardsley, A. Zisserman, and D. Murray, “Sequential Update of Projective and Affine Structure from Motion,” Int'l J. Computer Vision, vol. 23, no. 3, pp. 235-259, 1997.
[40] P. Sturm, “A Case Against Kruppa's Equations for Camera Self-Calibration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 10, pp. 1199-1204, Sept. 2000.

Index Terms:
Image processing and computer vision, camera calibration, modeling from video, interval arithmetic, 3D/stereo scene analysis, self-calibration.
Citation:
Andrea Fusiello, Arrigo Benedetti, Michela Farenzena, Alessandro Busti, "Globally Convergent Autocalibration Using Interval Analysis," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 12, pp. 1633-1638, Dec. 2004, doi:10.1109/TPAMI.2004.125
Usage of this product signifies your acceptance of the Terms of Use.