Efficient algorithm for computing data association probabilities for multitarget tracking

Babak Bakhtiar; Hossein Alavi; Farid Amoozegar

doi:10.1117/12.241140

24 May 1996 Efficient algorithm for computing data association probabilities for multitarget tracking

Babak Bakhtiar, Hossein Alavi, Farid Amoozegar

Proceedings Volume 2756, Automatic Object Recognition VI; (1996) https://doi.org/10.1117/12.241140
Event: Aerospace/Defense Sensing and Controls, 1996, Orlando, FL, United States

Abstract

In this paper, an effective method is proposed to compute the data association probabilities in the joint probabilistic data association (JPDA) method. In this method, the a posteriori probability of the origin of each measurement required in JPDA, is computed directly, based on an approximate formula. The Computational and memory requirements of this method decrease greatly compared to the original JPDA. Simulation results show that despite great reduction in computational complexity, the algorithm approximates an exact JPDA more accurately than previously proposed simplifying methods such as SPDA.

Citation Download Citation

Babak Bakhtiar, Hossein Alavi, and Farid Amoozegar "Efficient algorithm for computing data association probabilities for multitarget tracking", Proc. SPIE 2756, Automatic Object Recognition VI, (24 May 1996); https://doi.org/10.1117/12.241140

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available