.png){kind=icon}
.png){kind=icon}
Return
Practical global optimization for multiview geometry
.png){kind=icon}
PRE
AI
DOI：10.1007/s11263-007-0117-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a practical method for finding the provably globally optimal solution to numerous problems in projective geometry including multiview triangulation, camera resectioning and homography estimation. Unlike traditional methods which may get trapped in local minima due to the non-convex nature of these problems, this approach provides a theoretical guarantee of global optimality. The formulation relies on recent developments in fractional programming and the theory of convex underestimators and allows a unified framework for minimizing the standard L(2)-norm of reprojection errors which is optimal under Gaussian noise as well as the more robust L(1)-norm which is less sensitive to outliers. Even though the worst case complexity of our algorithm is exponential, the practical efficacy is empirically demonstrated by good performance on experiments for both synthetic and real data. An open source MATLAB toolbox that implements the algorithm is also made available to facilitate further research.
Keywords:
global optimization
multiple view geometry
triangulation
geometry
reconstruction
cameras
camera pose
branch and bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.3
Papers:
3.9K
Citations:
2.8W
