Minimal Problems for the Calibrated Trifocal Variety
Joe Kileel
TL;DR
This paper calculates the algebraic degree of minimal problems related to the calibrated trifocal variety in computer vision using numerical algebraic geometry and homotopy continuation methods.
Contribution
It introduces a method to determine the algebraic degree of minimal problems in the calibrated trifocal variety using advanced numerical techniques.
Findings
Algebraic degree of minimal problems determined
Application of Bertini software for computations
Enhanced understanding of trifocal variety properties
Abstract
We determine the algebraic degree of minimal problems for the calibrated trifocal variety in computer vision. We rely on numerical algebraic geometry and the homotopy continuation software Bertini.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Advanced Vision and Imaging · Polynomial and algebraic computation