The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Revisiting the PnP Problem: A Fast, General and Optimal Solution
Open accessAbstract
In this paper, we revisit the classical perspective-n-point (PnP) problem, and propose the first non-iterative O(n) solution that is fast, generally applicable and globally optimal. Our basic idea is to formulate the PnP problem into a functional minimization problem and retrieve all its stationary points by using the Gr"obner basis technique. The novelty lies in a non-unit quaternion representation to parameterize the rotation and a simple but elegant formulation of the PnP problem into an unconstrained optimization problem. Interestingly, the polynomial system arising from its first-order optimality condition assumes two-fold symmetry, a nice property that can be utilized to improve speed and numerical stability of a Grobner basis solver. Experiment results have demonstrated that, in terms of accuracy, our proposed solution is definitely better than the state-of-the-art O(n) methods, and even comparable with the reprojection error minimization method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
EPnP: An Accurate O(n) Solution to the PnP Problem
Lepetit, V., Moreno-Noguer, F., & Fua, P. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0152-6 · Cited by 3,298
Least-squares estimation of transformation parameters between two point patterns
Umeyama, S. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88573 · Cited by 2,420
(2005) · Graduate Texts in Mathematics · doi:10.1007/b138611 · Cited by 1,621
Complete solution classification for the perspective-three-point problem
Gao, X.-S., Hou, X.-R., Tang, J., & Cheng, H.-F. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1217599 · Cited by 976
Fast and globally convergent pose estimation from video images
Lu, C.-P., Hager, G. D., & Mjolsness, E. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862199 · Cited by 882
Linear N-point camera pose determination
Quan, L., & Lan, Z. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.784291 · Cited by 635
Kneip, L., Scaramuzza, D., & Siegwart, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995464 · Cited by 559
A Robust O(n) Solution to the Perspective-n-Point Problem
Li, S., Xu, C., & Xie, M. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.41 · Cited by 503
Linear pose estimation from points or lines
Ansar, A., & Daniilidis, K. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195992 · Cited by 434
A Direct Least-Squares (DLS) method for PnP
Hesch, J. A., & Roumeliotis, S. I. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126266 · Cited by 373
Robust Pose Estimation from a Planar Target
Schweighofer, G., & Pinz, A. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.252 · Cited by 363
Automatic Generator of Minimal Problem Solvers
Kukelova, Z., Bujnak, M., & Pajdla, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_23 · Cited by 247
Branch-and-Bound Methods for Euclidean Registration Problems
Olsson, C., Kahl, F., & Oskarsson, M. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.131 · Cited by 161
Optimal Algorithms in Multiview Geometry
Hartley, R. I., & Kahl, F. (2007) · Springer eBooks · doi:10.1007/978-3-540-76386-4_2 · Cited by 106
Solving the PnP Problem with Anisotropic Orthogonal Procrustes Analysis
Garro, V., Crosilla, F., & Fusiello, A. (2012) · International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission · doi:10.1109/3dimpvt.2012.40 · Cited by 93
Cited by
Pose estimation for augmented reality: a hands-on survey
Marchand, E., Uchiyama, H., & Spindler, F. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2513408 · Cited by 746
Segmentation-Driven 6D Object Pose Estimation
Hu, Y., Hugonot, J., Fua, P., & Salzmann, M. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00350 · Cited by 333
Automatic Extrinsic Calibration of a Camera and a 3D LiDAR Using Line and Plane Correspondences
Zhou, L., Li, Z., & Kaess, M. (2018) · 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8593660 · Cited by 308
Kimera: From SLAM to spatial perception with 3D dynamic scene graphs
Rosinol, A., Violette, A., Abate, M., Hughes, N., Chang, Y., Shi, J., Gupta, A., & Carlone, L. (2021) · The International Journal of Robotics Research · doi:10.1177/02783649211056674 · Cited by 271
Comparative assessment of techniques for initial pose estimation using monocular vision
Sharma, S., & D׳Amico, S. (2016) · Acta Astronautica · doi:10.1016/j.actaastro.2015.12.032 · Cited by 94
Metadata
- Authors
- Zheng, Y., Kuang, Y., Sugimoto, S., Astrom, K., & Okutomi, M.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- Pages
- 2344-2351
- OpenAlex
- W2142482451
- Cited by
- 358
- References
- 17
- FWCI
- 9.60
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.