The particle filter has attracted considerable attention in visual tracking due to its relaxation of the linear and Gaussian restrictions in the state space model. It is thus more flexible than the Kalman filter. However, the conventional particle filter uses system transition as the proposal distribution, leading to poor sampling efficiency and poor performance in visual tracking. It is not a ...

The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...

The particle filter (PF) is a novel technique that has sufficiently good estimation results for the nonlinear/non-Gaussian systems. However, PF is inconsistent that caused mainly by loss of particle diversity in resampling step and unknown a priori knowledge of the noise statistics. This paper introduces a new modified particle filter called adaptive unscented particle filter (AUPF) to overcome th...

We introduce the antiparticle filter, AF, a new type of recursive Bayesian estimator that is unlike either the extended Kalman Filter, EKF, unscented Kalman Filter, UKF or the particle filter PF. We show that for a classic problem of robot localization the AF can substantially outperform these other filters in some situations. The AF estimates the posterior distribution as an auxiliary variable...

In this paper, we propose a new particle filter based on sequential importance sampling. The algorithm uses a bank of unscented filters to obtain the importance proposal distribution. This proposal has two very "nice" properties. Firstly, it makes efficient use of the latest available information and, secondly, it can have heavy tails. As a result, we find that the algorithm outperforms standar...

The extended Kalman filter, which linearizes the relationship between security prices and state variables, is widely used in fixed income applications. We investigate if the unscented Kalman filter should be used to capture nonlinearities, and compare the performance of the Kalman filter to that of the particle filter. We analyze the cross section of swap rates, which are mildly nonlinear in th...

In this study, an unscented particle filtering method based on an interacting multiple model (IMM) frame for a Markovian switching system is presented. The method integrates the multiple model (MM) filter with an unscented particle filter (UPF) by an interaction step at the beginning. The framework (interaction/mixing, filtering, and combination) is similar to that in a standard IMM filter, but...

FastSLAM is a framework which solves the problem of simultaneous localization and mapping using a Rao-Blackwellized particle filter. Conventional FastSLAM is known to degenerate over time in terms of accuracy due to the particle depletion in resampling phase. To solve this problem, a FastSLAM method based on particle swarm optimization and unscented particle filter is proposed. The number of pa...

—In the computer vision community, the Condensation algorithm has received considerable attention. Recently, it has been proven that the algorithm is one variant of particle filter (also known as sequential Monte Carlo filter, sequential importance sampling etc.). In sampling stage of Condensation, particles are drawn from the prior probability distribution of the state evolution transition, wi...