TY - GEN
T1 - On Gibbs Sampling Architecture for Labeled Random Finite Sets Multi-Object Tracking
AU - Trezza, Anthony
AU - Bucci, Donald J.
AU - Varshney, Pramod K.
N1 - Publisher Copyright:
© 2023 International Society of Information Fusion.
PY - 2023
Y1 - 2023
N2 - Gibbs sampling is one of the most popular Markov chain Monte Carlo algorithms because of its simplicity, scalability, and wide applicability within many fields of statistics, science, and engineering. In the labeled random finite sets literature, Gibbs sampling procedures have recently been applied to efficiently truncate the single-sensor and multi-sensor δ-generalized labeled multi-Bernoulli posterior density as well as the multi-sensor adaptive labeled multi-Bernoulli birth distribution. However, only a limited discussion has been provided regarding key Gibbs sampler architecture details including the Markov chain Monte Carlo sample generation technique and early termination criteria. This paper begins with a brief background on Markov chain Monte Carlo methods and a review of the Gibbs sampler implementations proposed for labeled random finite sets filters. Next, we propose a short chain, multi-simulation sample generation technique that is well suited for these applications and enables a parallel processing implementation. Additionally, we present two heuristic early termination criteria that achieve similar sampling performance with substantially fewer Markov chain observations. Finally, the benefits of the proposed Gibbs samplers are demonstrated via two Monte Carlo simulations.
AB - Gibbs sampling is one of the most popular Markov chain Monte Carlo algorithms because of its simplicity, scalability, and wide applicability within many fields of statistics, science, and engineering. In the labeled random finite sets literature, Gibbs sampling procedures have recently been applied to efficiently truncate the single-sensor and multi-sensor δ-generalized labeled multi-Bernoulli posterior density as well as the multi-sensor adaptive labeled multi-Bernoulli birth distribution. However, only a limited discussion has been provided regarding key Gibbs sampler architecture details including the Markov chain Monte Carlo sample generation technique and early termination criteria. This paper begins with a brief background on Markov chain Monte Carlo methods and a review of the Gibbs sampler implementations proposed for labeled random finite sets filters. Next, we propose a short chain, multi-simulation sample generation technique that is well suited for these applications and enables a parallel processing implementation. Additionally, we present two heuristic early termination criteria that achieve similar sampling performance with substantially fewer Markov chain observations. Finally, the benefits of the proposed Gibbs samplers are demonstrated via two Monte Carlo simulations.
KW - Gibbs Sampling
KW - Markov Chain Monte Carlo
KW - Multi-object Tracking
KW - Random Finite Sets
UR - http://www.scopus.com/inward/record.url?scp=85171554385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85171554385&partnerID=8YFLogxK
U2 - 10.23919/FUSION52260.2023.10224141
DO - 10.23919/FUSION52260.2023.10224141
M3 - Conference contribution
AN - SCOPUS:85171554385
T3 - 2023 26th International Conference on Information Fusion, FUSION 2023
BT - 2023 26th International Conference on Information Fusion, FUSION 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th International Conference on Information Fusion, FUSION 2023
Y2 - 27 June 2023 through 30 June 2023
ER -