首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 187 毫秒
1.
探讨了利用Gabor小波和隐马尔可夫模型(HMM)进行人脸识别的方法,首先对人脸图像进行多分辨率的Gabor小波变换;然后在图像上放置一组网格结点,每个结点用该结点处的多尺度Gabor幅度特征描述,采用独立元分析法对每个结点进行去相关和降维;最后形成特征结,把每个特征结作为观测向量,对隐马尔可夫模型进行训练,并将优化的模型参数用于人脸识别,ORL人脸库的实验结果表明,该方法识别率高,工程上易于应用。  相似文献   

2.
This paper attempts to overcome the tendency of the expectation-maximization (EM) algorithm to locate a local rather than global maximum when applied to estimate the hidden Markov model (HMM) parameters in speech signal modeling. We propose a hybrid algorithm for estimation of the HMM in automatic speech recognition (ASR) using a constraint-based evolutionary algorithm (EA) and EM, the CEL-EM. The novelty of our hybrid algorithm (CEL-EM) is that it is applicable for estimation of the constraint-based models with many constraints and large numbers of parameters (which use EM) like HMM. Two constraint-based versions of the CEL-EM with different fusion strategies have been proposed using a constraint-based EA and the EM for better estimation of HMM in ASR. The first one uses a traditional constraint-handling mechanism of EA. The other version transforms a constrained optimization problem into an unconstrained problem using Lagrange multipliers. Fusion strategies for the CEL-EM use a staged-fusion approach where EM has been plugged with the EA periodically after the execution of EA for a specific period of time to maintain the global sampling capabilities of EA in the hybrid algorithm. A variable initialization approach (VIA) has been proposed using a variable segmentation to provide a better initialization for EA in the CEL-EM. Experimental results on the TIMIT speech corpus show that CEL-EM obtains higher recognition accuracies than the traditional EM algorithm as well as a top-standard EM (VIA-EM, constructed by applying the VIA to EM).  相似文献   

3.
随着经济的发展,国内外贸易迅速增长,港口航运业务也日趋繁忙,港口拥堵的现象常有发生,以致许多船舶不得不把时间浪费在等待服务上。为了减少船舶的等待时间,在原来的港口上进行扩建是十分必要的,为此提出了港口扩建的资源配置协调优化模型。提出在原有港口资源的基础上增加泊位数和提高服务率两种方案,并针对以上两种方案分别构建了所需总费用的数学模型;运用排队论方法和计算机仿真优化方法进行求解,通过一个实例来说明计算机仿真技术在港口扩建的资源协调优化的适用性和有效性。  相似文献   

4.
一种基于DSmT和HMM的序列飞机目标识别算法   总被引:1,自引:1,他引:0  
针对姿态多变化的飞机自动目标识别中的低识别率问题, 提出了一种基于DSmT (Dezert-Smarandache theory)与隐马尔可夫模型(Hidden Markov model, HMM)的飞机多特征序列信息融合识别算法(Multiple features and sequential information fusion, MFSIF). 其创新性在于将单幅图像的多特征信息融合识别和序列图像信息融合识别进行有机结合.首先, 对图像进行二值化预处理, 并提取目标的Hu矩和轮廓局部奇异值特征; 然后, 利用概率神经网络(Probabilistic neural networks, PNN)构造基本信度赋值(Basic belief assignment, BBA); 接着, 利用DSmT对该图像的不同特征进行融合,从而获得HMM的观察值序列;再接着, 利用隐马尔可夫模型对飞机序列信息融合, 计算观察值序列与各隐马尔可夫模型之间的相似度, 从而实现姿态多变化的飞机目标自动识别;最后, 通过仿真实验, 验证了该算法在飞机姿态发生较大变化时, 依然可以获得较高的正确识别率,同时在实时性方面也可以满足飞机目标识别的要求. 另外, 在飞机序列发生连续遮挡帧数τ ≤ 6的情况下, 也具有较高的飞机目标正确识别率.  相似文献   

