Multi-Modal User Interaction Fall 2008
|
|
- Conrad Phillips
- 5 years ago
- Views:
Transcription
1 Mul-Modal User Ineracon Fall 2008 Lecure 2: Speech recognon I Zheng-Hua an Deparmen of Elecronc Sysems Aalborg Unversy Denmark z@es.aau.dk Mul-Modal User Ineracon II Zheng-Hua an 2008 ar I: Inroducon Inroducon hsory and rends Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably Mul-Modal User Ineracon II Zheng-Hua an
2 ASR hsory. Specral resonances exraced by an analogue fler bank and logc crcus; phoneme syllable dg recognon 2. DW IWR IBM LV ASR Bell Labs SI ASR CMU CSR ARA 5- year proec 3. Sascal framework HMM CMU IBM J.Baker Δcepsrum Furu -gram IBM eural ne DARA program Resource managemen ask Dscrmnave approach robus ASR DARA program broadcas news EARS rch ranscrpon GALE sponaneous speech audovsual ASR S. Furu 2007 Mul-Modal User Ineracon II Zheng-Hua an I echnology progress Mul-Modal User Ineracon II Zheng-Hua an
3 97-976: he ARA proec ARA launched 5 year Spoken Undersandng Research proec Goal: 000 word vocabulary a few speakers connuous speech consraned grammar 90% undersandng rae near real me on a 00 MIS machne 4 Sysems bul by he end of he program SDC 24% BB s HWIM 44% CMU s Hearsay II 74% CMU s HARY 95% -- bu 80 mes real me! Ra Reddy HARY based on engneerng approach: search on nework of all he possble uerances Conclude: Speech Undersandng s oo early for s me Lesson learned: Hand-bul knowledge does no scale up eed of a global opmzaon creron Mul-Modal User Ineracon II Zheng-Hua an s -- he Sascal Approach Hdden Markov Models based sascal approach Fred Jelnek and Jm Baker IBM Foundaons of modern speech recognon engnes Wˆ arg max A W W W Acousc HMMs a a22 Word r-grams a33 w w w 2 a2 a23 S S2 S3 J Baker o Daa Lke More Daa Whenever I fre a lngus our sysem performance mproves 988 Some of my bes frends are lnguss 2004 Mul-Modal User Ineracon II Zheng-Hua an
4 Large vocabulary speech recognon A Block Dagram Inpu Speech Fron-end Sgnal rocessng Feaure Vecors Lngusc Decodng and Search Algorhm upu Senence Speech Corpora Acousc Model ranng Acousc Models Lexcon Language Model Language Model Consrucon ex Corpora Example Inpu Senence hs s speech Acousc Models h-h-s-h-z-s-p-h-ch Lexcon h-h-s hs h-z s s-p-y-ch speech Language Model hs s speech Lexcal Knowledge-base Grammar hs s hs speech hs s w w - b-gram language model w w - w -2 r-gram Mul-Modal language User modelec L.S. Lee 2007 Ineracon II Zheng-Hua an Key componens of LVCSR sysem Acousc models Language models Speech Feaure exracon Decoder search Words Applcaon Speech recognon nvolves: How o represen he sgnal How o model boh acousc and language consrans How o search for he opmal answer Mul-Modal User Ineracon II Zheng-Hua an
5 ar II: Speech sgnal represenaon Inroducon Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably Mul-Modal User Ineracon II Zheng-Hua an Shor-me processng soluon Assumng ha speech has non-me-varyng properes fxed excaon and vocal rac whn shor nervals rocessng shor segmens frames of he speech sgnal each me f x n m x m w n m Mul-Modal User Ineracon II Zheng-Hua an
6 Wndows Recangular wndow w[ n] 0 n Hammng wndow commonly used 2πn w[ n] cos 0 n Mul-Modal User Ineracon II Zheng-Hua an 2008 Choce of wndow Wndow ype Bandwdh of Hammng wndow s abou wce he bandwdh of Recangular Aenuaon of more han 40dB for Hammng as compared wh 4 db for Recangular ousde passband Wndow duraon Increase decrease wndow bandwdh should be larger han a pch perod bu smaller han a sound duraon Mul-Modal User Ineracon II Zheng-Hua an
7 Dmenson & speech represenaon he curse of dmenson he compuaonal cos ncreases exponenally wh he dmenson of he problem he frame-based analyss yelds a seuence as a new represenaon of he speech sgnal samples a 8000/sec vecors a 00/sec Mul-Modal User Ineracon II Zheng-Hua an Fron-end feaure exracon MFCC Mul-Modal User Ineracon II Zheng-Hua an
8 ar III: emplae based approach Inroducon Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably Mul-Modal User Ineracon II Zheng-Hua an emplae based ASR x unknown speech Feaure Exracon X feaure vecor seuence aern Machng Decson Makng W oupu word y ranng speech Feaure Exracon Y Reference aerns emplae machng mechansm Calculae he dsance beween wo paerns Dynamc me warpng DW Mul-Modal User Ineracon II Zheng-Hua an
9 Speakng rae and me-normalzaon Speakng rae varaon causes nonlnear flucuaon n a speech paern me axs me-normalzaon s needed. Mul-Modal User Ineracon II Zheng-Hua an D based me-normalzaon Dynamc programmng s a paern machng algorhm wh a nonlnear me-normalzaon effec. me dfferences bw wo speech paerns are elmnaed by warpng he me axs of one so ha he maxmum concdence s aaned wh he oher also called dynamc me warpng DW he me-normalzed dsance s calculaed as he mnmzed resdual dsance beween hem remanng sll afer elmnang he mng dfferences. Mul-Modal User Ineracon II Zheng-Hua an
10 Dynamc programmng Consder wo speech paerns expressed as a seuence of feaure vecors : ck A a a2... a... ai B b b... b... b 2 Consder an - plane hen me dfferences can be depced by a seuence of pons c: where F c c2... c k... c K c k k k J Mul-Modal User Ineracon II Zheng-Hua an Dynamc programmng con d he seuence c s called a warpng funcon. A dsance bw wo feaure vecors s d c d a b he weghed summaon of dsances on warpng funcon F becomes E F K d c k. w k he me-normalzed dsance bw A and B s defned as he mnmum resdual dsance bw hem K d c k. w k k D A B mn K w k k k Mul-Modal User Ineracon II Zheng-Hua an
11 Resrcons on warpng funcon Warpng funcon F or pons ck as a model of me-axs flucuaon n speech has resrcons: Monoonc condons : k k and k 2 Connuy condons : k k and k 3 Boundary condons : and K I K J. 4 Adusmen wndow condon k k r 5 Slope consran condon : k k A graden should be neher oo seep nor oo genle. Mul-Modal User Ineracon II Zheng-Hua an he smples D of symmerc form Sep : Inalsaon: g 2d Sep 2: Ieraon D euaon: g + d g mn g + 2d g + d Adusmen wndow: r + r Sep 3: ermnaon: me-normalsed dsance D A B g I J where I + J Mul-Modal User Ineracon II Zheng-Hua an
12 From emplae o sascal mehod he emplae mehod wh D algnmen s a smplfed non-paramerc mehod whch s hard o characerse he varaon among uerances Hdden Markov model HMM s a powerful sascal mehod of characersng he observed daa samples of a dscree-me seres he underlyng assumpon of he HMM s he speech sgnal can be well characersed as a paramerc random process he parameers of he sochasc process can be esmaed n a precse well-defned manner Mul-Modal User Ineracon II Zheng-Hua an ar IV: Hdden Markov model Inroducon Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably Mul-Modal User Ineracon II Zheng-Hua an
13 Hdden Markov model Mul-Modal User Ineracon II Zheng-Hua an he Urn-and-Ball model doubly sochasc sysems Mul-Modal User Ineracon II Zheng-Hua an
14 Elemens of a dscree HMM : he number of saes saes s {s s 2...s } sae a me s M: he number of observaon symbols observaon symbols v {v v 2...v M } observaon a me o v A {a }: sae ranson probably dsrbuon a + s s B {b k}: observaon probably dsrbuon n sae b k v k s k M π π } { : nal sae dsrbuon For convenence we use he noaon: λ A B π Mul-Modal User Ineracon II Zheng-Hua an hree basc HMM problems Scorng: Gven an observaon seuence {o o 2...o } and a model λ {A Bπ} how o compue λ he probably of he observaon seuence? he Forward-Backward Algorhm Machng: Gven an observaon seuence {o o 2...o } and he model λhow o choose a sae seuence { 2... } whch s opmum n some sense? he Verb Algorhm ranng: How o adus he model parameers λ {ABπ} o maxmze λ? he Baum-Welch Re-esmaon rocedures Mul-Modal User Ineracon II Zheng-Hua an
15 roblem : Scorng Gven {o o 2...o } and λ {A Bπ} how o compue λ he probably of he observaon seuence? probably evaluaon Consder all possble sae seuences of lengh : λ λ λ Calculaon reured 2 all 2... π b a 2 For compuaons! b 2... a 2 b Mul-Modal User Ineracon II Zheng-Hua an he forward algorhm Consder he forward varable α defned as α oo2... o λ.e. he probably of he paral observaon seuence unl me and sae a me gven he model λ We can solve for α nducvely as follows:. Inalsaon α π b o 2. Inducon 3. ermnaon α α a b o + + λ α Calculaon 2.. For nsead of 0 72 Mul-Modal User Ineracon II Zheng-Hua an
16 Illusraon of forward algorhm Rabner 989 Mul-Modal User Ineracon II Zheng-Hua an he backward algorhm Smlarly consder he backward varable defned as β o o... o.e. he probably of he paral observaon seuence from me + o he end gven sae a me and model λ We can solve for β nducvely as follows:. Inalsaon β 2. Inducon λ β ab o 3. ermnaon λ π b o β Agan calculaon β + β 2... Mul-Modal User Ineracon II Zheng-Hua an
17 7 Mul-Modal User Ineracon II Zheng-Hua an roblem 2: Machng Gven {o o 2...o }how o choose a sae seuence { 2... } whch s opmum n some sense? pmal sae seuence rells dagram for an Isolaed Word Recognon ask. Mul-Modal User Ineracon II Zheng-Hua an Fndng opmal sae seuence ne opmaly creron s o choose he saes ha are ndvdually mos lkely a each me Defne he probably of beng n sae a me gven he observaon seuence and he model λ he ndvdually mos lkely sae * a me s λ γ λ λ λ λ Snce β λ α We have β α β α γ ] arg max[ * γ
18 Fndng opmal sae seuence con d he ndvdual opmaly creron has he problem ha he opmum sae seuence may no obey sae ranson consrans he opmal sae seuence may no even be a vald seuence a 0 for some and Anoher opmaly creron s s o fnd he sngle bes sae seuence pah.e. o maxmze λ he Verb algorhm a mehod based on dynamc programmng Mul-Modal User Ineracon II Zheng-Hua an he Verb algorhm o fnd he bes pah { 2... } for gven {o o 2...o } we defne he bes score hghes probably along a sngle pah a me δ max 2... oo2... o 2... λ whch accouns for he frs observaons and ends n sae. hen δ [maxδ a ]. b o + + Mul-Modal User Ineracon II Zheng-Hua an
19 9 Mul-Modal User Ineracon II Zheng-Hua an he Verb algorhm con d. Inalsaon 2. Recurson 3. ermnaon 4. ah sae seuence backrackng 0 o b ψ π δ a o b a 2 ] arg max[ 2 ] max[ δ ψ δ δ ] arg max[ ] max[ * * δ δ 2... * * + + ψ Mul-Modal User Ineracon II Zheng-Hua an he Verb algorhm con d Joseph cone
20 he power of recursve euaon Compung facorals n! Mehod. smply caculae n!for each n Mehod 2. use n! n n! f F n n!hen F n nf n for n Recursve Euaon Mul-Modal User Ineracon II Zheng-Hua an roblem 3: ranng How o une he model parameers λ {ABπ} o maxmze λ? - a learnng problem o effcen algorhm for global opmsaon Effecve erave algorhm for local opmsaon: he Baum-Welch re-esmaon Baum-Welch forward-backward algorhm Baum 972 s a specal case of EM expecaon-maxmzaon algorhm compues probables usng curren model λ; refnes λ o λ such ha λ s locally maxmsed uses α and β from forward-backward algorhm Mul-Modal User Ineracon II Zheng-Hua an
21 2 Mul-Modal User Ineracon II Zheng-Hua an Baum-Welch re-esmaon Defne he probably of beng n sae a me and sae a me + gven λ and.e. ξ b a b a b a β α β α λ β α λ λ λ ξ o o o Mul-Modal User Ineracon II Zheng-Hua an Baum-Welch Re-esmaon con d Recall ha s defned as he probably of beng n sae a me gven he enre observaon seuence and he model so Sum and over we have + ξ λ λ γ γ γ ξ n o sae ransons from sae expeced number of vsed. s ha sae mes he expeced number of n ransons from sae expeced number of ξ γ γ
22 22 Mul-Modal User Ineracon II Zheng-Hua an Baum-Welch re-esmaon formulas oherwse 0 mes n sae expeced number of and observng symbol mes n sae expeced number of ransons from sae expeced number of o sae ransons from sae expeced number of a me mes n sae expeced freuency number of.. k k k v o s k v o v o v o v k b a k δ λ δ λ γ γ γ ξ γ π Mul-Modal User Ineracon II Zheng-Hua an ar VI: Varably Inroducon Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably
23 Varably n he speech sgnal Mos noceable facors ha deermne accuracy are varaons n conex n speaker and n envronmen. Speech recognser can be very accurae for a parcular speaker n a parcular language and speakng syle n a parcular envronmen and lmed o a parcular ask. Bu remans a research challenge o buld a recognser ha can undersand anyone s speech n any language on any opc n any free-flowng syle and n any speakng envronmen Accuracy and robusness are he ulmae measures for he success of ASR Mul-Modal User Ineracon II Zheng-Hua an Varably Conex varably I s easy o recognse speech. I s easy o wreck a nce beach. Syle varably Isolaed connuous sponaneous Speaker varably human vocal rac Speaker-dependen vs. speaker-ndependen Speaker-adapaon Envronmenal varably Mulsyle ranng ransmsson channel varably Error concealmen Mul-Modal User Ineracon II Zheng-Hua an
24 roblems wh nose Hgh-level performance n conrolled envronmens Degradaon n nosy suaons 00% o 30% accuracy n a car wh 90km/h 99% o 50% n a cafeera Key ssue: msmach n ranng and operang envronmens Mul-Modal User Ineracon II Zheng-Hua an ose robusness Speech enhancemen x unknown speech + nose2 SR2 y ranng speech + nose SR Feaure Exracon Feaure Exracon X ose ressance Y Language models Decoder Acousc models Mul-condon ranng Mul-Modal User Ineracon II Zheng-Hua an W Model compensaon 24
25 ar VI: Summary Inroducon Speech sgnal represenaon emplae based approach DW Sascal model based approach HMM Varably Mul-Modal User Ineracon II Zheng-Hua an
Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationLecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,
Lecure Sldes for INTRDUCTIN T Machne Learnng ETHEM ALAYDIN The MIT ress, 2004 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/2ml CHATER 3: Hdden Marov Models Inroducon Modelng dependences n npu; no
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationHidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University
Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationDigital Speech Processing Lecture 20. The Hidden Markov Model (HMM)
Dgal Speech Processng Lecure 20 The Hdden Markov Model (HMM) Lecure Oulne Theory of Markov Models dscree Markov processes hdden Markov processes Soluons o he Three Basc Problems of HMM s compuaon of observaon
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationConsider processes where state transitions are time independent, i.e., System of distinct states,
Dgal Speech Processng Lecure 0 he Hdden Marov Model (HMM) Lecure Oulne heory of Marov Models dscree Marov processes hdden Marov processes Soluons o he hree Basc Problems of HMM s compuaon of observaon
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationHidden Markov Model for Speech Recognition. Using Modified Forward-Backward Re-estimation Algorithm
IJCSI Inernaonal Journal of Compuer Scence Issues Vol. 9 Issue 4 o 2 July 22 ISS (Onlne): 694-84.IJCSI.org 242 Hdden Markov Model for Speech Recognon Usng Modfed Forard-Backard Re-esmaon Algorhm Balan
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationChapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are
Chaper 6 DEECIO AD EIMAIO: Fundamenal ssues n dgal communcaons are. Deecon and. Esmaon Deecon heory: I deals wh he desgn and evaluaon of decson makng processor ha observes he receved sgnal and guesses
More informationHidden Markov Models
11-755 Machne Learnng for Sgnal Processng Hdden Markov Models Class 15. 12 Oc 2010 1 Admnsrva HW2 due Tuesday Is everyone on he projecs page? Where are your projec proposals? 2 Recap: Wha s an HMM Probablsc
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More informationFall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationHIDDEN MARKOV MODELS FOR AUTOMATIC SPEECH RECOGNITION: THEORY AND APPLICATION. S J Cox
HIDDEN MARKOV MODELS FOR AUTOMATIC SPEECH RECOGNITION: THEORY AND APPLICATION S J Cox ABSTRACT Hdden Markov modellng s currenly he mos wdely used and successful mehod for auomac recognon of spoken uerances.
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationCS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering
CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc
More informationHidden Markov Model. a ij. Observation : O1,O2,... States in time : q1, q2,... All states : s1, s2,..., sn
Hdden Mrkov Model S S servon : 2... Ses n me : 2... All ses : s s2... s 2 3 2 3 2 Hdden Mrkov Model Con d Dscree Mrkov Model 2 z k s s s s s s Degree Mrkov Model Hdden Mrkov Model Con d : rnson roly from
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle
More informationModélisation de la détérioration basée sur les données de surveillance conditionnelle et estimation de la durée de vie résiduelle
Modélsaon de la dééroraon basée sur les données de survellance condonnelle e esmaon de la durée de ve résduelle T. T. Le, C. Bérenguer, F. Chaelan Unv. Grenoble Alpes, GIPSA-lab, F-38000 Grenoble, France
More information( ) [ ] MAP Decision Rule
Announcemens Bayes Decson Theory wh Normal Dsrbuons HW0 due oday HW o be assgned soon Proec descrpon posed Bomercs CSE 90 Lecure 4 CSE90, Sprng 04 CSE90, Sprng 04 Key Probables 4 ω class label X feaure
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationFoundations of State Estimation Part II
Foundaons of Sae Esmaon Par II Tocs: Hdden Markov Models Parcle Flers Addonal readng: L.R. Rabner, A uoral on hdden Markov models," Proceedngs of he IEEE, vol. 77,. 57-86, 989. Sequenal Mone Carlo Mehods
More informationIntroduction to Boosting
Inroducon o Boosng Cynha Rudn PACM, Prnceon Unversy Advsors Ingrd Daubeches and Rober Schapre Say you have a daabase of news arcles, +, +, -, -, +, +, -, -, +, +, -, -, +, +, -, + where arcles are labeled
More informationHybrid of Chaos Optimization and Baum-Welch Algorithms for HMM Training in Continuous Speech Recognition
Inernaonal Conference on Inellgen Conrol and Informaon Processng Augus 3-5, - Dalan, Chna Hybrd of Chaos Opmzaon and Baum-Welch Algorhms for HMM ranng n Connuous Speech Recognon Somayeh Cheshom, Saeed
More informationPattern Classification (III) & Pattern Verification
Preare by Prof. Hu Jang CSE638 --4 CSE638 3. Seech & Language Processng o.5 Paern Classfcaon III & Paern Verfcaon Prof. Hu Jang Dearmen of Comuer Scence an Engneerng York Unversy Moel Parameer Esmaon Maxmum
More informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationDual Approximate Dynamic Programming for Large Scale Hydro Valleys
Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored
More information10. A.C CIRCUITS. Theoretically current grows to maximum value after infinite time. But practically it grows to maximum after 5τ. Decay of current :
. A. IUITS Synopss : GOWTH OF UNT IN IUIT : d. When swch S s closed a =; = d. A me, curren = e 3. The consan / has dmensons of me and s called he nducve me consan ( τ ) of he crcu. 4. = τ; =.63, n one
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationMachine Learning Linear Regression
Machne Learnng Lnear Regresson Lesson 3 Lnear Regresson Bascs of Regresson Leas Squares esmaon Polynomal Regresson Bass funcons Regresson model Regularzed Regresson Sascal Regresson Mamum Lkelhood (ML)
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationAdvanced Macroeconomics II: Exchange economy
Advanced Macroeconomcs II: Exchange economy Krzyszof Makarsk 1 Smple deermnsc dynamc model. 1.1 Inroducon Inroducon Smple deermnsc dynamc model. Defnons of equlbrum: Arrow-Debreu Sequenal Recursve Equvalence
More informationCHAPTER 2: Supervised Learning
HATER 2: Supervsed Learnng Learnng a lass from Eamples lass of a famly car redcon: Is car a famly car? Knowledge eracon: Wha do people epec from a famly car? Oupu: osve (+) and negave ( ) eamples Inpu
More informationVideo-Based Face Recognition Using Adaptive Hidden Markov Models
Vdeo-Based Face Recognon Usng Adapve Hdden Markov Models Xaomng Lu and suhan Chen Elecrcal and Compuer Engneerng, Carnege Mellon Unversy, Psburgh, PA, 523, U.S.A. xaomng@andrew.cmu.edu suhan@cmu.edu Absrac
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationLecture 2 M/G/1 queues. M/G/1-queue
Lecure M/G/ queues M/G/-queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly
More informationPerformance Analysis for a Network having Standby Redundant Unit with Waiting in Repair
TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen
More informationNotes on the stability of dynamic systems and the use of Eigen Values.
Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon
More informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon If we say wh one bass se, properes vary only because of changes n he coeffcens weghng each bass se funcon x = h< Ix > - hs s how we calculae
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationNeural Networks-Based Time Series Prediction Using Long and Short Term Dependence in the Learning Process
Neural Neworks-Based Tme Seres Predcon Usng Long and Shor Term Dependence n he Learnng Process J. Puchea, D. Paño and B. Kuchen, Absrac In hs work a feedforward neural neworksbased nonlnear auoregresson
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationPanel Data Regression Models
Panel Daa Regresson Models Wha s Panel Daa? () Mulple dmensoned Dmensons, e.g., cross-secon and me node-o-node (c) Pongsa Pornchawseskul, Faculy of Economcs, Chulalongkorn Unversy (c) Pongsa Pornchawseskul,
More informationCHAPTER 5: MULTIVARIATE METHODS
CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he
More informationBandlimited channel. Intersymbol interference (ISI) This non-ideal communication channel is also called dispersive channel
Inersymol nererence ISI ISI s a sgnal-dependen orm o nererence ha arses ecause o devaons n he requency response o a channel rom he deal channel. Example: Bandlmed channel Tme Doman Bandlmed channel Frequency
More informationAnomaly Detection. Lecture Notes for Chapter 9. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar
Anomaly eecon Lecure Noes for Chaper 9 Inroducon o aa Mnng, 2 nd Edon by Tan, Senbach, Karpane, Kumar 2/14/18 Inroducon o aa Mnng, 2nd Edon 1 Anomaly/Ouler eecon Wha are anomales/oulers? The se of daa
More informationEcon107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)
Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen
More informationECE 366 Honors Section Fall 2009 Project Description
ECE 366 Honors Secon Fall 2009 Projec Descrpon Inroducon: Muscal genres are caegorcal labels creaed by humans o characerze dfferen ypes of musc. A muscal genre s characerzed by he common characerscs shared
More informationFiltrage particulaire et suivi multi-pistes Carine Hue Jean-Pierre Le Cadre and Patrick Pérez
Chaînes de Markov cachées e flrage parculare 2-22 anver 2002 Flrage parculare e suv mul-pses Carne Hue Jean-Perre Le Cadre and Parck Pérez Conex Applcaons: Sgnal processng: arge rackng bearngs-onl rackng
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationGenetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems
Genec Algorhm n Parameer Esmaon of Nonlnear Dynamc Sysems E. Paeraks manos@egnaa.ee.auh.gr V. Perds perds@vergna.eng.auh.gr Ah. ehagas kehagas@egnaa.ee.auh.gr hp://skron.conrol.ee.auh.gr/kehagas/ndex.hm
More informationPhone Recognition on TIMIT Database Using Mel-Frequency Cepstral Coefficients and Support Vector Machine Classifier
IJISET - Inernaonal Journal of Innovave Scence, Engneerng & Technology, Vol. Issue, January 05. www.jse.com Phone Recognon on TIMIT Daabase Usng Mel-Frequency Cepsral Coeffcens and Suppor Vecor Machne
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationNetworked Estimation with an Area-Triggered Transmission Method
Sensors 2008, 8, 897-909 sensors ISSN 1424-8220 2008 by MDPI www.mdp.org/sensors Full Paper Neworked Esmaon wh an Area-Trggered Transmsson Mehod Vnh Hao Nguyen and Young Soo Suh * Deparmen of Elecrcal
More informationPart II CONTINUOUS TIME STOCHASTIC PROCESSES
Par II CONTINUOUS TIME STOCHASTIC PROCESSES 4 Chaper 4 For an advanced analyss of he properes of he Wener process, see: Revus D and Yor M: Connuous marngales and Brownan Moon Karazas I and Shreve S E:
More informationSampling Procedure of the Sum of two Binary Markov Process Realizations
Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV
More informationA New Method for Computing EM Algorithm Parameters in Speaker Identification Using Gaussian Mixture Models
0 IACSI Hong Kong Conferences IPCSI vol. 9 (0) (0) IACSI Press, Sngaore A New ehod for Comung E Algorhm Parameers n Seaker Idenfcaon Usng Gaussan xure odels ohsen Bazyar +, Ahmad Keshavarz, and Khaoon
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationBuilding Temporal Models for Gesture Recognition
Buldng Temporal Models for Gesure Recognon Rchard Bowden, Mansoor Sarhad Vson and VR Group Dep of Sysems Engneerng, Brunel Unversy Uxbrdge, Mddlesex, UB8 3PH, UK rchard.bowden@brunel.ac.uk Absrac Ths work
More informationBernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field
Submed o: Suden Essay Awards n Magnecs Bernoull process wh 8 ky perodcy s deeced n he R-N reversals of he earh s magnec feld Jozsef Gara Deparmen of Earh Scences Florda Inernaonal Unversy Unversy Park,
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationPHYS 1443 Section 001 Lecture #4
PHYS 1443 Secon 001 Lecure #4 Monda, June 5, 006 Moon n Two Dmensons Moon under consan acceleraon Projecle Moon Mamum ranges and heghs Reerence Frames and relae moon Newon s Laws o Moon Force Newon s Law
More informationDecentralised Sliding Mode Load Frequency Control for an Interconnected Power System with Uncertainties and Nonlinearities
Inernaonal Research Journal of Engneerng and echnology IRJE e-iss: 2395-0056 Volume: 03 Issue: 12 Dec -2016 www.re.ne p-iss: 2395-0072 Decenralsed Sldng Mode Load Frequency Conrol for an Inerconneced Power
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brh-deah rocess - Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuous-me Marov-chans Grah and marx reresenaon Transen and
More informationParametric Estimation in MMPP(2) using Time Discretization. Cláudia Nunes, António Pacheco
Paramerc Esmaon n MMPP(2) usng Tme Dscrezaon Cláuda Nunes, Anóno Pacheco Deparameno de Maemáca and Cenro de Maemáca Aplcada 1 Insuo Superor Técnco, Av. Rovsco Pas, 1096 Lsboa Codex, PORTUGAL In: J. Janssen
More informationA GENERAL FRAMEWORK FOR CONTINUOUS TIME POWER CONTROL IN TIME VARYING LONG TERM FADING WIRELESS NETWORKS
A GENERAL FRAEWORK FOR CONTINUOUS TIE POWER CONTROL IN TIE VARYING LONG TER FADING WIRELESS NETWORKS ohammed. Olama, Seddk. Djouad Charalambos D. Charalambous Elecrcal and Compuer Engneerng Deparmen Elecrcal
More informationImplementation of Quantized State Systems in MATLAB/Simulink
SNE T ECHNICAL N OTE Implemenaon of Quanzed Sae Sysems n MATLAB/Smulnk Parck Grabher, Mahas Rößler 2*, Bernhard Henzl 3 Ins. of Analyss and Scenfc Compung, Venna Unversy of Technology, Wedner Haupsraße
More informationMulti-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach
Mul-Fuel and Med-Mode IC Engne Combuson Smulaon wh a Dealed Chemsry Based Progress Varable Lbrary Approach Conens Inroducon Approach Resuls Conclusons 2 Inroducon New Combuson Model- PVM-MF New Legslaons
More informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More information