The Joint Probabilistic Data Association algorithm is one of the most widely used Data Association algorithm which can effectively finish multi-target tracking in clutter environment. But it will cause track coalescence phenomenon in parallel neighboring or small-angle crossing scene. For avoiding track coalescence, four modified Joint Probabilistic Data Association algorithms are introduced in this paper. Through Monte Carlo simulations, it is confirmed that these algorithms all can avoid this problem, but the tracking performances of these algorithms are different. So tracking performances of them in tracking precision, computation and anti-jamming ability are compared through simulation test, which can provide the basis for applying these new algorithms in practical.
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.