基于经典隐马尔可夫模型的汉语连续语音识别系统

该文构造了基于经典隐马尔可夫模型(Hidden Markov Model,HMM)的汉语连续语音识别系统,定量地分析与评价了经典HMM的性能。     

一种适于非特定人语音识别的并行隐马尔可夫模型

为了适合非特定人语音识别,提出了一种由多条并行马尔可夫链组成的并行HMM(Parallel Hidden Markov Model,PHMM),从而融合了基于分类的语音识别中为各个类别建立的模板,提高了识别性能,各条链之间允许有交叉,使得融合的多模板之间存在状态共享,同时PHMM可以在训练过程中自动完成聚类,且测试语音的输出结果来自所有类别,无需聚类分析和类别判断,这些都减少了存储量和计算量,汉语非特定人孤立数字的识别实验表明,PHMM较之传统CHMM使识别性能及噪声鲁棒性都得到了改善。     

基于状态码本的准连续隐马尔可夫模型

本文针对经典HMM模型对训练数据要求多且算法复杂的问题，提出了一种改进的模型一基于状态码本的准连续HMM模型（SCBHMM），该模型在有限训练数据的条件下能更加有效地描述语音信号的声学特征．通过将状态转移概率与动态谱变化量相关联，使得SCBHMM能有效地将语音信号的静态特征和动态特征相结合．通过在标准语音数据库USTC94上的大量实验表明了SCBHMM在汉语音节识别中的有效性，它缓减了模型对训练数据的要求，并大大降低了训练、识别的计算量，但同样取得了相当高的识别率．     

正反向隐马尔可夫模型及其在连续语音识别中的应用

本文针对语音信号中客观存在的正、反向依赖特性，明确提出了用条件概率的概念来定量表述语音信号的这种正、反向的马尔可大依赖关系，提出了描述语音信号这种正反向依赖关系的正反向隐马尔可夫模型（ＨＭＭ），并用实验证明了仅仅利用语音反向依赖关系语音识别同样也能获得相当可观的识别性能。接着，本文针对孤立字和连续语音两种不同的识别任务，研究了在语音识别中同时利用这两种依赖信息的方法，并提出了一种连续语音识别中的新的搜索算法──正反向分半混合搜索。这种方法利用基于正向ＨＭＭ的正向Ｖｉｔｅｒｂｉ搜索和基于反向ＨＭＭ的反向Ｖｉｔｅｒｂｉ搜索的中间结果来有效地结合正反向依赖信息，实验证明正反向分半混合搜索方法确实一致地优于单用任何一种依赖信息的单向搜索识别方法。     

汉语连续语音识别中多项式拟合语音轨迹模型的研究

尽管作为当前最为流行的语音识别模型, HMM由于采用状态输出独立同分布假设,忽略了对语音轨迹动态特性的描述.本文基于一个更为灵活的语音描述统计框架—广义DDBHMM,提出了一个具体的多项式拟合语音轨迹模型,以及新的训练和识别算法,更好地刻划了真实的语音特性.本文还给出了一种有效的剪枝算法,得到一个实用化模型.汉语大词汇量非特定人连续语音识别的实验表明,这种剪枝的多项式拟合语音轨迹模型以较少的计算量明显改善了识别系统的性能.     

基于HMM的语音识别系统的Matlab仿真

隐马尔可夫模型(HMM)已成为语音识别中的主流技术,首先介绍了语音识别技术的原理和结构,然后介绍了HMM的三个基本问题及其解决方法,最后利用Matlab仿真工具设计了一个孤立词的语音识别系统,实现了数字0～9的识别.     

用于连续语音识别的RBF-Gamma-HMM组合模型

本文提供了一个有特色的、易扩展的多模块ＲＢＦ－Ｇａｍｍａ神经网与ＨＭＭ组合的连续语音识别模型,兼有ＲＢＦ网表达音元空间、Ｇａｍｍａ综合时序相关信息、ＨＭＭ作音元时间集成和扩展等功能,以实现功能互充本模型为基础,将本文提出的各咎改进分类的学习算法用于特定人连续数字语音识别,其字正识率达到９８．９％,串正识率达到９４．８％。     

