Login / Signup
A computationally efficient importance sampling tracking algorithm.
Rana Farah
Qifeng Gan
J. M. Pierre Langlois
Guillaume-Alexandre Bilodeau
Yvon Savaria
Published in:
Mach. Vis. Appl. (2014)
Keyphrases
</>
computationally efficient
importance sampling
learning algorithm
kalman filter
monte carlo
k means
dynamic programming
higher order
incremental learning
markov chain monte carlo
computational complexity
hidden markov models
expectation maximization
motion model
particle filtering
proposal distribution