Fast motion retrieval with the distance input space

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Accessing and querying large motion databases can be a time consuming operation since motions are by essence big multivariate time series. However, with the help of good dimensionality reduction methods, this problem can be alleviated. Yet, it appears that the initial motion representation space is of great importance with regards to the final performances. This paper advocates the idea that the distance representation space (i.e. ensemble of joint-to-joint distances of the skeleton), though bigger, can yield a powerful representation of the motion. In order to validate this idea, comparisons with rotation and position based representations are experimented in a motion retrieval task performed with the HDM05 motion database. The final resulting retrieval algorithm is very fast with satisfying performances. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Le Naour, T., Courty, N., & Gibet, S. (2012). Fast motion retrieval with the distance input space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7660 LNCS, pp. 362–365). Springer Verlag. https://doi.org/10.1007/978-3-642-34710-8_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free