资源分类
》 资源 》论文》A QCQP Approach to Triangulation

A QCQP Approach to Triangulation

2020-04-02 | |  68 |   34 |   0

Abstract

Triangulation of a three-dimensional point from n ? 2 two- dimensional images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solu- tions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for cer- tifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation problem.

上一篇：Information Theoretic Learning for Pixel-Based Visual Agents

下一篇：Robust Fitting for Multiple View Geometry

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...