Factorization with Erroneous Data
Henrik Aanæs, Rune Vincents Fisker, Kalle Åström, Jens Michael Carstensen · 2002
Factorization algorithms for recovering structure and motion from an image stream have many advantages, but traditionally requires a set of well tracked feature points. This limits the usability since, correctly tracked feature points are not available in general. There is thus a need to make factorization algorithms deal successfully with incorrectly tracked feature points. We propose a new computationally efficient algorithm for applying an arbitrary error function in the factorization scheme, and thereby enable the use of robust statistical techniques and arbitrary noise models for individual feature points. These techniques and models effectively deal with feature point noise as well as feature mismatch and missing features. Furthermore, the algorithm includes a new method for Euclidean reconstruction that experimentally shows a significant improvement in convergence of the factorization algorithms. The proposed algorithm has been implemented in the Christy–Horaud factorization scheme and the results clearly illustrate a considerable increase in error tolerance. 1