A switching algorithm for tracking extended targets.
Andreas KräußlingFrank E. SchneiderDennis WildermuthPublished in: ICINCO (2005)
Keyphrases
- target tracking
- cost function
- learning algorithm
- computational cost
- preprocessing
- dynamic programming
- improved algorithm
- optimization algorithm
- experimental evaluation
- computational complexity
- moving target
- high accuracy
- np hard
- significant improvement
- optimal solution
- matching algorithm
- segmentation algorithm
- convergence rate
- motion segmentation
- kalman filter
- times faster
- computationally efficient
- simulated annealing
- k means
- multiple targets
- multi target
- tracking of multiple objects
- worst case
- clustering method
- real time
- optical flow
- data structure
- objective function
- similarity measure
- neural network