Convex Optimisation for Inverse Kinematics
Authors:
- 1 September 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-327
Abstract
We consider the problem of inverse kinematics (IK), where one wants to find the parameters of a given kinematic skeleton that best explain a set of observed 3D joint locations. The kinematic skeleton has a tree structure, where each node is a joint that has an associated geometric transformation that is propagated to all its child nodes. The IK problem has various applications in vision and graphics, for example for tracking or reconstructing articulated objects, such as human hands or bodies. Most commonly, the IK problem is tackled using local optimisation methods. A major downside of these approaches is that, due to the non-convex nature of the problem, such methods are prone to converge to unwanted local optima and therefore require a good initialisation. In this paper we propose a convex optimisation approach for the IK problem based on semidefinite programming, which admits a polynomial-time algorithm that globally solves (a relaxation of) the IK problem. Experimentally, we demonstrate that the proposed method significantly outperforms local optimisation methods using different real-world skeletons.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Tight Relaxation of Quadratic MatchingComputer Graphics Forum, 2015
- A convex relaxation for approximate global optimization in simultaneous localization and mapping2015
- Extending FABRIK with model constraintsComputer Animation and Virtual Worlds, 2015
- Semidefinite Descriptions of the Convex Hull of Rotation MatricesSIAM Journal on Optimization, 2015
- Multireference alignment using semidefinite programming2014
- Exact and stable recovery of rotations for robust synchronizationInformation and Inference: A Journal of the IMA, 2013
- FABRIK: A fast, iterative solver for the Inverse Kinematics problemGraphical Models, 2011
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programmingJournal of Global Optimization, 2008
- Probabilistic Subgraph Matching Based on Convex Relaxation2005
- A combined optimization method for solving the inverse kinematics problems of mechanical manipulatorsIEEE Transactions on Robotics and Automation, 1991