论文信息 - A recursive algorithm for the Bayes solution of the smoothing problem

A recursive algorithm for the Bayes solution of the smoothing problem

The optimum fixed interval smoothing problem is solved using a Bayesian approach, assuming that the signal is Markov and is corrupted by independent noise (not necessarily additive). A recursive algorithm to compute the a posteriori smoothed density is obtained. Using this recursive algorithm, the smoothed estimate of a binary Markov signal corrupted by an independent noise in a nonlinear manner is determined demonstrating that the Bayesian approach presented in this paper is not restricted to the Gauss-Markov problem.

H. Derin | M. Askar

[1] R. E. Kalman,et al. A New Approach to Linear Filtering and Prediction Problems , 2002 .

[2] R. E. Kalman,et al. New Results in Linear Filtering and Prediction Theory , 1961 .

[3] H. Rauch. Solutions to the linear smoothing problem , 1963 .

[4] C. Striebel,et al. On the maximum likelihood estimates for linear dynamic systems , 1965 .

[5] Y. Ho. On the stochastic approximation method and optimal filtering theory , 1963 .

[6] Henry Cox,et al. On the estimation of state variables and parameters for noisy dynamic systems , 1964 .

[7] J. Meditch. Orthogonal Projection and Discrete Optimal Linear Smoothing , 1967 .

[8] T. Kailath,et al. An innovations approach to least-squares estimation--Part II: Linear smoothing in additive white noise , 1968 .

[9] D. Fraser,et al. The optimum linear smoother as a combination of two optimum linear filters , 1969 .