homework6_ZhankunLuo

本文详细介绍了使用动态时间规整(DTW)和隐马尔科夫模型(HMM)进行语音识别的过程。通过修复和改进Matlab脚本,实现对数字语音样本的匹配识别,并展示了HMM的训练和识别结果。实验涵盖了不同语音模式的识别,以及HMM训练算法的性能展示。

Zhankun Luo

PUID: 0031195279

Email: luo333@pnw.edu

Fall-2018-ECE-59500-009

Instructor: Toma Hentea

Homework 6

Chap 7

Task

Dynamic Time Warping in Speech Recognition

Experiment with the matlab script IsoDigitRec.m to match template recordings of digits zero.wav, one.wav, …

to a set of template patterns provided in the textbook’s software

small fixes to IsoDigitRec.m

  1. ind=strfind(curDir,'\'); is changed to ind=strfind(curDir,'/');
  2. [x, Fs, bits] = wavread()will be removed, so replace them with [x,Fs]=audioread
  3. Change protoNames={'zero', ...} to protoNames={'zero.wav',...}accordingly

fixed IsoDigitRec.m

% IsoDigitRec.m (Example 5.4)
% "Introduction to Pattern Recognition: A MATLAB Approach"
% S. Theodoridis, A. Pikrakis, K. Koutroumbas, D. Cavouras
% At a first step, the data folder of Chapter 5 is appended to the existing 
% MATLAB path.
curDir=pwd;
ind=strfind(curDir,'/');
curDir(ind(end)+1:end)=[];
addpath([curDir 'data'],'-end');
close('all');
clear;
% To build the system, we will use short-term Energy and short-term Zero-
% Crossing Rate (Section 7.5.4, [Theo 09]) as features, so that each signal is rep-
% resented by a sequence of two-dimensional feature vectors. Note that this is not
% an optimal feature set in any sense and it has only been adopted on the basis of
% simplicity. The feature extraction stage is accomplished by typing the following
% code:
protoNames={'zero.wav','one.wav','two.wav','three.wav','four.wav','five.wav','six.wav','seven.wav','eight.wav','nine.wav'};
for i=1:length(protoNames)
    [x,Fs]=audioread(protoNames{i});
    winlength = round(0.02*Fs); % 20 ms moving window length
    winstep = winlength; % moving window step. No overlap
    [E,T]=stEnergy(x,Fs,winlength,winstep);
    [Zcr,T]=stZeroCrossingRate(x,Fs,winlength,winstep);
    protoFSeq{i}=[E;Zcr];
end
% To find the best match for an unknown pattern, say a pattern stored in file
% "upattern1.wav", type the following code:
[test,Fs]=audioread('upattern1.wav');
winlength = round(0.02*Fs); % use the same values as before
winstep = winlength;
[E,T]=stEnergy(test,Fs,winlength,winstep);
[Zcr,T]=stZeroCrossingRate(test,Fs,winlength,winstep);
Ftest=[E;Zcr];
tolerance=0.1;
LeftEndConstr=round(tolerance/winstep); % left endpoint constraint
RightEndConstr = LeftEndConstr;
for i=1:length(protoNames)
    [MatchingCost(i),BestPath{i},D{i},Pred{i}]=DTWSakoeEndp(protoFSeq{i},Ftest,LeftEndConstr,RightEndConstr,0);
end
[minCost,indexofBest]=min(MatchingCost);
fprintf('The unknown pattern has been identified as a "%s" \n',protoNames{indexofBest});

Result for Patterns

Change [test,Fs]=audioread('upattern1.wav'); to [test,Fs]=audioread('upattern02.wav'); , etc.

Then get Result for Patterns:

Name of PatternIdentified as
upattern1.wavzero.wav
upattern02.wavzero.wav
upattern11.wavzero.wav
upattern12.wavone.wav
upattern13.wavone.wav
upattern14.wavthree.wav
upattern15.wavzero.wav
upattern16.wavfour.wav
upattern17.wavfour.wav
upattern21.wavthree.wav
upattern22.wavtwo.wav
upattern23.wavtwo.wav
upattern51.wavfive.wav
upattern61.wavsix.wav

Chap 8

Task

HMM recognition and training

Run example633.m, example634.m, example635.m and example636.m

Fix

put BackTracking.m of Chap 5 into Chap 6 function&example folder

Because MultSeqTrainDoHMMVITsc.m use function BackTracking.m

content of functions

% CHAPTER 6: m-files
%
%   BWDoHMMsc              - Computes the recognition probability of a HMM, given a sequence of   %                            discrete observations, by means of the scaled version of the Baum-   %                            Welch (any-path) method
%   BWDoHMMst              - Same as BWDoHMMSc, except that no scaling is employed.
%   MultSeqTrainCoHMMBWsc  - Baum-Welch training (scaled version) of a Continuous Observation
%                            HMM, given multiple training sequences. Each sequence 
%                            consists of l-dimensional feature vectors.
%                            It is assumed that the pdf associated with each state 
%                            is a multivariate Gaussian mixture. 
%   MultSeqTrainDoHMMBWsc  - Baum-Welch training (scaled version) of a Discrete Observation
%                            HMM, given multiple training sequences.
%   MultSeqTrainDoHMMVITsc - Viterbi training (scaled version) of a Discrete ObservationHMM,given
%                            multiple training sequences.
%   VitCoHMMsc             - Computes the scaledViterbi score of aHMM,given a sequence of l-       %                            dimensional vectors
%                            of continuous observations, under the assumption that the pdf 
%                            of each state is a Gaussian mixture.
%   VitCoHMMst             - Same as VitCoHMMsc except that no scaling is employed.
%   VitDoHMMsc             - Computes the scaled Viterbi score of a Discrete Observation HMM, 
%                            given a sequence of observations.
%   VitDoHMMst             - Same as VitDoHMMsc, except that no scaling is employed.

Result for example633.m

epoch =     1
epoch =     2
piTrained_1 =
    0.7141
    0.2859
ATrained_1 =
    0.6743    0.3257
    0.6746    0.3254
BTrained_1 =
    0.7672    0.3544
    0.2328    0.6456
% press any key    
epoch =     1
epoch =     2
epoch =     3
epoch =     4
epoch =     5
epoch =     6
epoch =     7
epoch =     8
epoch =     9
epoch =    10
epoch =    11
epoch =    12
epoch =    13
piTrained_2 =
     1
     0
ATrained_2 =
    1.0000    0.0000
         0    1.0000
BTrained_2 =
    0.6333         0
    0.3667    1.0000

Result for example634.m

theEpoch =     1
theEpoch =     2
piTrained_1 =
    0.6857
    0.3143
ATrained_1 =
    0.6278    0.3722
    0.6288    0.3712
BTrained_1 =
     1     0
     0     1

Result for example635.m

epoch =     1
epoch =     2
piTrained_1 =
    0.7141
    0.2859
ATrained_1 =
    0.6743    0.3257
    0.6746    0.3254
BTrained_1 =
    0.7672    0.3544
    0.2328    0.6456
% press any key
epoch =     1
epoch =     2
epoch =     3
epoch =     4
epoch =     5
epoch =     6
epoch =     7
epoch =     8
epoch =     9
epoch =    10
epoch =    11
epoch =    12
epoch =    13
piTrained_2 =
     1
     0
ATrained_2 =
    1.0000    0.0000
         0    1.0000
BTrained_2 =
    0.6333         0
    0.3667    1.0000

Result for example636.m

Pr1 =   -8.8513
Pr2 =  -15.1390
bs1 =
     1     1     1     1     1     1     1     2     2     2     2     2     2
bs2 =
     1     2     2     2     2     2     2     2     2     2     2     2     2
【电力系统】单机无穷大电力系统短路故障暂态稳定Simulink仿真(带说明文档)内容概要:本文档围绕“单机无穷大电力系统短路故障暂态稳定Simulink仿真”展开,提供了完整的仿真模型与说明文档,重点研究电力系统在发生短路故障后的暂态稳定性问题。通过Simulink搭建单机无穷大系统模型,模拟不同类型的短路故障(如三相短路),分析系统在故障期间及切除后的动态响应,包括发电机转子角度、转速、电压和功率等关键参数的变化,进而评估系统的暂态稳定能力。该仿真有助于理解电力系统稳定性机理,掌握暂态过程分析方法。; 适合人群:电气工程及相关专业的本科生、研究生,以及从事电力系统分析、运行与控制工作的科研人员和工程师。; 使用场景及目标:①学习电力系统暂态稳定的基本概念与分析方法;②掌握利用Simulink进行电力系统建模与仿真的技能;③研究短路故障对系统稳定性的影响及提高稳定性的措施(如故障清除时间优化);④辅助课程设计、毕业设计或科研项目中的系统仿真验证。; 阅读建议:建议结合电力系统稳定性理论知识进行学习,先理解仿真模型各模块的功能与参数设置,再运行仿真并仔细分析输出结果,尝试改变故障类型或系统参数以观察其对稳定性的影响,从而深化对暂态稳定问题的理解。
本研究聚焦于运用MATLAB平台,将支持向量机(SVM)应用于数据预测任务,并引入粒子群优化(PSO)算法对模型的关键参数进行自动调优。该研究属于机器学习领域的典型实践,其核心在于利用SVM构建分类模型,同时借助PSO的全局搜索能力,高效确定SVM的最优超参数配置,从而显著增强模型的整体预测效能。 支持向量机作为一种经典的监督学习方法,其基本原理是通过在高维特征空间中构造一个具有最大间隔的决策边界,以实现对样本数据的分类或回归分析。该算法擅长处理小规模样本集、非线性关系以及高维度特征识别问题,其有效性源于通过核函数将原始数据映射至更高维的空间,使得原本复杂的分类问题变得线性可分。 粒子群优化算法是一种模拟鸟群社会行为的群体智能优化技术。在该算法框架下,每个潜在解被视作一个“粒子”,粒子群在解空间中协同搜索,通过不断迭代更新自身速度与位置,并参考个体历史最优解和群体全局最优解的信息,逐步逼近问题的最优解。在本应用中,PSO被专门用于搜寻SVM中影响模型性能的两个关键参数——正则化参数C与核函数参数γ的最优组合。 项目所提供的实现代码涵盖了从数据加载、预处理(如标准化处理)、基础SVM模型构建到PSO优化流程的完整步骤。优化过程会针对不同的核函数(例如线性核、多项式核及径向基函数核等)进行参数寻优,并系统评估优化前后模型性能的差异。性能对比通常基于准确率、精确率、召回率及F1分数等多项分类指标展开,从而定量验证PSO算法在提升SVM模型分类能力方面的实际效果。 本研究通过一个具体的MATLAB实现案例,旨在演示如何将全局优化算法与机器学习模型相结合,以解决模型参数选择这一关键问题。通过此实践,研究者不仅能够深入理解SVM的工作原理,还能掌握利用智能优化技术提升模型泛化性能的有效方法,这对于机器学习在实际问题中的应用具有重要的参考价值。 资源来源于网络分享,仅用于学习交流使用,请勿用于商业,如有侵权请联系我删除!
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值