Fast Algorithms for Projective Multi-Frame Structure from Motion

Abstract

We describe new algorithms for multi-frame structure from motion from tracked point features. The algorithms are essentially linear and give accuracies similar to those of a maximum-likelihood estimate. For the common situations where the calibration is fixed and approximately known, we experimentally compare the fully projective versions of our algorithms to mixed projective/Euclidean strategies. Our theoretical results clarify the nature of dominant-plane compensation and the effect of calibration error on translation recovery.

Cite

Text

Oliensis and Genc. "Fast Algorithms for Projective Multi-Frame Structure from Motion." IEEE/CVF International Conference on Computer Vision, 1999. doi:10.1109/ICCV.1999.791269

Markdown

[Oliensis and Genc. "Fast Algorithms for Projective Multi-Frame Structure from Motion." IEEE/CVF International Conference on Computer Vision, 1999.](https://mlanthology.org/iccv/1999/oliensis1999iccv-fast-a/) doi:10.1109/ICCV.1999.791269

BibTeX

@inproceedings{oliensis1999iccv-fast-a,
  title     = {{Fast Algorithms for Projective Multi-Frame Structure from Motion}},
  author    = {Oliensis, John and Genc, Yakup},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1999},
  pages     = {536-543},
  doi       = {10.1109/ICCV.1999.791269},
  url       = {https://mlanthology.org/iccv/1999/oliensis1999iccv-fast-a/}
}