The Improved Particle Filtering Algorithms for Tracking the Signals

Article Preview

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 PF(Particle Filtering) algorithm uses “sequential importance sampling”, previously applied to the posterior of static signals, in which the probability distribution of possible interpretations is represented by a randomly generated set. PF uses learned “sequential Monte Carlo” models, together with practical observations, to propagate and update the random set over time. The result is highly robust tracking of agile motion. Not withstanding the use of stochastic methods, the algorithm runs in near Real-Time.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2341-2344

Citation:

Online since:

November 2011

Keywords:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Arnaud Doucet, Simon Godsill and Christophe Andrieu. On sequential Monte Carlo sampling methods for Bayesian filtering[J]. Statistics and Computing, 2000, Vol. 10: 197–208.

DOI: 10.1023/a:1008935410038

Google Scholar

[2] Katja Nummiaro , Esther Koller-Meier and Luc Van Gool. A Color-based Particle Filter[J].: 53-60.

Google Scholar

[3] Michael Isard and Andrew Blake. CONDENSATION—Conditional Density Propagation for Visual Tracking[J]. International Journal of Computer Vision, 1998, Vol. 29(1): 5–28.

Google Scholar

[4] J. Carpenter,P. Clifford and P. Fearnhead. Improved Particle Filter for Nonlinear Problems[J]. IEE Proc-Radar, Sonar Navig, 1999, Vol. 146(1): 2-7.

DOI: 10.1049/ip-rsn:19990255

Google Scholar