A novel linear algorithm for P5P problem

被引:39
作者
Tang, Jianliang [1 ,2 ]
Chen, Wen-Sheng [1 ]
Wang, Jie [3 ]
机构
[1] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100080, Peoples R China
[3] Beijing Univ Technol, Coll Comp Sci & Technol, Key Lab Multimedia & Intelligent Software, Beijing 100022, Peoples R China
基金
中国国家自然科学基金;
关键词
Perspective-five-point (P5P) problem; Critical configurations; Numerical linear algebra; Numeric elimination; Involutive bases; Numeric jet geometry;
D O I
10.1016/j.amc.2008.05.037
中图分类号
O29 [应用数学];
学科分类号
070104 [应用数学];
摘要
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.
引用
收藏
页码:628 / 634
页数:7
相关论文
共 27 条
[1]
A NEW EFFICIENT AND DIRECT SOLUTION FOR POSE ESTIMATION USING QUADRANGULAR TARGETS - ALGORITHM AND EVALUATION [J].
ABIDI, MA ;
CHANDRA, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (05) :534-538
[2]
AMELLER MA, 2002, P RFIA 02
[3]
[Anonymous], BASIC PRINCIPLES MEC
[4]
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY [J].
FISCHLER, MA ;
BOLLES, RC .
COMMUNICATIONS OF THE ACM, 1981, 24 (06) :381-395
[5]
On the probability of the number of solutiong for the P4P problem [J].
Gao, Xiao-Shan ;
Tang, Jianliang .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2006, 25 (01) :79-86
[6]
Complete solution classification for the Perspective-Three-Point problem [J].
Gao, XS ;
Hou, XR ;
Tang, JL ;
Cheng, HF .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (08) :930-943
[7]
Involutive bases of polynomial ideals [J].
Gerdt, VP ;
Blinkov, YA .
MATHEMATICS AND COMPUTERS IN SIMULATION, 1998, 45 (5-6) :519-541
[8]
Golub G. H., 1996, MATRIX COMPUTATIONS
[9]
Haralick R. M., 1991, Proceedings 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (91CH2983-5), P592, DOI 10.1109/CVPR.1991.139759
[10]
CLOSED-FORM SOLUTION OF ABSOLUTE ORIENTATION USING ORTHONORMAL MATRICES [J].
HORN, BKP ;
HILDEN, HM ;
NEGAHDARIPOUR, S .
JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1988, 5 (07) :1127-1135