DocumentCode :
2954312
Title :
A Direct Least-Squares (DLS) method for PnP
Author :
Hesch, Joel A. ; Roumeliotis, Stergios I.
Author_Institution :
Univ. of Minnesota, Minneapolis, MN, USA
fYear :
2011
fDate :
6-13 Nov. 2011
Firstpage :
383
Lastpage :
390
Abstract :
In this work, we present a Direct Least-Squares (DLS) method for computing all solutions of the perspective-n-point camera pose determination (PnP) problem in the general case (n ≥ 3). Specifically, based on the camera measurement equations, we formulate a nonlinear least-squares cost function whose optimality conditions constitute a system of three third-order polynomials. Subsequently, we employ the multiplication matrix to determine all the roots of the system analytically, and hence all minima of the LS, without requiring iterations or an initial guess of the parameters. A key advantage of our method is scalability, since the order of the polynomial system that we solve is independent of the number of points. We compare the performance of our algorithm with the leading PnP approaches, both in simulation and experimentally, and demonstrate that DLS consistently achieves accuracy close to the Maximum-Likelihood Estimator (MLE).
Keywords :
least squares approximations; matrix algebra; maximum likelihood estimation; polynomial approximation; pose estimation; PnP approaches; camera measurement equations; direct least-squares method; maximum-likelihood estimator; multiplication matrix; nonlinear least-squares cost function; optimality conditions; perspective-n-point camera pose determination problem; third-order polynomials; Cameras; Cost function; Mathematical model; Matrix decomposition; Noise measurement; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision (ICCV), 2011 IEEE International Conference on
Conference_Location :
Barcelona
ISSN :
1550-5499
Print_ISBN :
978-1-4577-1101-5
Type :
conf
DOI :
10.1109/ICCV.2011.6126266
Filename :
6126266
Link To Document :
بازگشت