隐马尔可夫模型（HMM）参数迭代算法的改进

本文提出了一种改进的隐马尔可夫模型（ＨＭＭ）参数迭代算法，该算法克服了传统算法的缺点，提高了ＨＭＭ参数系统的分辨率，把它用于语音识别，可以有效地提高语音识别率。     

基于连续隐马尔科夫的语音识别模型

本文针对问题一建立了基于连续隐马尔科夫模型的语音识别系统的模型。该语音识别系统包括预处理,特征提取以及声学模型三个部分。问题二要求以一个实际的例子则对问题一中建立的模型进行验证。我们选择了"话费查询"这个功能进行测试。待测语音信号依次经过预处理、特征提取、训练与识别。     

语音识别隐马尔可夫模型的改进

由于在语音识别中被广泛应用的隐马尔可夫模型是一重马尔可夫模型，它不能充分地描述语音信号的时间相依性。虽然理论上可将ＨＭＭ扩展成多重马尔可夫模型，但由于所需运算量和存储量将成指数增长而使其难以应用。因此，本文提出一种新模型，它是由ＨＭＭ与一个能描述语音信号时间相依性的多维高斯密度函数相结合构成的。本文从理论上论证了新模型的合理性。对汉语不计声调的全部４０９个单音节的识别实验结果表明：新模型的识别率显     

Development of an acoustic-phonetic hidden Markov model forcontinuous speech recognition

The techniques used to develop an acoustic-phonetic hidden Markov model, the problems associated with representing the whole acoustic-phonetic structure, the characteristics of the model, and how it performs as a phonetic decoder for recognition of fluent speech are discussed. The continuous variable duration model was trained using 450 sentences of fluent speech, each of which was spoken by a single speaker, and segmented and labeled using a fixed number of phonemes, each of which has a direct correspondence to the states of the matrix. The inherent variability of each phoneme is modeled as the observable random process of the Markov chain, while the phonotactic model of the unobservable phonetic sequence is represented by the state transition matrix of the hidden Markov model. The model assumes that the observed spectral data were generated by a Gaussian source. However, an analysis of the data shows that the spectra for the most of the phonemes are not normally distributed and that an alternative representation would be beneficial     

基于隐马尔可夫模型的车牌自动识别技术

文中提出了一种车牌字符识别的新方法,用二维隐马尔可夫模型方法识别车牌中的汉字,用伪二维隐马尔可夫模型（P2D－HMM）方法识别车牌中的英文字符及阿拉伯数字。该算法适用于不同的字符大小、字符倾斜、污损等情况,抗噪声能力强。字符识别正确率达94％以上,满足实用技术的要求。     

Segmental corrective training for hidden Markov model parameter estimation in speech recognition

A modified corrective training method using state segment information in the hidden Markov model is presented. The proposed algorithm is shown to result in a higher recognition rate than the conventional corrective training method and requires less computation.<>     

Hybrid approach to speech recognition using hidden Markov modelsand Markov chains

The paper presents a hybrid of a hidden Markov model and a Markov chain model for speech recognition. In this hybrid, the hidden Markov model is concerned with the time-varying property of spectral features, while the Markov chain accounts for the interdependence of spectral features. The log-likelihood scores of the two models, with respect to a given utterance, are combined by a postprocessor to yield a combined log-likelihood score for word classification. Experiments on speaker-independent and multispeaker isolated English alphabet recognition show that the hybrid outperformed both the hidden Markov model and the Markov chain model in terms of recognition     

Speech recognition algorithm based on neural network and hidden Markov model

This study proposes a hybrid model of speech recognition parallel algorithm based on hidden Markov model (HMM) and artificial neural network (ANN). First, the algorithm uses HMM for time-series modeling of speech signals and calculates the voice to the HMM of the output probability score. Second, with the probability score as input to the neural network, the algorithm gets information for classification and recognition and makes a decision based on the hybrid model. Finally, Matlab software is used to train and test sample data. Simulation results show that using the strong time-series modeling ability of HMM and the classification features of neural network, the proposed algorithm possesses stronger noise immunity than the traditional HMM. Moreover, the hybrid model enhances the individual flaws of the HMM and the neural network and greatly improves the speed and performance of speech recognition.     

