Global Optimization through Rotation Space Search
This paper introduces a new algorithmic technique for solving certain problems in geometric computer vision. The main novelty of the method is a branch-and-bound search over rotation space, which is used in this paper to determine camera orientation. By searching over all possible rotations, problems can be reduced to known fixed-rotation problems for which optimal solutions have been previously given. In particular, a method is developed for the estimation of the essential matrix, giving the...[Show more]
|Collections||ANU Research Publications|
|Source:||International Journal of Computer Vision|
|01_Hartley_Global_Optimization_through_2009.pdf||876.22 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.