Abstract

Information measures have been used in the context of nonlinear systems presenting abrupt complexity changes and related to nonlinear time series analysis. In this study, complexity measures such as Shannon entropy, q-entropy and their associated divergences have been added to a robust speech recognizer front-end. The method proposed here is tested on continuous speech and compared with a classical mel-cepstral analysis. The recognition degradation has been evaluated in both systems in presence of white and babble noise. The results suggest that complexity measures provide additional valuable information for speech recognition in noisy conditions.

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.