Globally optimal estimates for geometric reconstruction problems

DOI10.1007/S11263-006-0015-YMaRDI QIDQ2642729zbMATH OpenOpenAlexFDO

Authors Fredrik Kahl, Didier Henrion

Publication date 4 September 2007

Published in International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11263-006-0015-y

zbMATH Keywords

global optimizationLMI relaxationsnonconvex optimizationsemidefinite programmingstructure from motiontriangulation

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonconvex programming, global optimization (90C26)

Recommendations

• Triangulation of Points, Lines and Conics
• Practical global optimization for multiview geometry
• Generalized convexity in multiple view geometry
• Globally optimal algorithms for stratified autocalibration
• Verifying global minima for L₂ minimization problems in multiple view geometry

Cites work

• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Global optimization of rational functions: a semidefinite programming approach
• Global optimization with polynomials and the problem of moments
• GloptiPoly
• scientific article; zbMATH DE number 2062605 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Multiple View Geometry in Computer Vision
• Nondifferentiable optimization and polynomial problems
• Optimal structure from motion: Local ambiguities and global estimates
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

Cited in

(18)

• Global optimization of polynomials over real algebraic sets
• Verifying global minima for L₂ minimization problems in multiple view geometry
• On the tightness of semidefinite relaxations for rotation estimation
• Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials
• Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
• Topics in absolute anabelian geometry. III: Global reconstruction algorithms
• scientific article; zbMATH DE number 6381741 (Why is no real title available?)
• Lagrangian duality in complex pose graph optimization
• Globally optimal algorithms for stratified autocalibration
• A convex relaxation to compute the nearest structured rank deficient matrix
• Towards bulk metric reconstruction from extremal area variations
• Global registration of multiple point clouds using semidefinite programming
• A sufficient condition of optimality for the relative pose problem between cameras
• Nonlinear algebra and applications
• Triangulation of Points, Lines and Conics
• Global optimization through rotation space search
• Practical global optimization for multiview geometry
• Generalized convexity in multiple view geometry

Describes a project that uses

Uses Software

• SeDuMi
• GloptiPoly

This page was built for publication: Globally optimal estimates for geometric reconstruction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642729)