Home  |  Centre for Mathematical Sciences  |  LTH  |  LU
Title: Projective Least-Squares: Global Solutions with Local Optimization
Fulltext: PDF
Authors: Olsson, Carl and Kahl, Fredrik and Hartley, Richard
Year: 2009
Document Type:Conference Paper
Conference: Conference on Computer Vision and Pattern Recognition
Conference location: Miami, USA
Status: In Press
Refereed: Yes
Keywords: ffl, globalvision, vinst
BibTeX item:BibTeX
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.

 

Back

 

Questions: webmaster
Last updated: 2012-01-17

Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Phone: 046-222 00 00