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

Bibliographic Details

Published in:	2010 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
Language:	English
Published:	IEEE 01.12.2010
Subjects:	Clutter Covariance matrix Joints Measurement uncertainty Probabilistic logic Target tracking Time measurement
ISBN:	1424479398, 9781424479399
ISSN:	2156-7379
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!