Accurate Non-Iterative O(n) Solution to the PnP Problem

We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O(n5 ) or even O(n8 ), without being more accurate. Our method is applicable for all n 4 and handles properly both planar and non-planar configurations. Our central idea is to express the n 3D points as a weighted sum of four virtual control points. The problem then reduces to estimating the coordinates of these control points in the camera referential, which can be done in O(n) time by expressing these coordinates as weighted sum of the eigenvectors of a 12 ? 12 matrix and solving a small constant number of quadratic equations to pick the right weights. The advantages of our method are demonstrated by thorough testing on both synthetic and real-data.

• Type: Conference
• Year: 2007
• Where: ICCV
• Authors: Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fua
• Keywords: Computer Vision, Correspondences--whose Computational Complexity, ICCV 2007, PnP Problem--the Estimation, Small Constant Number, Virtual Control Points, Weighted Sum