Particle filter for extracting target label information when targets move in close proximity

This paper addresses the problem of approximating the posterior probability density function of two targets after a crossing from the Bayesian perspective such that the information about target labels is not lost. To this end, we develop a particle filter that is able to maintain the inherent multimodality of the posterior after the targets have moved in close proximity. Having this approximation available, we are able to extract information about target labels even when the measurements do not provide information about target's identities. In addition, due to the structure of our particle filter, we are able to use an estimator that provides lower optimal subpattern assignment (OSPA) errors than usual estimators

Efficient characterization of labeling uncertainty in closely-spaced targets tracking

In this paper we propose a novel solution to the labeled multi-target tracking problem. The method presented is specially effective in scenarios where the targets have once moved in close proximity. When this is the case, disregarding the labeling uncertainty present in a solution (after the targets split) may lead to a wrong decision by the end user. We take a closer look at the main cause of the labeling problem. By modeling the possible crosses between the targets, we define some relevant labeled point estimates. We extend the concept of crossing objects, which is obvious in one dimension, to scenarios where the objects move in multiple dimensions. Moreover, we provide a measure of uncertainty associated to the proposed solution to tackle the labeling problem. We develop a novel, scalable and modular framework in line with it. The proposed method is applied and analyzed on the basis of one-dimensional objects and two-dimensional objects simulation experiments

Particle filter for extracting target label information when targets move in close proximity

This paper addresses the problem of approximating the posterior probability density function of two targets after a crossing from the Bayesian perspective such that the information about target labels is not lost. To this end, we develop a particle filter that is able to maintain the inherent multimodality of the posterior after the targets have moved in close proximity. Having this approximation available, we are able to extract information about target labels even when the measurements do not provide information about target's identities. In addition, due to the structure of our particle filer, we are able to use an estimator that provides lower optimal subpattern assignment (OSPA) errors than usual estimators. © 2011 IEEE

Two-layer particle filter for multiple target detection and tracking

This paper deals with the detection and tracking of an unknown number of targets using a Bayesian hierarchical model with target labels. To approximate the posterior probability density function, we develop a two-layer particle filter. One deals with track initiation, and the other with track maintenance. In addition, the parallel partition method is proposed to sample the states of the surviving targets

Labeling Uncertainty in Multitarget Tracking

In multitarget tracking, the problem of track labeling (assigning labels to tracks) is an ongoing research topic. The existing literature, however, lacks an appropriate measure of uncertainty related to the assigned labels that has a sound mathematical basis as well as clear practical meaning to the user. This is especially important in a situation where well separated targets move in close proximity with each other and thereafter separate again; in such a situation, it is well known that there will be confusion on target identities, also known as "mixed labeling." In this paper, we specify comprehensively the necessary assumptions for a Bayesian formulation of the multitarget tracking and labeling (MTTL) problem to be meaningful. We provide a mathematical characterization of the labeling uncertainties with clear physical interpretation. We also propose a novel labeling procedure that can be used in combination with any existing (unlabeled) MTT algorithm to obtain a Bayesian solution to the MTTL problem. One advantage of the resulting solution is that it readily provides the labeling uncertainty measures. Using the mixed labeling phenomenon in the presence of two targets as our test bed, we show with simulation results that an unlabeled multitarget sequential Monte Carlo (M-SMC) algorithm that employs sequential importance resampling (SIR) augmented with our labeling procedure performs much better than its "naive" extension, the labeled SIR M-SMC filter

A theoretical analysis of Bayes-optimal multi-target tracking and labelling

