The essential variety and degrees of minimal problems

Series
Student Algebraic Geometry Seminar
Time
Monday, September 30, 2019 - 1:15pm for 1 hour (actually 50 minutes)
Location
Skiles
Speaker
Tim Duff – GA Tech – https://timduff35.github.io/timduff35/
Organizer
Trevor Gunn / Cvetelina Hill

It is a fundamental problem in computer vision to describe the geometric relations between two or more cameras that view the same scene -- state of the art methods for 3D reconstruction incorporate these geometric relations in a nontrivial way. At the center of the action is the essential variety: an irreducible subvariety of P^8 of dimension 5 and degree 10 whose homogeneous ideal is minimal generated by 10 cubic equations. Taking a linear slice of complementary dimension corresponds to solving the "minimal problem" of 5 point relative pose estimation. Viewed algebraically, this problem has 20 solutions for generic data: these solutions are elements of the special Euclidean group SE(3) which double cover a generic slice of the essential variety. The structure of these 20 solutions is governed by a somewhat mysterious Galois group (ongoing work with Regan et. al.)

We may ask: what other minimal problems are out there? I'll give an overview of work with Kohn, Pajdla, and Leykin on this question. We have computed the degrees of many minimal problems via computer algebra and numerical methods. I am inviting algebraic geometers at large to attack these problems with "pen and paper" methods: there is still a wide class of problems to be considered, and the more tools we have, the better.