5.
将隐马尔可夫模型(HMM)与小波神经网络(WNN)相结合,提出了一种基于心音信号的身份识别方法。该方法首先利用HMM对心音信号进行时序建模,并计算出待识别心音信号的输出概率评分;再将此识别概率评分作为小波神经网络的输入,通过小波神经网络将HMM的识别概率值进行非线性映射,获取分类识别信息;最后根据混合模型的识别算法得出识别结果。实验采集80名志愿者的160段心音信号对所提出的方法进行验证,并与GMM模型的识别结果进行了对比,结果表明,所选方法能够有效提高系统的识别性能,达到了比较理想的识别效果。  相似文献   

6.
基于二叉树和Adaboost算法的纸币号码识别   总被引:2,自引:0,他引:2  
潘虎  陈斌  李全文 《计算机应用》2011,31(2):396-398
运用一种快速弱分类器训练算法和高速缓存策略来加速Adaboost算法的训练。集成学习算法Adaboost能够精确构建二分类器,运用二叉树型结构快速灵活地将纸币号码识别转化为一系列的Adaboost二分类问题。实验结果证明, 快速Adaboost训练算法能加快训练速度,基于二叉树和Adaboost的纸币号码识别系统具有较好的识别率和处理速度,已经应用在点钞机、清分机和ATM中。  相似文献   

7.
在人机交互过程中,理解人类的情绪是计算机和人进行交流必备的技能之一。最能表达人类情绪的就是面部表情。设计任何现实情景中的人机界面,面部表情识别是必不可少的。在本文中,我们提出了交互式计算环境中的一种新的实时面部表情识别框架。文章对这个领域的研究主要有两大贡献:第一,提出了一种新的网络结构和基于AdaBoost的嵌入式HMM的参数学习算法。第二,将这种优化的嵌入式HMM用于实时面部表情识别。本文中,嵌入式HMM把二维离散余弦变形后的系数作为观测向量,这和以前利用像素深度来构建观测向量的嵌入式HMM方法不同。因为算法同时修正了嵌入式HMM的网络结构和参数,大大提高了分类的精确度。该系统减少了训练和识别系统的复杂程度,提供了更加灵活的框架,且能应用于实时人机交互应用软件中。实验结果显示该方法是一种高效的面部表情识别方法。  相似文献   

8.
Because of large variations involved in handwritten words, the recognition problem is very difficult. Hidden Markov models (HMM) have been widely and successfully used in speech processing and recognition. Recently HMM has also been used with some success in recognizing handwritten words with presegmented letters. In this paper, a complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model type stochastic network is presented. Our scheme includes a morphology and heuristics based segmentation algorithm, a training algorithm that can adapt itself with the changing dictionary, and a modified Viterbi algorithm which searches for the (l+1)th globally best path based on the previous l best paths. Detailed experiments are carried out and successful recognition results are reported  相似文献   

9.
VQ/HMM二级音节识别的研究   总被引:1,自引:0,他引:1  
HMM技术在语音识别是得到较为成功的应用,然而VQ/HMM对在词表的识别速度及识别率仍不理想,文中根据系统实现中的实时性和识别率的要求,提出了初始码本均匀法,对参加训练的各音先对其求平均,然后用各音的平均值组成初始矢量的空间,并采用码本快速迭代法以及标号直方图法与HMM识别相结合的二级识别方法,提高了系统的识别率和识别速度,此方法简单,易于实时化。  相似文献   

10.
A Chinese sign language recognition system based on SOFM/SRN/HMM   总被引:3,自引:0,他引:3  
Wen  Gaolin  Debin  Yiqiang   《Pattern recognition》2004,37(12):2389-2402
In sign language recognition (SLR), the major challenges now are developing methods that solve signer-independent continuous sign problems. In this paper, SOFM/HMM is first presented for modeling signer-independent isolated signs. The proposed method uses the self-organizing feature maps (SOFM) as different signers' feature extractor for continuous hidden Markov models (HMM) so as to transform input signs into significant and low-dimensional representations that can be well modeled by the emission probabilities of HMM. Based on these isolated sign models, a SOFM/SRN/HMM model is then proposed for signer-independent continuous SLR. This model applies the improved simple recurrent network (SRN) to segment continuous sign language in terms of transformed SOFM representations, and the outputs of SRN are taken as the HMM states in which the lattice Viterbi algorithm is employed to search the best matched word sequence. Experimental results demonstrate that the proposed system has better performance compared with conventional HMM system and obtains a word recognition rate of 82.9% over a 5113-sign vocabulary and an accuracy of 86.3% for signer-independent continuous SLR.  相似文献   

