Abstract

Pose estimation with unknown correspondences between 3D object points and 2D image points is known as the simultaneous pose and correspondence determination problem in the field of computer vision. It currently is still diffcutlt to solve particularly with the appearance of occlusion and cluster. In this paper, we present a new iterative algorithm for the pose estimation of an 3D object without any additional 3D-2D corresondence infromation. Our method combines SoftAssign algorithm for derterming the correspondence and OI (orthogonal iteration) algorithm for computing the pose. An assignment matrix which describes the correspondence is first introduced to the objective function of OI algorithm, and the simultaneous pose and correspondence determination problem is formulated as that of minimizing the weighted object space collinearity error. The pose and correspondence are evolved from an initial pose to an optimum value by nesting the two algorithms into one deterministic annealing process. Simulation and experimental results demonstrate that the proposed method is computationally more efficient and more accurate than the state-of-art methods.

Highlights

  • Pose estimation is widely used in virtual reality [1], unmanned air vehicle navigation [2], aircrafts docking [3] and robot control [4]

  • To solve the pose estimation with unknown correspondences problem, the weights mij which determine the assignments between object and image points are introduced, and the simultaneous pose and correspondence can be formulated as the minimization of the new weighted object space collinearity error as: NM

  • In this paper, we present a new simultaneous pose and correspondence determination algorithm in which occlusion and cluster cases are taken into account

Read more

Summary

INTRODUCTION

Pose estimation is widely used in virtual reality [1], unmanned air vehicle navigation [2], aircrafts docking [3] and robot control [4]. SoftPosit cannot handle coplanar case because the scaled orthographic projection matrix in the embedded Posit algorithm will be singular if the geometry features of the object are coplanar For these reasons, the goal of our work is to design a more accurate, faster and more widely used algorithm to estimate the pose of an object from non-corresponding points. Xia et al [21] enhances the evolutionary algorithms with a new efficient scheme: the candidate solution is evolved only when the offspring is better than the parent, so the survival probability of good pose offspring is increased, which will improve the efficiency These Genetic algorithms are accurate when the object points are not very close to each other, but it takes too much time during the evolution process from one generation to another, and the perspective projection model is not robust to the image noise.

CAMERA MODEL
CORRESPONDENCE DETERMINATION
POSE DETERMINATION
SOFTOI ALGORITHM FLOW
SIMULATIONS AND EXPERIMENTS RESULTS
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call