Average degree of the essential variety
Paul Breiding, Samantha Fairchild, Pierpaola Santarsiero and, Elima Shehu

TL;DR
This paper computes the expected number of real solutions when intersecting a linear space with the essential variety in computer vision, revealing an average of about 4 real solutions under certain distributions.
Contribution
It provides the first expected value calculations for real intersection points of the essential variety with random linear spaces, relevant for 3D reconstruction.
Findings
Expected real intersection points under orthogonal invariance: 4
Monte Carlo estimates for computer vision distribution: approximately 3.95
Results inform the likelihood of real solutions in 3D pose estimation
Abstract
The essential variety is an algebraic subvariety of dimension in real projective space which encodes the relative pose of two calibrated pinhole cameras. The -point algorithm in computer vision computes the real points in the intersection of the essential variety with a linear space of codimension . The degree of the essential variety is , so this intersection consists of 10 complex points in general. We compute the expected number of real intersection points when the linear space is random. We focus on two probability distributions for linear spaces. The first distribution is invariant under the action of the orthogonal group acting on linear spaces in . In this case, the expected number of real intersection points is equal to . The second distribution is motivated from computer vision and is defined by…
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
TopicsImage and Object Detection Techniques · Advanced Vision and Imaging · Image Processing Techniques and Applications
