Two methods for autoregressive estimationin noise

The maximum-likelihood(ML) and the expectation-maximization criteria have been previously used in the problem of autoregressive estimation in noise. This paper presents a thorough comparative study of these techniques. Despite these criteria lead in both cases to apparently similar algorithms, the methodological differences and connections between both approaches are explored. Their performance, speed of convergence, and robustness of the solution are assessed with the help of simulated experiments. Further research work at increasing robustness in the ML approach is finally proposed.

[1]  Luis Weruaga,et al.  Frequency-selective autoregressive estimation in noise , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[2]  Carlos E. Davila A subspace approach to estimation of autoregressive parameters from noisy measurements , 1998, IEEE Trans. Signal Process..

[3]  Mark A. Clements,et al.  Comparison of autoregressive parameter estimation algorithms for speech processing and recognition , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[4]  Steven Kay,et al.  The effects of noise on the autoregressive spectral estimator , 1979 .

[5]  Umberto Soverini,et al.  Speech Enhancement Combining Optimal Smoothing and Errors-In-Variables Identification of Noisy AR Processes , 2007, IEEE Transactions on Signal Processing.

[6]  Simon J. Godsill,et al.  Efficient Alternatives to the Ephraim and Malah Suppression Rule for Audio Signal Enhancement , 2003, EURASIP J. Adv. Signal Process..

[7]  Thippur V. Sreenivas,et al.  Codebook constrained Wiener filtering for speech enhancement , 1996, IEEE Trans. Speech Audio Process..