An Efficient Implementation of the Generalized Labeled Multi-Bernoulli Filter
From MaRDI portal
Publication:4620720
DOI10.1109/TSP.2016.2641392zbMATH Open1414.94646arXiv1606.08350OpenAlexW2963272312MaRDI QIDQ4620720FDOQ4620720
Authors: Ba-Ngu Vo, Ba Tuong Vo, Hung Gia Hoang
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: This paper proposes an efficient implementation of the generalized labeled multi-Bernoulli (GLMB) filter by combining the prediction and update into a single step. In contrast to an earlier implementation that involves separate truncations in the prediction and update steps, the proposed implementation requires only one truncation procedure for each iteration. Furthermore, we propose an efficient algorithm for truncating the GLMB filtering density based on Gibbs sampling. The resulting implementation has a linear complexity in the number of measurements and quadratic in the number of hypothesized objects.
Full work available at URL: https://arxiv.org/abs/1606.08350
Cited In (8)
- The multiple pairwise Markov chain model-based labeled multi-Bernoulli filter
- Efficient approximation of the labeled multi-Bernoulli filter for online multitarget tracking
- A Tutorial on Bernoulli Filters: Theory, Implementation and Applications
- Parallel initial orbit determination using angles-only observation pairs
- Title not available (Why is that?)
- The Cardinality Balanced Multi-Target Multi-Bernoulli Filter and Its Implementations
- Multi-target identity management with decentralized optimal sensor scheduling
- Approximate Multi-Hypothesis Multi-Bernoulli Multi-Object Filtering Made Multi-Easy
This page was built for publication: An Efficient Implementation of the Generalized Labeled Multi-Bernoulli Filter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620720)