24,436 research outputs found
PPF - A Parallel Particle Filtering Library
We present the parallel particle filtering (PPF) software library, which
enables hybrid shared-memory/distributed-memory parallelization of particle
filtering (PF) algorithms combining the Message Passing Interface (MPI) with
multithreading for multi-level parallelism. The library is implemented in Java
and relies on OpenMPI's Java bindings for inter-process communication. It
includes dynamic load balancing, multi-thread balancing, and several
algorithmic improvements for PF, such as input-space domain decomposition. The
PPF library hides the difficulties of efficient parallel programming of PF
algorithms and provides application developers with the necessary tools for
parallel implementation of PF methods. We demonstrate the capabilities of the
PPF library using two distributed PF algorithms in two scenarios with different
numbers of particles. The PPF library runs a 38 million particle problem,
corresponding to more than 1.86 GB of particle data, on 192 cores with 67%
parallel efficiency. To the best of our knowledge, the PPF library is the first
open-source software that offers a parallel framework for PF applications.Comment: 8 pages, 8 figures; will appear in the proceedings of the IET Data
Fusion & Target Tracking Conference 201
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 , 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
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 -GLMB, marginalized
-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
Information theoretic approach to robust multi-Bernoulli sensor control
A novel sensor control solution is presented, formulated within a
Multi-Bernoulli-based multi-target tracking framework. The proposed method is
especially designed for the general multi-target tracking case, where no prior
knowledge of the clutter distribution or the probability of detection profile
are available. In an information theoretic approach, our method makes use of
R\`{e}nyi divergence as the reward function to be maximized for finding the
optimal sensor control command at each step. We devise a Monte Carlo sampling
method for computation of the reward. Simulation results demonstrate successful
performance of the proposed method in a challenging scenario involving five
targets maneuvering in a relatively uncertain space with unknown
distance-dependent clutter rate and probability of detection
Hybrid Poisson and multi-Bernoulli filters
The probability hypothesis density (PHD) and multi-target multi-Bernoulli
(MeMBer) filters are two leading algorithms that have emerged from random
finite sets (RFS). In this paper we study a method which combines these two
approaches. Our work is motivated by a sister paper, which proves that the full
Bayes RFS filter naturally incorporates a Poisson component representing
targets that have never been detected, and a linear combination of
multi-Bernoulli components representing targets under track. Here we
demonstrate the benefit (in speed of track initiation) that maintenance of a
Poisson component of undetected targets provides. Subsequently, we propose a
method of recycling, which projects Bernoulli components with a low probability
of existence onto the Poisson component (as opposed to deleting them). We show
that this allows us to achieve similar tracking performance using a fraction of
the number of Bernoulli components (i.e., tracks).Comment: Submitted to 15th International Conference on Information Fusion
(2012
- …