Algebra and Geometry of Camera Resectioning
Not on the map. Why?
Abstract (arXiv)
We study algebraic varieties associated with the camera resectioning problem. We characterize these resectioning varieties' multigraded vanishing ideals using Gr"obner basis techniques. As an application, we derive and re-interpret celebrated results in geometric computer vision related to camera-point duality. We also clarify some relationships between the classical problems of optimal resectioning and triangulation, state a conjectural formula for the Euclidean distance degree of the resectioning variety, and discuss how this conjecture relates to the recently-resolved multiview conjecture.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 41 references that are in the map. First posted on arXiv 7 Sep 2023.
Builds on
8 of 41 references.
References · 8
- 2018Beyond Gr"obner Bases: Basis Selection for Minimal Solverscited by 25
- 2019PLMP -- Point-Line Minimal Problems in Complete Multi-View Visibilitycited by 18
- 2020PL1P -- Point-line Minimal Problems under Partial Visibility in Three Viewscited by 16
- 2013The Euclidean distance degree of an algebraic varietycited by 15
- 2021Galois/monodromy groups for decomposing minimal problems in 3D reconstructioncited by 12
- 2022Snapshot of Algebraic Visioncited by 9
- 2019A convex relaxation to compute the nearest structured rank deficient matrixcited by 7
- 2022An Atlas for the Pinhole Cameracited by 5
Built on by
Citing papers per year: 2025: 2.
2 papers.
- 2025Numerically Computing Galois Groups of Minimal Problemscited by 0
- 2025Universal Gr"obner Bases of (Universal) Multiview Idealscited by 0
- 2025Universal Gr"obner Bases of (Universal) Multiview Ideals15 Sep 2025
- 2025Numerically Computing Galois Groups of Minimal Problems14 Jul 2025