The calculation of marginal association probabilities is the major computational bottleneck in the Joint
Probabilistic Data Association Filter (JPDAF). In this paper, we investigate approximations for the marginal associations that simplify the (computational complex) original association model in order to obtain efficient algorithms. In this context, we first discuss the Bakhtiar-Alavi algorithm and the Linear Multitarget Integrated Probabilistic Data Association (LMIPDA) algorithm. Second, we propose a fast novel approximation that exploits systematic combinations of the JPDAF measurement model with the Probabilistic Multi-Hypothesis Tracker (PMHT) measurement model. The discussed methods are evaluated by means of a tracking scenario with a high number of closely-spaced targets.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.