CPnP: Consistent Pose Estimator for Perspective-n-Point Problem with Bias Elimination
Not on the map. Why?
Abstract (arXiv)
The Perspective-n-Point (PnP) problem has been widely studied in both computer vision and photogrammetry societies. With the development of feature extraction techniques, a large number of feature points might be available in a single shot. It is promising to devise a consistent estimator, i.e., the estimate can converge to the true camera pose as the number of points increases. To this end, we propose a consistent PnP solver, named CPnP, with bias elimination. Specifically, linear equations are constructed from the original projection model via measurement model modification and variable elimination, based on which a closed-form least-squares solution is obtained. We then analyze and subtract the asymptotic bias of this solution, resulting in a consistent estimate. Additionally, Gauss-Newton (GN) iterations are executed to refine the consistent solution. Our proposed estimator is efficient in terms of computations -- it has O(n) computational complexity. Experimental tests on both synthetic data and real images show that our proposed estimator is superior to some well-known ones for images with dense visual features, in terms of estimation precision and computing time.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 6 of its 34 references that are in the map. First posted on arXiv 13 Sep 2022.
Builds on
6 of 34 references.
References · 6
- 2017VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimatorcited by 423
- 20176-DoF Object Pose from Semantic Keypointscited by 89
- 2019Camera-to-Robot Pose Estimation from a Single Imagecited by 48
- 2021Uncertainty-Aware Camera Pose Estimation from Points and Linescited by 17
- 2016MLPnP - A Real-Time Maximum Likelihood Solution to the Perspective-n-Point Problemcited by 13
- 2017Backtracking Regression Forests for Accurate Camera Relocalizationcited by 10
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.