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...
Saved in:
Published in | 2010 2nd International Conference on Information Engineering and Computer Science pp. 1 - 4 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2010
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!