首页> 外文会议>Chinese Control Conference >Asynchronous track-to-track association algorithm based on dynamic time warping distance
【24h】

Asynchronous track-to-track association algorithm based on dynamic time warping distance

机译:基于动态时间规整距离的异步航迹关联算法

获取原文

摘要

In the distributed multi-target tracking system, the local sensors often begin working at different time and provide tracks at different rates with different communication delays. As a result, the local tracks from different sensors are usually asynchronous. The current solution is time registration before track association which leads to track synchronization. However, when synchronizing, the estimation error increases. This affects performance of track-to-track association. In this paper, tracks are treated as time series, and using dynamic time warping method (DTW) measures the distance between any two tracks. DTW is a much more robust distance measure for time series, allowing similar shapes to match even if they are out of phase in the time axis. Considering track-to-track association problems, and confining the search area of DTW when optimizing, a fast algorithm is obtained. This is a post-processing technique of tracks. In order to make track-to-track association more accurately after obtaining the track data from sensors, the algorithm is proposed so that track fusion can be implemented next. Simulation results show that the presented method can effectively solve the asynchronous track-to-track association problem.
机译:在分布式多目标跟踪系统中,本地传感器通常在不同的时间开始工作,并以不同的速率提供具有不同通信延迟的跟踪。结果,来自不同传感器的本地轨迹通常是异步的。当前的解决方案是在磁道关联之前进行时间记录,这会导致磁道同步。然而,当同步时,估计误差增加。这会影响音轨间关联的性能。在本文中,轨迹被视为时间序列,并使用动态时间规整方法(DTW)测量任意两条轨迹之间的距离。对于时间序列,DTW是一种更可靠的距离度量,即使它们在时间轴上异相,也可以使它们匹配。考虑到轨道间的关联问题,并在优化时限制了DTW的搜索区域,从而获得了一种快速算法。这是轨道的后处理技术。为了在从传感器获得轨迹数据后更准确地进行轨迹间关联,提出了该算法,以便下一步可以实现轨迹融合。仿真结果表明,该方法可以有效地解决异步轨道间的关联问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号