z-logo
open-access-imgOpen Access
MMSE and maximum a posteriori estimators for speech enhancement in additive noise assuming a t ‐location‐scale clean speech prior
Author(s) -
Faraji Neda,
Kohansal Akram
Publication year - 2018
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
eISSN - 1751-9683
pISSN - 1751-9675
DOI - 10.1049/iet-spr.2017.0446
Subject(s) - minimum mean square error , estimator , maximum a posteriori estimation , mathematics , noise (video) , wiener filter , mean squared error , speech enhancement , statistics , probability density function , speech recognition , algorithm , computer science , noise reduction , artificial intelligence , maximum likelihood , image (mathematics)
The authors derive closed form solutions for the minimum mean square error (MMSE) and maximum a posteriori estimators for speech enhancement in additive Gaussian noise assuming a t ‐location‐scale probability density function (PDF) as clean speech prior. Fitting a t ‐location‐scale PDF to the real and imaginary parts of the discrete fourier transform (DFT) coefficients of clean speech signals demonstrates the lower Jensen–Shannon divergence compared to the other heavy‐tailed distributions such as Laplacian and gamma. The authors utilise the two presented estimators along with the Wiener filter and MMSE estimators based on Laplacian, gamma, and generalised gamma prior PDFs to enhance noisy signals from the NOIZEUS database. All the estimators are compared together in terms of both signal and noise distortions. The obtained results show that their proposed MMSE estimator results in the minimum squared error and signal distortion to estimate the complex‐valued DFT coefficients of speech. The quality assessments of the enhanced signals are also performed in terms of perceptual evaluation of speech quality, segmental and general SNRs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here