English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  An Efficient Algorithm for Keyframe-based Motion Retrieval in the Presence of Temporal Deformations

Baak, A., Müller, M., & Seidel, H.-P. (2008). An Efficient Algorithm for Keyframe-based Motion Retrieval in the Presence of Temporal Deformations. In MM’08: Proceedings of the 2008 ACM International Conference on Multimedia, with co-located Symposium & Workshops (AREA’08, CommunicabilityMS’08, HCC’08, MIR’08, MS’08, SAME’08, SRMC’08, TVS’08, VNBA’08) (pp. 451-458). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1AE2-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1AE3-E
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Baak, Andreas1, 2, Author           
Müller, Meinard1, Author           
Seidel, Hans-Peter1, Author           
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Content

show
hide
Free keywords: -
 Abstract: In the last years, various algorithms have been proposed for automatic classification and retrieval of motion capture data. Here, one main difficulty is due to the fact that similar types of motions may exhibit significant spatial as well as temporal variations. To cope with such variations, previous algorithms often rely on warping and alignment techniques that are computationally time and cost intensive. In this paper, we present a novel keyframe-based algorithm that significantly speeds up the retrieval process and drastically reduces memory requirements. In contrast to previous index-based strategies, our recursive algorithm can cope with temporal variations. In particular, the degree of admissible deformation tolerance between the queried keyframes can be controlled by an explicit stiffness parameter. While our algorithm works for general multimedia data, we concentrate on demonstrating the practicability of our concept by means of the motion retrieval scenario. Our experiments show that one can typically cut down the search space from several hours to a couple of minutes of motion capture data within a fraction of a second.

Details

show
hide
Language(s): eng - English
 Dates: 2009-03-232008
 Publication Status: Issued
 Pages: -
 Publishing info: New York, NY : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 427984
DOI: 10.1145/1460096.1460169
URI: http://doi.acm.org/10.1145/1460096.1460169
Other: Local-ID: C125756E0038A185-C58B63122961E157C125753E003273BF-BaakMS08_KeyframeMotion_ACM-MIR
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Vancouver, British Columbia, Canada
Start-/End Date: 2008-10-30 - 2008-10-31

Legal Case

show

Project information

show

Source 1

show
hide
Title: MM’08 : Proceedings of the 2008 ACM International Conference on Multimedia, with co-located Symposium & Workshops (AREA’08, CommunicabilityMS’08, HCC’08, MIR’08, MS’08, SAME’08, SRMC’08, TVS’08, VNBA’08)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 451 - 458 Identifier: ISBN: 978-1-60558-312-9