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

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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 ε-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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Wang, L., Duan, F. Q., & Liang, C. (2011). A global optimal algorithm for camera calibration with one-dimensional objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6761 LNCS, pp. 660–669). https://doi.org/10.1007/978-3-642-21602-2_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free