Block Kalman Filter: An Asymptotic Block Particle Filter in the Linear Gaussian Case

Author(s):  
Rui Min ◽  
Christelle Garnier ◽  
Francois Septier ◽  
John Klein
2013 ◽  
Vol 683 ◽  
pp. 824-827
Author(s):  
Tian Ding Chen ◽  
Chao Lu ◽  
Jian Hu

With the development of science and technology, target tracking was applied to many aspects of people's life, such as missile navigation, tanks localization, the plot monitoring system, robot field operation. Particle filter method dealing with the nonlinear and non-Gaussian system was widely used due to the complexity of the actual environment. This paper uses the resampling technology to reduce the particle degradation appeared in our test. Meanwhile, it compared particle filter with Kalman filter to observe their accuracy .The experiment results show that particle filter is more suitable for complex scene, so particle filter is more practical and feasible on target tracking.


2018 ◽  
Vol 7 (2.7) ◽  
pp. 12
Author(s):  
Penumarty Hiranmayi ◽  
Kola Sai Gowtham ◽  
S Koteswara Rao ◽  
V Gopi Tilak

The phenomenon of simple harmonic motion is more vigilantly explained using a simple pendulum. The angular motion of a pendulum is linear in nature. But the analysis of the motion along the horizontal direction is non-linear. To estimate this, several algorithms like the Kalman filter, Extended Kalman Filter etc. are adopted. Here in this paper, Particle filter is chosen which is a method to form Monte Carlo approximations to the solutions of Bayesian filtering equations. Sequential importance resampling based Particle filters are used where the filtering distributions are multi-nodal or consist of discrete state components since under these circumstances the Bayesian approximations do not always work well.


2014 ◽  
Vol 16 (2) ◽  
pp. 382-402
Author(s):  
Feng Bao ◽  
Yanzhao Cao ◽  
Xiaoying Han

AbstractNonlinear filter problems arise in many applications such as communications and signal processing. Commonly used numerical simulation methods include Kalman filter method, particle filter method, etc. In this paper a novel numerical algorithm is constructed based on samples of the current state obtained by solving the state equation implicitly. Numerical experiments demonstrate that our algorithm is more accurate than the Kalman filter and more stable than the particle filter.


Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2139
Author(s):  
Xiuqiong Chen ◽  
Jiayi Kang ◽  
Mina Teicher ◽  
Stephen S.-T. Yau

Nonlinear filtering is of great significance in industries. In this work, we develop a new linear regression Kalman filter for discrete nonlinear filtering problems. Under the framework of linear regression Kalman filter, the key step is minimizing the Kullback–Leibler divergence between standard normal distribution and its Dirac mixture approximation formed by symmetric samples so that we can obtain a set of samples which can capture the information of reference density. The samples representing the conditional densities evolve in a deterministic way, and therefore we need less samples compared with particle filter, as there is less variance in our method. The numerical results show that the new algorithm is more efficient compared with the widely used extended Kalman filter, unscented Kalman filter and particle filter.


2014 ◽  
Vol 95 (7) ◽  
pp. 31-37 ◽  
Author(s):  
Jharna Majumdar ◽  
Parashar Dhakal ◽  
Nabin Sharma Rijal ◽  
Amar Mani Aryal ◽  
Nilesh Kumar Mishra

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 214
Author(s):  
Yanbo Wang ◽  
Fasheng Wang ◽  
Jianjun He ◽  
Fuming Sun

The particle filter method is a basic tool for inference on nonlinear partially observed Markov process models. Recently, it has been applied to solve constrained nonlinear filtering problems. Incorporating constraints could improve the state estimation performance compared to unconstrained state estimation. This paper introduces an iterative truncated unscented particle filter, which provides a state estimation method with inequality constraints. In this method, the proposal distribution is generated by an iterative unscented Kalman filter that is supplemented with a designed truncation method to satisfy the constraints. The detailed iterative unscented Kalman filter and truncation method is provided and incorporated into the particle filter framework. Experimental results show that the proposed algorithm is superior to other similar algorithms.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 2233-2246 ◽  
Author(s):  
Inam Ullah ◽  
Yu Shen ◽  
Xin Su ◽  
Christian Esposito ◽  
Chang Choi

2018 ◽  
Vol 25 (4) ◽  
pp. 731-746 ◽  
Author(s):  
Sangeetika Ruchi ◽  
Svetlana Dubinkina

Abstract. Over the years data assimilation methods have been developed to obtain estimations of uncertain model parameters by taking into account a few observations of a model state. The most reliable Markov chain Monte Carlo (MCMC) methods are computationally expensive. Sequential ensemble methods such as ensemble Kalman filters and particle filters provide a favorable alternative. However, ensemble Kalman filter has an assumption of Gaussianity. Ensemble transform particle filter does not have this assumption and has proven to be highly beneficial for an initial condition estimation and a small number of parameter estimations in chaotic dynamical systems with non-Gaussian distributions. In this paper we employ ensemble transform particle filter (ETPF) and ensemble transform Kalman filter (ETKF) for parameter estimation in nonlinear problems with 1, 5, and 2500 uncertain parameters and compare them to importance sampling (IS). The large number of uncertain parameters is of particular interest for subsurface reservoir modeling as it allows us to parameterize permeability on the grid. We prove that the updated parameters obtained by ETPF lie within the range of an initial ensemble, which is not the case for ETKF. We examine the performance of ETPF and ETKF in a twin experiment setup, where observations of pressure are synthetically created based on the known values of parameters. For a small number of uncertain parameters (one and five) ETPF performs comparably to ETKF in terms of the mean estimation. For a large number of uncertain parameters (2500) ETKF is robust with respect to the initial ensemble, while ETPF is sensitive due to sampling error. Moreover, for the high-dimensional test problem ETPF gives an increase in the root mean square error after data assimilation is performed. This is resolved by applying distance-based localization, which however deteriorates a posterior estimation of the leading mode by largely increasing the variance due to a combination of less varying localized weights, not keeping the imposed bounds on the modes via the Karhunen–Loeve expansion, and the main variability explained by the leading mode. A possible remedy is instead of applying localization to use only leading modes that are well estimated by ETPF, which demands knowledge of which mode to truncate.


Sign in / Sign up

Export Citation Format

Share Document