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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 2nd International Conference on Information Engineering and Computer Science s. 1 - 4
Hlavní autoři: Chen Song-lin, Xu Yi-bing, Zhu Ming
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2010
Témata:
Clutter
Covariance matrix
Joints
Measurement uncertainty
Probabilistic logic
Target tracking
Time measurement
ISBN:1424479398, 9781424479399
ISSN:2156-7379
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424479398
9781424479399
ISSN:2156-7379
DOI:10.1109/ICIECS.2010.5677877