High performance connected digit recognition using hidden Markov models
Readings in speech recognition
Speech recognition with continuous-parameter hidden Markov models
Readings in speech recognition
Fundamentals of speech recognition
Fundamentals of speech recognition
Speechreading using probabilistic models
Computer Vision and Image Understanding - Special issue on physics-based modeling and reasoning in computer vision
Lipreading: a classifier combination approach
Pattern Recognition Letters - special issue on pattern recognition in practice V
Lexicon Reduction in an HMM-Framework Based on Quantized Feature Vectors
ICDAR '97 Proceedings of the 4th International Conference on Document Analysis and Recognition
Clustering Persian viseme using phoneme subspace for developing visual speech application
Multimedia Tools and Applications
| Hi-index | 0.00 |
In this paper, we describe a systematic approach to the lipreading of whole sentences. A vocabulary of elementary words is considered. Based on the vocabulary, we define a grammar that generates a set of legal sentences. Our lipreading approach is based on a combination of the grammar with hidden Markov models (HMMs). Two different experiments were conducted. In the first experiment a set of e-mail commands is considered, while the set of sentences in the second experiment is given by all English integer numbers up to one million. Both experiments showed promising results, regarding the difficulty of the considered task.