How Hard Is 3-View Triangulation Really?
Abstract
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maximum likelihood) objective function. Internally, the solution is found by computing roots of multivariate polynomial equations, directly solving the conditions for stationarity. The solver makes use of standard methods from computational commutative algebra to convert the root-finding problem into a 47
Cite
Text
Stewénius et al. "How Hard Is 3-View Triangulation Really?." IEEE/CVF International Conference on Computer Vision, 2005. doi:10.1109/ICCV.2005.115Markdown
[Stewénius et al. "How Hard Is 3-View Triangulation Really?." IEEE/CVF International Conference on Computer Vision, 2005.](https://mlanthology.org/iccv/2005/stewenius2005iccv-hard/) doi:10.1109/ICCV.2005.115BibTeX
@inproceedings{stewenius2005iccv-hard,
title = {{How Hard Is 3-View Triangulation Really?}},
author = {Stewénius, Henrik and Schaffalitzky, Frederik and Nistér, David},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2005},
pages = {686-693},
doi = {10.1109/ICCV.2005.115},
url = {https://mlanthology.org/iccv/2005/stewenius2005iccv-hard/}
}