Efficient Solution of Point-Line Absolute Pose

Petr Hruby, Timothy Duff, M. Pollefeys
2/9/2026

No official code found. Best implementation: petrhruby97/efficient_absolute (40 stars, last commit 2024-04-25).

Abstract

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\in\{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 $\geq 4$ (univariate) polynomials when $p=2$, or degree $\geq 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 https://github.com/petrhruby97/efficient_absolute

View on arXivView PDF

Code Implementations(1)

A repository for paper "Efficient Solution of Point-Line Absolute Pose" by P.Hruby, T.Duff, and M. Pollefeys, presented at CVPR 2024.

405C, C++Mar 28, 20242 years ago

Similar Papers

Cite this paper

@article{hruby2026efficient,
  title  = {Efficient Solution of Point-Line Absolute Pose},
  author = {Petr Hruby and Timothy Duff and M. Pollefeys},
  year   = {2026},
  eprint = {2404.16552},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2404.16552},
  journal = {CVPR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.16552.svg)](https://codeofpaper.com/paper/2404.16552)

Discussion