CONDENSATION - Conditional Density Propagation for Visual Tracking

4.4kCitations
Citations of this article
1.1kReaders
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of tracking curves in dense visual clutter is challenging. Kalman filtering 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.

Cite

CITATION STYLE

APA

Isard, M., & Blake, A. (1998). CONDENSATION - Conditional Density Propagation for Visual Tracking. International Journal of Computer Vision, 29(1), 5–28. https://doi.org/10.1023/A:1008078328650

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free