Globally optimal estimates for geometric reconstruction problems
From MaRDI portal
Publication:2642729
DOI10.1007/s11263-006-0015-yzbMath1477.68382OpenAlexW2105340458MaRDI QIDQ2642729
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
triangulationglobal optimizationsemidefinite programmingnonconvex optimizationstructure from motionLMI relaxations
Nonconvex programming, global optimization (90C26) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Related Items (7)
On the tightness of semidefinite relaxations for rotation estimation ⋮ Global optimization through rotation space search ⋮ Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials ⋮ Nonlinear algebra and applications ⋮ Global optimization of polynomials over real algebraic sets ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nondifferentiable optimization and polynomial problems
- Optimal structure from motion: Local ambiguities and global estimates
- Global optimization of rational functions: a semidefinite programming approach
- Global Optimization with Polynomials and the Problem of Moments
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Multiple View Geometry in Computer Vision
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: Globally optimal estimates for geometric reconstruction problems
