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

Extended Object Tracking: Introduction, Overview and Applications

This article provides an elaborate overview of current research in extended object tracking. We provide a clear definition of the extended object tracking problem and discuss its delimitation to other types of object tracking. Next, different aspects of extended object modelling are extensively discussed. Subsequently, we give a tutorial introduction to two basic and well used extended object tracking approaches - the random matrix approach and the Kalman filter-based approach for star-convex shapes. The next part treats the tracking of multiple extended objects and elaborates how the large number of feasible association hypotheses can be tackled using both Random Finite Set (RFS) and Non-RFS multi-object trackers. The article concludes with a summary of current applications, where four example applications involving camera, X-band radar, light detection and ranging (lidar), red-green-blue-depth (RGB-D) sensors are highlighted.Comment: 30 pages, 19 figure

Random finite sets in multi-target tracking - efficient sequential MCMC implementation

Over the last few decades multi-target tracking (MTT) has proved to be a challenging and attractive research topic. MTT applications span a wide variety of disciplines, including robotics, radar/sonar surveillance, computer vision and biomedical research. The primary focus of this dissertation is to develop an effective and efficient multi-target tracking algorithm dealing with an unknown and time-varying number of targets. The emerging and promising Random Finite Set (RFS) framework provides a rigorous foundation for optimal Bayes multi-target tracking. In contrast to traditional approaches, the collection of individual targets is treated as a set-valued state. The intent of this dissertation is two-fold; first to assert that the RFS framework not only is a natural, elegant and rigorous foundation, but also leads to practical, efficient and reliable algorithms for Bayesian multi-target tracking, and second to provide several novel RFS based tracking algorithms suitable for the specific Track-Before-Detect (TBD) surveillance application. One main contribution of this dissertation is a rigorous derivation and practical implementation of a novel algorithm well suited to deal with multi-target tracking problems for a given cardinality. The proposed Interacting Population-based MCMC-PF algorithm makes use of several Metropolis-Hastings samplers running in parallel, which interact through genetic variation. Another key contribution concerns the design and implementation of two novel algorithms to handle a varying number of targets. The first approach exploits Reversible Jumps. The second approach is built upon the concepts of labeled RFSs and multiple cardinality hypotheses. The performance of the proposed algorithms is also demonstrated in practical scenarios, and shown to significantly outperform conventional multi-target PF in terms of track accuracy and consistency. The final contribution seeks to exploit external information to increase the performance of the surveillance system. In multi-target scenarios, kinematic constraints from the interaction of targets with their environment or other targets can restrict target motion. Such motion constraint information is integrated by using a fixed-lag smoothing procedure, named Knowledge-Based Fixed-Lag Smoother (KB-Smoother). The proposed combination IP-MCMC-PF/KB-Smoother yields enhanced tracking

Robust Distributed Fusion with Labeled Random Finite Sets

This paper considers the problem of the distributed fusion of multi-object posteriors in the labeled random finite set filtering framework, using Generalized Covariance Intersection (GCI) method. Our analysis shows that GCI fusion with labeled multi-object densities strongly relies on label consistencies between local multi-object posteriors at different sensor nodes, and hence suffers from a severe performance degradation when perfect label consistencies are violated. Moreover, we mathematically analyze this phenomenon from the perspective of Principle of Minimum Discrimination Information and the so called yes-object probability. Inspired by the analysis, we propose a novel and general solution for the distributed fusion with labeled multi-object densities that is robust to label inconsistencies between sensors. Specifically, the labeled multi-object posteriors are firstly marginalized to their unlabeled posteriors which are then fused using GCI method. We also introduce a principled method to construct the labeled fused density and produce tracks formally. Based on the developed theoretical framework, we present tractable algorithms for the family of generalized labeled multi-Bernoulli (GLMB) filters including $\delta$-GLMB, marginalized $\delta$-GLMB and labeled multi-Bernoulli filters. The robustness and efficiency of the proposed distributed fusion algorithm are demonstrated in challenging tracking scenarios via numerical experiments.Comment: 17pages, 23 figure

Box-Particle Labeled Multi-Bernoulli Filter for Multiple Extended Target Tracking

This paper focuses on real-time tracking of multiple extended targets in clutter based on labeled multi-Bernoulli filter. To address this problem, a novel approach is proposed within the recently presented box-particle framework. Unlike the traditional point-particle approach, the measurements of extended targets are modeled as interval measurements in this work, and the corresponding likelihood function is given based on interval analysis. Then, labeled multi-Bernoulli recursion for extended targets is implemented by box particles, referred to as BP-LMB filter. Furthermore, BP-MM-LMB filter is proposed to better accommodate the uncertainty of target dynamics by integrating the BP-LMB filter with interacting multiple models (IMM) algorithm. Simulations demonstrate that the proposed approach can significantly reduce the number of particles and well track multiple extended targets with less runtime

Online Audio-Visual Multi-Source Tracking and Separation: A Labeled Random Finite Set Approach

The dissertation proposes an online solution for separating an unknown and time-varying number of moving sources using audio and visual data. The random finite set framework is used for the modeling and fusion of audio and visual data. This enables an online tracking algorithm to estimate the source positions and identities for each time point. With this information, a set of beamformers can be designed to separate each desired source and suppress the interfering sources