Calibration of image sequences for model visualisation

The object of this paper is to find a quick and accurate method for computing the projection matrices of an image sequence, so that the error is distributed evenly along the sequence. It assumes that a set of correspondences between points in the images is known, and that these points represent rigid points in the world. This paper extends the algebraic minimisation approach developed by Hartley so that it can be used for long image sequences. This is achieved by initially computing a trifocal tensor using the three most extreme views. The intermediate views are then computed linearly using the trifocal tensor. An iterative algorithm as presented which perturbs the twelve entries of one camera matrix so that the algebraic error along the whole sequence is minimised.

[1]  Reinhard Koch,et al.  Self-calibration and metric reconstruction in spite of varying and unknown internal camera parameters , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[2]  Richard I. Hartley,et al.  A linear method for reconstruction from lines and points , 1995, Proceedings of IEEE International Conference on Computer Vision.

[3]  Anders Heyden.  A Common Framework for Multiple View Tensors , 1998, ECCV.

[4]  S. P. Mudur,et al.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[5]  Bill Triggs,et al.  Autocalibration and the absolute quadric , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Richard I. Hartley,et al.  Minimizing algebraic error in geometric estimation problems , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[7]  Andrew Zisserman,et al.  Robust parameterization and computation of the trifocal tensor , 1997, Image Vis. Comput..

[8]  Long Quan,et al.  Invariants of 6 Points from 3 Uncalibrated Images , 1994, ECCV.

[9]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.