On sequential Monte Carlo sampling methods for Bayesian filtering
Statistics and Computing
Design and Implementation of Flexible Resampling Mechanism for High-Speed Parallel Particle Filters
Journal of VLSI Signal Processing Systems
Parallel Programming in C with MPI and OpenMP
Parallel Programming in C with MPI and OpenMP
Analysis of parallelizable resampling algorithms for particle filtering
Signal Processing
Resampling algorithms for particle filters: a computational complexity perspective
EURASIP Journal on Applied Signal Processing
Motion Tracking Using Particle Filter
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
IEEE Transactions on Signal Processing
Visual tracking and recognition using appearance-adaptive models in particle filters
IEEE Transactions on Image Processing
Multiple 3D object position estimation and tracking using double filtering on multi-core processor
Multimedia Tools and Applications
Hi-index | 0.00 |
Particle filters are computationally intensive and thus efficient parallelism is crucial to effective implementations, especially object tracking in video sequences. Two schemes for pipelining particles under high performance computing environment, including an alternative Markov Chain Monte Carlo (MCMC) resampling algorithm and kernel function, are proposed so as to improve tracking performance and minimize execution time. Experimental results on a network of workstations composed of simple off-the-shelf hardware components show that global parallelizable scheme provides a promising resolution to clearly reduce execution time with increasing particles, compared with generic particle filtering.