Approximate evaluation of marginal association probabilities with belief propagation
arXiv:1209.6299 · doi:10.1109/TAES.2014.120568
Abstract
Data association, the problem of reasoning over correspondence between targets and measurements, is a fundamental problem in tracking. This paper presents a graphical model formulation of data association and applies an approximate inference method, belief propagation (BP), to obtain estimates of marginal association probabilities. We prove that BP is guaranteed to converge, and bound the number of iterations necessary. Experiments reveal a favourable comparison to prior methods in terms of accuracy and computational complexity.
http://dx.doi.org/10.1109/TAES.2014.120568. appears in IEEE Transactions on Aerospace and Electronic Systems, vol. 50, no. 4, October 2014
References in corpus (2)
Cited by in corpus (14)
- Marginal multi-Bernoulli filters: RFS derivation of MHT, JIPDA and association-based MeMBer
- A Belief Propagation Algorithm for Multipath-Based SLAM
- A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
- An efficient, variational approximation of the best fitting multi-Bernoulli filter
- Scalable Detection and Tracking of Geometric Extended Objects
- Trajectory Poisson multi-Bernoulli filters
- Decentralized Gaussian Filters for Cooperative Self-localization and Multi-target Tracking
- Machine Learning Methods for Data Association in Multi-Object Tracking
- Fusion of Sensor Measurements and Target-Provided Information in Multitarget Tracking
- Sequential Detection and Estimation of Multipath Channel Parameters Using Belief Propagation
- Classification-Aided Multitarget Tracking Using the Sum-Product Algorithm
- Distributed Poisson multi-Bernoulli filtering via generalised covariance intersection
- Efficient approximations of the multi-sensor labelled multi-Bernoulli filter
- Robust Localization in Modern Cellular Networks using Global Map Features