English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Convex Optimisation for Inverse Kinematics

MPS-Authors
/persons/resource/persons244016

Yenamandra,  Tarum
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons214986

Bernard,  Florian
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons244018

Wang,  Jiayi
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons134216

Mueller,  Franziska
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt,  Christian       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1910.11016.pdf
(Preprint), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Yenamandra, T., Bernard, F., Wang, J., Mueller, F., & Theobalt, C. (2019). Convex Optimisation for Inverse Kinematics. Retrieved from http://arxiv.org/abs/1910.11016.


Cite as: https://hdl.handle.net/21.11116/0000-0005-7DA8-2
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.