K Nearest Neighbor Joint Possibility Data Association Algorithm

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 Ne...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Information Engineering and Computer Science pp. 1 - 4
Main Authors Chen Song-lin, Xu Yi-bing, Zhu Ming
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Online AccessGet full text

Cover

Loading…