A global optimal algorithm for camera calibration with one-dimensional objects

Authors:
Liang Wang;FuQing Duan;Chao Liang
Affiliations:
College of Electronic Information and Control Engineering, Beijing University of Technology, Beijing, P.R. China;College of Information Science and Technology, Beijing Normal University, Beijing, P.R. China;College of Electronic Information and Control Engineering, Beijing University of Technology, Beijing, P.R. China
Venue:
HCII'11 Proceedings of the 14th international conference on Human-computer interaction: design and development approaches - Volume Part I
Year:
2011

Citing 10
Cited 0

A theory of self-calibration of a moving camera

International Journal of Computer Vision
Multiple view geometry in computer visiond

Multiple view geometry in computer visiond
Autocalibration from Planar Scenes

ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Autocalibration and the absolute quadric

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
The Modulus Constraint: A New Constraint for Self-Calibration

ICPR '96 Proceedings of the 1996 International Conference on Pattern Recognition (ICPR '96) Volume I - Volume 7270
Camera Calibration with One-Dimensional Objects

IEEE Transactions on Pattern Analysis and Machine Intelligence
Degenerate Cases and Closed-form Solutions for Camera Calibration with One-Dimensional Objects

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Revisiting Zhang's 1D calibration algorithm

Pattern Recognition
Camera calibration with moving one-dimensional objects

Pattern Recognition
Globally Optimal Algorithms for Stratified Autocalibration

International Journal of Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

The emergent one-dimensional (1D) calibration is very suitable for multi-camera calibration. However its accuracy is not satisfactory. Conventional optimal algorithms, such as bundle adjustment, do not perform well for the non-convex optimization of 1D calibration. In this paper, a practical optimal algorithm for camera calibration with 1D objects using branch and bound framework is presented. To obtain the optimal solution which can provide e-optimality, tight convex relaxations of the objective functions are constructed and minimized in a branch and bound optimization framework. Experiments prove the validity of the proposed method.