A QCQP Approach to Triangulation
From MaRDI portal
Publication:6234752
arXiv1207.7160MaRDI QIDQ6234752
Author name not available (Why is that?)
Publication date: 31 July 2012
Abstract: Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying 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.
Has companion code repository: https://github.com/linusnie/robust-triangulation-relaxations
This page was built for publication: A QCQP Approach to Triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234752)