A very robust, fast, parallelizable adaptive least squares algorithm with excellent tracking abilities.
Constantin PapaodysseusD. GorgoyannisElias KoukoutsisPanayiotis RousopoulosPublished in: ICASSP (3) (1994)
Keyphrases
- least squares
- object tracking algorithm
- dynamic programming
- search space
- k means
- computationally efficient
- optimization algorithm
- neural network
- computational complexity
- sparse linear
- levenberg marquardt
- simulated annealing
- tracking of multiple objects
- target tracking
- convergence rate
- kalman filter
- object tracking
- worst case
- np hard
- preprocessing
- objective function
- recognition algorithm
- parameter tuning
- computational cost
- recursive least squares
- illumination change