A novel linear algorithm for P5P problem

Perspective-five-point (P5P) problem is a classical problem in applied mathematics, pattern recognition and computer vision. We briefly survey several existing algorithms for the problem, and present a new linear algorithm (CSNM algorithm) to solve the P5P problem, which is based on a symbolic-numeric method from the geometric theory of partial differential equations. The proposed algorithm is stable robust. In particular, it can deal with the points near critical configurations. Numerical experiments are given to show the performance of our novel algorithm. (C) 2008 Elsevier Inc. All rights reserved.

[1]  H. M. Möller,et al.  Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems , 1995 .

[2]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[3]  Yuri A. Blinkov,et al.  Involutive bases of polynomial ideals , 1998, math/9912027.

[4]  J. Tuomela,et al.  On the numerical solution of involutive ordinary differential systems , 2000 .

[5]  Wu Fu.  A Study on the P5P Problem , 2001 .

[6]  Mongi A. Abidi,et al.  A New Efficient and Direct Solution for Pose Estimation Using Quadrangular Targets: Algorithm and Evaluation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  B. Triggs,et al.  Camera Pose Revisited -- New Linear Algorithms , 2000 .

[8]  Wenjun Wu.  On the Construction of Groebner Basis of a Polynomial Ideal Based on Riquier—Janet Theory , 2005 .

[9]  Jianliang Tang,et al.  Complete Solution Classification for the Perspective-Three-Point Problem , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  M. Kuranishi.  ON E. CARTAN'S PROLONGATION THEOREM OF EXTERIOR DIFFERENTIAL SYSTEMS.* , 1957 .

[11]  Bernhard P. Wrobel.  Minimum Solutions for Orientation , 2001 .

[12]  Werner M. Seiler,et al.  Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra , 2009, Algorithms and computation in mathematics.

[13]  G. Reid,et al.  Fast differential elimination in C: The CDiffElim environment ? ? This program can be downloaded fro , 2001 .

[14]  Gene H. Golub,et al.  Matrix computations , 1983 .

[15]  Zhanyi Hu,et al.  A Note on the Number of Solutions of the Noncoplanar P4P Problem , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  J. Pommaret.  Systems of partial differential equations and Lie pseudogroups , 1978 .

[17]  Andrew J. Sommese,et al.  Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components , 2000, SIAM J. Numer. Anal..

[18]  Bernard Mourrain,et al.  Computing the Isolated Roots by Matrix Methods , 1998, J. Symb. Comput..

[19]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[20]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[21]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using orthonormal matrices , 1988 .

[22]  Lihong Zhi,et al.  A complete symbolic-numeric linear method for camera pose determination , 2003, ISSAC '03.

[23]  Dongming Wang,et al.  Elimination Methods , 2001, Texts and Monographs in Symbolic Computation.

[24]  Jianliang Tang,et al.  On the Probability of the Number of Solutions for the P4P Problem , 2006, Journal of Mathematical Imaging and Vision.

[25]  G. Reid,et al.  Differential Elimination–Completion Algorithms for DAE and PDAE , 2001 .

[26]  Long Quan,et al.  Linear N-Point Camera Pose Determination , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Robert M. Haralick,et al.  Analysis and solutions of the three point perspective pose estimation problem , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[28]  Lihong Zhi,et al.  Solving Nonlinear Polynomial Systems via Symbolic-Numeric Elimination Method , 2004 .