Globally optimal algorithms for stratified autocalibration

DOI10.1007/s11263-009-0305-2zbMath1477.68339OpenAlexW2139583471MaRDI QIDQ408824

J. Herrera, H. S. Yoon

Publication date: 12 April 2012

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

Full work available at URL: https://doi.org/10.1007/s11263-009-0305-2

zbMATH Keywords

global optimizationconvex relaxationsautocalibrationmultiple-view geometry

Mathematics Subject Classification ID

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

Related Items

Self-calibration under the Cayley framework

Uses Software

• Sostools
• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex extensions and envelopes of lower semi-continuous functions
• A microchoice bound for continuous-space classification algorithms
• Global Optimization with Polynomials and the Problem of Moments
• An Automatic Method of Solving Discrete Programming Problems
• Jointly Constrained Biconvex Programming
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Multiple View Geometry in Computer Vision
• GloptiPoly
• A method for the solution of certain non-linear problems in least squares
• Semidefinite relaxations of fractional programs via novel convexification techniques