DocumentCode :
851132
Title :
A simplification of the JPDAM algorithm
Author :
Chang, Kuo-Chu ; Bar-Shalom, Y.
Author_Institution :
University of Connecticut, Storrs, CT, USA
Volume :
31
Issue :
10
fYear :
1986
fDate :
10/1/1986 12:00:00 AM
Firstpage :
989
Lastpage :
991
Abstract :
The JPDAM (joint probabilistic data association for possibly merged measurements) algorithm has been developed to track targets in the same neighborhood in a cluttered environment, where the target-originated measurements could be unresolved (merged). The JPDAM algorithm evaluates for each measurement the probability that it originated from a single target, from two targets (i.e., it is a merged measurement), or from clutter. The original work used a relatively complicated expression for the probability density function (pdf) of a merged measurement. In this note, a simple approximation for the pdf of a merged measurement is derived. The results are easy to implement and can be used to significantly simplify the JPDAM algorithm. Some typographical errors from [2] are also corrected.
Keywords :
Tracking; Computer errors; Computer science; Density measurement; Equations; Error correction; Gaussian approximation; Probability density function; Target tracking; Weight measurement;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.1986.1104152
Filename :
1104152
Link To Document :
بازگشت