In multi-target tracking (MTT), we are often interested not only in finding the position of the multiple objects, but also allowing individual objects to be uniquely identified with the passage of time, by placing a label on each track. While there are many MTT algorithms that produce uniquely identified tracks as output, most of them make use of certain heuristics and/or unrealistic assumptions that makes the global result suboptimal of Bayesian sense. An innovative way of performing MTT is the so-called joint multi-target tracking, where the raw output of the algorithm, rather than being already the collection of output tracks, is a multi-target density calculated by approximating the Bayesian recursion that considers the entire system to have a single multidimensional state. The raw output, i.e. the calculated multi-target density, is thereafter processed to obtain output tracks to be displayed to the operator. This elegant approach, at least in theory, would allow us to precisely represent multi-target statistics. However, most joint MTT methods in the literature handle the problem of track labelling in an ad-hoc, i.e. non-Bayesian manner. A number of methods, however, have suggested that the multi-target density, calculated using the Bayesian recursion, should contain information not only about the location of the individual objects but also their identities. This approach, that we refer as joint MTTL (joint multi-target tracking and labelling), looks intuitively advantageous. It would allow us, at least in theory, to obtain an output consisting of labelled tracks that is optimal in Bayesian sense. Moreover, it would allow us to have statistical information about the assigned labels; for instance, we would know what is the probability that track swap may have occurred after some approximation of targets (or, in simpler words, we would know how much we can believe that a target is what the display says that it is). However, the methods proposed in the still emerging joint MTTL literature do not address some problems that may considerably reduce the usefulness of the approach. These problems include: track coalescence after targets move closely to each other, gradual loss of ambiguity information when particle filters or multiple hypotheses approaches are used, and dealing with unknown/varying number of targets. As we are going to see, each of the previously proposed methods handles only a subset of these problems. Moreover, while obtaining a Bayes-optimal output of labelled tracks is one of the main motivations for joint MTTL, how such output should be obtained is a matter of debate. This work will tackle the joint MTTL problem together with a companion memorandum. In this work, we look at the problem from a theoretical perspective, i.e. we aim to provide an accurate and algorithm-independent picture of the aforementioned problems. An algorithm that actually handles these problems will be proposed in the companion memorandum. As one of the contributions of the memorandum, we clearly characterize the so-called "mixed labelling" phenomenon that leads to track coalescence and other problems, and we verify that, unlike implied in previous literature, it is a physical phenomenon inherent of the MTTL problem rather than specific to a particular approach. We also show how mixed labelling leads to nontrivial issues in practical implementations of joint MTTL. As another of the contributions of the memorandum, we propose a conceptual, algorithm-independent track extraction method for joint MTTL estimators, that gives an output with clear physical interpretation for the user

Characterization of uncertainty in Bayesian estimation using sequential Monte Carlo methods

In estimation problems, accuracy of the estimates of the quantities of interest cannot be taken for granted. This means that estimation errors are expected, and a good estimation algorithm should be able not only to compute estimates that are optimal in some sense, but also provide meaningful measures of uncertainty associated with those estimates. In some situations, we might also be able to reduce estimation uncertainty through the use of feedback on observations, an approach referred to as sensor management. Characterization of estimation uncertainty, as well as sensor management, are certainly difficult tasks for general partially observed processes, which might be non-linear, non-Gaussian, and/or have dependent process and observation noises. Sequential Monte Carlo (SMC) methods, also known as particle filters, are numerical Bayesian estimators which are, in principle, able to handle highly general estimation problems. However, SMC methods are known to suffer from a phenomenon called degeneracy, or self-resolving, which greatly impairs their usefulness against certain classes of problems. One of such classes, that we address in the first part of this thesis, is the joint state and parameter estimation problem, where there are unknown parameters to be estimated together with the timevarying state. Some SMC variants have been proposed to counter the degeneracy phenomenon for this problem, but these state-of-the-art techniques are either non-Bayesian or introduce biases on the system model, which might not be appropriate if proper characterization of estimation uncertainty is required. For this type of scenario, we propose using the Rao-Blackwellized Marginal Particle Filter (RBMPF), a combination of two SMC algorithm variants: the Rao-Blackwellized Particle Filter (RBPF) and the Marginal Particle Filter (MPF). We derive two new versions of the RBMPF: one for models with low dimensional parameter vectors, and another for more general models. We apply the proposed methods to two practical problems: the target tracking problem of turn rate estimation for a constant turn maneuver, and the econometrics problem of stochastic volatility estimation. Our proposed methods are shown to be effective solutions, both in terms of estimation accuracy and statistical consistency, i.e. characterization of estimation uncertainty. Another problem where standard particle filters suffer from degeneracy, addressed in the second part of this thesis, is the joint multi-target tracking and labelling problem. In comparison with the joint state and parameter estimation problem, this problem poses an additional challenge, namely, the fact that it has not been properly mathematically formulated in previous literature. Using Finite Set Statistics (FISST), we provide a sound theoretical formulation for the problem, and in order to actually solve the problem, we propose a novel Bayesian algorithm, the Labelling Uncertainty-Aware Particle Filter (LUA-PF) filter, essentially a combination of the RBMPF and the Multi-target Sequential Monte Carlo (M-SMC) filter techniques. We show that the new algorithm achieves significant improvements on both finding the correct track labelling and providing a meaningful measure of labelling uncertainty. In the last part of this thesis, we address the sensor management problem. Although we apply particle filters to the problem, they are not the main focus of this part of the work. Instead, we concentrate on a more fundamental question, namely, which sensor management criterion should be used in order to obtain the best results in terms of information gain and/or reduction of uncertainty. In order to answer this question, we perform an in-depth theoretical and empirical analysis on two popular sensor management criteria based on information theory – the Kullback-Leibler and R´enyi divergences. On the basis of this analysis, we are able to either confirm or reject some previous arguments used as theoretical justification for these two criteria