Smart particle filtering for high-dimensional tracking
Computer Vision and Image Understanding
Resampling algorithms for particle filters: a computational complexity perspective
EURASIP Journal on Applied Signal Processing
Functional sampling density design for particle filters
Signal Processing
Tackling the premature convergence problem in Monte-Carlo localization
Robotics and Autonomous Systems
A new evolutionary particle filter for the prevention of sample impoverishment
IEEE Transactions on Evolutionary Computation
An ant stochastic decision based particle filter and its convergence
Signal Processing
An improvement on resampling algorithm of particle filters
IEEE Transactions on Signal Processing
Risk-Sensitive Particle Filters for Mitigating Sample Impoverishment
IEEE Transactions on Signal Processing - Part II
High-throughput scalable parallel resampling mechanism for effective redistribution of particles
IEEE Transactions on Signal Processing
Particle filter with multimode sampling strategy
Signal Processing
Computers in Biology and Medicine
Expert Systems with Applications: An International Journal
Hi-index | 0.08 |
A novel resampling algorithm (called Deterministic Resampling) is proposed, which avoids uncensored discarding of low weighted particles thereby avoiding sample impoverishment. The diversity of particles is maintained by deterministically sampling support particles to improve the residual resampling. A proof is given that our approach can be strictly unbiased and maintains the original state density distribution. Additionally, it is practically simple to implement in low dimensional state space applications. The core idea behind our approach is that it is important to (re)sample based on both the weight of particles and their state values, especially when the sample size is small. Our approach, verified by simulations, indicates that estimation accuracy is better than traditional methods with an affordable computation burden.