A line-based pose estimation algorithm for 3-D polyhedral object recognition

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a new approach to solve the problem of estimating the camera 3-D location and orientation from a matched set of 3-D model and 2-D image features. An iterative least-square method is used to solve both rotation and translation simultaneously. Because conventional methods that solved for rotation first and then translation do not provide good solutions, we derive an error equation using roll-pitch-yaw angle to present the rotation matrix. From the modeling of the error equation, we analytically extract the partial derivates for estimation parameters from the nonlinear error equation. To minimize the error equation, Levenberg-Marquardt algorithm is introduced with uniform sampling strategy of rotation space to avoid stuck in local minimum. Experimental results using real images are presented. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Lho, T. J., Kang, D. J., & Ha, J. E. (2004). A line-based pose estimation algorithm for 3-D polyhedral object recognition. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3046 LNCS(PART 4), 906–914. https://doi.org/10.1007/978-3-540-24768-5_97

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