针对扩展目标高斯混合概率假设密度(extended target Gaussian mixture probability hypothesis density,ET-GM-PHD)滤波器中的量测集划分问题,提出了一种改进的密度峰值聚类(improved density peak clustering,IDPC)量测集划分算法。首...针对扩展目标高斯混合概率假设密度(extended target Gaussian mixture probability hypothesis density,ET-GM-PHD)滤波器中的量测集划分问题,提出了一种改进的密度峰值聚类(improved density peak clustering,IDPC)量测集划分算法。首先,使用IDPC算法去除局部密度较低的杂波量测,以获得最有可能的目标生成的量测集。其次,将剩余的量测集聚类以获得空间上紧密联系的聚类簇和簇的聚类中心。最后,根据预测的具有较高权重的高斯分量的均值在每个簇上的投影,获得准确的量测集划分。实验结果表明,与现有的量测集划分方法相比,该算法在保持跟踪精度的同时,可以大大减少计算时间。展开更多
To date, Wald sequential probability ratio test(WSPRT) has been widely applied to track management of multiple hypothesis tracking(MHT). But in a real situation, if the false alarm spatial density is much larger than ...To date, Wald sequential probability ratio test(WSPRT) has been widely applied to track management of multiple hypothesis tracking(MHT). But in a real situation, if the false alarm spatial density is much larger than the new target spatial density, the original track score will be very close to the deletion threshold of the WSPRT. Consequently, all tracks, including target tracks, may easily be deleted, which means that the tracking performance is sensitive to the tracking environment. Meanwhile, if a target exists for a long time, its track will have a high score, which will make the track survive for a long time even after the target has disappeared. In this paper, to consider the relationship between the hypotheses of the test, we adopt the Shiryayev SPRT(SSPRT) for track management in MHT. By introducing a hypothesis transition probability, the original track score can increase faster, which solves the first problem. In addition, by setting an independent SSPRT for track deletion, the track score can decrease faster, which solves the second problem. The simulation results show that the proposed SSPRT-based MHT can achieve better tracking performance than MHT based on the WSPRT under a high false alarm spatial density.展开更多
文摘针对扩展目标高斯混合概率假设密度(extended target Gaussian mixture probability hypothesis density,ET-GM-PHD)滤波器中的量测集划分问题,提出了一种改进的密度峰值聚类(improved density peak clustering,IDPC)量测集划分算法。首先,使用IDPC算法去除局部密度较低的杂波量测,以获得最有可能的目标生成的量测集。其次,将剩余的量测集聚类以获得空间上紧密联系的聚类簇和簇的聚类中心。最后,根据预测的具有较高权重的高斯分量的均值在每个簇上的投影,获得准确的量测集划分。实验结果表明,与现有的量测集划分方法相比,该算法在保持跟踪精度的同时,可以大大减少计算时间。
基金supported by National Natural Science Foundation of China (Grant Nos. 61471019, 61501011)
文摘To date, Wald sequential probability ratio test(WSPRT) has been widely applied to track management of multiple hypothesis tracking(MHT). But in a real situation, if the false alarm spatial density is much larger than the new target spatial density, the original track score will be very close to the deletion threshold of the WSPRT. Consequently, all tracks, including target tracks, may easily be deleted, which means that the tracking performance is sensitive to the tracking environment. Meanwhile, if a target exists for a long time, its track will have a high score, which will make the track survive for a long time even after the target has disappeared. In this paper, to consider the relationship between the hypotheses of the test, we adopt the Shiryayev SPRT(SSPRT) for track management in MHT. By introducing a hypothesis transition probability, the original track score can increase faster, which solves the first problem. In addition, by setting an independent SSPRT for track deletion, the track score can decrease faster, which solves the second problem. The simulation results show that the proposed SSPRT-based MHT can achieve better tracking performance than MHT based on the WSPRT under a high false alarm spatial density.
