Set JPDA algorithm for tracking unordered sets of targets.
Lennart SvenssonDaniel SvenssonPeter WillettPublished in: FUSION (2009)
Keyphrases
- input data
- detection algorithm
- computational cost
- computational complexity
- learning algorithm
- target tracking
- optimal solution
- objective function
- search space
- k means
- initial set
- moving target
- convex hull
- worst case
- real time
- expectation maximization
- tracking of multiple objects
- simulated annealing
- probability distribution
- np hard
- cost function
- state space
- motion model
- solution space
- motion segmentation
- particle filtering
- probabilistic model
- tracking accuracy
- multiple target tracking
- target detection and tracking
- lower bound