11.
基于一种改进禁忌搜索算法优化离散隐马尔可夫模型   总被引:1,自引:0,他引:1  
隐马尔可夫模型(HMM,HiddenMarkovModel)是语音识别和手势识别中广泛使用的统计模式识别方法。文章提出了一种改进的禁忌搜索(ITS,ImprovedTabuSearch)优化HMM的参数。传统的TabuSearch(TS)与局部搜索算法(极大似然法)交替进行,从而加快了算法的收敛速度,并得到优化解。分别用TS及ITS训练隐马尔可夫模型进行动态手势识别。结果表明ITS可获得更高的识别率,且能达到全局优化。  相似文献   

12.
View-invariant human action recognition is a challenging research topic in computer vision. Hidden Markov Models(HMM) and their extensions have been widely used for view-invariant action recognition. However those methods are usually according to a large parameter space, requiring amounts of training data and with low classification accuracies for real application. A novel graphical structure based on HMM with multi-view transition is proposed to model the human action with viewpoint changing. The model consists of multiple sub action models, which correspond to the traditional HMM utilized to model the human action in a particular rotation viewpoint space. In the training process, the novel model can be built by connecting the sub action models between adjacent viewpoint spaces. In the recognition process, action with unknown viewpoint is recognized by using improved forward algorithm. The proposed model can not only simplify the model training process by decomposing the parameter space into multiple sub-spaces, but also improve the performance the algorithm by constraining the possible viewpoint changing. Experiment results on IXMAS dataset demonstrated that the proposed model obtains better performance than other recent view-invariant action recognition method.  相似文献   

13.
In proactive computing, human activity recognition from image sequences is an active research area. In this paper, a novel human activity recognition method is proposed, which utilizes Independent Component Analysis (ICA) for activity shape information extraction from image sequences and Hidden Markov Model (HMM) for recognition. Various human activities are represented by shape feature vectors from the sequence of activity shape images via ICA. Based on these features, each HMM is trained and activity recognition is achieved by the trained HMMs of different activities. Our recognition performance has been compared to the conventional method where Principal Component Analysis (PCA) is typically used to derive activity shape features. Our results show that superior recognition is achieved with the proposed method especially for activities (e.g., skipping) that cannot be easily recognized by the conventional method. Furthermore, by employing Linear Discriminant Analysis (LDA) on IC features, the recognition results further improved significantly in the recognition performance.  相似文献   

14.
隐马尔可夫模型(Hidden Markov Model,HMM)是一种有效的时序信号建模方法,已广泛用于语音识别、文字识别等领域,近年来也被用于人的行为识别。人的行为序列是一种特殊的时序信号,每类行为往往包含若干帧关键姿势。利用行为序列的这个特点,提出了AdaBoost-EHMM(AdaBoost-Exemplar-based HMM)算法,并将该算法应用于行为识别中。利用AdaBoost的特征选择方法将行为序列中的典型样本逐个选择出来作为HMM观测概率模型的均值,之后融合多级分类器进行行为识别。实验结果证明AdaBoost-EHMM算法在保证算法收敛的同时提高了识别率。  相似文献   

15.
为了解决语音信号中帧与帧之间的重叠,提高语音信号的自适应能力,本文提出基于隐马尔可夫(HMM)与遗传算法神经网络改进的语音识别系统.该改进方法主要利用小波神经网络对Mel频率倒谱系数(MFCC)进行训练,然后利用HMM对语音信号进行时序建模,计算出语音对HMM的输出概率的评分,结果作为遗传神经网络的输入,即得语音的分类识别信息.实验结果表明,改进的语音识别系统比单纯的HMM有更好的噪声鲁棒性,提高了语音识别系统的性能.  相似文献   

