A fast joint probabilistic data association （FJPDA） algorithm is proposed in tiffs paper. Cluster probability matrix is approximately calculated by a new method, whose elements βi^t（K） can be taken as evaluation ...A fast joint probabilistic data association （FJPDA） algorithm is proposed in tiffs paper. Cluster probability matrix is approximately calculated by a new method, whose elements βi^t（K） can be taken as evaluation functions. According to values of βi^t（K）, N events with larger joint probabilities can be searched out as the events with guiding joint probabilities, tiros, the number of searching nodes will be greatly reduced. As a result, this method effectively reduces the calculation load and nnkes it possible to be realized on real-thne, Theoretical ,analysis and Monte Carlo simulation results show that this method is efficient.展开更多
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood d...A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.展开更多
The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to de...The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.展开更多
Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system....Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system.A multi-sensor data association is proposed based on aftinity propagation(AP)algorithm.The proposed method needs an initial similarity,a distance between any two points,as a parameter,therefore,the similarity matrix is calculated by track position,velocity and azimuth of track data.The approach can automatically obtain the optimal classification of uncertain target based on clustering validity index.Furthermore,the same kind of data are fused based on the variance of measured data and the fusion result can be taken as a new measured data of the target.Finally,the measured data are classified to a certain target based on the nearest neighbor ideas and its characteristics,then filtering and target tracking are conducted.The experimental results show that the proposed method can effectively achieve multi-sensor and multi-target track association.展开更多
Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is ...Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.展开更多
Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has b...Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has been a difficulty. This paper will discuss a method based on layered searching construction of association hypothesis events. According to the method, the searching schedule of the association events between two layers can be recursive and with independence, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and corresponding computer simulation tests and results are also given in the paper.展开更多
针对简单运动模型在复杂驾驶环境多目标跟踪表现不佳的问题,提出了一种基于恒定转弯率和加速度(constant turn rate and acceleration,CTRA)模型的点云多目标跟踪方法。通过采用包含角速度信息的运动模型来描述目标的运动轨迹,可提高在...针对简单运动模型在复杂驾驶环境多目标跟踪表现不佳的问题,提出了一种基于恒定转弯率和加速度(constant turn rate and acceleration,CTRA)模型的点云多目标跟踪方法。通过采用包含角速度信息的运动模型来描述目标的运动轨迹,可提高在目标转弯时的跟踪精度。同时,利用检测算法提供的速度信息,在轨迹更新时对物体速度进行校正,以改善在目标速度突变时的跟踪效果。此外,采用基于置信度的两阶段匹配策略,以降低低置信度检测框对跟踪结果的影响。在nuScenes验证集上对所提出的三维目标检测与跟踪算法进行了性能评估,并通过消融实验验证了算法中各模块的有效性。实验结果表明,基于CTRA模型的点云多目标跟踪算法在跟踪精度上优于基于简单模型的算法,在目标转弯和速度突变场景下的跟踪效果显著提升,且跟踪过程中身份切换次数大幅减少。展开更多
针对联合概率数据关联(JPDA,Joint Probabilistic Data Association)算法关联概率计算过于复杂,无法适应复杂电磁环境下多目标实时跟踪的需求,提出了一种改进的JPDA算法(MJPDA)。首先,考虑多重因素重新定义关联矩阵,并计算关联概率;其次...针对联合概率数据关联(JPDA,Joint Probabilistic Data Association)算法关联概率计算过于复杂,无法适应复杂电磁环境下多目标实时跟踪的需求,提出了一种改进的JPDA算法(MJPDA)。首先,考虑多重因素重新定义关联矩阵,并计算关联概率;其次,对密集杂波下公共量测的关联概率进行修正,引入马氏距离对公共量测进行二次加权,同时考虑公共与非公共量测数目的影响,最后计算修正关联概率。该算法规避了确认矩阵的拆分,有效解决了JPDA算法计算量随杂波密度增加呈指数级增长的问题。通过理论分析和蒙特卡罗仿真实验结果表明,在密集杂波环境下,改进算法具有良好的跟踪性能和较小的计算量,显著提升了算法的实时性。展开更多
针对杂波环境下的多目标跟踪数据互联问题,该文提出基于全邻模糊聚类的联合概率数据互联算法(Joint Probabilistic Data Association algorithm based on All-Neighbor Fuzzy Clustering,ANFCJPDA)。该算法根据确认区域中量测的分布和点...针对杂波环境下的多目标跟踪数据互联问题,该文提出基于全邻模糊聚类的联合概率数据互联算法(Joint Probabilistic Data Association algorithm based on All-Neighbor Fuzzy Clustering,ANFCJPDA)。该算法根据确认区域中量测的分布和点迹-航迹关联规则构造统计距离,以各目标的预测位置为聚类中心,利用模糊聚类方法,计算相关波门内候选量测与不同目标互联的概率,通过概率加权融合对各目标状态与协方差进行更新。仿真分析表明,与经典的联合概率数据互联算法(Joint Probabilistic Data Association algorithm,JPDA)相比,ANFCJPDA较大程度地改善了算法的实时性,并且跟踪精度与JPDA相当。展开更多
文摘A fast joint probabilistic data association （FJPDA） algorithm is proposed in tiffs paper. Cluster probability matrix is approximately calculated by a new method, whose elements βi^t（K） can be taken as evaluation functions. According to values of βi^t（K）, N events with larger joint probabilities can be searched out as the events with guiding joint probabilities, tiros, the number of searching nodes will be greatly reduced. As a result, this method effectively reduces the calculation load and nnkes it possible to be realized on real-thne, Theoretical ,analysis and Monte Carlo simulation results show that this method is efficient.
基金This project was supported by the National Natural Science Foundation of China (60272024).
文摘A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
文摘The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.
基金Supported by the National Natural Science Foundation of China(11078001)
文摘Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system.A multi-sensor data association is proposed based on aftinity propagation(AP)algorithm.The proposed method needs an initial similarity,a distance between any two points,as a parameter,therefore,the similarity matrix is calculated by track position,velocity and azimuth of track data.The approach can automatically obtain the optimal classification of uncertain target based on clustering validity index.Furthermore,the same kind of data are fused based on the variance of measured data and the fusion result can be taken as a new measured data of the target.Finally,the measured data are classified to a certain target based on the nearest neighbor ideas and its characteristics,then filtering and target tracking are conducted.The experimental results show that the proposed method can effectively achieve multi-sensor and multi-target track association.
基金the National Natural Science Foundation of China(61771367)the Science and Technology on Communication Networks Laboratory(HHS19641X003).
文摘Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.
基金Supported by Defense Advanced Research Fund of China
文摘Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has been a difficulty. This paper will discuss a method based on layered searching construction of association hypothesis events. According to the method, the searching schedule of the association events between two layers can be recursive and with independence, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and corresponding computer simulation tests and results are also given in the paper.
文摘针对简单运动模型在复杂驾驶环境多目标跟踪表现不佳的问题,提出了一种基于恒定转弯率和加速度(constant turn rate and acceleration,CTRA)模型的点云多目标跟踪方法。通过采用包含角速度信息的运动模型来描述目标的运动轨迹,可提高在目标转弯时的跟踪精度。同时,利用检测算法提供的速度信息,在轨迹更新时对物体速度进行校正,以改善在目标速度突变时的跟踪效果。此外,采用基于置信度的两阶段匹配策略,以降低低置信度检测框对跟踪结果的影响。在nuScenes验证集上对所提出的三维目标检测与跟踪算法进行了性能评估,并通过消融实验验证了算法中各模块的有效性。实验结果表明,基于CTRA模型的点云多目标跟踪算法在跟踪精度上优于基于简单模型的算法,在目标转弯和速度突变场景下的跟踪效果显著提升,且跟踪过程中身份切换次数大幅减少。
文摘针对联合概率数据关联(JPDA,Joint Probabilistic Data Association)算法关联概率计算过于复杂,无法适应复杂电磁环境下多目标实时跟踪的需求,提出了一种改进的JPDA算法(MJPDA)。首先,考虑多重因素重新定义关联矩阵,并计算关联概率;其次,对密集杂波下公共量测的关联概率进行修正,引入马氏距离对公共量测进行二次加权,同时考虑公共与非公共量测数目的影响,最后计算修正关联概率。该算法规避了确认矩阵的拆分,有效解决了JPDA算法计算量随杂波密度增加呈指数级增长的问题。通过理论分析和蒙特卡罗仿真实验结果表明,在密集杂波环境下,改进算法具有良好的跟踪性能和较小的计算量,显著提升了算法的实时性。
文摘针对杂波环境下的多目标跟踪数据互联问题,该文提出基于全邻模糊聚类的联合概率数据互联算法(Joint Probabilistic Data Association algorithm based on All-Neighbor Fuzzy Clustering,ANFCJPDA)。该算法根据确认区域中量测的分布和点迹-航迹关联规则构造统计距离,以各目标的预测位置为聚类中心,利用模糊聚类方法,计算相关波门内候选量测与不同目标互联的概率,通过概率加权融合对各目标状态与协方差进行更新。仿真分析表明,与经典的联合概率数据互联算法(Joint Probabilistic Data Association algorithm,JPDA)相比,ANFCJPDA较大程度地改善了算法的实时性,并且跟踪精度与JPDA相当。
