@inproceedings{b704739002454159b555d66924452699,
title = "UPnP: An optimal O(n) solution to the absolute pose problem with universal applicability",
abstract = "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. We compare our result to state-of-the-art minimal, non-minimal, central, and non-central PnP algorithms, and demonstrate universal applicability, competitive noise resilience, and superior computational efficiency. Our algorithm is called Unified PnP (UPnP).",
keywords = "DLS, Generalized absolute pose, Non-perspective PnP, PnP, geometric optimality, global optimality, linear complexity",
author = "Laurent Kneip and Hongdong Li and Yongduek Seo",
year = "2014",
doi = "10.1007/978-3-319-10590-1\_9",
language = "English",
isbn = "9783319105895",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
number = "PART 1",
pages = "127--142",
booktitle = "Computer Vision, ECCV 2014 - 13th European Conference, Proceedings",
address = "Germany",
edition = "PART 1",
note = "13th European Conference on Computer Vision, ECCV 2014 ; Conference date: 06-09-2014 Through 12-09-2014",
}