An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as dron...An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.展开更多
In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with ...In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with extended targets, without distinguishing the measurements originating from the true targets or clutter.Based on our recent work on extended box-particle probability hypothesis density(ET-BP-PHD) filter, we propose the extended labeled box-particle cardinalized probability hypothesis density(ET-LBP-CPHD) filter, which relaxes the Poisson assumptions of the extended target probability hypothesis density(PHD) filter in target numbers, and propagates not only the intensity function but also cardinality distribution. Moreover, it provides the identity of individual target by adding labels to box-particles. The proposed filter can improve the precision of estimating target number meanwhile achieve targets' tracks. The effectiveness and reliability of the proposed algorithm are verified by the simulation results.展开更多
The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influen...The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.展开更多
In this paper, we consider the problem of irregular shapes tracking for multiple extended targets by introducing the Gaussian surface matrix(GSM) into the framework of the random finite set(RFS) theory. The Gaussi...In this paper, we consider the problem of irregular shapes tracking for multiple extended targets by introducing the Gaussian surface matrix(GSM) into the framework of the random finite set(RFS) theory. The Gaussian surface function is constructed first by the measurements, and it is used to define the GSM via a mapping function. We then integrate the GSM with the probability hypothesis density(PHD) filter, the Bayesian recursion formulas of GSM-PHD are derived and the Gaussian mixture implementation is employed to obtain the closed-form solutions. Moreover, the estimated shapes are designed to guide the measurement set sub-partition, which can cope with the problem of the spatially close target tracking. Simulation results show that the proposed algorithm can effectively estimate irregular target shapes and exhibit good robustness in cross extended target tracking.展开更多
In multi-target tracking,Multiple Hypothesis Tracking (MHT) can effectively solve the data association problem. However,traditional MHT can not make full use of motion information. In this work,we combine MHT with Int...In multi-target tracking,Multiple Hypothesis Tracking (MHT) can effectively solve the data association problem. However,traditional MHT can not make full use of motion information. In this work,we combine MHT with Interactive Multiple Model (IMM) estimator and feature fusion. New algorithm greatly improves the tracking performance due to the fact that IMM estimator provides better estimation and feature information enhances the accuracy of data association. The new algorithm is tested by tracking tropical fish in fish container. Experimental result shows that this algorithm can significantly reduce tracking lost rate and restrain the noises with higher computational effectiveness when compares with traditional MHT.展开更多
The probability hypothesis density(PHD) filter has been recognized as a promising technique for tracking an unknown number of targets. The performance of the PHD filter, however, is sensitive to the available knowledg...The probability hypothesis density(PHD) filter has been recognized as a promising technique for tracking an unknown number of targets. The performance of the PHD filter, however, is sensitive to the available knowledge on model parameters such as the measurement noise variance and those associated with the changes in the maneuvering target trajectories. If these parameters are unknown in advance, the tracking performance may degrade greatly. To address this aspect, this paper proposes to incorporate the adaptive parameter estimation(APE) method in the PHD filter so that the model parameters, which may be static and/or time-varying, can be estimated jointly with target states. The resulting APE-PHD algorithm is implemented using the particle filter(PF), which leads to the PF-APE-PHD filter. Simulations show that the newly proposed algorithm can correctly identify the unknown measurement noise variances, and it is capable of tracking multiple maneuvering targets with abrupt changing parameters in a more robust manner, compared to the multi-model approaches.展开更多
Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper ...Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper focuses on the tracking algo- rithm for hypothesis generation, hypothesis probability calculation, hypotheses reduction and pruning and other sectors. From an engineering point of view, a technique called the linear assignment problem (LAP) used in the implementation of M-best feasible hypotheses generation, the number of the hypotheses is relatively small compared with the total number that may exist in each scan, also the N-scan back pruning is used, the algorithm's efficiency and practicality have been improved. Monte Carlo simulation results show that the proposed algorithm can track the boost phase of multiple ballistic missiles and it has a good tracking performance compared with joint probability data association (JPDA).展开更多
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.展开更多
Probability Hypothesis Density (PHD) filtering approach has shown its advantages in tracking time varying number of targets even when there are noise,clutter and misdetection. For linear Gaussian Mixture (GM) system,P...Probability Hypothesis Density (PHD) filtering approach has shown its advantages in tracking time varying number of targets even when there are noise,clutter and misdetection. For linear Gaussian Mixture (GM) system,PHD filter has a closed form recursion (GMPHD). But PHD filter cannot estimate the trajectories of multi-target because it only provides identity-free estimate of target states. Existing data association methods still remain a big challenge mostly because they are com-putationally expensive. In this paper,we proposed a new data association algorithm using GMPHD filter,which significantly alleviated the heavy computing load and performed multi-target trajectory tracking effectively in the meantime.展开更多
As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algori...As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algorithm is used to extract target states,a free clustering optimal P-PHD(FCO-P-PHD) filter is proposed.This method can lead to obtainment of analytical form of optimal sampling density of P-PHD filter and realization of optimal P-PHD filter without use of clustering algorithms in extraction target states.Besides,as sate extraction method in FCO-P-PHD filter is coupled with the process of obtaining analytical form for optimal sampling density,through decoupling process,a new single-sensor free clustering state extraction method is proposed.By combining this method with standard P-PHD filter,FC-P-PHD filter can be obtained,which significantly improves the tracking performance of P-PHD filter.In the end,the effectiveness of proposed algorithms and their advantages over other algorithms are validated through several simulation experiments.展开更多
基金supported by the National Natural Science Foundation of China (61773142)。
文摘An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.
文摘In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with extended targets, without distinguishing the measurements originating from the true targets or clutter.Based on our recent work on extended box-particle probability hypothesis density(ET-BP-PHD) filter, we propose the extended labeled box-particle cardinalized probability hypothesis density(ET-LBP-CPHD) filter, which relaxes the Poisson assumptions of the extended target probability hypothesis density(PHD) filter in target numbers, and propagates not only the intensity function but also cardinality distribution. Moreover, it provides the identity of individual target by adding labels to box-particles. The proposed filter can improve the precision of estimating target number meanwhile achieve targets' tracks. The effectiveness and reliability of the proposed algorithm are verified by the simulation results.
基金supported by the National Natural Science Foundation of China(61401475)
文摘The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.
基金supported by the National Natural Science Foundation of China(6130501761304264+1 种基金61402203)the Natural Science Foundation of Jiangsu Province(BK20130154)
文摘In this paper, we consider the problem of irregular shapes tracking for multiple extended targets by introducing the Gaussian surface matrix(GSM) into the framework of the random finite set(RFS) theory. The Gaussian surface function is constructed first by the measurements, and it is used to define the GSM via a mapping function. We then integrate the GSM with the probability hypothesis density(PHD) filter, the Bayesian recursion formulas of GSM-PHD are derived and the Gaussian mixture implementation is employed to obtain the closed-form solutions. Moreover, the estimated shapes are designed to guide the measurement set sub-partition, which can cope with the problem of the spatially close target tracking. Simulation results show that the proposed algorithm can effectively estimate irregular target shapes and exhibit good robustness in cross extended target tracking.
基金Supported by the National Natural Science Foundation of China (No. 60772154)the President Foundation of Graduate University of Chinese Academy of Sciences (No. 085102GN00)
文摘In multi-target tracking,Multiple Hypothesis Tracking (MHT) can effectively solve the data association problem. However,traditional MHT can not make full use of motion information. In this work,we combine MHT with Interactive Multiple Model (IMM) estimator and feature fusion. New algorithm greatly improves the tracking performance due to the fact that IMM estimator provides better estimation and feature information enhances the accuracy of data association. The new algorithm is tested by tracking tropical fish in fish container. Experimental result shows that this algorithm can significantly reduce tracking lost rate and restrain the noises with higher computational effectiveness when compares with traditional MHT.
基金supported by the National Natural Science Foundation of China (Nos. 61305017, 61304264)the Natural Science Foundation of Jiangsu Province (No. BK20130154)
文摘The probability hypothesis density(PHD) filter has been recognized as a promising technique for tracking an unknown number of targets. The performance of the PHD filter, however, is sensitive to the available knowledge on model parameters such as the measurement noise variance and those associated with the changes in the maneuvering target trajectories. If these parameters are unknown in advance, the tracking performance may degrade greatly. To address this aspect, this paper proposes to incorporate the adaptive parameter estimation(APE) method in the PHD filter so that the model parameters, which may be static and/or time-varying, can be estimated jointly with target states. The resulting APE-PHD algorithm is implemented using the particle filter(PF), which leads to the PF-APE-PHD filter. Simulations show that the newly proposed algorithm can correctly identify the unknown measurement noise variances, and it is capable of tracking multiple maneuvering targets with abrupt changing parameters in a more robust manner, compared to the multi-model approaches.
文摘Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper focuses on the tracking algo- rithm for hypothesis generation, hypothesis probability calculation, hypotheses reduction and pruning and other sectors. From an engineering point of view, a technique called the linear assignment problem (LAP) used in the implementation of M-best feasible hypotheses generation, the number of the hypotheses is relatively small compared with the total number that may exist in each scan, also the N-scan back pruning is used, the algorithm's efficiency and practicality have been improved. Monte Carlo simulation results show that the proposed algorithm can track the boost phase of multiple ballistic missiles and it has a good tracking performance compared with joint probability data association (JPDA).
基金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.
基金Supported by the National Natural Science Foundation of China (No.60772154)the President Foundation of Graduate University of Chinese Academy of Sciences (No.085102GN00)
文摘Probability Hypothesis Density (PHD) filtering approach has shown its advantages in tracking time varying number of targets even when there are noise,clutter and misdetection. For linear Gaussian Mixture (GM) system,PHD filter has a closed form recursion (GMPHD). But PHD filter cannot estimate the trajectories of multi-target because it only provides identity-free estimate of target states. Existing data association methods still remain a big challenge mostly because they are com-putationally expensive. In this paper,we proposed a new data association algorithm using GMPHD filter,which significantly alleviated the heavy computing load and performed multi-target trajectory tracking effectively in the meantime.
文摘As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algorithm is used to extract target states,a free clustering optimal P-PHD(FCO-P-PHD) filter is proposed.This method can lead to obtainment of analytical form of optimal sampling density of P-PHD filter and realization of optimal P-PHD filter without use of clustering algorithms in extraction target states.Besides,as sate extraction method in FCO-P-PHD filter is coupled with the process of obtaining analytical form for optimal sampling density,through decoupling process,a new single-sensor free clustering state extraction method is proposed.By combining this method with standard P-PHD filter,FC-P-PHD filter can be obtained,which significantly improves the tracking performance of P-PHD filter.In the end,the effectiveness of proposed algorithms and their advantages over other algorithms are validated through several simulation experiments.