7,795 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
Extraction of Airways with Probabilistic State-space Models and Bayesian Smoothing
Segmenting tree structures is common in several image processing
applications. In medical image analysis, reliable segmentations of airways,
vessels, neurons and other tree structures can enable important clinical
applications. We present a framework for tracking tree structures comprising of
elongated branches using probabilistic state-space models and Bayesian
smoothing. Unlike most existing methods that proceed with sequential tracking
of branches, we present an exploratory method, that is less sensitive to local
anomalies in the data due to acquisition noise and/or interfering structures.
The evolution of individual branches is modelled using a process model and the
observed data is incorporated into the update step of the Bayesian smoother
using a measurement model that is based on a multi-scale blob detector.
Bayesian smoothing is performed using the RTS (Rauch-Tung-Striebel) smoother,
which provides Gaussian density estimates of branch states at each tracking
step. We select likely branch seed points automatically based on the response
of the blob detection and track from all such seed points using the RTS
smoother. We use covariance of the marginal posterior density estimated for
each branch to discriminate false positive and true positive branches. The
method is evaluated on 3D chest CT scans to track airways. We show that the
presented method results in additional branches compared to a baseline method
based on region growing on probability images.Comment: 10 pages. Pre-print of the paper accepted at Workshop on Graphs in
Biomedical Image Analysis. MICCAI 2017. Quebec Cit
A Multi-Scan Labeled Random Finite Set Model for Multi-object State Estimation
State space models in which the system state is a finite set--called the
multi-object state--have generated considerable interest in recent years.
Smoothing for state space models provides better estimation performance than
filtering by using the full posterior rather than the filtering density. In
multi-object state estimation, the Bayes multi-object filtering recursion
admits an analytic solution known as the Generalized Labeled Multi-Bernoulli
(GLMB) filter. In this work, we extend the analytic GLMB recursion to propagate
the multi-object posterior. We also propose an implementation of this so-called
multi-scan GLMB posterior recursion using a similar approach to the GLMB filter
implementation
Multisensor Poisson Multi-Bernoulli Filter for Joint Target-Sensor State Tracking
In a typical multitarget tracking (MTT) scenario, the sensor state is either
assumed known, or tracking is performed in the sensor's (relative) coordinate
frame. This assumption does not hold when the sensor, e.g., an automotive
radar, is mounted on a vehicle, and the target state should be represented in a
global (absolute) coordinate frame. Then it is important to consider the
uncertain location of the vehicle on which the sensor is mounted for MTT. In
this paper, we present a multisensor low complexity Poisson multi-Bernoulli MTT
filter, which jointly tracks the uncertain vehicle state and target states.
Measurements collected by different sensors mounted on multiple vehicles with
varying location uncertainty are incorporated sequentially based on the arrival
of new sensor measurements. In doing so, targets observed from a sensor mounted
on a well-localized vehicle reduce the state uncertainty of other poorly
localized vehicles, provided that a common non-empty subset of targets is
observed. A low complexity filter is obtained by approximations of the joint
sensor-feature state density minimizing the Kullback-Leibler divergence (KLD).
Results from synthetic as well as experimental measurement data, collected in a
vehicle driving scenario, demonstrate the performance benefits of joint
vehicle-target state tracking.Comment: 13 pages, 7 figure
- …