Arithmetic Average Density Fusion -- Part III: Heterogeneous Unlabeled and Labeled RFS Filter Fusion

This paper proposes a heterogenous density fusion approach to scalable multisensor multitarget tracking where the inter-connected sensors run different types of random finite set (RFS) filters according to their respective capacity and need. These diverse RFS filters result in heterogenous multitarget densities that are to be fused with each other in a proper means for more robust and accurate detection and localization of the targets. Our approach is based on Gaussian mixture implementations where the local Gaussian components (L-GCs) are revised for PHD consensus, i.e., the corresponding unlabeled probability hypothesis densities (PHDs) of each filter best fit their average regardless of the specific type of the local densities. To this end, a computationally efficient, coordinate descent approach is proposed which only revises the weights of the L-GCs, keeping the other parameters unchanged. In particular, the PHD filter, the unlabeled and labeled multi-Bernoulli (MB/LMB) filters are considered. Simulations have demonstrated the effectiveness of the proposed approach for both homogeneous and heterogenous fusion of the PHD-MB-LMB filters in different configurations.Comment: 11 pages, 14 figures. IEEE Transactions on Aerospace and Electronics Systems, 202

Robust Multi-target Tracking with Bootstrapped-GLMB Filter

This dissertation presents novel multi-target tracking algorithms that obviate the need for prior knowledge of system parameters such as clutter rate, detection probabilities, and birth models. Information on these parameters is unknown but important to tracking performance. The proposed algorithms exploit the advantages of existing RFS trackers and filters by bootstrapping them. This configuration inherits the efficiency of tracking target trajectories from the RFS trackers and low complexity in parameter estimation from the RFS filters

Acoustic Speaker Localization with Strong Reverberation and Adaptive Feature Filtering with a Bayes RFS Framework

The thesis investigates the challenges of speaker localization in presence of strong reverberation, multi-speaker tracking, and multi-feature multi-speaker state filtering, using sound recordings from microphones. Novel reverberation-robust speaker localization algorithms are derived from the signal and room acoustics models. A multi-speaker tracking filter and a multi-feature multi-speaker state filter are developed based upon the generalized labeled multi-Bernoulli random finite set framework. Experiments and comparative studies have verified and demonstrated the benefits of the proposed methods

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

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

Robust Multi-Object Tracking: A Labeled Random Finite Set Approach

The labeled random finite set based generalized multi-Bernoulli filter is a tractable analytic solution for the multi-object tracking problem. The robustness of this filter is dependent on certain knowledge regarding the multi-object system being available to the filter. This dissertation presents techniques for robust tracking, constructed upon the labeled random finite set framework, where complete information regarding the system is unavailable