Wientapper, Folker ; Schmitt, Michael ; Fraissinet-Tachet, Matthieu ; Kuijper, Arjan (2018)
A universal, closed-form approach for absolute pose problems.
In: Computer Vision and Image Understanding, 173
doi: 10.1016/j.cviu.2018.04.006
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
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.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2018 |
| Autor(en): | Wientapper, Folker ; Schmitt, Michael ; Fraissinet-Tachet, Matthieu ; Kuijper, Arjan |
| Art des Eintrags: | Bibliographie |
| Titel: | A universal, closed-form approach for absolute pose problems |
| Sprache: | Englisch |
| Publikationsjahr: | 2018 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Computer Vision and Image Understanding |
| Jahrgang/Volume einer Zeitschrift: | 173 |
| DOI: | 10.1016/j.cviu.2018.04.006 |
| URL / URN: | https://doi.org/10.1016/j.cviu.2018.04.006 |
| Kurzbeschreibung (Abstract): | 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. |
| Freie Schlagworte: | Pose estimation, Simultaneous localization and mapping (SLAM), 2D/3D registration, Marker based tracking |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Mathematisches und angewandtes Visual Computing |
| Hinterlegungsdatum: | 19 Jun 2019 11:17 |
| Letzte Änderung: | 19 Jun 2019 11:17 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum