Joint Probabilistic Data Association Algorithm Research Articles

Joint Probabilistic Data Association and Smoothing Applied to Multiple Space Object Tracking

A foundational aspect of space domain awareness is the ability to identify and track space objects, including space object discovery and custody. This paper demonstrates the power of combining an efficient multiple hypothesis joint probabilistic data association (MH-JPDA) algorithm with a fixed-interval smoother to simultaneously track multiple space objects. For newly discovered objects, statistical initial orbit determination (SIOD) is possible with a single short optical tracklet, but results in large initial uncertainties. Combining these uncertainties with closely spaced objects can result in highly ambiguous data associations, which can lead to poor state estimates and even filter divergence. This paper invokes MH-JPDA to probabilistically update multiple tracks with multiple simultaneous observations in a sequential filter, while avoiding assigning one-to-one associations. Once sufficient information has been collected, the space objects become uniquely distinguishable among each other. Subsequently, the smoother is applied to achieve improved association of the prior observations. MH-JPDA allows for immediate track formation (using SIOD) and sequential processing of incoming observations, providing statistically rigorous real-time state estimates, whereas smoothing produces a more-refined, higher-confidence overall track estimate at user-defined intervals. This paper demonstrates this approach within the Constrained Admissible Region, Multiple Hypothesis Filter (CAR-MHF) software by tracking a simulated break-up scenario.

Group tracking algorithm for split maneuvering based on complex domain topological descriptions

A group tracking algorithm for split maneuvering based on complex domain topological descriptions is proposed for the tracking of members in a maneuvering group. According to the split characteristics of a group target, split models of group targets are established based on a sliding window feedback mechanism to determine the occurrence and classification of split maneuvering, which makes the tracked objects focus by group members effectively. The track of an outlier single target is reconstructed by the sequential least square method. At the same time, the relationship between the group members is expressed by the complex domain topological description method, which solves the problem of point-track association between the members. The Singer method is then used to update the tracks. Compared with classical multi-target tracking algorithms based on Multiple Hypothesis Tracking (MHT) and the Different Structure Joint Probabilistic Data Association (DS-JPDA) algorithm, the proposed algorithm has better tracking accuracy and stability, is robust against environmental clutter and has stable time-consumption under both classical radar conditions and partly resolvable conditions.

Centralized Multi-Sensor Square Root Cubature Joint Probabilistic Data Association.

This paper focuses on the tracking problem of multiple targets with multiple sensors in a nonlinear cluttered environment. To avoid Jacobian matrix computation and scaling parameter adjustment, improve numerical stability, and acquire more accurate estimated results for centralized nonlinear tracking, a novel centralized multi-sensor square root cubature joint probabilistic data association algorithm (CMSCJPDA) is proposed. Firstly, the multi-sensor tracking problem is decomposed into several single-sensor multi-target tracking problems, which are sequentially processed during the estimation. Then, in each sensor, the assignment of its measurements to target tracks is accomplished on the basis of joint probabilistic data association (JPDA), and a weighted probability fusion method with square root version of a cubature Kalman filter (SRCKF) is utilized to estimate the targets’ state. With the measurements in all sensors processed CMSCJPDA is derived and the global estimated state is achieved. Experimental results show that CMSCJPDA is superior to the state-of-the-art algorithms in the aspects of tracking accuracy, numerical stability, and computational cost, which provides a new idea to solve multi-sensor tracking problems.

Multitarget tracking in cluttered environment for a multistatic passive radar system under the DAB/DVB network

