ML Anthology

A Practical Algorithm for L Triangulation with Outliers

Hongdong Li
CVPR 2007
doi:10.1109/CVPR.2007.383068 /cvpr/2007/li2007cvpr-practical/

Abstract

This paper addresses the problem of robust optimal multi-view triangulation. We propose an abstract framework, as well as a practical algorithm, which finds the best 3D reconstruction with guaranteed global optimality even in the presence of outliers. Our algorithm is founded on the theory of LP-type problem. We have recognized that the L∞ triangulation is a concrete example of the LP-type problems. We propose a set of non-trivial basis operation subroutines that actually implement the idea. Experiments have validated the effectiveness and efficiency of the proposed algorithm.

CVPR Semantic Scholar

Cite

Text

Li. "A Practical Algorithm for L Triangulation with Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2007. doi:10.1109/CVPR.2007.383068

Markdown

[Li. "A Practical Algorithm for L Triangulation with Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2007.](https://mlanthology.org/cvpr/2007/li2007cvpr-practical/) doi:10.1109/CVPR.2007.383068

BibTeX

@inproceedings{li2007cvpr-practical,
  title     = {{A Practical Algorithm for L Triangulation with Outliers}},
  author    = {Li, Hongdong},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2007},
  doi       = {10.1109/CVPR.2007.383068},
  url       = {https://mlanthology.org/cvpr/2007/li2007cvpr-practical/}
}