Robust optimal pose estimation

28Citations
Citations of this article
52Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the problem of estimating the position and orientation of a calibrated camera from an image of a known scene. A common problem in camera pose estimation is the existence of false correspondences between image features and modeled 3D points. Existing techniques such as ransac to handle outliers have no guarantee of optimality. In contrast, we work with a natural extension of the L ∈∞∈ norm to the outlier case. Using a simple result from classical geometry, we derive necessary conditions for L ∈∞∈ optimality and show how to use them in a branch and bound setting to find the optimum and to detect outliers. The algorithm has been evaluated on synthetic as well as real data showing good empirical performance. In addition, for cases with no outliers, we demonstrate shorter execution times than existing optimal algorithms. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Enqvist, O., & Kahl, F. (2008). Robust optimal pose estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5302 LNCS, pp. 141–153). Springer Verlag. https://doi.org/10.1007/978-3-540-88682-2_12

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