scholarly journals Particle Representation for the Solution of the Filtering Problem. Application to the Error Expansion of Filtering Discretizations

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Dan Crisan ◽  
Thomas Kurtz ◽  
Salvador Ortiz-Latorre
2020 ◽  
Vol 26 (2) ◽  
pp. 113-129
Author(s):  
Hamza M. Ruzayqat ◽  
Ajay Jasra

AbstractIn the following article, we consider the non-linear filtering problem in continuous time and in particular the solution to Zakai’s equation or the normalizing constant. We develop a methodology to produce finite variance, almost surely unbiased estimators of the solution to Zakai’s equation. That is, given access to only a first-order discretization of solution to the Zakai equation, we present a method which can remove this discretization bias. The approach, under assumptions, is proved to have finite variance and is numerically compared to using a particular multilevel Monte Carlo method.


Author(s):  
Fuqiang Di ◽  
Minqing Zhang ◽  
Yingnan Zhang ◽  
Jia Liu

A novel reversible data hiding algorithm for encrypted image based on interpolation error expansion is proposed. The proposed method is an improved version of Shiu' s. His work does not make full use of the correlation of the neighbor pixels and some additional side information is needed. The proposed method adopts the interpolation prediction method to fully exploit the pixel correlation and employ the Paillier public key encryption method. The algorithm is reversible. In the proposed method, less side information is demanded. The experiment has verified the feasibility and effectiveness of the proposed method, and the better embedding performance can be obtained, compared with some existing RDHEI-P methods. Specifically, the final embedding capacity can be up to 0.74 bpp (bit per pixel), while the peak signal-to-noise ratio (PSNR) for the marked image Lena is 35 dB. This is significantly higher than Shiu's method which is about 0.5 bpp.


Entropy ◽  
2022 ◽  
Vol 24 (1) ◽  
pp. 117
Author(s):  
Xuyou Li ◽  
Yanda Guo ◽  
Qingwen Meng

The maximum correntropy Kalman filter (MCKF) is an effective algorithm that was proposed to solve the non-Gaussian filtering problem for linear systems. Compared with the original Kalman filter (KF), the MCKF is a sub-optimal filter with Gaussian correntropy objective function, which has been demonstrated to have excellent robustness to non-Gaussian noise. However, the performance of MCKF is affected by its kernel bandwidth parameter, and a constant kernel bandwidth may lead to severe accuracy degradation in non-stationary noises. In order to solve this problem, the mixture correntropy method is further explored in this work, and an improved maximum mixture correntropy KF (IMMCKF) is proposed. By derivation, the random variables that obey Beta-Bernoulli distribution are taken as intermediate parameters, and a new hierarchical Gaussian state-space model was established. Finally, the unknown mixing probability and state estimation vector at each moment are inferred via a variational Bayesian approach, which provides an effective solution to improve the applicability of MCKFs in non-stationary noises. Performance evaluations demonstrate that the proposed filter significantly improves the existing MCKFs in non-stationary noises.


Sign in / Sign up

Export Citation Format

Share Document