Projective Least-Squares: Global Solutions with Local Optimization
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efciency. On the other hand, traditional bundle adjustment algorithms have been found to provide good solutions even though there
|Collections||ANU Research Publications|
|Source:||Proceeings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009)|
|01_Olsson_Projective_Least-Squares:_2009.pdf||1.47 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.