The target tracking using multistatic passive radar in a digital audio/video broadcast (DAB/DVB) network with illuminators of opportunity faces two main challenges: the first challenge is that one has to solve the measurement-to-illuminator association ambiguity in addition to the conventional association ambiguity between the measurements and targets, which introduces a significantly complex three-dimensional (3-D) data association problem among the target-measurement illuminator, this is because all the illuminators transmit the same carrier frequency signals and signals transmitted by different illuminators but reflected via the same target become indistinguishable; the other challenge is that only the bistatic range and range-rate measurements are available while the angle information is unavailable or of very poor quality.In this paper, the authors propose a new target tracking algorithm directly in three-dimensional (3-D) Cartesian coordinates with the capability of track management using the probability of target existence as a track quality measure. The proposed algorithm is termed sequential processing-joint integrated probabilistic data association (SP-JIPDA), which applies the modified sequential processing technique to resolve the additional association ambiguity between measurements and illuminators. The SP-JIPDA algorithm sequentially operates the JIPDA tracker to update each track for each illuminator with all the measurements in the common measurement set at each time. For reasons of fair comparison, the existing modified joint probabilistic data association (MJPDA) algorithm that addresses the 3-D data association problem via “supertargets” using gate grouping and provides tracks directly in 3-D Cartesian coordinates, is enhanced by incorporating the probability of target existence as an effective track quality measure for track management. Both algorithms deal with nonlinear observations using the extended Kalman filtering. A simulation study is performed to verify the superiority of the proposed SP-JIPDA algorithm over the MJIPDA in this multistatic passive radar system.

Distributed Multi-Target Tracking Based on the K-MTSCF Algorithm in Camera Networks

It is a challenging task to develop an effective multi-target tracking algorithm for camera networks due to the factors, such as spurious measurement, limited field of view, complexity of data association algorithm, and so on. In a real-life environment, the system model for camera networks is usually nonlinear, and hence, a Kalman filter may be inappropriate for modeling this system. Besides, the main drawback of traditional joint probabilistic data association (JPDA) is prone to raise the combinatorial explosion problem when the association probabilities have to be calculated. To solve these problems, a multi-target square-root cubature information weighted consensus filter (MTSCF) combined with a K-best joint probabilistic data association algorithm is proposed in this paper. The proposed K-MTSCF algorithm can not only reduce the effect of data association uncertainty stemming from the ambiguity of measurements and computation complexity of data association algorithm by K-best JPDA, but also increase tracking accuracy and stability using MTSCF algorithm. The experimental results demonstrate that the proposed approach performs favorably against the state-of-the-art methods in terms of accuracy and stability for tracking multiple targets in camera networks.

Optimal coordination method of opportunistic array radars for multi‐target‐tracking‐based radio frequency stealth in clutter

AbstractOpportunistic array radar is a new radar system that can improve the modern radar performance effectively. In order to improve its radio frequency stealth ability, a novel coordination method of opportunistic array radars in the network for target tracking in clutter is presented. First, the database of radar cross section for targets is built, then the signal‐to‐noise ratio for netted radars is computed according to the radar cross section and range of target. Then the joint probabilistic data association algorithm of tracking is improved with consideration of emitted power of the opportunistic array radar, which has a main impact on detection probability for tracking in clutter. Finally, with the help of grey relational grade and covariance control, the opportunistic array radar with the minimum radiated power will be selected for better radio frequency stealth performance. Simulation results show that the proposed algorithm not only has excellent tracking accuracy in clutter but also saves much more radiated power comparing with other methods.

Multitarget range-azimuth tracker

We focus on the design of a Kalman filter-based algorithm to track multiple targets in range and azimuth. The detection stage implements a multitarget strategy aimed at collecting and eventually processing all target measurements. Existing tracks are updated using a joint probabilistic data association (JPDA) algorithm to handle the data association problem.We model target echoes as coherent pulse trains in white Gaussian noise with unknown power. The performance analysis assumes a maritime scenario and shows that the proposed tracker outperforms more conventional approaches.

Coalescence-avoiding joint probabilistic data association based on bias removal

AbstractIn order to deal with the track coalescence problem of the joint probabilistic data association (JPDA) algorithm, a novel approach from a state bias removal point of view is developed in this paper. The factors that JPDA causes the state bias are analyzed, and the direct computation equation of the bias in the ideal case is given. Then based on the definitions of target detection hypothesis and target-to-target association hypothesis, the bias estimation is extended to the general and practical case. Finally, the estimated bias is removed from the state updated by JPDA to generate the unbiased state. The results of Monte Carlo simulations show that the proposed method can handle track coalescence and presents better performance when compared with the traditional methods.

An Efficient, Variational Approximation of the Best Fitting Multi-Bernoulli Filter

