Abstract

The classification of active speech vs. inactive speech in noisy speech is an important part of speech applications, typically in order to achieve a lower bit-rate. In this work, the error rates for raw classification (i.e. with no hangover mechanism) of noisy speech obtained with traditional classification algorithms are compared to the rates obtained with neural network classifiers, trained with different learning algorithms. The traditional classification algorithms used are the linear classifier, some nearest neighbor classifiers and the quadratic Gaussian classifier. The training algorithms used for the neural networks classifiers are the extended Kalman filter and the Levenberg-Marquadt algorithm. An evaluation of the computational complexity for the different classification algorithms is presented. Our noisy speech classification experiments show that using neural network classifiers typically produces a more accurate and more robust classification than other traditional algorithms, while having a significantly lower computational complexity. Neural network classifiers may therefore be a good choice for the core component of a noisy speech classifier, which would typically also include a hangover mechanism and possibly a speech enhancement algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.