Belief Hidden Markov Model for speech recognition

  title={Belief Hidden Markov Model for speech recognition},
  author={Siwar Jendoubi and Boutheina Ben Yaghlane and Arnaud Martin},
  journal={2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)},
Speech Recognition searches to predict the spoken words automatically. These systems are known to be very expensive because of using several pre-recorded hours of speech. Hence, building a model that minimizes the cost of the recognizer will be very interesting. In this paper, we present a new approach for recognizing speech based on belief HMMs instead of probabilistic HMMs. Experiments shows that our belief recognizer is insensitive to the lack of the data and it can be trained using only one… 

Figures from this paper

Second-Order Belief Hidden Markov Models
A second-order Hidden Markov Model using belief functions is presented, one of the most used techniques based on the Bayesian model for pattern recognition.
Lip-Reading Using Pixel-Based and Geometry-Based Features for Multimodal Human–Robot Interfaces
The evaluation experiments show a significant improvement (up to 9%) in recognition accuracy by using proposed geometry-based features when compared to pixel-based PCA features.
A Speech Emotion Recognition Solution-based on Support Vector Machine for Children with Autism Spectrum Disorder to Help Identify Human Emotions
A speech emotion recognition model has been developed to help children with Autism Spectrum Disorder (ASD) identify emotions in social interactions using the Python programming language to develop a machine learning model based on the Support Vector Machine (SVM).


HMM/ANN hybrid model for continuous Malayalam speech recognition
Automatic segmentation and labeling of speech based on Hidden Markov Models
Fundamentals of speech recognition
This book presents a meta-modelling framework for speech recognition that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually modeling speech.
Techniques for accurate automatic annotation of speech waveforms
We describe techniques used in the development of an automatic annotation system for use with a concatenative text-to-speech synthesis system. The goal of the system is to generate automatically from
Punjabi Automatic Speech Recognition Using HTK
The paper describes the role of each HTK tool, used in various phases of system development, by presenting a detailed architecture of an ASR system developed using HTK library modules and tools.
Automatic phonetic segmentation
The most frequently used approach-based on a modified Hidden Markov Model (HMM) phonetic recognizer is analyzed, and a general framework for the local refinement of boundaries is proposed, and the performance of several pattern classification approaches is compared within this framework.
A tutorial on hidden Markov models and selected applications in speech recognition
The fabric comprises a novel type of netting which will have particular utility in screening out mosquitoes and like insects and pests. The fabric is defined of voids having depth as well as width
Concatenative speech synthesis for European Portuguese
The ultimate goal is to develop a text-to-speech system that could be trained for any speaker’s voice in a fully automatic way, i.e., a customized text- to-speech synthesizer for any voice reading a predetermined text.
Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions
Algorithms based on the mechanisms of Hidden Markov Models usually used for state sequence analysis in probability theory are proposed which allow to filter temporal belief functions and to assess state sequences in the TBM framework.
Time-Sliced Temporal Evidential Networks: The case of Evidential HMM with application to dynamical system analysis
This paper proposes to complete the generalization of HMM to belief functions with a method for automatic parameter training and proposes to use the theory of belief functions as described by Dempster, Shafer and Smets to solve this problem.