Robust Tracking Method for Small and Weak Multiple Targets Under Dynamic Interference Based on Q-IMM-MHT

基于Q-IMM-MHT的动态干扰下小而弱的多目标鲁棒跟踪方法

阅读:1

Abstract

In complex environments, traditional multi-target tracking methods often encounter challenges such as strong clutter interference and interruptions in target trajectories, which can result in insufficient tracking accuracy and robustness. To address these issues, this paper presents an improved multi-target tracking algorithm, termed Q-IMM-MHT. This method integrates Multiple Hypothesis Tracking (MHT) with Interactive Multiple Model (IMM) and introduces a Q-learning-based adaptive model switching strategy to dynamically adjust model selection in response to variations in the target's motion patterns. Furthermore, the algorithm utilizes Support Vector Machines (SVMs) for anomaly detection and trajectory recovery, thereby enhancing the accuracy of data association and the overall robustness of the system. Experimental results indicate that under high noise conditions, the Root Mean Square Error (RMSE) of position estimation decreases to 0.74 pixels, while the RMSE of velocity estimation falls to 0.04 pixels/frame. Compared to traditional methods such as the Unscented Kalman Filter (UKF), IMM, and CIMM, the RMSE is reduced by at least 10.84% and 42.86%, respectively. In scenarios characterized by target trajectory interruptions and clutter interference, the algorithm maintains an association accuracy exceeding 46.3% even after 30 frames of interruption, significantly outperforming other methods. These findings demonstrate that the Q-IMM-MHT algorithm offers substantial performance improvements in multi-target tracking tasks within complex environments, effectively enhancing both tracking accuracy and stability, with considerable application value and extensive potential for future use.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。