Answers are grounded in this paper and cite their sources.
We investigate the application of expectation maximization (EM) algorithms to the classical problem of multiple target tracking (MTT) for a known number of targets. Conventional algorithms, which deal with this problem, have a computational complexity that depends exponentially on the number of targets, and usually divide the problem into a localization stage and a tracking stage. The new algorithms achieve a linear dependency and integrate these two stages. Three optimization criteria are proposed, using deterministic and stochastic dynamic models for the targets.
No takes yet. Share an insight, caveat, or question.
Frenkel et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: