A batch algorithm for estimating trajectories of point targets using expectation maximization
Artikel i vetenskaplig tidskrift, 2016

In this paper, we propose a strategy that is based on expectation maximization for tracking multiple point targets. The algorithm is similar to probabilistic multi-hypothesis tracking (PMHT) but does not relax the point target model assumptions. According to the point target models, a target can generate at most one measurement, and a measurement is generated by at most one target. With this model assumption, we show that the proposed algorithm can be implemented as iterations of Rauch-Tung-Striebel (RTS) smoothing for state estimation, and the loopy belief propagation method for marginal data association probabilities calculation. Using example illustrations with tracks, we compare the proposed algorithm with PMHT and joint probabilistic data association (JPDA) and show that PMHT and JPDA exhibit coalescence when there are closely moving targets whereas the proposed algorithm does not. Furthermore, extensive simulations c comparing the mean optimal subpattern assignment (MOSPA) performance of the algorithm for different scenarios averaged over several Monte Carlo iterations show that the proposed algorithm performs better than JPDA and PMHT. We also compare it to benchmarking algorithm: N-scan pruning based track-oriented multiple hypothesis tracking (TOMHT). The proposed algorithm shows a good tradeoff between computational complexity and the MOSPA performance.

loopy belief propagation

Data association

probabilistic multi-hypothesis tracking (PMHT)

expectation maximisation

Författare

Abu Sajana Rahmathullah

Chalmers, Signaler och system, Signalbehandling och medicinsk teknik, Signalbehandling

Raghavendra Selvan

Köbenhavns Universitet

Lennart Svensson

Chalmers, Signaler och system, Signalbehandling och medicinsk teknik, Signalbehandling

IEEE Transactions on Signal Processing

1053-587X (ISSN)

Vol. 64 18 4792 - 4804 7478157

Ämneskategorier

Signalbehandling

DOI

10.1109/TSP.2016.2572048

Mer information

Senast uppdaterat

2018-05-08