SEDMIDUBSKÝ, Jan, Pavel ZEZULA and Jan ŠVEC. Fast Subsequence Matching in Motion Capture Data. In 21st European Conference on Advances in Databases and Information Systems. Cham: Springer, 2017, p. 59-72. ISBN 978-3-319-66916-8. Available from: https://dx.doi.org/10.1007/978-3-319-66917-5_5.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Fast Subsequence Matching in Motion Capture Data
Authors SEDMIDUBSKÝ, Jan (203 Czech Republic, guarantor, belonging to the institution), Pavel ZEZULA (203 Czech Republic, belonging to the institution) and Jan ŠVEC (203 Czech Republic).
Edition Cham, 21st European Conference on Advances in Databases and Information Systems, p. 59-72, 14 pp. 2017.
Publisher Springer
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"
RIV identification code RIV/00216224:14330/17:00094760
Organization unit Faculty of Informatics
ISBN 978-3-319-66916-8
Doi http://dx.doi.org/10.1007/978-3-319-66917-5_5
UT WoS 000463611400005
Keywords in English subsequence matching; motion capture data; content-based retrieval; similarity measure; segmentation; indexing
Tags DISA, firank_B
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 14/5/2020 15:14.
Abstract
Motion capture data digitally represent human movements by sequences of body configurations in time. Subsequence matching in such spatio-temporal data is difficult as query-relevant motions can vary in lengths and occur arbitrarily in a very long motion. To deal with these problems, we propose a new subsequence matching approach which (1) partitions both short query and long data motion into fixed-size segments that overlap only partly, (2) uses an effective similarity measure to efficiently retrieve data segments that are the most similar to query segments, and (3) localizes the most query-relevant subsequences within extended and merged retrieved segments in a four-step postprocessing phase. The whole retrieval process is effective and fast in comparison with related work. A real-life 68-minute data motion can be searched in about 1s with the average precision of 87.98% for 5-NN queries.
Links
GBP103/12/G084, research and development projectName: Centrum pro multi-modální interpretaci dat velkého rozsahu
Investor: Czech Science Foundation
PrintDisplayed: 26/4/2024 20:21