首页> 外文会议>IEEE Region 10 Conference >A quick search method for determining corresponding points from vehicle-vibration data
【24h】

A quick search method for determining corresponding points from vehicle-vibration data

机译:一种快速搜索方法,用于确定车辆振动数据的相应点

获取原文

摘要

This paper presents a method for reducing the enormous computation time required by adaptive dynamic time warping (ADTW). A previous method has been proposed that converts a time-axis sequence, which is obtained from passenger trains, to a space-axis sequence with a high degree of accuracy. However, ADTW has the drawback of enormous computation time for converting the time-axis sequence to space-axis sequence because it applies DTW to search for an optimal corresponding point for two vibration sequences. Therefore, an efficient corresponding-point-search processing algorithm is desirable for realizing quasi-real-time processing using passenger trains, which can monitor the rail condition several times a day. In this paper, we propose space-series sequence active search (SAS) as a high-speed processing method for obtaining a corresponding-point-search algorithm. SAS is a method that matches shifting features. It is based on matching the appearance positions of the intervals of a similar signal by shifting one sample at a time. Computer simulation shows that the computation time of SAS is 1/126 times that of ADTW.
机译:本文介绍了一种减少自适应动态时间翘曲(ADTW)所需的巨大计算时间的方法。已经提出了一种以前的方法,其将从乘客列车获得的时间轴序列转换为具有高精度的空间轴序列。然而,ADTW具有巨大的计算时间的缺点,用于将时间轴序列转换为空间轴序列,因为它应用DTW以搜索两个振动序列的最佳对应点。因此,期望使用乘客列车实现准确的相应点搜索处理算法,用于使用乘客列车每天多次监控铁路条件。在本文中,我们将空间系列序列活动搜索(SAS)作为用于获得相应点搜索算法的高速处理方法。 SAS是一种与移位功能匹配的方法。它基于一次通过移动一个样本来匹配类似信号的间隔的外观位置。计算机仿真显示SA的计算时间为ADTW的1/126倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号