基于SORT框架无迹卡尔曼滤波的多目标跟踪算法
CSTR:
作者:
作者单位:

1.上海交通大学电子信息与电气工程学院, 上海 200240 ;2.上海无线电设备研究所, 上海 201109

作者简介:

陈智超,男,硕士研究生。

通讯作者:

中图分类号:

TN953

基金项目:

上海航天先进技术联合研究基金(USCAST2022-32)


Multi-Target Tracking Algorithm Based on Unscented Kalman Filter within SORT Framework
Author:
Affiliation:

1.School of Electronic Information and Electrical Engineering, Shanghai Jiao TongUniversity, Shanghai 200240 , China ; 2.Shanghai Radio Equipment Research Institute,Shanghai 201109 , China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对同向密集目标跟踪需求,提出了一种基于SORT(simple online and realtime tracking)框架无迹卡尔曼滤波(unscented Kalman filter,UKF)的多目标跟踪算法。该算法利用SORT框架构建多无迹卡尔曼滤波(multiple unscented Kalman filter,MUKF)跟踪器,使用欧氏距离和马氏距离计算代价矩阵,采用匈牙利算法和贪婪算法进行数据关联匹配,并根据匹配结果进行标签管理以及生命周期管理,实现多目标跟踪。仿真结果表明:与卡尔曼滤波(Kalman filter,KF)算法、扩展卡尔曼滤波(extended Kalman filter,EKF)算法相比,所提算法也具有良好的多目标跟踪性能,且基于马氏距离的多目标跟踪性能更优。

    Abstract:

    A multi-target tracking algorithm based on unscented Kalman filter (UKF) within simple online and realtime tracking (SORT) framework was proposed to meet the requirement of intensive target tracking in the same direction. This algorithm employed the SORT framework to construct a multiple unscented Kalman filter (MUKF) tracker. The cost matrix was calculated using Euclidean distance and Mahalanobis distance, the Hungarian algorithm and the greedy algorithm were applied for data association matching, and label management and life cycle management were performed on the basis of the matching results to achieve multi-target tracking. Simulation results demonstrate that compared with Kalman filter (KF) algorithm and extended Kalman filter (EKF) algorithm, the proposed algorithm has good performance in multi-target tracking, and the performance is better when based on Mahalanobis distance.

    参考文献
    相似文献
    引证文献
引用本文

陈智超,常家云,许震俞,等.基于SORT框架无迹卡尔曼滤波的多目标跟踪算法[J].制导与引信,2025,46(4):7-14

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-07-25
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2025-12-16
  • 出版日期:
文章二维码