Research on Self Calibration Without Minimization
R. A. Manning and C. R. Dyer, Computer Sciences Department Technical Report 1490, University of Wisconsin - Madison, February 2003.

Abstract

In this paper we present a new metric camera self-calibration algorithm that does not require the global minimization of an error function and can produce all legal solutions to the three-camera self-calibration problem in a single pass. By contrast, virtually all previous self-calibration algorithms rely on nonlinear global optimization unless special assumptions are made about the camera or its motion. The key drawback to global-optimization-based methods is that, for nontrivial error functions, they can run indefinitely. Therefore, because our new algorithm produces all solutions quickly and in a fixed amount of time, it is arguably the fastest self-calibration algorithm in existence. In addition, our algorithm makes it possible to determine experimentally the number of solutions to the three-camera self-calibration problem; an upper-bound of 21 was given by Schaffilitzky, but our experiments show this number is more typically 1 or 2. Finally, because our algorithm runs very quickly and requires only the theoretical minimum of three camera views, it can be used in conjunction with RANSAC for great robustness to noise when more than three views are available.