Sampling Signals with Finite Rate of Innovation and Recovery by Maximum Likelihood Estimation

We propose a maximum likelihood estimation approach for the recovery of continuously-defined sparse signals from noisy measurements, in particular periodic sequences of Diracs, derivatives of Diracs and piecewise polynomials. The conventional approach for this problem is based on least-squares (a.k.a. annihilating filter method) and Cadzow denoising. It requires more measurements than the number of unknown parameters and mistakenly splits the derivatives of Diracs into several Diracs at different positions. Moreover, Cadzow denoising does not guarantee any optimality. The proposed approach based on maximum likelihood estimation solves all of these problems. Since the corresponding log-likelihood function is non-convex, we exploit the stochastic method called particle swarm optimization (PSO) to find the global solution. Simulation results confirm the effectiveness of the proposed approach, for a reasonable computational cost. key words: Signals with finite rate of innovation, sequence of Diracs, derivatives of Diracs, piecewise polynomials, maximum likelihood estimation, Cadzow denoising

[1]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[2]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[3]  Thierry Blu,et al.  Sampling Piecewise Sinusoidal Signals With Finite Rate of Innovation Methods , 2010, IEEE Transactions on Signal Processing.

[4]  Thierry Blu,et al.  Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix , 2007, IEEE Transactions on Signal Processing.

[5]  Pedro M. Crespo,et al.  A new stochastic algorithm inspired on genetic algorithms to estimate signals with finite rate of innovation from noisy samples , 2010, Signal Process..

[6]  A. Papoulis,et al.  The Fourier Integral and Its Applications , 1963 .

[7]  Vivek K. Goyal,et al.  Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm , 2007, IEEE Transactions on Signal Processing.

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  M. Vetterli,et al.  Sparse Sampling of Signal Innovations , 2008, IEEE Signal Processing Magazine.

[10]  Ivan Markovsky,et al.  Structured low-rank approximation and its applications , 2008, Autom..

[11]  Joseph Tabrikian,et al.  Periodic CRB for non-Bayesian parameter estimation , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[12]  Yonina C. Eldar,et al.  Innovation Rate Sampling of Pulse Streams With Application to Ultrasound Imaging , 2010, IEEE Transactions on Signal Processing.

[13]  James A. Cadzow,et al.  Signal enhancement-a composite property mapping algorithm , 1988, IEEE Trans. Acoust. Speech Signal Process..

[14]  Arthur Albert,et al.  Regression and the Moore-Penrose Pseudoinverse , 2012 .

[15]  Laurent Condat,et al.  Recovery of nonuniformdirac pulses from noisy linear measurements , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[17]  Gitta Kutyniok,et al.  1 . 2 Sparsity : A Reasonable Assumption ? , 2012 .

[18]  Akira Hirabayashi Sampling and Reconstruction of Periodic Piecewise Polynomials Using Sinc Kernel , 2012, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..