2020
DOI: 10.1007/978-3-030-58452-8_28
|View full text |Cite
|
Sign up to set email alerts
|

A Consistently Fast and Globally Optimal Solution to the Perspective-n-Point Problem

Abstract: An approach for estimating the pose of a camera given a set of 3D points and their corresponding 2D image projections is presented. It formulates the problem as a non-linear quadratic program and identifies regions in the parameter space that contain unique minima with guarantees that at least one of them will be the global minimum. Each regional minimum is computed with a sequential quadratic programming scheme. These premises result in an algorithm that always determines the global minima of the perspective-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 68 publications
(23 citation statements)
references
References 47 publications
0
23
0
Order By: Relevance
“…Once the initial place is retrieved, our method proceeds with the actual 6-DoF localization, which is based on a Perspective-n-Point (PnP) solver [43]. The goal is to find the camera pose that, given a set of 3D points, minimizes the reprojection error of the 2D points in the camera plane.…”
Section: -Dof Visual Localizationmentioning
confidence: 99%
“…Once the initial place is retrieved, our method proceeds with the actual 6-DoF localization, which is based on a Perspective-n-Point (PnP) solver [43]. The goal is to find the camera pose that, given a set of 3D points, minimizes the reprojection error of the 2D points in the camera plane.…”
Section: -Dof Visual Localizationmentioning
confidence: 99%
“…The method is thus based on finding the point where the transformation is best estimated and using only this local information to constrain the pose. The SQPnP (sequential quadratic PnP) algorithm [74] formulates the PnP problem as a nonlinear quadratic program and identifies regions in the parameter space that contain unique minima. This guarantees that at least one of them is the global minimum.…”
Section: Pnp Algorithmsmentioning
confidence: 99%
“…There has been sufficient research on the design, detection, and decoding processes of visual fiducial markers, such as ARTag [15], ArUco 3 [16], and AprilTag 3 [17]. For tag-based pose estimation problem, also named as Solve Pose from n Points (SolvePnP) problem, many algorithms have been proposed and integrated into the OpenCV library, such as EPnP [18], IPPE [19], and SQPnP [20]. The motivation is to design an inexpensive localization method for indoor AR robotics systems, and hence the tag-based approach is chosen in this work.…”
Section: Related Workmentioning
confidence: 99%