6533b836fe1ef96bd12a059e

RESEARCH PRODUCT

Stratified Autocalibration of Cameras with Euclidean Image Plane

Devesh AdlakhaAdlane HabedFabio MorbidiCédric DemonceauxMichel De Mathelin

subject

[INFO.INFO-SY] Computer Science [cs]/Systems and Control [cs.SY][INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO][INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO][INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV][INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO][INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV][INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION[INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY][INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO][INFO.INFO-AU] Computer Science [cs]/Automatic Control EngineeringComputingMilieux_MISCELLANEOUS

description

International audience; This paper tackles the problem of stratified autocalibration of a moving camera with Euclidean image plane (i.e. zero skew and unit aspect ratio) and constant intrinsic parameters. We show that with these assumptions, in addition to the polynomial derived from the so-called modulus constraint, each image pair provides a new quartic polynomial in the unknown plane at infinity. For three or more images, the plane at infinity estimation is stated as a constrained polynomial optimization problem that can efficiently be solved using Lasserre's hierarchy of semidefinite relaxations. The calibration parameters and thus a metric reconstruction are subsequently obtained by solving a system of linear equations. Synthetic data and real image experiments show that the new polynomial in our proposed algorithm leads to a more reliable performance than existing methods.

https://hal.science/hal-02939758