Efficient parallelized particle filter design on CUDA
Authors:
- 1 October 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21623562,p. 299-304
Abstract
Particle filtering is widely used in numerous nonlinear applications which require reconfigurability, fast prototyping, and online parallel signal processing. The emerging computing platform, CUDA, may be regarded as the most appealing platform for such implementation. However, there are not yet literatures exploring how to utilize CUDA for particle filters. This parer aims to provide two design techniques, A) finite-redraw importance-maximizing (FRIM) prior editing and B) localized resampling, for efficient implementation of particle filters on CUDA, which can be verified to reduce global operations and provide significant speedup. The modifications on algorithm and architectural mapping are evaluated with conceptual and quantitative analysis. From the classic bearings-only tracking experiments, the proposed design is 5.73 times faster than the direct implementation on GeForce 9400m.Keywords
This publication has 8 references indexed in Scilit:
- Simultaneous and fast 3D tracking of multiple faces in video by GPU-based stream processingInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008
- Design Methodology for Domain Specific Parameterizable Particle Filter RealizationsIEEE Transactions on Circuits and Systems I: Regular Papers, 2007
- An Overview of Existing Methods and Recent Advances in Sequential Monte CarloProceedings of the IEEE, 2007
- Resampling algorithms and architectures for distributed particle filtersIEEE Transactions on Signal Processing, 2005
- Particle filter on GPUs for real-time tracking2004
- Particle filters for positioning, navigation, and trackingIEEE Transactions on Signal Processing, 2002
- Sequential Monte Carlo Methods in Practice2001
- Novel approach to nonlinear/non-Gaussian Bayesian state estimationIEE Proceedings F Radar and Signal Processing, 1993