video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

A QCQP Approach to Triangulation

Published on Feb 4, 20254796 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

Presentation

A QCQP Approach to Triangulation00:00
The Triangulation Problem02:07:04
Previous Work - 326:00:26
Previous Work - 430:24:03
Previous Work - 533:46:06
Unconstrained to Constrained - 138:01:42
Unconstrained to Constrained - 241:33:23
Unconstrained to Constrained - 344:09:10
Unconstrained to Constrained - 453:16:53
Unconstrained to Constrained - 555:57:24
Unconstrained to Constrained - 661:55:46
The Constraint Set - 166:54:12
The Constraint Set - 273:29:42
The Constraint Set - 378:22:35
The Constraint Set - 485:43:44
From QCQP to SDP - 189:43:14
From QCQP to SDP - 2102:39:33
From QCQP to SDP - 3109:01:49
From QCQP to SDP - 4120:23:02
When Does QCQP = SDP? - 1134:21:52
When Does QCQP = SDP? - 2137:17:26
When Does QCQP = SDP? - 3138:53:22
When Does QCQP = SDP? - 4144:52:59
When Does QCQP = SDP? - 5149:41:56
When Does QCQP = SDP? - 6164:50:52
When Does QCQP = SDP? - 7167:04:55
Synthetic - Cameras on Sphere168:59:18
Synthetic - Coplanar Cameras190:27:22
Synthetic - Collinear Cameras199:58:58
Summary of Our Contributions216:35:57