Detection and estimation of superimposed signals

The problem of fitting a model composed of a number of superimposed signals to noisy observations is addressed. An approach allowing us to evaluate both the number of signals and their characteristics is presented. The idea is to search for a parsimonious representation of the data. The parsimony is insured by adding to the maximum likelihood criterion a regularization term built upon the l/sub 1/-norm of the weights. Different equivalent formulations of the criterion are presented. They lead to appealing physical interpretations. Due to limited space, we only sketch an analysis of the performance of the algorithm that has been successfully applied to different classes of problems.

[1]  Yoram Bresler,et al.  Parameter estimation of superimposed signals by dynamic programming , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[2]  Jean-Jacques Fuchs Extension of the Pisarenko method to sparse linear arrays , 1997, IEEE Trans. Signal Process..

[3]  Yoram Bresler,et al.  On the robustness of parameter estimation of superimposed signals by dynamic programming , 1996, IEEE Trans. Signal Process..

[4]  Jean-Jacques Fuchs Multipath time-delay estimation , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Terry E. Ewart,et al.  Separating multipaths by global optimization of a multidimensional matched filter , 1986, IEEE Trans. Acoust. Speech Signal Process..

[6]  Jean-Jacques Fuchs,et al.  Sinusoids in white noise: a quadratic programming approach , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[7]  Yves Goussard,et al.  Unsupervised deconvolution of sparse spike trains using stochastic approximation , 1996, IEEE Trans. Signal Process..

[8]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..