Markov Chain Monte Carlo Multi-Scan Data Association for Sets of Trajectories



Xia, Yuxuan, García-Fernández, Ángel F and Svensson, Lennart
(2024) Markov Chain Monte Carlo Multi-Scan Data Association for Sets of Trajectories IEEE Transactions on Aerospace and Electronic Systems, 60 (6). pp. 1-15. ISSN 0018-9251, 1557-9603

[thumbnail of batchTPMBMfinal.pdf] Text
batchTPMBMfinal.pdf - Author Accepted Manuscript
Available under License Creative Commons Attribution.

Download (4MB) | Preview

Abstract

This article considers a batch solution to the multiobject tracking problem based on sets of trajectories. Specifically, we present two offline implementations of the trajectory Poisson multi-Bernoulli mixture (TPMBM) filter for batch data based on Markov chain Monte Carlo (MCMC) sampling of the data association hypotheses. In contrast to online TPMBM implementations, the proposed offline implementations solve a large-scale, multiscan data association problem across the entire time interval of interest, and therefore, they can fully exploit all the measurement information available. Furthermore, by leveraging the efficient hypothesis structure of TPMBM filters, the proposed implementations compare favorably with other MCMC-based multiobject tracking algorithms. Simulation results show that the TPMBM implementation using the Metropolis-Hastings algorithm presents state-of-the-art multiple trajectory estimation performance.

Item Type: Article
Uncontrolled Keywords: Trajectory, Time measurement, Estimation, Monte Carlo methods, Current measurement, Standards, Proposals, Multiple object tracking, data association, sets of trajectories, smoothing, Markov chain Monte Carlo (MCMC)
Depositing User: Symplectic Admin
Date Deposited: 01 Jul 2024 09:50
Last Modified: 28 Feb 2026 17:23
DOI: 10.1109/taes.2024.3419785
Related Websites:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3182543
Disclaimer: The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.