Minimizing the object space error for pose estimation: towards the most efficient algorithm

DOI10.22436/jnsa.010.10.34zbMath1412.90122OpenAlexW2766564992MaRDI QIDQ5743218

Yong Xia, Ping Li, Ying-Wei Han

Publication date: 9 May 2019

Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22436/jnsa.010.10.34

zbMATH Keywords

branch-and-boundroboticspose estimationLagrangian dualPnP

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational issues in computer and robotic vision (65D19)

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
• Global optimization through rotation space search
• Strong duality for a trust-region type relaxation of the quadratic assignment problem
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Camera-Pose Estimation via Projective Newton Optimization on the Manifold
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: Minimizing the object space error for pose estimation: towards the most efficient algorithm