Marc Pollefeys, Petr Hruby, Timothy Duff
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 previouslystudied 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 stateof-the art, we may obtain nearly an order of magnitude speedup. The code is available at https://github. com/petrhruby97/efficient_absolute
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2404.16552")
get_code_for_paper("2404.16552")
have("2404.16552")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2404.16552.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2404.16552)
Connect an agent — have() is free.