SEDMIDUBSKÝ, Jan, Petr ELIÁŠ and Pavel ZEZULA. Similarity Searching in Long Sequences of Motion Capture Data. In L. Amsaleg et al. Proceedings of 9th International Conference on Similarity Search and Applications (SISAP 2016), LNCS 9939. Cham (ZG): Springer International Publishing AG, 2016, p. 271-285. ISBN 978-3-319-46758-0. Available from: https://dx.doi.org/10.1007/978-3-319-46759-7_21.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Similarity Searching in Long Sequences of Motion Capture Data
Authors SEDMIDUBSKÝ, Jan (203 Czech Republic, guarantor, belonging to the institution), Petr ELIÁŠ (203 Czech Republic, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, belonging to the institution).
Edition Cham (ZG), Proceedings of 9th International Conference on Similarity Search and Applications (SISAP 2016), LNCS 9939, p. 271-285, 15 pp. 2016.
Publisher Springer International Publishing AG
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/16:00088023
Organization unit Faculty of Informatics
ISBN 978-3-319-46758-0
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-46759-7_21
UT WoS 000389801100021
Keywords in English motion capture data; similarity search; subsequence search; multi-level segmentation
Tags DISA
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 14/5/2020 15:26.
Abstract
Motion capture data digitally represent human movements by sequences of body configurations in time. Searching in such spatio-temporal data is difficult as query-relevant motions can vary in lengths and occur arbitrarily in the very long data sequence. There is also a strong requirement on effective similarity comparison as the specific motion can be performed by various actors in different ways, speeds or starting positions. To deal with these problems, we propose a new subsequence matching algorithm which uses a synergy of elastic similarity measure and multi-level segmentation. The idea is to generate a minimum number of overlapping data segments so that there is at least one segment matching an arbitrary subsequence. A non-partitioned query is then efficiently evaluated by searching for the most similar segments in a single level only, while guaranteeing a precise answer with respect to the similarity measure. The retrieval process is efficient and scalable which is confirmed by experiments executed on a real-life dataset.
Links
GBP103/12/G084, research and development projectName: Centrum pro multi-modální interpretaci dat velkého rozsahu
Investor: Czech Science Foundation
PrintDisplayed: 27/4/2024 14:23