Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm

DOI10.1007/s10851-014-0545-9zbMath1330.68288arXiv1403.4806OpenAlexW2036542402MaRDI QIDQ2354819

Didier Henrion, Adrien Bartoli, Jean-José Orteu, T. Sentenac, Florian Bugarin, Jean-Bernard Lasserre

Publication date: 27 July 2015

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.4806

zbMATH Keywords

global optimizationfundamental matrixlinear matrix inequality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Miscellaneous inequalities involving matrices (15A45) Machine vision and scene understanding (68T45)

Related Items

Degeneracy of the intersection of three quadrics

Uses Software

• CSDP
• SDPA
• SeDuMi
• SDPT3
• GloptiPoly
• DSDP5
• YALMIP
• SIGOA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Algorithms for the maximum satisfiability problem
• Future paths for integer programming and links to artificial intelligence
• Globally optimal estimates for geometric reconstruction problems
• Global Optimization with Polynomials and the Problem of Moments
• An Automatic Method of Solving Discrete Programming Problems
• GloptiPoly 3: moments, optimization and semidefinite programming
• Introduction to Interval Analysis
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Optimisation globale et théorie des moments
• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
• GloptiPoly