Linear Complexity Gibbs Sampling for Generalized Labeled Multi-Bernoulli Filtering
arXiv:2211.16041 · doi:10.1109/TSP.2023.3277220
Abstract
Generalized Labeled Multi-Bernoulli (GLMB) densities arise in a host of multi-object system applications analogous to Gaussians in single-object filtering. However, computing the GLMB filtering density requires solving NP-hard problems. To alleviate this computational bottleneck, we develop a linear complexity Gibbs sampling framework for GLMB density computation. Specifically, we propose a tempered Gibbs sampler that exploits the structure of the GLMB filtering density to achieve an complexity, where is the number of iterations of the algorithm, and are the number hypothesized objects and measurements. This innovation enables the GLMB filter implementation to be reduced from an complexity to . Moreover, the proposed framework provides the flexibility for trade-offs between tracking performance and computational load. Convergence of the proposed Gibbs sampler is established, and numerical studies are presented to validate the proposed GLMB filter implementation.
References in corpus (13)
- Generalized Labeled Multi-Bernoulli Approximation of Multi-Object Densities
- Robust Distributed Fusion with Labeled Random Finite Sets
- A Bayesian Filter for Multi-view 3D Multi-object Tracking with Occlusion Handling
- Online UAV Path Planning for Joint Detection and Tracking of Multiple Radio-tagged Objects
- Importance Tempering
- Multi-Sensor Control for Multi-Object Bayes Filters
- Tracking Cells and their Lineages via Labeled Random Finite Sets
- Multi-Scan Multi-Sensor Multi-Object State Estimation
- Multi-sensor Joint Adaptive Birth Sampler for Labeled Random Finite Set Tracking
- Scalable Importance Tempering and Bayesian Variable Selection
- Multi-Objective Multi-Agent Planning for Jointly Discovering and Tracking Mobile Object
- Gibbs Sampling, Exponential Families and Orthogonal Polynomials
- Rapid Convergence of Informed Importance Tempering