Margaret Regan: A complete error analysis on solving an overdetermined system in computer vision using linear algebra

Abstract

Many problems in computer vision are represented using a parametrized overdetermined system of polynomials which must be solved quickly and efficiently. Classical methods for solving these systems involve specialized solvers based on Gröbner basis techniques or utilize randomization in order to create well-constrained systems for numerical techniques. We propose new methods in numerical linear algebra for solving such overdetermined polynomial systems and provide a complete error analysis showing that the numerical approach is stable. Examples will be provided to show the efficacy of the method and how the error in the data affects the error in the solution.

This is joint work with Jonathan Hauenstein.