Very Fast Solution to the PnP Problem with Algebraic Outlier Rejection

Luis Ferraz, Xavier Binefa, Francesc Moreno-Noguer; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 501-508

Abstract


We propose a real-time, robust to outliers and accurate solution to the Perspective-n-Point (PnP) problem. The main advantages of our solution are twofold: first, it in- tegrates the outlier rejection within the pose estimation pipeline with a negligible computational overhead; and sec- ond, its scalability to arbitrarily large number of correspon- dences. Given a set of 3D-to-2D matches, we formulate pose estimation problem as a low-rank homogeneous sys- tem where the solution lies on its 1D null space. Outlier correspondences are those rows of the linear system which perturb the null space and are progressively detected by projecting them on an iteratively estimated solution of the null space. Since our outlier removal process is based on an algebraic criterion which does not require computing the full-pose and reprojecting back all 3D points on the image plane at each step, we achieve speed gains of more than 100 compared to RANSAC strategies. An extensive exper- imental evaluation will show that our solution yields accu- rate results in situations with up to 50% of outliers, and can process more than 1000 correspondences in less than 5ms.

Related Material


[pdf]
[bibtex]
@InProceedings{Ferraz_2014_CVPR,
author = {Ferraz, Luis and Binefa, Xavier and Moreno-Noguer, Francesc},
title = {Very Fast Solution to the PnP Problem with Algebraic Outlier Rejection},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}