By Topic

A New Line-Based Orthogonal Iteration Pose Estimation Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiaohu Zhang ; Coll. of Aerosp. & Mater. Eng., Nat. Univ. of defense Technol., Changsha, China ; Kunpeng Wang ; Zheng Zhang ; Qifeng Yu

The Orthogonal Iteration (OI) algorithm for pose estimation from point correspondences is global convergent, efficient and robust, which make this algorithm quite attractive. In this paper, we extend the OI algorithm to 2D-3D line correspondences and present an iterative algorithm referred to as LBOI (Line-Based Orthogonal Iterative Algorithm). We first derive a new form of fundamental equations and get an error function which has actual geometry meaning. We then divide the error function into two parts and minimize both of them to estimate the best pose parameters iteratively. The iteration process of our method is similar as that of the OI algorithm. However, the rotation matrix is computed twice in each iteration in our method. For different groups of line correspondences, we present different methods for getting an initial guess. Synthetic experiment data show the proposed algorithm is insensitive to initialization, efficient and accurate.

Published in:

2009 International Conference on Information Engineering and Computer Science

Date of Conference:

19-20 Dec. 2009