A practical algorithm for L∞ triangulation with outliers

Hongdong Li

doi:10.1109/CVPR.2007.383068

A practical algorithm for L_∞ triangulation with outliers

Hongdong Li^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

56 Citations (Scopus)

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.

Original language	English
Title of host publication	2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07
DOIs	https://doi.org/10.1109/CVPR.2007.383068
Publication status	Published - 2007
Event	2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07 - Minneapolis, MN, United States Duration: 17 Jun 2007 → 22 Jun 2007

Publication series

Name	Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
ISSN (Print)	1063-6919

Conference

Conference	2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07
Country/Territory	United States
City	Minneapolis, MN
Period	17/06/07 → 22/06/07

Access to Document

10.1109/CVPR.2007.383068

Cite this

@inproceedings{844b350b7d254155959ade8263ae9380,

title = "A practical algorithm for L∞ triangulation with outliers",

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.",

author = "Hongdong Li",

year = "2007",

doi = "10.1109/CVPR.2007.383068",

language = "English",

isbn = "1424411807",

series = "Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition",

booktitle = "2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07",

note = "2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07 ; Conference date: 17-06-2007 Through 22-06-2007",

}

Li, H 2007, A practical algorithm for L_∞ triangulation with outliers. in 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07., 4270093, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07, Minneapolis, MN, United States, 17/06/07. https://doi.org/10.1109/CVPR.2007.383068

A practical algorithm for L_∞ triangulation with outliers. / Li, Hongdong.
2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07. 2007. 4270093 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A practical algorithm for L∞ triangulation with outliers

AU - Li, Hongdong

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34948860607&partnerID=8YFLogxK

U2 - 10.1109/CVPR.2007.383068

DO - 10.1109/CVPR.2007.383068

M3 - Conference contribution

SN - 1424411807

SN - 9781424411801

T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

BT - 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07

T2 - 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07

Y2 - 17 June 2007 through 22 June 2007

ER -