Name
Abstract | ||
|---|---|---|
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of camera pose estimation for calibrated cameras. While traditional methods may get trapped in local minima, due to the non-convexity of the problem, we have developed an approach that guarantees global optimality. The scheme is based on ideas from global optimization theory, in particular, convex under-estimators in combination with branch and bound. We provide a provably optimal algorithm and demonstrate good performance on both synthetic and real data. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICPR.2006.909 | ICPR (2) |
Keywords | Field | DocType |
traditional method,global optimization theory,optimal solution,global optimality,optimal estimation,good performance,efficient method,perspective camera pose,provably optimal algorithm,local minimum,convex under-estimators,pose estimation,motion estimation,computer vision,local minima,branch and bound,global optimization | Computer vision,Mathematical optimization,Branch and bound,Global optimization,Computer science,3D pose estimation,Optimal estimation,Regular polygon,Maxima and minima,Pose,Artificial intelligence,Motion estimation | Conference |
ISSN | ISBN | Citations |
1051-4651 | 0-7695-2521-0 | 12 |
PageRank | References | Authors |
1.30 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carl Olsson | 1 | 344 | 27.31 |
| Fredrik Kahl | 2 | 1415 | 92.61 |
| Magnus Oskarsson | 3 | 196 | 22.85 |