English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Automatic Learning of Articulated Skeletons from 3D Marker Trajectories

MPS-Authors
/persons/resource/persons43977

de Aguiar,  Edilson
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

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

/persons/resource/persons45449

Seidel,  Hans-Peter       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dHMNL
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

de Aguiar, E., Theobalt, C., & Seidel, H.-P. (2006). Automatic Learning of Articulated Skeletons from 3D Marker Trajectories. In G. Bebis, R. Boyle, B. Parvin, D. Koracin, P. Remagnino, A. Nefian, et al. (Eds.), Advances in Visual Computing (pp. 485-494). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2235-4
Abstract
We present a novel fully-automatic approach for estimating an articulated
skeleton of a moving subject and its motion from body marker trajectories that
have been measured with an optical motion capture system. Our method does not
require a priori information about the shape and proportions of the tracked
subject, can be applied to arbitrary motion sequences, and renders dedicated
initialization poses unnecessary. To serve this purpose, our algorithm first
identifies individual rigid bodies by means of a variant of spectral
clustering. Thereafter, it determines joint positions at each time step of
motion through numerical optimization, reconstructs the skeleton topology, and
finally enforces fixed bone length constraints. Through experiments, we
demonstrate the robustness and effciency of our algorithm and show that it
outperforms related methods from the literature in terms of accuracy and speed.