The joint probabilistic data association (JPDA) filter is a popular tracking methodology for problems involving well-spaced targets, but it is rarely applied in problems with closely-spaced targets due to its complexity in these cases, and due to the well-known phenomenon of coalescence. This paper addresses these difficulties using random finite sets (RFSs) and variational inference, deriving a highly tractable, approximate method for obtaining the multi-Bernoulli distribution that minimises the set Kullback-Leibler (KL) divergence from the true posterior, working within the RFS framework to incorporate uncertainty in target existence. The derivation is interpreted as an application of expectation-maximisation (EM), where the missing data is the correspondence of Bernoulli components (i.e., tracks) under each data association hypothesis. The missing data is shown to play an identical role to the selection of an ordered distribution in the same ordered family in the set JPDA algorithm. Subsequently, a special case of the proposed method is utilised to provide an efficient approximation of the minimum mean optimal sub-pattern assignment estimator. The performance of the proposed methods is demonstrated in challenging scenarios in which up to twenty targets come into close proximity.

Extended Probabilistic Data Association Algorithm

[Purpos In order to improve the accuracy of target tracking and reduce losing rate of target in the multiple target tracking, a new algorithm called Extended Probabilistic Data Association (EPDA) is presented in this paper. [Metho This paper defines joint association event based on the number of target and puts forward the EPDA for target tracking. [Result Experimental results show that this algorithm has higher accuracy of target tracking than the Probabilistic Data Association algorithm and costs much less time relative to the Joint Probabilistic Data Association algorithm. [Conclusion Consequently, EPDA is an effective algorithm to balance the accuracy and the losing rate in target tracking.

Integrated track initialization and maintenance in heavy clutter using probabilistic data association

Target tracking in high clutter or low signal-to-noise ratio (SNR) environments is an important topic and still a challenging task. Joint Maximum Likelihood Probabilistic Data Association (JML-PDA) is a well-known batch method for initializing the tracks of very low observable (VLO) targets in heavy clutter environments. On the other hand, the Joint Probabilistic Data Association (JPDA) algorithm, which is commonly used for recursive track maintenance, lacks track initialization capability. In this paper, we propose a Combined JML-PDA and JPDA (CJML-PDA) algorithm to automatically initialize and maintain the tracks. This combined approach seamlessly shares information between the initialization and maintenance stages of the tracker. In contrast, in other batch-recursive approaches the initialization and maintenance algorithms operate rather independent of each other. The effectiveness of the proposed algorithm is demonstrated on a heavy clutter scenario and its performance is tested on closely-spaced (but resolved) targets with association ambiguity using angle-only measurements.

A Method of Multi-sensor and Multi-target Tracking and Fusion Based on Double-threshold Technique

The data fusion can come down to a process that combines the state vectors from different sources to obtain a more accurate result. Compare to the achieved results that depend on single source, the method has gained an improved performance and reduced the computational complexity and bandwidth of transmission as well. This paper makes use of Probabilistic Data Association (PDA) algorithm and Joint Probabilistic Data Association (JPDA) algorithm to track the Multi-target for each local sensor in a clutter environment. Furthermore, a method based on statistical double-threshold association algorithm and covariance-weighted fusion algorithm is proposed in this paper. Meanwhile, the simulation result shows that the performance has been improved significantly in multi-sensor and multi-target tracking progress with the proposed method in the paper.

An object correlation and maneuver detection approach for space surveillance

Object correlation and maneuver detection are persistent problems in space surveillance and maintenance of a space object catalog. We integrate these two problems into one interrelated problem, and consider them simultaneously under a scenario where space objects only perform a single in-track orbital maneuver during the time intervals between observations. We mathematically formulate this integrated scenario as a maximum a posteriori (MAP) estimation. In this work, we propose a novel approach to solve the MAP estimation. More precisely, the corresponding posterior probability of an orbital maneuver and a joint association event can be approximated by the Joint Probabilistic Data Association (JPDA) algorithm. Subsequently, the maneuvering parameters are estimated by optimally solving the constrained non-linear least squares iterative process based on the second-order cone programming (SOCP) algorithm. The desired solution is derived according to the MAP criterions. The performance and advantages of the proposed approach have been shown by both theoretical analysis and simulation results. We hope that our work will stimulate future work on space surveillance and maintenance of a space object catalog.

클러터 환경에서 Track Coalescence & Switch 감소를 위한 JPDA 기법연구

Data association is important technology which designate final destination in the target tracking. The joint probabilistic data association(JPDA) algorithm provides excellent ability to maintain track on multiple targets. Currently, it is not easily implemented in real time because of track coalescence & switch. The aim of this paper is to develop probabilistic filters that increase JPDA`s sensitivity and decrease track coalescence & switch in a cluttered environments.

Modified Joint Probability Data Association Algorithm Avoiding Track Coalescence

Joint Probabilistic Data Association has proven to be effective in tracking multiple targets from measurements amidst clutter and missed detections. But the traditional Joint Probabilistic Data Association algorithm will cause track coalescence when the targets are parallel neighboring or small-angle crossing. To avoid track coalescence, a modified Joint Probabilistic Data Association algorithm is proposed in this paper. An exclusive measurement is defined for every target in the new algorithm. The exclusive measurement of a target is one measurement which associates with the target and has the maximum associated probability. The associated events of the exclusive measurement with other targets will be pruned, which resists two or more targets share the same measurement as a key measurement and avoids track coalescence. The simulation results show that the new algorithm can effectively solve track coalescence problem in all kinds of scenarios and keep a high tracking performance.

Shape-Based Online Multitarget Tracking and Detection for Targets Causing Multiple Measurements: Variational Bayesian Clustering and Lossless Data Association

This paper proposes a novel online two-level multitarget tracking and detection (MTTD) algorithm. The algorithm focuses on multitarget detection and tracking for the case of multiple measurements per target and for an unknown and varying number of targets. Information is continuously exchanged in both directions between the two levels. Using the high level target position and shape information, the low level clusters the measurements. Furthermore, the low level features automatic relevance detection (ARD), as it automatically determines the optimal number of clusters from the measurements taking into account the expected target shapes. The high level's data association allows for a varying number of targets. A joint probabilistic data association algorithm looks for associations between clusters of measurements and targets. These associations are used to update the target trackers and the target shapes with the individual measurements. No information is lost in the two-level approach since the measurement information is not summarized into features. The target trackers are based on an underlying motion model, while the high level is supplemented with a filter estimating the number of targets. The algorithm is verified using both simulations and experiments using two sensor modalities, video and laser scanner, for detection and tracking of people and ants.

A New Joint Possibility Data Association Algorithm Avoiding Track Coalescence

For the problem of tracking multiple targets, the Joint Probabilistic Data Association approach has shown to be very effective in handling clutter and missed detections. However, it tends to coalesce neighboring tracks and ignores the coupling between those tracks. To avoid track coalescence,a K Nearest Neighbor Joint Probabilistic Data Association algorithm is proposed in this paper. Like the Joint Probabilistic Data Association algorithm, the association possibilities of target with every measurement will be computed in the new algorithm, but only the first K measurements whose association probabilities with the target are larger than others' are used to estimate target's state. Finally, through Monte Carlo simulations, it is shown that the new algorithm is able to avoid track coalescence and keeps good tracking performance in heavy clutter and missed detections.

Modified joint probabilistic data association with classification-aided for multitarget tracking

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.

Distributed interacted multisensor joint probabilistic data association algorithm based on D-S theory

In order to resolve the multisensor multiplied maneuvering target tracking problem, this paper presents a distributed interacted multiple model multisensor joint probabilistic data association algorithm (DIMM-MSJPDA). First of all, the interacted multiple model joint probabilistic data association algorithm is applied to each sensor, and then the state estimation, estimation covariance, model probability, combined innovation, innovation covariance are delivered to the fusion center. Then, the tracks from each sensor are correlated and the D-S evidence theory is used to gain the model probability of an identical target. Finally, the ultimate state estimation of each target is calculated according to the new model probability, and the state estimation is transmitted to each sensor. Simulations are designed to test the tracking performance of DIMM-MSJPDA algorithm. The results show that the use of DIMM-MSJPDA algorithm enables the distributed multisensor system to track multiplied maneuvering targets and its tracking performance is much better than that of IMMJPDA algorithm.

A new fast algorithm for multitarget tracking in dense clutter

A fast joint probabilistic data association (FJPDA) algorithm is proposed in this 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) events with larger joint probabilities can be searched out as the events with guiding joint probabilities, thus, the number of searching nodes will be greatly reduced. As a result, this method effectively reduces the calculation load and makes it possible to be realized on real-time. Theoretical analysis and Monte Carlo simulation results show that this method is efficient.