A New Joint Possibility Data Association Algorithm Avoiding Track Coalescence

Full Text (PDF, 210KB), PP.45-51

Views: 0 Downloads: 0


Song-lin Chen 1,* Yi-bing Xu 1

1. Xi’an Communications Institute, Xi’an, China

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2011.02.07

Received: 5 Jul. 2010 / Revised: 1 Oct. 2010 / Accepted: 5 Dec. 2010 / Published: 8 Mar. 2011

Index Terms

Joint Probabilistic Data Association, track coalescence, K Nearest Neighbor, Scaled Joint Probabilistic Data Association


For the problem of tracking multiple targets, the Joint Probabilistic Data Association approach has shown to be very effective in handling clutter and missed detections. However, it tends to coalesce neighboring tracks and ignores the coupling between those tracks. To avoid track coalescence,a K Nearest Neighbor Joint Probabilistic Data Association algorithm is proposed in this paper. Like the Joint Probabilistic Data Association algorithm, the association possibilities of target with every measurement will be computed in the new algorithm, but only the first K measurements whose association probabilities with the target are larger than others’ are used to estimate target’s state. Finally, through Monte Carlo simulations, it is shown that the new algorithm is able to avoid track coalescence and keeps good tracking performance in heavy clutter and missed detections.

Cite This Paper

Song-lin Chen, Yi-bing Xu,"A New Joint Possibility Data Association Algorithm Avoiding Track Coalescence", International Journal of Intelligent Systems and Applications(IJISA), vol.3, no.2, pp.45-51, 2011. DOI: 10.5815/ijisa.2011.02.07


[1] Y. Bar-Shalom and T. E. Fortmann. Tracking and Data Association. New York: Academic , 1988.

[2] R. J. Fitzgerald, Development of practical PDA logic for multitarget tracking by microprocessor, in Multitarget-Multisensor Tracking:Advanced Applications, Y. Bar-Shalom, Ed. Reading, MA: Artech House, 1990. pp: 1–23.

[3] Hugh L. Kennedy .Controlling Track Coalescence with Scaled Joint Probabilistic Data Association. IEEE RADAR 2008, pp:440-445.

[4] Y. Bar-Shalom and E. Tse. Tracking in a Cluttered Environment with Probabilistic Data Association. Automatica, vol. 11. Sep.1975. pp:451-460. 

[5] T. Kirubarajan and Y. Bar-Shalom. Probabilistic data association techniques for target tracking in clutter. Proceedings of the IEEE, vol.92, no. 3. Mar. 2004. pp: 536-557.

[6] Y. Bar-Shalom, T. Kirubarajan and X. Lin. Probabilistic data association techniques for target tracking with applications to sonar, radar and EO sensors. IEEE Aerospace and Electronic Systems Magazine, vol. 20, no. 8. Aug. 2005. pp: 37-56.

[7] Seokwon Yeom, Efficient Multi-target Tracking with Sub-event IMM-JPDA and One-point Prime Initialization. Proceedings of IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems Seoul, Korea, 2008, pp:451-456.