A rapid motion retrieval technique using simple and discrete representation of motion data
A rapid motion retrieval technique using simple and discrete representation of motion data
复制标题
DOI：
10.1109/iciteed.2015.7408915
复制
发表时间：
2015-10
期刊：
影响因子：
--
通讯作者：
N. Pantuwong;Kensuke Takahara;Masanori Sugimoto
中科院分区：
文献类型：
--
作者：
N. Pantuwong;Kensuke Takahara;Masanori Sugimoto
在本文中，我们提出了一种快速的运动检索技术，使用动态时间规整。运动帧由特征向量表示，特征向量的元素为整数值。通过主成分分析对特征向量进行降维，并将向量元素的值量化为2位。生成给出帧之间的距离的相似性矩阵以供动态时间规整使用。进行了初步的实验，以找到最佳的参数值，通过评估运动检索性能。所提出的方法的一个重要特点是，如果帧表示的位长是固定的，在任何两个运动中的任何两个帧之间的距离可以被发现作为一个元素的相似性矩阵，而不改变其大小，这可以实现快速的运动检索通过动态时间扭曲。与现有方法的实验比较表明，我们提出的技术可以完成检索任务的速度比传统的动态时间规整方法快6倍以上，同时达到几乎相同的精度和计算成本水平的k-d树方法在[1]中描述的。通过使用简单且离散的帧表示，探索了在保持高检索准确率的情况下实现快速检索的可能性。
In this paper, we propose a rapid motion retrieval technique using dynamic time warping. The frames of the motions are represented by feature vectors whose elements are integer values. The dimensionality of the feature vectors is reduced by using principal component analysis and the values of vector elements are quantized to two bits. A similarity matrix giving distances between the frames is generated for use by dynamic time warping. Preliminary experiments were conducted to find optimum parameter values by evaluating motion retrieval performance. One important feature of the proposed method is that, if the bit length for the frame representation is fixed, the distance between any two frames in any two motions can be found as an element of the similarity matrix without changing its size, which can achieve rapid motion retrieval via dynamic time warping. Experimental comparison with existing methods demonstrated that our proposed technique can complete retrieval tasks over six times faster than a traditional dynamic time warping method, while achieving almost the same levels of accuracy and computation cost as those for the k-d tree method described in [1]. By using simple and discrete representations of frames, the possibilities of achieving rapid retrieval retaining high retrieval accuracy are explored.