三角测量的QCQP方法A QCQP Approach to Triangulation |
|
课程网址: | http://videolectures.net/eccv2012_aholt_triangulation/ |
主讲教师: | Chris Aholt, Jean Ponce, Tomas Pajdla |
开课单位: | 华盛顿大学 |
开课时间: | 2012-11-12 |
课程语种: | 英语 |
中文简介: | 可以将来自n≥2个二维图像的三维点的三角剖分公式化为二次约束的二次规划。我们提出了一种算法,从其半定规划松弛中提取候选解决方案。然后,我们描述了足够的条件和多项式时间测试,以证明何时这种解决方案是最优的。该测试没有误报。实验表明,假阴性是罕见的,该算法在实践中具有优异的性能。我们根据三角测量问题的几何形状来解释这种现象。 |
课程简介: | 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 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. |
关 键 词: | 二维图像; 三角剖分; 三角测量 |
课程来源: | 视频讲座网 |
最后编审: | 2020-06-29:cxin |
阅读次数: | 96 |