A universal, closed-form approach for absolute pose problems

被引:7
|
作者
Wientapper F. [1 ,2 ]
Schmitt M. [1 ]
Fraissinet-Tachet M. [1 ]
Kuijper A. [1 ,3 ]
机构
[1] VRAR, Fraunhofer IGD, Fraunhoferstr. 5, Darmstadt
[2] Visometry GmbH, Fraunhoferstr. 5, Darmstadt
[3] MAVC, TU Darmstadt, Fraunhoferstr. 5, Darmstadt
关键词
3D registration; Absolute orientation; Absolute pose; Gröbner basis; Perspective-n-line problem; Perspective-n-point problem;
D O I
10.1016/j.cviu.2018.04.006
中图分类号
学科分类号
摘要
We propose a general approach for absolute pose problems including the well known perspective-n-point (PnP) problem, its generalized variant (GPnP) with and without scale, and the pose from 2D line correspondences (PnL). These have received a tremendous attention in the computer vision community during the last decades. However, it was only recently that efficient, globally optimal, closed-form solutions have been proposed, which can handle arbitrary numbers of correspondences including minimal configurations as well as over-constrained cases with linear complexity. We follow the general scheme by eliminating the linear parameters first, which results in a least squares error function that only depends on the non-linear rotation and a small symmetric coefficient matrix of fixed size. Then, in a second step the rotation is solved with algorithms which are derived using methods from algebraic geometry such as the Gröbner basis method. We propose a unified formulation based on a representation with orthogonal complements which allows to combine different types of constraints elegantly in one single framework. We show that with our unified formulation existing polynomial solvers can be interchangeably applied to problem instances other than those they were originally proposed for. It becomes possible to compare them on various registrations problems with respect to accuracy, numerical stability, and computational speed. Our compression procedure not only preserves linear complexity, it is even faster than previous formulations. For the second step we also derive an own algebraic equation solver, which can additionally handle the registration from 3D point-to-point correspondences, where other rotation solvers fail. Finally, we also present a marker-based SLAM approach with automatic registration to a target coordinate system based on partial and distributed reference information. It represents an application example that goes beyond classical camera pose estimation from image measurements and also serves for evaluation on real data. © 2018 Elsevier Inc.
引用
收藏
页码:57 / 75
页数:18
相关论文
共 50 条
  • [41] A new closed-form thermodynamic approach for radiative strength functions
    Plujko, VA
    ACTA PHYSICA POLONICA B, 2000, 31 (02): : 435 - 441
  • [43] Closed-Form Representations of Friction
    Huang, Jin
    Li, Xingyu
    Li, Huiqian
    Chen, Ye-Hwa
    Zhong, Zhihua
    IEEE ACCESS, 2021, 9 : 31287 - 31296
  • [44] Closed-Form Expressions for the n-Queens Problem and Related Problems
    Pratt, Kevin
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2019, 2019 (04) : 1098 - 1107
  • [45] CLOSED-FORM SOLUTIONS TO A CLASS OF H-INFINITY-OPTIMIZATION PROBLEMS
    SABERI, A
    CHEN, BM
    LIN, ZL
    INTERNATIONAL JOURNAL OF CONTROL, 1994, 60 (01) : 41 - 70
  • [46] What is a closed-form number?
    Chow, TY
    AMERICAN MATHEMATICAL MONTHLY, 1999, 106 (05): : 440 - 448
  • [47] Closed-form shock solutions
    Johnson, B. M.
    JOURNAL OF FLUID MECHANICS, 2014, 745 : R1
  • [48] Pattern Learning in Closed-Form
    Toh, Kar-Ann
    2016 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA), 2016,
  • [49] CLOSED-FORM IMPLICIT SUMMATION
    LUGER, AD
    ROBINSON, EJ
    BULLETIN OF THE AMERICAN PHYSICAL SOCIETY, 1969, 14 (10): : 938 - &
  • [50] CLOSED-FORM SOLUTIONS OF PERFORMABILITY
    MEYER, JF
    IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (07) : 648 - 657