en
0.25
0.5
0.75
1.25
1.5
1.75
2
A QCQP Approach to Triangulation
Published on Nov 12, 20124785 Views
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
Related categories
Chapter list
A QCQP Approach to Triangulation00:00
The Triangulation Problem00:07
Previous Work - 100:59
Previous Work - 201:06
Previous Work - 301:33
Previous Work - 401:49
Previous Work - 502:01
Unconstrained to Constrained - 102:16
Unconstrained to Constrained - 202:29
Unconstrained to Constrained - 302:38
Unconstrained to Constrained - 403:11
Unconstrained to Constrained - 503:21
Unconstrained to Constrained - 603:42
The Constraint Set - 104:00
The Constraint Set - 204:24
The Constraint Set - 304:42
The Constraint Set - 405:08
From QCQP to SDP - 105:22
From QCQP to SDP - 206:09
From QCQP to SDP - 306:32
From QCQP to SDP - 407:13
When Does QCQP = SDP? - 108:03
When Does QCQP = SDP? - 208:14
When Does QCQP = SDP? - 308:20
When Does QCQP = SDP? - 408:41
When Does QCQP = SDP? - 508:58
When Does QCQP = SDP? - 609:53
When Does QCQP = SDP? - 710:01
Synthetic - Cameras on Sphere10:08
Synthetic - Coplanar Cameras11:25
Synthetic - Collinear Cameras11:59
Real Data12:13
Summary of Our Contributions12:59