We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or nonoptimality - or a combination of both - we pursue the goal of achieving global solutions of the statistically optimal cost-function. Our approach is based on a hierarchy of convex relaxations to solve nonconvex optimization problems with polynomials. These convex relaxations generate a monotone sequence of lower bounds and we show how one can detect whether the global optimum is attained at a given relaxation. The technique is applied to a number of classical vision problems: triangulation, camera pose, homography estimation and last, but not least, epipolar geometry estimation. Experimental validation on both synthetic and real data is provided. In practice, only a few relaxations are needed for attaining the global optimum.
Globally optimal estimates for geometric reconstruction problems
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 ; 2 ; 978-985 Vol. 2
01.01.2005
486501 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Globally Optimal Estimates for Geometric Reconstruction Problems
British Library Online Contents | 2007
|Globally Optimal Estimates for Geometric Reconstruction Problems
British Library Conference Proceedings | 2005
|Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
British Library Conference Proceedings | 2004
|L-Minimization in Geometric Reconstruction Problems
British Library Conference Proceedings | 2004
|