利用稀疏性在网格上跟踪目标信号强度
Tracking Target Signal Strengths on a Grid using Sparsity
AI总结:
提出一种基于网格的线性状态和测量模型,通过稀疏感知卡尔曼滤波实现多目标跟踪,避免数据关联并降低复杂度。
摘要:
多目标跟踪主要面临测量方程中的非线性和快速准确数据关联的挑战。为克服这些挑战,本文引入一种基于网格的模型,其中状态捕获已知空间网格上的目标信号强度(TSSG)。该模型导致线性的状态和测量方程,绕过了数据关联,并可以通过稀疏感知卡尔曼滤波(KF)进行状态估计。利用新模型的网格诱导稀疏性,开发了两种稀疏感知TSSG-KF跟踪器:一种通过ℓ1范数正则化实现稀疏性,另一种将稀疏性作为额外测量。开发了迭代扩展卡尔曼滤波和高斯-牛顿算法以实现低复杂度跟踪,并提供了精确的误差协方差更新以评估所得稀疏感知状态估计器的性能。基于TSSG状态估计,可以在后续步骤中获得更具信息性的目标位置和轨迹估计,确保轨迹关联和位置估计误差不会传播回TSSG状态估计。新颖的TSSG跟踪器不需要知道目标数量或其信号强度,并且与基准隐马尔可夫模型滤波器相比,复杂度显著降低,尤其是在目标数量较多时。数值模拟表明,与不感知稀疏性的对应方法相比,稀疏感知跟踪器在降低复杂度的同时,均方根误差性能得到改善。
英文摘要:
Multi-target tracking is mainly challenged by the nonlinearity present in the measurement equation, and the difficulty in fast and accurate data association. To overcome these challenges, the present paper introduces a grid-based model in which the state captures target signal strengths on a known spatial grid (TSSG). This model leads to \emph{linear} state and measurement equations, which bypass data association and can afford state estimation via sparsity-aware Kalman filtering (KF). Leveraging the grid-induced sparsity of the novel model, two types of sparsity-cognizant TSSG-KF trackers are developed: one effects sparsity through $\ell_1$-norm regularization, and the other invokes sparsity as an extra measurement. Iterative extended KF and Gauss-Newton algorithms are developed for reduced-complexity tracking, along with accurate error covariance updates for assessing performance of the resultant sparsity-aware state estimators. Based on TSSG state estimates, more informative target position and track estimates can be obtained in a follow-up step, ensuring that track association and position estimation errors do not propagate back into TSSG state estimates. The novel TSSG trackers do not require knowing the number of targets or their signal strengths, and exhibit considerably lower complexity than the benchmark hidden Markov model filter, especially for a large number of targets. Numerical simulations demonstrate that sparsity-cognizant trackers enjoy improved root mean-square error performance at reduced complexity when compared to their sparsity-agnostic counterparts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。