## [Toss-devel] The "Condensation" Algorithm (1998)

 [Toss-devel] The "Condensation" Algorithm (1998) From: Lukasz Stafiniak - 2013-01-03 10:42:26 ```I suggest we have a look at: http://www.robots.ox.ac.uk/~misard/condensation.html http://www.robots.ox.ac.uk/~misard/abstracts/thesis.html http://link.springer.com/article/10.1023%2FA%3A1008078328650 I got there from http://en.wikipedia.org/wiki/Video_tracking Happy New Year. "The problem of tracking curves in dense visual clutter is challenging. Kalman ﬁltering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses “factored sampling”, previously applied to the interpretation of static images, in which the probability distribution of possible interpretations is represented by a randomly generated set. Condensation uses learned dynamical models, together with visual observations, to propagate the random set over time. The result is highly robust tracking of agile motion. Notwithstanding the use of stochastic methods, the algorithm runs in near real-time." ```

 [Toss-devel] The "Condensation" Algorithm (1998) From: Lukasz Stafiniak - 2013-01-03 10:42:26 ```I suggest we have a look at: http://www.robots.ox.ac.uk/~misard/condensation.html http://www.robots.ox.ac.uk/~misard/abstracts/thesis.html http://link.springer.com/article/10.1023%2FA%3A1008078328650 I got there from http://en.wikipedia.org/wiki/Video_tracking Happy New Year. "The problem of tracking curves in dense visual clutter is challenging. Kalman ﬁltering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses “factored sampling”, previously applied to the interpretation of static images, in which the probability distribution of possible interpretations is represented by a randomly generated set. Condensation uses learned dynamical models, together with visual observations, to propagate the random set over time. The result is highly robust tracking of agile motion. Notwithstanding the use of stochastic methods, the algorithm runs in near real-time." ```