Fir smoothing of discrete-time polynomial signals in state space
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Determining the initial states in forward-backward filtering
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Fast anisotropic Gauss filtering
IEEE Transactions on Image Processing
An Iterative Kalman-Like Algorithm Ignoring Noise and Initial Conditions
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
A forward-backward (FB) unbiased finite impulse response (UFIR) smoothing algorithm is addressed to provide efficient denoising of piecewise-smooth signals with known or identifiable edge positions. Owing to the time-variant horizon, the algorithm unites advantages of linear structures with robustness of nonlinear ones. The FB UFIR smoother proposed has been examined in Gaussian and heavy-tailed noise environments and compared to the nonlinear myriad filter fitting the Cauchy statistics. Based upon, we show that the smoother is able to preserve edges without jitter and provide denoising with sufficient robustness against outliers.