Share Email Print

Proceedings Paper

Comparing of several modified joint probabilistic data association algorithms
Author(s): Yibing Xu; Junshen Ma; Yu Wen; Min Zhu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 14 March 2013
PDF: 5 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87681E (14 March 2013); doi: 10.1117/12.2010764
Show Author Affiliations
Yibing Xu, Xi’an Communications Institute (China)
Junshen Ma, Xi’an Communications Institute (China)
Yu Wen, Xi’an Communications Institute (China)
Min Zhu, Xi’an Communications Institute (China)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top