Near-Optimal Resampling in Particle Filters Using the Ising Energy Model

Abstract

Resampling increasing the variance of the tracking algorithm in Particle Filtering (PF). Instead of utilizing resampling procedures that rely on asymptotic convergence properties, we show that intelligently selecting and replicating a set of samples can better represent the posterior approximation and improve the overall performance of the PF. To this end, we formulate the resampling procedure as an integer program that minimizes an upper bound on the Kullback-Leibler divergence (KLD) between the resampled distribution and the posterior approximation. We then transform the problem into an Ising energy minimization problem, which we are able to efficiently solve. Applying our novel paradigm to a challenging sequential importance resampling (SIR) simulation shows faster convergence over the number of resampled particles and a 35% improvement in the median KLD for a fixed number of particles.

A Distribution Network State Estimation Method With Non-Gaussian Noise Based on Parallel Particle Filter

“…In the context of GPGPU-based parallel computations, it is essential to minimize such data exchanges to augment memory access bandwidth. In light of this, this section outlines the fundamental procedure of resampling in particle filtering [42]- [43]. Moreover, enhancements are incorporated into the resampling process by proposing a thread-level resampling approach, thereby optimizing it for GPGPU-based parallel computation.…”