Skip navigation
Skip navigation

UPnP: An optimal O(n) solution to the absolute pose problem with universal applicability

Kneip, Laurent; Li, Hongdong; Seo, Yongduek


A large number of absolute pose algorithms have been presented in the literature. Common performance criteria are computational complexity, geometric optimality, global optimality, structural degeneracies, and the number of solutions. The ability to handle minimal sets of correspondences, resulting solution multiplicity, and generalized cameras are further desirable properties. This paper presents the first PnP solution that unifies all the above desirable properties within a single algorithm....[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-10590-1_9


File Description SizeFormat Image
01_Kneip_UPnP:_An_optimal_O(n)_solution_2014.pdf725.4 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator