Sampling and recovery of continuous sparse signals 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 derivatives of Diracs and piecewise polynomials. The conventional approach for this problem is based on total-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. Further on, Cadzow denoising does not guarantee any optimality. The proposed parametric approach solves all of these problems. Since the corresponding log-likelihood function is non-convex, we exploit the stochastic method of particle swarm optimization (PSO) to find the global solution. Simulation results confirm the effectiveness of the proposed approach, for a reasonable computational cost.

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

[2]  Akira Hirabayashi,et al.  Reconstruction of the sequence of Diracs from noisy samples via maximum likelihood estimation , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[3]  Srinivasan Umesh,et al.  Estimation of parameters of exponentially damped sinusoids using fast maximum likelihood estimation with application to NMR spectroscopy data , 1996, IEEE Trans. Signal Process..

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

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

[6]  Michael B. Wakin,et al.  An Introduction To Compressive Sampling [A sensing/sampling paradigm that goes against the common knowledge in data acquisition] , 2008 .

[7]  Joseph Tabrikian,et al.  Non-Bayesian Periodic Cramér-Rao Bound , 2013, IEEE Transactions on Signal Processing.

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

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

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

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

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

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

[14]  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..

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

[16]  T. Blumensath,et al.  Theory and Applications , 2011 .

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

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