Projective Least-Squares: Global Solutions with Local Optimization
Abstract
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efficiency. On the other hand, traditional bundle adjustment algorithms have been found to provide good solutions even though there may be multiple local minima. In this paper we justify this observation by giving a simple sufficient condition for global optimality that can be used to verify that a solution obtained from any local method is indeed global. The method is tested on numerous problem instances of both synthetic and real data sets. In the vast majority of cases we are able to verify that the solutions are optimal, in particular for small-scale problems. We also develop a branch and bound procedure that goes beyond verification. In cases where the sufficient condition does not hold, the algorithm returns either of the following two results: (i) a certificate of global optimality for the local solution or (ii) the global solution.
Cite
Text
Olsson et al. "Projective Least-Squares: Global Solutions with Local Optimization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2009. doi:10.1109/CVPR.2009.5206864Markdown
[Olsson et al. "Projective Least-Squares: Global Solutions with Local Optimization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2009.](https://mlanthology.org/cvpr/2009/olsson2009cvpr-projective/) doi:10.1109/CVPR.2009.5206864BibTeX
@inproceedings{olsson2009cvpr-projective,
title = {{Projective Least-Squares: Global Solutions with Local Optimization}},
author = {Olsson, Carl and Kahl, Fredrik and Hartley, Richard I.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2009},
pages = {1216-1223},
doi = {10.1109/CVPR.2009.5206864},
url = {https://mlanthology.org/cvpr/2009/olsson2009cvpr-projective/}
}