16.
基于小波变换和隐马尔可夫模型的人脸识别方法   总被引:5,自引:1,他引:4  
提出了基于小波变换和隐马尔可夫模型的人脸识别方法。对原始图像采用小波分解后,原始图像被分解到不同的频带上。利用小波理论分析可知,在每一级分解中,低频子图像包含了原始图像的主要描述信息,而其他3个高频子图像包含的信息较少,对模式分类的作用也较小,所以可忽略不计。该算法首先对图像进行3级小波分解,然后把3个不同分辨率的低频子图像由小到大排列成树状结构,形成低频小波树。接着利用主元分析对每个小波树枝进行去相关、降维,形成特征小波树枝,并把它作为观测向量对隐马尔可夫模型进行训练,把优化的模型参数用于人脸识别,实验结果表明,该方法识别率较高,具有很好的发展前景。  相似文献   

17.
The role of gesture recognition is significant in areas like human‐computer interaction, sign language, virtual reality, machine vision, etc. Among various gestures of the human body, hand gestures play a major role to communicate nonverbally with the computer. As the hand gesture is a continuous pattern with respect to time, the hidden Markov model (HMM) is found to be the most suitable pattern recognition tool, which can be modeled using the hand gesture parameters. The HMM considers the speeded up robust feature features of hand gesture and uses them to train and test the system. Conventionally, the Viterbi algorithm has been used for training process in HMM by discovering the shortest decoded path in the state diagram. The recursiveness of the Viterbi algorithm leads to computational complexity during the execution process. In order to reduce the complexity, the state sequence analysis approach is proposed for training the hand gesture model, which provides a better recognition rate and accuracy than that of the Viterbi algorithm. The performance of the proposed approach is explored in the context of pattern recognition with the Cambridge hand gesture data set.  相似文献   

18.
方高林  高文  陈熙霖  王春立  马继勇 《软件学报》2002,13(11):2169-2175
手语识别是通过计算机提供一种有效而准确的机制将手语翻译成文本或语音。目前最新发展水平的手语识别系统在实际应用中应解决非特定人连续手语问题。提出一种将连续手语识别分解成各弧立词识别的分治方法,用于非特定人连续手语识别。把精简循环网(simple recurrent network,简称SRN)作为连续手语的段边界检测器,把SRN分段结果作为隐马可夫模型(hidden Markov models,简称HMM)框架中的状态输入,在HMM框架里使用网格Viterbi算法搜索出一条最佳手语词路径。实验结果表明,该方法的识别效果比单纯使用HMM要好。  相似文献   

19.
In this paper, we propose a multi-environment model adaptation method based on vector Taylor series (VTS) for robust speech recognition. In the training phase, the clean speech is contaminated with noise at different signal-to-noise ratio (SNR) levels to produce several types of noisy training speech and each type is used to obtain a noisy hidden Markov model (HMM) set. In the recognition phase, the HMM set which best matches the testing environment is selected, and further adjusted to reduce the environmental mismatch by the VTS-based model adaptation method. In the proposed method, the VTS approximation based on noisy training speech is given and the testing noise parameters are estimated from the noisy testing speech using the expectation-maximization (EM) algorithm. The experimental results indicate that the proposed multi-environment model adaptation method can significantly improve the performance of speech recognizers and outperforms the traditional model adaptation method and the linear regression-based multi-environment method.  相似文献   

20.
Most of the contemporary speech recognition systems exploit complex algorithms based on Hidden Markov Models (HMMs) to achieve high accuracy. However, in some cases rich computational resources are not available, and even isolated words recognition becomes challenging task. In this paper, we present two ways to simplify scoring in HMM-based speech recognition in order to reduce its computational complexity. We focus on core HMM procedure—forward algorithm, which is used to find the probability of generating observation sequence by given HMM, applying methods of dynamic programming. All proposed approaches were tested on Russian words recognition and the results were compared with those demonstrated by conventional forward algorithm.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号