Bayesian denoising of generalized poisson processes with finite rate of innovation

We investigate the problem of the optimal reconstruction of a generalized Poisson process from its noisy samples. The process is known to have a finite rate of innovation since it is generated by a random stream of Diracs with a finite average number of impulses per unit interval. We formulate the recovery problem in a Bayesian framework and explicitly derive the joint probability density function (pdf) of the sampled signal. We compare the performance of the optimal Minimum Mean Square Error (MMSE) estimator with common regularization techniques such as ℓ1 and Log penalty functions. The simulation results indicate that, under certain conditions, the regularization techniques can achieve a performance close to the MMSE method.

[1]  Michael Unser,et al.  Stochastic Models for Sparse and Piecewise-Smooth Signals , 2011, IEEE Transactions on Signal Processing.

[2]  Li Ping,et al.  The Factor Graph Approach to Model-Based Signal Processing , 2007, Proceedings of the IEEE.

[3]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[4]  Michael Unser,et al.  A unified formulation of Gaussian vs. sparse stochastic processes - Part I: Continuous-domain theory , 2011, ArXiv.

[5]  Thierry Blu,et al.  Extrapolation and Interpolation) , 2022 .

[6]  Michael Unser,et al.  MMSE denoising of sparse Lévy processes via message passing , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[8]  Thierry Blu,et al.  Cardinal exponential splines: part I - theory and filtering algorithms , 2005, IEEE Transactions on Signal Processing.