Planar shape recognition based on hidden Markov models

A new deformed shape recognition method based on hidden Markov models (HMMs), which is very resistant against transformations and non-rigid deformations, is presented. Since shape features are not referred to an absolute point, the method is also resistant to severe shape distortions. The method has been successfully tested using different databases     

Isolated-utterance speech recognition using hidden Markov modelswith bounded state durations

Hidden Markov models (HMMs) with bounded state durations (HMM/BSD) are proposed to explicitly model the state durations of HMMs and more accurately consider the temporal structures existing in speech signals in a simple, direct, but effective way. A series of experiments have been conducted for speaker dependent applications using 408 highly confusing first-tone Mandarin syllables as the example vocabulary. It was found that in the discrete case the recognition rate of HMM/BSD (78.5%) is 9.0%, 6.3%, and 1.9% higher than the conventional HMMs and HMMs with Poisson and gamma distribution state durations, respectively. In the continuous case (partitioned Gaussian mixture modeling), the recognition rates of HMM/BSD (88.3% with 1 mixture, 88.8% with 3 mixtures, and 89.4% with 5 mixtures) are 6.3%, 5.0%, and 5.5% higher than those of the conventional HMMs, and 5.9% (with 1 mixture), 3.9% (with 3 mixtures) and 3.1% (with 1 mixture), 1.8% (with 3 mixtures) higher than HMMs with Poisson and gamma distributed state durations, respectively     

Gain-adapted hidden Markov models for recognition of clean andnoisy speech

In applying hidden Markov modeling for recognition of speech signals, the matching of the energy contour of the signal to the energy contour of the model for that signal is normally achieved by appropriate normalization of each vector of the signal prior to both training and recognition. This approach, however, is not applicable when only noisy signals are available for recognition. A unified approach is developed for gain adaptation in recognition of clean and noisy signals. In this approach, hidden Markov models (HMMs) for gain-normalized clean signals are designed using maximum-likelihood (ML) estimates of the gain contours of the clean training sequences. The models are combined with ML estimates of the gain contours of the clean test signals, obtained from the given clean or noisy signals, in performing recognition using the maximum a posteriori decision rule. The gain-adapted training and recognition algorithms are developed for HMMs with Gaussian subsources using the expectation-minimization (EM) approach     

基于不同隐马尔科夫模型的图像识别方法

为了更详细地研究隐马尔科夫模型在图像识别中的应用,以指纹识别为例,纵向总结了几种基于隐马尔科夫模型的指纹图像识别算法,包括一维隐马尔科夫模型、伪二维隐马尔科夫模型、二维模型及一维模型组。分别从时间复杂度、识别精确度等方面总结出这四种隐马尔科夫模型在图像识别时的优缺点,得出不同待识别图像适合使用的识别模型的结论。     

基于CNN的连续语音说话人声纹识别

近年来,随着社会生活水平的不断提高,人们对机器智能人声识别的要求越来越高.高斯混合—隐马尔可夫模型(Gaussian of mixture-hidden Markov model,GMM-HMM)是说话人识别研究领域中最重要的模型.由于该模型对大语音数据的建模能力不是很好,对噪声的顽健性也比较差,模型的发展遇到了瓶颈.为了解决该问题,研究者开始关注深度学习技术.引入了CNN深度学习模型研究连续语音说话人识别问题,并提出了CNN连续说话人识别(continuous speaker recognition of convolutional neural network,CSR-CNN)算法.模型提取固定长度、符合语序的语音片段,形成时间线上的有序语谱图,通过CNN提取特征序列,经过奖惩函数对特征序列组合进行连续测量.实验结果表明,CSR-CNN算法在连续—片段说话人识别领域取得了比GMM-HMM更好的识别效果.