Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are...Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are similar for different closely spaced targets, there is ambiguity in using the kinematic information alone; the correct association probability will decrease in conventional joint probabilistic data association algorithm and track coalescence will occur easily. A modified algorithm of joint probabilistic data association with classification-aided is presented, which avoids track coalescence when tracking multiple neighboring targets. Firstly, an identification matrix is defined, which is used to simplify validation matrix to decrease computational complexity. Then, target class information is integrated into the data association process. Performance comparisons with and without the use of class information in JPDA are presented on multiple closely spaced maneuvering targets tracking problem. Simulation results quantify the benefits of classification-aided JPDA for improved multiple targets tracking, especially in the presence of association uncertainty in the kinematic measurement and target maneuvering. Simulation results indicate that the algorithm is valid.展开更多
A rough set probabilistic data association(RS-PDA)algorithm is proposed for reducing the complexity and time consumption of data association and enhancing the accuracy of tracking results in multi-target tracking appl...A rough set probabilistic data association(RS-PDA)algorithm is proposed for reducing the complexity and time consumption of data association and enhancing the accuracy of tracking results in multi-target tracking application.In this new algorithm,the measurements lying in the intersection of two or more validation regions are allocated to the corresponding targets through rough set theory,and the multi-target tracking problem is transformed into a single target tracking after the classification of measurements lying in the intersection region.Several typical multi-target tracking applications are given.The simulation results show that the algorithm can not only reduce the complexity and time consumption but also enhance the accuracy and stability of the tracking results.展开更多
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.展开更多
In most of the passive tracking systems, only the target kinematical information is used in the measurement-to-track association, which results in error tracking in a multitarget environment, where the targets are too...In most of the passive tracking systems, only the target kinematical information is used in the measurement-to-track association, which results in error tracking in a multitarget environment, where the targets are too close to each other. To enhance the tracking accuracy, the target signal classification information （TSCI） should be used to improve the data association. The TSCI is integrated in the data association process using the JPDA （joint probabilistic data association）. The use of the TSCI in the data association can improve discrimination by yielding a purer track and preserving continuity. To verify the validity of the application of TSCI, two simulation experiments are done on an air target-tracing problem, that is, one using the TSCI and the other not using the TSCI. The final comparison shows that the use of the TSCI can effectively improve tracking accuracy.展开更多
Due to the advantages of ant colony optimization （ACO） in solving complex problems, a new data association algorithm based on ACO in a cluttered environment called DACDA is proposed. In the proposed method, the conc...Due to the advantages of ant colony optimization （ACO） in solving complex problems, a new data association algorithm based on ACO in a cluttered environment called DACDA is proposed. In the proposed method, the concept for tour and the length of tour are redefined. Additionally, the directional information is incorporated into the proposed method because it is one of the most important factors that affects the performance of data association. Kalman filter is employed to estimate target states. Computer simulation results show that the proposed method could carry out data association in an acceptable CPU time, and the correct data association rate is higher than that obtained by the data association （DA） algorithm not combined with directional information.展开更多
Usually, only the Cramer-Rao lower bound （CRLB） of single target is taken into consideration in the state estimate of passive tracking systems. As for the case of multitarget, there are few works done due to its com...Usually, only the Cramer-Rao lower bound （CRLB） of single target is taken into consideration in the state estimate of passive tracking systems. As for the case of multitarget, there are few works done due to its complexity. The recursion formula of the posterior Cramer-Rao lower bound （PCRLB） in multitarget bearings-only tracking with the three kinds of data association is presented. Meanwhile, computer simulation is carried out for data association. The final result shows that the accuracy probability of data association has an important impact on the PCRLB.展开更多
Multi-laser-target tracking is an important subject in the field of signal processing of laser warners. A clustering method is applied to the measurement of laser warner, and the space-time fusion for measurements in ...Multi-laser-target tracking is an important subject in the field of signal processing of laser warners. A clustering method is applied to the measurement of laser warner, and the space-time fusion for measurements in the same cluster is accomplished. Real-time tracking of multi-laser-target and real-time picking of multi-laser-signal are introduced using data fusion of the measurements. A prototype device of the algorithm is built up. The results of experiments show that the algorithm is very effective.展开更多
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.展开更多
The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear progr...The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming （LP） based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming （OSIP） algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model （IMM） algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises.展开更多
The amplitude of frequency spectrum can he integrated with prohabilisfic data association （PDA） to distinguish the target with clutter echoes, especially in low SNR underwater environment. A new target-tracking algo...The amplitude of frequency spectrum can he integrated with prohabilisfic data association （PDA） to distinguish the target with clutter echoes, especially in low SNR underwater environment. A new target-tracking algorithm is presented which adopts the amplitude of frequency spectrum to improve target tracking in clutter. The prohabilisfic density distribution of frequency spectrum amplitude is analyzed. By simulation, the results show that the algorithm is superior to PDA. This approach enhances stability for the association probability and increases the performance of target tracking.展开更多
基金Defense Advanced Research Project "the Techniques of Information Integrated Processing and Fusion" in the Eleventh Five-Year Plan (513060302).
文摘Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are similar for different closely spaced targets, there is ambiguity in using the kinematic information alone; the correct association probability will decrease in conventional joint probabilistic data association algorithm and track coalescence will occur easily. A modified algorithm of joint probabilistic data association with classification-aided is presented, which avoids track coalescence when tracking multiple neighboring targets. Firstly, an identification matrix is defined, which is used to simplify validation matrix to decrease computational complexity. Then, target class information is integrated into the data association process. Performance comparisons with and without the use of class information in JPDA are presented on multiple closely spaced maneuvering targets tracking problem. Simulation results quantify the benefits of classification-aided JPDA for improved multiple targets tracking, especially in the presence of association uncertainty in the kinematic measurement and target maneuvering. Simulation results indicate that the algorithm is valid.
文摘A rough set probabilistic data association(RS-PDA)algorithm is proposed for reducing the complexity and time consumption of data association and enhancing the accuracy of tracking results in multi-target tracking application.In this new algorithm,the measurements lying in the intersection of two or more validation regions are allocated to the corresponding targets through rough set theory,and the multi-target tracking problem is transformed into a single target tracking after the classification of measurements lying in the intersection region.Several typical multi-target tracking applications are given.The simulation results show that the algorithm can not only reduce the complexity and time consumption but also enhance the accuracy and stability of the tracking results.
基金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 Youth Science and Technology Foundection of University of Electronic Science andTechnology of China (JX0622).
文摘In most of the passive tracking systems, only the target kinematical information is used in the measurement-to-track association, which results in error tracking in a multitarget environment, where the targets are too close to each other. To enhance the tracking accuracy, the target signal classification information （TSCI） should be used to improve the data association. The TSCI is integrated in the data association process using the JPDA （joint probabilistic data association）. The use of the TSCI in the data association can improve discrimination by yielding a purer track and preserving continuity. To verify the validity of the application of TSCI, two simulation experiments are done on an air target-tracing problem, that is, one using the TSCI and the other not using the TSCI. The final comparison shows that the use of the TSCI can effectively improve tracking accuracy.
文摘Due to the advantages of ant colony optimization （ACO） in solving complex problems, a new data association algorithm based on ACO in a cluttered environment called DACDA is proposed. In the proposed method, the concept for tour and the length of tour are redefined. Additionally, the directional information is incorporated into the proposed method because it is one of the most important factors that affects the performance of data association. Kalman filter is employed to estimate target states. Computer simulation results show that the proposed method could carry out data association in an acceptable CPU time, and the correct data association rate is higher than that obtained by the data association （DA） algorithm not combined with directional information.
文摘Usually, only the Cramer-Rao lower bound （CRLB） of single target is taken into consideration in the state estimate of passive tracking systems. As for the case of multitarget, there are few works done due to its complexity. The recursion formula of the posterior Cramer-Rao lower bound （PCRLB） in multitarget bearings-only tracking with the three kinds of data association is presented. Meanwhile, computer simulation is carried out for data association. The final result shows that the accuracy probability of data association has an important impact on the PCRLB.
基金University Doctor Subject Foundation of China (20060699024)
文摘Multi-laser-target tracking is an important subject in the field of signal processing of laser warners. A clustering method is applied to the measurement of laser warner, and the space-time fusion for measurements in the same cluster is accomplished. Real-time tracking of multi-laser-target and real-time picking of multi-laser-signal are introduced using data fusion of the measurements. A prototype device of the algorithm is built up. The results of experiments show that the algorithm is very effective.
文摘近年来,随着羊只养殖向大规模和精细化的方向发展,羊场对智能化管理的需求日益增加。因此,精准的个体识别和行为监测变得尤为重要,对多目标跟踪(Multiple object tracking, MOT)算法的准确性提出了更高要求。然而,现有的MOT算法在目标遮挡和动态场景下的性能仍不理想。本文提出两种跟踪线索:深度调制交并比(Depth modulated intersection over union, DIoU)和轨迹方向建模(Tracklet direction modeling, TDM),旨在补充交并比(Intersection over union, IoU)线索,提高多目标跟踪的精准度和鲁棒性。DIoU线索通过引入目标的深度信息改进了传统的IoU计算方法。TDM聚焦于目标的运动趋势,预测其未来的移动方向。本文将DIoU和TDM跟踪线索集成到BoT-SORT算法中,形成改进的多目标跟踪算法。在两个私有数据集上,改进算法相比基线方法,MOTA(Multiple object tracking accuracy)指标分别提高1.6、1.7个百分点,IDF1(Identification F1 score)指标分别提高1.9、1.0个百分点。结果显示,改进算法在复杂场景中的跟踪连续性和准确性显著提升。
基金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 the National Natural Science Fundation of China (61203238 61134005+5 种基金 60921001 90916024 91116016)the National Basic Research Program of China (973 Program) (2012CB8212002012CB821201)the National Science Foundation for Postdoctoral Scientists of China (2012M520140)
文摘The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming （LP） based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming （OSIP） algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model （IMM） algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises.
基金This project was supported by the Defense Pre-Research Project of the‘Tenth Five-Year-Plan’of China (40105010101)
文摘The amplitude of frequency spectrum can he integrated with prohabilisfic data association （PDA） to distinguish the target with clutter echoes, especially in low SNR underwater environment. A new target-tracking algorithm is presented which adopts the amplitude of frequency spectrum to improve target tracking in clutter. The prohabilisfic density distribution of frequency spectrum amplitude is analyzed. By simulation, the results show that the algorithm is superior to PDA. This approach enhances stability for the association probability and increases the performance of target tracking.
