Efficient Solution of Point-Line Absolute Pose
Not on the map. Why?
Abstract (arXiv)
We revisit certain problems of pose estimation based on 3D--2D correspondences between features which may be points or lines. Specifically, we address the two previously-studied minimal problems of estimating camera extrinsics from p ∈ 1, 2 point--point correspondences and l=3-p line--line correspondences. To the best of our knowledge, all of the previously-known practical solutions to these problems required computing the roots of degree ≥ 4 (univariate) polynomials when p=2, or degree ≥ 8 polynomials when p=1. We describe and implement two elementary solutions which reduce the degrees of the needed polynomials from 4 to 2 and from 8 to 4, respectively. We show experimentally that the resulting solvers are numerically stable and fast: when compared to the previous state-of-the art, we may obtain nearly an order of magnitude speedup. The code is available at urlhttps://github.com/petrhruby97/efficientabsolute
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 32 references that are in the map. First posted on arXiv 25 Apr 2024.
Builds on
6 of 32 references.
References · 6
- 2023GlueStick: Robust Image Matching by Sticking Points and Lines Togethercited by 65
- 2022DeepLSD: Line Segment Detection and Refinement with Deep Image Gradientscited by 58
- 20233D Line Mapping Revisitedcited by 39
- 20173D Visual Perception for Self-Driving Cars using a Multi-Camera System: Calibration, Mapping, Localization, and Obstacle Detectioncited by 35
- 2019CvxPnPL: A Unified Convex Solution to the Absolute Pose Estimation Problem from Point and Line Correspondencescited by 12
- 2021Galois/monodromy groups for decomposing minimal problems in 3D reconstructioncited by 12
Built on by
Citing papers per year: 2026: 1.
1 paper.