Multiple Target, Multiple Type Filtering in the RFS Framework

A Multiple Target, Multiple Type Filtering (MTMTF) algorithm is developed using Random Finite Set (RFS) theory. First, we extend the standard Probability Hypothesis Density (PHD) filter for multiple types of targets, each with distinct detection properties, to develop a multiple target, multiple type filtering, N-type PHD filter, where $N\geq2$, for handling confusions among target types. In this approach, we assume that there will be confusions between detections, i.e. clutter arises not just from background false positives, but also from target confusions. Then, under the assumptions of Gaussianity and linearity, we extend the Gaussian mixture (GM) implementation of the standard PHD filter for the proposed N-type PHD filter termed the N-type GM-PHD filter. Furthermore, we analyze the results from simulations to track sixteen targets of four different types using a four-type (quad) GM-PHD filter as a typical example and compare it with four independent GM-PHD filters using the Optimal Subpattern Assignment (OSPA) metric. This shows the improved performance of our strategy that accounts for target confusions by efficiently discriminating them

Box-Particle Implementation and Comparison of Cardinalized Probability Hypothesis Density Filter

This paper develops a box-particle implementation of cardinalized probability hypothesis density filter to track multiple targets and estimate the unknown number of targets. A box particle is a random sample that occupies a small and controllable rectangular region of nonzero volume in the target state space. In box-particle filter the huge number of traditional point observations is instead by a remarkably reduced number of interval measurements. It decreases the number of particles significantly and reduces the runtime considerably. The proposed algorithm based on box-particle is able to reach a similar accuracy to a Sequential Monte Carlo cardinalized probability hypothesis density (SMC-CPHD) filter with much less computational costs. Not only does it propagates the PHD, but also propagates the cardinality distribution of target number. Therefore, it generates more accurate and stable instantaneous estimates of target number as well as target state than the box-particle probability hypothesis density (BP-PHD) filter does especially in dense clutter environment. Comparison and analysis based on the simulations in different probability of detection and different clutter rate have been done. The effectiveness and reliability of the proposed algorithm are verified by the simulation results

A Gaussian Mixture PHD Filter for Jump Markov System Models

The probability hypothesis density (PHD) filter is an attractive approach to tracking an unknown and time-varying number of targets in the presence of data association uncertainty, clutter, noise, and detection uncertainty. The PHD filter admits a closed-form solution for a linear Gaussian multi-target model. However, this model is not general enough to accommodate maneuvering targets that switch between several models. In this paper, we generalize the notion of linear jump Markov systems to the multiple target case to accommodate births, deaths, and switching dynamics. We then derive a closed-form solution to the PHD recursion for the proposed linear Gaussian jump Markov multi-target model. Based on this an efficient method for tracking multiple maneuvering targets that switch between a set of linear Gaussian models is developed. An analytic implementation of the PHD filter using statistical linear regression technique is also proposed for targets that switch between a set of nonlinear models. We demonstrate through simulations that the proposed PHD filters are effective in tracking multiple maneuvering targets

A Robust Multi-Sensor PHD Filter Based on Multi-Sensor Measurement Clustering

[EN] This letter presents a novel multi-sensor probability hypothesis density (PHD) filter for multi-target tracking by means of multiple or even massive sensors that are linked by a fusion center or by a peer-to-peer network. As a challenge, we find there is little known about the statistical properties of the sensors in terms of their measurement noise, clutter, target detection probability, and even potential cross-correlation. Our approach converts the collection of the measurements of different sensors to a set of proxy and homologous measurements. These synthetic measurements overcome the problems of false and missing data and of unknown statistics, and facilitate linear PHD updating that amounts to the standard PHD filtering with no false and missing data. Simulation has demonstrated the advantages and limitations of our approach in comparison with the cutting-edge multi-sensor/distributed PHD filters

PHD Filter for Object Tracking in Road Traffic Applications Considering Varying Detectability

This paper considers the object detection and tracking problem in a road traffic situation from a traffic participant’s perspective. The information source is an automotive radar which is attached to the ego vehicle. The scenario characteristics are varying object visibility due to occlusion and multiple detections of a vehicle during a scanning interval. The goal is to maintain and report the state of undetected though possibly present objects. The proposed algorithm is based on the multi-object Probability Hypothesis Density filter. Because the PHD filter has no memory, the estimate of the number of objects present can change abruptly due to erroneous detections. To reduce this effect, we model the occlusion of the object to calculate the state-dependent detection probability. Thus, the filter can maintain unnoticed but probably valid hypotheses for a more extended period. We use the sequential Monte Carlo method with clustering for implementing the filter. We distinguish between detected, undetected, and hidden particles within our framework, whose purpose is to track hidden but likely present objects. The performance of the algorithm is demonstrated using highway radar measurements

Poisson multi-Bernoulli mixture trackers: continuity through random finite sets of trajectories

The Poisson multi-Bernoulli mixture (PMBM) is an unlabelled multi-target distribution for which the prediction and update are closed. It has a Poisson birth process, and new Bernoulli components are generated on each new measurement as a part of the Bayesian measurement update. The PMBM filter is similar to the multiple hypothesis tracker (MHT), but seemingly does not provide explicit continuity between time steps. This paper considers a recently developed formulation of the multi-target tracking problem as a random finite set (RFS) of trajectories, and derives two trajectory RFS filters, called PMBM trackers. The PMBM trackers efficiently estimate the set of trajectories, and share hypothesis structure with the PMBM filter. By showing that the prediction and update in the PMBM filter can be viewed as an efficient method for calculating the time marginals of the RFS of trajectories, continuity in the same sense as MHT is established for the PMBM filter

Marginal multi-Bernoulli filters: RFS derivation of MHT, JIPDA and association-based MeMBer

Recent developments in random finite sets (RFSs) have yielded a variety of tracking methods that avoid data association. This paper derives a form of the full Bayes RFS filter and observes that data association is implicitly present, in a data structure similar to MHT. Subsequently, algorithms are obtained by approximating the distribution of associations. Two algorithms result: one nearly identical to JIPDA, and another related to the MeMBer filter. Both improve performance in challenging environments.Comment: Journal version at http://ieeexplore.ieee.org/document/7272821. Matlab code of simple implementation included with ancillary file