【24h】

Fast Subsequence Matching in Motion Capture Data

机译:在运动捕获数据中匹配的快速子序列

获取原文

摘要

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 1 s with the average precision of 87.98% for 5-NN queries.
机译:运动捕获数据通过身体配置的序列数字地代表人类运动。在这种时空数据中匹配的子序列匹配难以作为查询相关的运动可以长度变化并且在非常长的运动中任意发生。要处理这些问题,我们提出了一种新的子序列匹配方法,(1)将短期查询和长数据动作分区为仅部分地重叠的固定大小段,(2)使用有效的相似度量来有效地检索数据段最相似的查询段,(3)本地化了在四步后处理阶段中的扩展和合并的检索段内的最Query相关子句。与相关工作相比,整个检索过程都是有效的,快速。可以在大约1秒内搜索真实寿命68分钟的数据运动,平均精度为5-nn查询。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号