Statistical Parametric Speech Synthesis with Joint Estimation of Acoustic and Excitation Model Parameters

Size: px
Start display at page:

Download "Statistical Parametric Speech Synthesis with Joint Estimation of Acoustic and Excitation Model Parameters"

Transcription

1 Statstal Parametr Speeh Synthess wth Jont Estmaton of Aoust and Extaton odel Parameters Rannery aa, Hega en, J F Gales Toshba Researh Europe Ltd, Cambrdge Researh Laboratory, Cambrdge, UK {rannerymaa,hegazen,mfg}@rltoshbaouk Abstrat Ths paper desrbes a novel framework for statstal parametr speeh synthess n whh statstal modelng of the speeh waveform s performed through the ont estmaton of aoust and extaton model parameters The proposed method ombnes extraton of spetral parameters, onsdered as hdden varables, and extaton sgnal modelng n a fashon smlar to fator analyzed traetory hdden arkov model The resultng ont model an be nterpreted as a waveform level losed-loop tranng, where the dstane between natural and syntheszed speeh s mnmzed An algorthm based on the maxmum lkelhood rteron s ntrodued to tran the proposed ont model and some experments are presented to show ts effetveness Index terms: statstal parametr speeh synthess, traetory hdden arkov model, extaton modelng, fator analyss 1 Introduton In typal statstal parametr speeh synthess [1], speeh parameters are extrated from speeh waveforms and ther traetores are modeled by a statstal model, suh as a hdden arkov models (Hs) The parameters of the models are estmated so as to maxmze ther lkelhood gven the tranng data At the synthess stage, a sentene-level sequene of states of the traned statstal models s omposed aordng to an nput text, and then speeh parameters are generated so as to maxmze the output probabltes of suh states [1] Fnally, a speeh waveform s re-onstruted from the generated speeh parameters by assumng the soure-flter produton model [] In ths paper a novel approah to statstal parametr speeh synthess s proposed, n whh aoust model parameters are ontly estmated wth parameters of a stand-alone extaton model n a way to maxmze a lkelhood funton nludng both models gven the speeh waveform Ths s done by assumng that speeh an be represented by the onvoluton of a slowly varyng voal trat mpulse response flter derved from spetral parameters, and an extaton soure In the proposed approah spetral parameter extraton s ntegrated n the ont tranng of aoust and extaton models, n a smlar way to the spetral analyss based on fator analyzed traetory H of [3] However, n the present method the speeh waveform s the observed term, and ts relatonshp wth the spetral features, onsdered as a hdden varable, s obtaned va the extaton model parameters The proposed ont estmaton of aoust and extaton models based on the maxmum lkelhood (L) rteron an be vewed as a losed-loop tranng method for statstal parametr synthess, suh as the one ntrodued n [4] Indeed, one smlarty between the urrent method wth the one desrbed n [4] s the ntegraton of spetral extraton durng the tranng Nevertheless, the phlosophy of the approah desrbed n [4] s the explt mnmzaton of a dstorton of ampltude spetra of natural and syntheszed speeh, whereas for the present ase the dstane between natural and syntheszed speeh waveforms s mnmzed n the tme doman Ths paper s organzed as follows In Seton the bas dea s ntrodued; n Seton 3 the ont modelng of aoust and extaton models s defned; Seton 4 presents a tranng algorthm based on the L rteron; Seton 5 shows some experments, and onludng remarks are n Seton 6 Bas dea 1 Conventonal framework In a typal statstal parametr speeh syntheszer [1], frstly aspetralparametervetor = ˆ T 1 s extrated from the speeh waveform, where t =[ t() t(c)] s a C-th order spetral feature vetor at frame t,andt s the total number of frames Estmaton of aoust model parameters s usually done through the L rteron, e, ˆλ =argmax p( l,λ ), (1) λ where l s a transrpton of the speeh waveform and λ denotes a set of aoust model parameters At run-tme synthess, s generated for a gven text to be syntheszed l so as to maxmze ts output probablty ĉ =argmax p( l, ˆλ ) () These generated features together wth an F -generated extaton sgnal are utlzed to synthesze the speeh waveform by usng the soure-flter produton approah [] Proposed framework Sne the ntenton of any speeh syntheszer s to mm the speeh waveform as well as possble, a statstal model defned at the waveform level s proposed here The parameters of ths new model are estmated so as to maxmze ts lkelhood gven the speeh waveform tself, e, ˆλ =argmax p (s l,λ), (3) λ where s =[s() s(n 1)] s a vetor ontanng the speeh waveform, wth s(n) beng a waveform value at sample n, N the number of samples, and λ denotng the set of parameters of the ont aoust-extaton model By ntrodung two hdden varables: the state sequene q = {q,,q T 1} (dsrete); and spetral parameter =

2 ˆ T 1 (ontnuous); (3) an be rewrtten as ˆλ =argmax p (s,, q l,λ) d (4) λ q =argmax p (s, q,λ) p ( q,λ) p (q l,λ) d, λ q where q t s the state at frame t The meanngs of the terms p (s, q,λ), p ( q,λ), and p (q l,λ) n (5) are separately analyzed as follows: p (s, q,λ): thstermonernsthespeehwaveform generaton from spetral features and a gven state sequene Its maxmzaton wth respet to λ s losely related to the L spetral estmaton [5] In ths work ths probablty s related to the assumed speeh sgnal generatve model 1 p ( q,λ): ths term s gven as the produt of state-output probabltes of speeh parameter vetors f Hs or hdden sem-arkov models (HSs) [1] are used for as aoust model If traetory Hs [6] are used, ths probablty s gven as a state-sequeneoutput probablty of the spetral parameter vetor p (q l,λ): ths term represents the probablty of a state sequene q for a gven transrpton l If an H or traetory H s used for aoust modelng, ths probablty s gven as a produt of state-transton probabltes In ase HS or traetory HS s used, p (q l,λ) nludes both state-transton and stateduraton probabltes Note that t s possble to model p ( q,λ) and p (q l,λ) usng exstng aoust models, suh as H, HS, or traetory H Therefore, the problem s how to model p (s, q,λ) 3 Defnton of the proposed framework Ths seton desrbes the dstrbuton of the speeh waveform gven spetral parameters, p (s, q,λ) Intally, ths s desrbed n terms of the mpulse response of a voal trat flter Later, n Seton 3, the relatonshp between spetral parameters and voal trat flter mpulse response s then onsdered 31 Assumed speeh generatve model The speeh sgnal s assumed to be generated by the proess n Fgure 1 [7], where (5) s(n) =h (n) [h v(n) t(n)+h u(n) w(n)], (6) wth denotng lnear onvoluton, and h (n): bengthevoaltratfltermpulseresponse; t(n): beng a pulse tran; w(n): bengagaussanwhtenosesequenewthmean zero and varane one; h v(n): beng the voed flter mpulse response; h u(n): beng the unvoed flter mpulse response 1 The assumed speeh generatve model wll be dsussed n Seton 31 The voal trat, voed and unvoed flters are assumed to have the followng transfer funtons, H (z) = H v (z) = P h (p)z p, (7) p= m= h v(m)z m, (8) K H u(z) = 1 P, (9) L l=1 g(l)z l where P, and L are respetvely the orders of H (z), H v (z), and H u(z) FlterH (z) s onsdered to have mnmum-phase response sne t represents the mpulse response of the voal trat flter [] Parameters of the generatve model above omprse the voal trat, voed and unvoed flters, H (z), H v (z) and H u (z), andthepostonsandampltudesoft(n), {p,,p 1}, and{a,,a 1}, wth beng the number of pulses Although there may exst several ways to estmate oeffents h v (m) and g(l) and gan term K, of flters H v (z) and H u(z),respetvely,thspaperwllbebasedonthemethod desrbed n [7] Usng matrx notaton, wth upperase and lowerase aptal letters respetvely denotng matres and vetors, (6) an be wrtten as s = H H vt + s u, (1) where s = ˆs ` H =» h () = } n» h () v = } H v = s `N + + P 1, (11), (1) h () h (P ) }, N+ n 1 h h() h(n+ 1) h h() v h(n 1) v h v ` h v ` (13), (14) }, N 1 (15) t = ˆt() t(n 1), (16) " # s u = } s u() s u(n + L 1) } The vetor s u ontans samples of +P L (17) s u (n) =h (n) h u (n) w(n), (18) and an be nterpreted as the error of the generatve model for voed regons of the speeh sgnal wth ovarane matrx H ΦH,where g () = Φ = G G 1, (19) G = ˆ g () g (N+ 1), ()» 1 g(1) g(l) } K K K } N+ 1 (1)

3 Pulse tran t(n) a a a1 a 1 H v (z) p p 1 p p 1 Gaussan whte nose w(n) (zero mean, varane one) H u (z) v(n) Voed Extaton u(n) Unvoed Extaton e(n) H (z) Extaton Speeh s(n) Fgure 1: The assumed speeh generaton model Extaton s reated by state-dependent flterng of a pulse tran and Gaussan whte nose [7] As w(n) s Gaussan whte nose, u(n) =h u (n) w(n) s a normally dstrbuted stohast proess Usng vetor notaton, the probablty of u an be expressed as p (u G) =N (u;, Φ), () where N (x; µ, Σ) means a Gaussan dstrbuton of x wth mean vetor µ and ovarane matrx Σ And sne u(n) =H 1 (z) {s(n) h(n) h v(n) t(n)}, (3) the probablty of speeh vetor s beomes p (s H, H v, G, t) =N s; H H vt, H ΦH (4) If the last P rows of H are gnored, thus negletng the zero-mpulse response of H (z) whh produes samples s `N +,,s`n + + P 1, thenh beomes square wth dmenson N + and (4) an be re-wrtten as p (s H,λ e)=h 1 1 N `H s; H vt, Φ, (5) where λ e = {H v, G, t} are parameters of the extaton part of the omplete speeh generatve model It s nterestng to note that the term H 1 s orresponds to the resdual sequene, extrated from the speeh sgnal s(n) through nverse flterng by H (z) By assumng that H v and G n the speeh generatve model have the state-dependent parameter tyng struture proposed n [7], (5) an be re-wrtten as p (s H, q,λ e)=h 1 1 N `H s ; H v,qt, Φ q, (6) where H v,q s the voed flter mpulse response matrx for state sequene q,andφ q = `G q G q 1, wth Gq beng the nverse unvoed flter mpulse response matrx for state sequene q 3 Relatonshp between voal trat flter mpulse response and spetral parameters The prevous seton has derved the dstrbuton p (s H, q,λ) However, from (5) the omplete waveform dstrbuton requres p (s, q,λ) Therefore, a relatonshp between voal trat mpulse response represented here by the matrx H and the orrespondng spetral parameters has to be derved Dependng on the relatonshp between H and, ts often dffult to ompute H from n a losed form for some hoes of spetral parameters, suh as mel-epstral oeffents, lne spetral pars, et To address ths problem, astohastapproxmatontomodeltherelatonshpbetween H and s one possblty If the mappng between H and an be represented as a Gaussan proess wth probablty p (H, q,λ h ),whereλ h s the set of parameters of a Gaussan model that maps spetral parameters onto voal trat flter mpulse response, then p (s, q,λ e) beomes p (s, q,λ)= p (s H, q,λ e) p (H, q,λ h ) dh = H 1 N `H 1 s ; H v,q t, Φ q N (H ; f q (), Ω q ) dh, (7) where f q() s an approxmaton funton to onvert to H and Ω q s a ovarane matrx representng the nose of the onverson In the speal ase where the relatonshp between H and s determnst, f q() beomes a smple mappng funton n a losed form and p (H, q,λ h ) beomes a delta funton 31 Cepstral oeffents as spetral parameters In ths paper epstral oeffents [5] were hosen as spetral parameters n order to avod the mappng model dsussed above Therefore, as that the flter H (z) has mnmum-phase response, the relatonshp between a gven epstral oeffent vetor for frame t, t = [ t() t(c)],andtsorrespondng voal trat flter mpulse response vetor, h,t = [h,t() h,t(p )],anbeexpressedas h,t = D t EP [D t t], (8) where EP[ ] means a vetor whh s derved by takng the exponental of the elements of [ ],andd t s a () (C +1) dsrete Fourer transform (DFT) matrx, wth W WP C +1 D t = , (9) 1 WP WP PC +1 W = e π, (3) and D t s a (P + 1) (P + 1) nverse DFT matrx Dt = 1 1 W 1 W P (31) 1 W P W P Note that D t and D t are onstant for all the frames - 9 -

4 3 Relatonshp between H and h The voal trat flter mpulse response-related term that appears n the generatve model of (1) s H,noth Relatonshp between H gven as (1) and (13) wthout the last P rows (square verson of H ), and h gven as h = ˆh, h,t 1, (3) h,t = ˆh,t() h,t(p ), (33) wth h,t beng the synthess flter mpulse response of the t-th frame, an be wrtten as H = N 1 n= J nbh n (34) In (34), N s the number of samples, and» n = } 1 }, (35) n N 1 n wth B beng an N() T ()matrx to map aframe-bassvetorh nto ts sample-bass verson The N N (P + 1) matres are onstruted as follows» I J =,N() P 1, (36) N P 1, N P 1,N() P 1 J N 1 =» N 1,N() P 1 N 1,1 N 1,P, (37) 1,N() P 1 1 1,P where,y means a matrx of zero elements wth rows and Y olumns, and I s an -dmenson dentty matrx For eah sample nrement the dentty matrx I moves one row down and olumns to the rght 33 Jont aoust and extaton modelng If a traetory H [6] s used to represent the probablty p ( l,λ ),then p( q,λ )=N ( ; q, P q), (38) TY 1 p(q l,λ )=π q t= α qt q t+1, (39) where π s the ntal probablty of state, α s the transton probablty from state to state, and q and P q orrespond to the mean vetor and ovarane matrx of traetory H for q In (38), q and P q are gven as q = P qr q, (4) R q = P 1 q = W Σ 1 q W, (41) r q = W Σ 1 q µ q, (4) where W s typally a 3T (C +1) T (C +1)wndow matrx that appends dynam features (veloty and aeleraton features) to µ q and Σ 1 q n (41) and (4) orrespond to the 3T (C +1) 1 mean parameter vetor and the 3T (C +1) 3T (C +1)preson parameter matrx for the state sequene q,gvenas h µ q = µ q µ q T 1, (43) n o Σ 1 q =dag Σ 1 q,,σ 1 q T 1, (44) where µ and Σ 1 orrespond to the 3(C + 1) 1 mean-parameter vetor and the 3(C + 1) 3(C + 1) preson-parameter matrx assoated wth state, and Y = dag{ 1,,} means that matres { 1,,} are dagonal sub-matres of Y ean parameter vetors and preson parameter matres for eah state are defned as µ = ˆµ µ µ Σ 1 = dag Σ 1, Σ 1, (45), Σ 1, (46) where [ ] and [ ] mean respetvely a vetor or matrx of veloty and aeleraton features assoated wth vetor or matrx [ ] The fnal model s obtaned by ombnng the aoust and extaton models, e, p (s l,λ)= p (s, q,λ e) p ( q,λ ) q p (q l,λ ) d, (47) where p ( q,λ ) and p (q l,λ ) are gven by (38) and (39), respetvely, whereas p (s, q,λ e) s represented by (6), and fnally λ = {λ e,λ } 4 L tranng Parameters of the ont model λ = {λ e,λ } are estmated aordng to (3), where the lkelhood funton p (s l,λ) s gven by (47), wth λ e = {H v, G, t} orrespondng to parameters of the extaton model, and λ = {m, σ} onsstng of parameters of the aoust model, m = ˆµ µ S 1, (48) 1 σ = vdag dag Σ,,Σ S 1, (49) where S s the number of states m and σ are respetvely vetors formed by onatenatng all the means and dagonals of the nverse ovarane matres of all states, wth vdag{[ ]} meanng a vetor formed by the dagonal elements of [ ] 41 Lkelhood funton Unfortunately, estmaton of λ through the expetatonmaxmzaton (E) algorthm s ntratable Therefore, here an approxmate reursve approah s adopted If the summaton over all possble q n (47) s approxmated by a fxed state sequene, then p (s l,λ) beomes p (s l,λ) p (s, ˆq,λ e) p ( ˆq,λ ) p ( ˆq l,λ ) d, (5) where ˆq = {ˆq,,ˆq T 1} s a fxed state sequene Further, f the ntegraton over all possble s approxmated by sngle epstral oeffent vetor, then (5) beomes p (s l,λ) p (s ĉ, ˆq,λ e) p (ĉ ˆq,λ ) p ( ˆq l,λ ), (51) where ĉ =[ĉ ĉ T 1] s a fxed spetral parameter vetor Fnally, f the state sequene ˆq s fxed through the entre tranng proess, the term p ( ˆq l,λ ) an be gnored By takng the logarthm of the resultng expresson, the followng log lkelhood funton to be maxmzed through the update of the aoust and extaton model parameters an be obtaned L (s; ĉ, ˆq,λ e,λ )=logp (s ĉ, ˆq,λ e)+logp (ĉ ˆq,λ ) (5)

5 4 Tranng proedure The optmzaton problem s broken nto two parts: ntalzaton and reurson 41 Intalzaton 1 Extrat from eah utterane of the speeh data an ntal epstral oeffent vetor, = ˆ T 1, (53) t = ˆ t() t(c) (54) Tran traetory H parameters λ by usng, ˆλ =argmax p ( λ ) (55) λ 3 Determne the best state sequene ˆq as the Vterb path from the traned models by usng the algorthm shown n [6], ˆq =argmax p (, q λ ) (56) q 4 Estmate extaton parameters λ e assumng ˆq and, by usng the algorthm desrbed n [7], 4 Reurson ˆλ e =argmax p(s, ˆq,λ e) (57) λ e 1 Estmate the best spetral parameter vetor ĉ by usng the log lkelhood funton of (5), ĉ =argmax L(s;, ˆq, ˆλ e, ˆλ ) (58) Update the aoust model parameters by tranng traetory H usng ĉ as the observaton, ˆλ =argmax p (ĉ ˆq,λ ) (59) λ 3 Update extaton model parameters λ e through the algorthm desrbed n [7], assumng ˆq and ĉ, ˆλ e =argmax p(s ĉ, ˆq,λ e ) (6) λ e The reursve steps may be repeated several tmes 43 Estmaton of the best epstral vetor ĉ In Step 1 of the reursve proess, epstral oeffents are estmated gven both traned extaton and aoust models The log lkelhood funton of (5) an be wrtten as L(s;, ˆq,λ e,λ )= 1 s H Φ 1 ˆq H 1 s + log H + + s H Φ 1 ˆq H v,ˆqt 1 R ˆq + r ˆq + K, (61) where K s a onstant that does not depend on The best epstral oeffent vetor ĉ an be alulated by utlzng any gradent-based optmzaton algorthm [8], where the gradent of L(s;, ˆq,λ e,λ ) wth respet to s L(s;, ˆq,λ e,λ )=D DIAG (EP [D]) D B ( N 1 n= h Jn H Φ 1 ˆq (e v) e I N n ) R ˆq +r ˆq, (6) Speeh Intal epstrum vetor Traetory H tranng Rˆq, rˆq Cepstrum vetor ĉ Traetory H tranng Intal epstral analyss State sequene ˆq Estmaton of the best epstral oeffents ĉ State sequene ˆq Intalzaton Intal epstrum vetor Extaton model tranng H v (z),g(z),t(n) Cepstrum vetor ĉ Extaton model tranng Reurson Fgure : Illustraton of the proposed ont tranng of aoust and extaton models and e = H 1 s, (63) v = H v,ˆq t, (64) D = dag {D,,D T 1}, (65) D = dag {D,,D T 1}, (66) where DIAG ([ ]) means a dagonal matrx whose non-zero elements ome from vetor [ ] 5 Experment Aprelmnaryexpermentwasondutedtoverfytheeffetveness of the proposed ont estmaton proess The database onssted of 1 hand-labeled sentenes from a US Englsh female speaker Intally, epstral oeffents were alulated by performng the spetral analyss desrbed n [5], wth γ =and α =, on smooth perodograms as nput, extrated from the speeh data at every 5 ms The number of epstral oeffents alulated per frame was 4, e, C =39 Jont tranng of aoust and extaton models λ = {λ e,λ } was then onduted as desrbed n Seton 4 and llustrated n the dagram of Fgure For estmaton of the best epstral oeffent vetor ĉ a 56-th order mpulse response of H (z) (P =56)wasonsdered Thereursveproesswas repeated 4 tmes 51 Cepstral analyss gven aoust and extaton models Estmaton of the best epstral oeffents for eah teraton of the reursve proedure was performed as desrbed n the Seton 43 Fgure 3 shows the behavor of the -dependent part of the lkelhood L(s;, ˆq,λ e,λ ) for one sentene, when a smple steepest-asent algorthm was utlzed wth onvergene F nformaton was utlzed to extrat smooth perodograms - 9 -

6 Lkelhood L() x Iteraton Fgure 3: Behavor of the log lkelhood L(s;, ˆq,λ e,λ ) durng the estmaton of the best epstrum ĉ for one sentene, usng a smple steepest-asent algorthm wth update fator δ =1 These measures were taken from the frst teraton of the reursve proess llustrated n Fgure Ampltude (db) Spetrum Smoothed spetrum Spetrum from ntal baselne epstrum Spetrum from 1 best estmated epstrum n Iteraton Frequeny (Hz) Fgure 4: Short-term ampltude spetra of a gven sentene Asde from natural and smooth spetra, spetra derved respetvely from the baselne epstra alulated n the ntal analyss, and epstra alulated n the 1-best estmaton proess of the fourth reursve teraton are also shown fator δ =1 Fgure 4 shows the spetral envelope derved from one frame of ntal, and 1-best epstra alulated on the fourth teraton of the reursve proess The speeh spetrum and ts smooth verson from whh the ntal epstrum was derved are also shown It an be seen for ths ase that the epstral oeffents alulated gven extaton and aoust models result n better reproduton of the formant around 5 Hz The performane of 1-best epstral oeffents ĉ alulated n eah reursve teraton was also verfed n terms of mpat on the resdual sgnal power, estmated as P e = lm N 1 N +1 N/ n= N/ e (n) 1 N e e, (67) where N n ths ase s the number of samples of the database Fgure 5 plots P e for eah teraton Resdual sgnals were obtaned through nverse flterng wth the mel generalzed log spetrum approxmaton (GLSA) flter struture [5] It an be seen that the resdual power has a relatve sgnfant derease n the frst reursve teraton of the ont tranng 5 Qualty resultng from the ont modelng An nformal lstenng test usng natural F and phonet duratons was onduted between the proposed ont tranng framework and the method n whh both extaton and aoust models are separately traned, orrespondng to the ntalzaton proess as llustrated n Fgure Extaton sgnal at run- Resdual power P e Reursve teraton Fgure 5: Resdual power extrated usng epstral oeffents alulated n eah reursve teraton In Iteraton the baselne observed epstral oeffents were used to derve P e tme was onstruted as depted n Fgure 1, wth pulse trans beng generated from F The GLSA flter, whh an mplement the voal trat flter usng epstral oeffents dretly, was used nstead of the all-zero struture of H (z) Aordng to the results the syntheszed speeh qualty produed by both approahes s ndstngushable One possble ause for ths was the lmted sze of the tranng database 6 Conluson Aproposalofontestmatonofaoustandextatonmodels for statstal parametr speeh synthess has been presented and ts tranng proedure based on L desrbed The resultng system beomes what an be nterpreted as a statstal modelng of the speeh waveform The approxmatons made for the estmaton of the parameters of the ntrodued ont aoustextaton model onssted of fxng the state sequene along the entre tranng proess and alulaton of a 1-best spetral oeffent vetor at eah teraton Future work nludes the utlzaton of other spetral parameterzatons, estmaton of N- best spetral parameters to approxmate p (s l,λ), andexperments wth larger tranng data 7 Referenes [1] H en, K Tokuda, and A Blak, Statstal parametr speeh synthess, Speeh Communaton, vol 51, pp , Nov 9 [] J R Deller, Jr, J H L Hansen, and J G Proaks, Dsrete- Tme Proessng of Speeh Sgnals NewYork:IEEEPress Class Ressue, [3] T Toda and K Tokuda, Statstal approah to voal trat transfer funton estmaton based on fator analyzed traetory H, n Pro of ICASSP,pp ,8 [4] Y J Wu and K Tokuda, nmum generaton error tranng by usng orgnal spetrum as referene for log spetral dstorton measure, n Pro of ICASSP, pp , 9 [5] K Tokuda, T Kobayash, T asuko, and S Ima, el-generalzed epstral analyss a unfed approah to speeh spetral estmaton, n Pro of ICSLP, pp , 1994 [6] H en, K Tokuda, and T Ktamura, Reformulatng the H as a traetory model by mposng explt relatonshps between stat and dynam feature vetor sequene, Computer Speeh and Language,vol1,pp ,Jan 7 [7] R aa, T Toda, H en, Y Nankaku, and K Tokuda, An extaton model for H-based speeh synthess based on resdual modelng, n Pro of ISCA Workshop on Speesh Synthess,pp ,7 [8] J Noedal and S J Wrght, Numeral Optmzaton New York: Sprnger,

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet

More information

JSM Survey Research Methods Section. Is it MAR or NMAR? Michail Sverchkov

JSM Survey Research Methods Section. Is it MAR or NMAR? Michail Sverchkov JSM 2013 - Survey Researh Methods Seton Is t MAR or NMAR? Mhal Sverhkov Bureau of Labor Statsts 2 Massahusetts Avenue, NE, Sute 1950, Washngton, DC. 20212, Sverhkov.Mhael@bls.gov Abstrat Most methods that

More information

FAULT DETECTION AND IDENTIFICATION BASED ON FULLY-DECOUPLED PARITY EQUATION

FAULT DETECTION AND IDENTIFICATION BASED ON FULLY-DECOUPLED PARITY EQUATION Control 4, Unversty of Bath, UK, September 4 FAUL DEECION AND IDENIFICAION BASED ON FULLY-DECOUPLED PARIY EQUAION C. W. Chan, Hua Song, and Hong-Yue Zhang he Unversty of Hong Kong, Hong Kong, Chna, Emal:

More information

Clustering. CS4780/5780 Machine Learning Fall Thorsten Joachims Cornell University

Clustering. CS4780/5780 Machine Learning Fall Thorsten Joachims Cornell University Clusterng CS4780/5780 Mahne Learnng Fall 2012 Thorsten Joahms Cornell Unversty Readng: Mannng/Raghavan/Shuetze, Chapters 16 (not 16.3) and 17 (http://nlp.stanford.edu/ir-book/) Outlne Supervsed vs. Unsupervsed

More information

DOAEstimationforCoherentSourcesinBeamspace UsingSpatialSmoothing

DOAEstimationforCoherentSourcesinBeamspace UsingSpatialSmoothing DOAEstmatonorCoherentSouresneamspae UsngSpatalSmoothng YnYang,ChunruWan,ChaoSun,QngWang ShooloEletralandEletronEngneerng NanangehnologalUnverst,Sngapore,639798 InsttuteoAoustEngneerng NorthwesternPoltehnalUnverst,X

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

STATS 306B: Unsupervised Learning Spring Lecture 10 April 30

STATS 306B: Unsupervised Learning Spring Lecture 10 April 30 STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Machine Learning: and 15781, 2003 Assignment 4

Machine Learning: and 15781, 2003 Assignment 4 ahne Learnng: 070 and 578, 003 Assgnment 4. VC Dmenson 30 onts Consder the spae of nstane X orrespondng to all ponts n the D x, plane. Gve the VC dmenson of the followng hpothess spaes. No explanaton requred.

More information

Outline. Clustering: Similarity-Based Clustering. Supervised Learning vs. Unsupervised Learning. Clustering. Applications of Clustering

Outline. Clustering: Similarity-Based Clustering. Supervised Learning vs. Unsupervised Learning. Clustering. Applications of Clustering Clusterng: Smlarty-Based Clusterng CS4780/5780 Mahne Learnng Fall 2013 Thorsten Joahms Cornell Unversty Supervsed vs. Unsupervsed Learnng Herarhal Clusterng Herarhal Agglomeratve Clusterng (HAC) Non-Herarhal

More information

JAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger

JAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger JAB Chan Long-tal clams development ASTIN - September 2005 B.Verder A. Klnger Outlne Chan Ladder : comments A frst soluton: Munch Chan Ladder JAB Chan Chan Ladder: Comments Black lne: average pad to ncurred

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

represents the amplitude of the signal after modulation and (t) is the phase of the carrier wave.

represents the amplitude of the signal after modulation and (t) is the phase of the carrier wave. 1 IQ Sgnals general overvew 2 IQ reevers IQ Sgnals general overvew Rado waves are used to arry a message over a dstane determned by the ln budget The rado wave (alled a arrer wave) s modulated (moded)

More information

Instance-Based Learning and Clustering

Instance-Based Learning and Clustering Instane-Based Learnng and Clusterng R&N 04, a bt of 03 Dfferent knds of Indutve Learnng Supervsed learnng Bas dea: Learn an approxmaton for a funton y=f(x based on labelled examples { (x,y, (x,y,, (x n,y

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

A SIMULATION TOOL FOR INTRODUCING ALGEBRAIC CELP (ACELP) CODING CONCEPTS IN A DSP COURSE

A SIMULATION TOOL FOR INTRODUCING ALGEBRAIC CELP (ACELP) CODING CONCEPTS IN A DSP COURSE A SIMULATION TOOL FOR INTRODUCING ALGEBRAIC CELP (ACELP) CODING CONCEPTS IN A DSP COURSE Venkatraman Att and Andreas Spanas Department of Eletral Engneerng, MIDL TRC Arzona State Unversty, Tempe, AZ, 85287-7206,

More information

ELG4179: Wireless Communication Fundamentals S.Loyka. Frequency-Selective and Time-Varying Channels

ELG4179: Wireless Communication Fundamentals S.Loyka. Frequency-Selective and Time-Varying Channels Frequeny-Seletve and Tme-Varyng Channels Ampltude flutuatons are not the only effet. Wreless hannel an be frequeny seletve (.e. not flat) and tmevaryng. Frequeny flat/frequeny-seletve hannels Frequeny

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Gravity Drainage Prior to Cake Filtration

Gravity Drainage Prior to Cake Filtration 1 Gravty Dranage Pror to ake Fltraton Sott A. Wells and Gregory K. Savage Department of vl Engneerng Portland State Unversty Portland, Oregon 97207-0751 Voe (503) 725-4276 Fax (503) 725-4298 ttp://www.e.pdx.edu/~wellss

More information

Introduction to Molecular Spectroscopy

Introduction to Molecular Spectroscopy Chem 5.6, Fall 004 Leture #36 Page Introduton to Moleular Spetrosopy QM s essental for understandng moleular spetra and spetrosopy. In ths leture we delneate some features of NMR as an ntrodutory example

More information

Improving the Performance of Fading Channel Simulators Using New Parameterization Method

Improving the Performance of Fading Channel Simulators Using New Parameterization Method Internatonal Journal of Eletrons and Eletral Engneerng Vol. 4, No. 5, Otober 06 Improvng the Performane of Fadng Channel Smulators Usng New Parameterzaton Method Omar Alzoub and Moheldn Wanakh Department

More information

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2) 1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons

More information

The corresponding link function is the complementary log-log link The logistic model is comparable with the probit model if

The corresponding link function is the complementary log-log link The logistic model is comparable with the probit model if SK300 and SK400 Lnk funtons for bnomal GLMs Autumn 08 We motvate the dsusson by the beetle eample GLMs for bnomal and multnomal data Covers the followng materal from hapters 5 and 6: Seton 5.6., 5.6.3,

More information

Statistical Analysis of Environmental Data - Academic Year Prof. Fernando Sansò CLUSTER ANALYSIS

Statistical Analysis of Environmental Data - Academic Year Prof. Fernando Sansò CLUSTER ANALYSIS Statstal Analyss o Envronmental Data - Aadem Year 008-009 Pro. Fernando Sansò EXERCISES - PAR CLUSER ANALYSIS Supervsed Unsupervsed Determnst Stohast Determnst Stohast Dsrmnant Analyss Bayesan Herarhal

More information

Phase Transition in Collective Motion

Phase Transition in Collective Motion Phase Transton n Colletve Moton Hefe Hu May 4, 2008 Abstrat There has been a hgh nterest n studyng the olletve behavor of organsms n reent years. When the densty of lvng systems s nreased, a phase transton

More information

technische universiteit eindhoven Analysis of one product /one location inventory control models prof.dr. A.G. de Kok 1

technische universiteit eindhoven Analysis of one product /one location inventory control models prof.dr. A.G. de Kok 1 TU/e tehnshe unverstet endhoven Analyss of one produt /one loaton nventory ontrol models prof.dr. A.G. de Kok Aknowledgements: I would lke to thank Leonard Fortun for translatng ths ourse materal nto Englsh

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

Clustering through Mixture Models

Clustering through Mixture Models lusterng through Mxture Models General referenes: Lndsay B.G. 995 Mxture models: theory geometry and applatons FS- BMS Regonal onferene Seres n Probablty and Statsts. MLahlan G.J. Basford K.E. 988 Mxture

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

Mr.Said Anwar Shah, Dr. Noor Badshah,

Mr.Said Anwar Shah, Dr. Noor Badshah, Internatonal Journal of Sentf & Engneerng Researh Volume 5 Issue 5 Ma-04 56 ISS 9-558 Level Set Method for Image Segmentaton and B Feld Estmaton usng Coeffent of Varaton wth Loal Statstal Informaton Mr.Sad

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

APPROXIMATE OPTIMAL CONTROL OF LINEAR TIME-DELAY SYSTEMS VIA HAAR WAVELETS

APPROXIMATE OPTIMAL CONTROL OF LINEAR TIME-DELAY SYSTEMS VIA HAAR WAVELETS Journal o Engneerng Sene and ehnology Vol., No. (6) 486-498 Shool o Engneerng, aylor s Unversty APPROIAE OPIAL CONROL OF LINEAR IE-DELAY SYSES VIA HAAR WAVELES AKBAR H. BORZABADI*, SOLAYAN ASADI Shool

More information

A Theorem of Mass Being Derived From Electrical Standing Waves (As Applied to Jean Louis Naudin's Test)

A Theorem of Mass Being Derived From Electrical Standing Waves (As Applied to Jean Louis Naudin's Test) A Theorem of Mass Beng Derved From Eletral Standng Waves (As Appled to Jean Lous Naudn's Test) - by - Jerry E Bayles Aprl 4, 000 Ths paper formalzes a onept presented n my book, "Eletrogravtaton As A Unfed

More information

Interval Valued Neutrosophic Soft Topological Spaces

Interval Valued Neutrosophic Soft Topological Spaces 8 Interval Valued Neutrosoph Soft Topologal njan Mukherjee Mthun Datta Florentn Smarandah Department of Mathemats Trpura Unversty Suryamannagar gartala-7990 Trpura Indamal: anjan00_m@yahooon Department

More information

A linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:

A linear imaging system with white additive Gaussian noise on the observed data is modeled as follows: Supplementary Note Mathematcal bacground A lnear magng system wth whte addtve Gaussan nose on the observed data s modeled as follows: X = R ϕ V + G, () where X R are the expermental, two-dmensonal proecton

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

8/25/17. Data Modeling. Data Modeling. Data Modeling. Patrice Koehl Department of Biological Sciences National University of Singapore

8/25/17. Data Modeling. Data Modeling. Data Modeling. Patrice Koehl Department of Biological Sciences National University of Singapore 8/5/17 Data Modelng Patrce Koehl Department of Bologcal Scences atonal Unversty of Sngapore http://www.cs.ucdavs.edu/~koehl/teachng/bl59 koehl@cs.ucdavs.edu Data Modelng Ø Data Modelng: least squares Ø

More information

Queueing Networks II Network Performance

Queueing Networks II Network Performance Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled

More information

Finite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin

Finite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin Fnte Mxture Models and Expectaton Maxmzaton Most sldes are from: Dr. Maro Fgueredo, Dr. Anl Jan and Dr. Rong Jn Recall: The Supervsed Learnng Problem Gven a set of n samples X {(x, y )},,,n Chapter 3 of

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Some Results on the Counterfeit Coins Problem. Li An-Ping. Beijing , P.R.China Abstract

Some Results on the Counterfeit Coins Problem. Li An-Ping. Beijing , P.R.China Abstract Some Results on the Counterfet Cons Problem L An-Png Bejng 100085, P.R.Chna apl0001@sna.om Abstrat We wll present some results on the ounterfet ons problem n the ase of mult-sets. Keywords: ombnatoral

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Efficient Sampling for Gaussian Process Inference using Control Variables

Efficient Sampling for Gaussian Process Inference using Control Variables Effent Samplng for Gaussan Proess Inferene usng Control Varables Mhals K. Ttsas, Nel D. Lawrene and Magnus Rattray Shool of Computer Sene, Unversty of Manhester Manhester M 9PL, UK Abstrat Samplng funtons

More information

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression 11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING

More information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

More information

425. Calculation of stresses in the coating of a vibrating beam

425. Calculation of stresses in the coating of a vibrating beam 45. CALCULAION OF SRESSES IN HE COAING OF A VIBRAING BEAM. 45. Calulaton of stresses n the oatng of a vbratng beam M. Ragulsks,a, V. Kravčenken,b, K. Plkauskas,, R. Maskelunas,a, L. Zubavčus,b, P. Paškevčus,d

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

More information

CSC401/2511 Spring CSC401/2511 Natural Language Computing Spring 2019 Lecture 5 Frank Rudzicz and Chloé Pou-Prom University of Toronto

CSC401/2511 Spring CSC401/2511 Natural Language Computing Spring 2019 Lecture 5 Frank Rudzicz and Chloé Pou-Prom University of Toronto CSC41/2511 Natural Language Computng Sprng 219 Lecture 5 Frank Rudzcz and Chloé Pou-Prom Unversty of Toronto Defnton of an HMM θ A hdden Markov model (HMM) s specfed by the 5-tuple {S, W, Π, A, B}: S =

More information

NON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS

NON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00

More information

The Similar Structure Method for Solving Boundary Value Problems of a Three Region Composite Bessel Equation

The Similar Structure Method for Solving Boundary Value Problems of a Three Region Composite Bessel Equation The Smlar Struture Method for Solvng Boundary Value Problems of a Three Regon Composte Bessel Equaton Mngmng Kong,Xaou Dong Center for Rado Admnstraton & Tehnology Development, Xhua Unversty, Chengdu 69,

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

ALGEBRAIC SCHUR COMPLEMENT APPROACH FOR A NON LINEAR 2D ADVECTION DIFFUSION EQUATION

ALGEBRAIC SCHUR COMPLEMENT APPROACH FOR A NON LINEAR 2D ADVECTION DIFFUSION EQUATION st Annual Internatonal Interdsplnary Conferene AIIC 03 4-6 Aprl Azores Portugal - Proeedngs- ALGEBRAIC SCHUR COMPLEMENT APPROACH FOR A NON LINEAR D ADVECTION DIFFUSION EQUATION Hassan Belhad Professor

More information

An Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation

An Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation An Experment/Some Intuton I have three cons n my pocket, 6.864 (Fall 2006): Lecture 18 The EM Algorthm Con 0 has probablty λ of heads; Con 1 has probablty p 1 of heads; Con 2 has probablty p 2 of heads

More information

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve follow-up tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the

More information

Communication with AWGN Interference

Communication with AWGN Interference Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m

More information

Voltammetry. Bulk electrolysis: relatively large electrodes (on the order of cm 2 ) Voltammetry:

Voltammetry. Bulk electrolysis: relatively large electrodes (on the order of cm 2 ) Voltammetry: Voltammetry varety of eletroanalytal methods rely on the applaton of a potental funton to an eletrode wth the measurement of the resultng urrent n the ell. In ontrast wth bul eletrolyss methods, the objetve

More information

( ) = ( ) + ( 0) ) ( )

( ) = ( ) + ( 0) ) ( ) EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data Condtonal Random Felds: Probablstc Models for Segmentng and Labelng Sequence Data Paper by John Lafferty, Andrew McCallum, and Fernando Perera ICML 2001 Presentaton by Joe Drsh May 9, 2002 Man Goals Present

More information

Expectation Maximization Mixture Models HMMs

Expectation Maximization Mixture Models HMMs -755 Machne Learnng for Sgnal Processng Mture Models HMMs Class 9. 2 Sep 200 Learnng Dstrbutons for Data Problem: Gven a collecton of eamples from some data, estmate ts dstrbuton Basc deas of Mamum Lelhood

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Hidden Markov Models & The Multivariate Gaussian (10/26/04) CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models

More information

A computer-aided optimization method of bending beams

A computer-aided optimization method of bending beams WSES Internatonal Conferene on ENGINEERING MECHNICS, STRUCTURES, ENGINEERING GEOLOGY (EMESEG '8), Heraklon, Crete Island, Greee, July 22-24, 28 omputer-aded optmzaton method of bendng beams CRMEN E. SINGER-ORCI

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14 APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce

More information

Classification as a Regression Problem

Classification as a Regression Problem Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class

More information

Signal space Review on vector space Linear independence Metric space and norm Inner product

Signal space Review on vector space Linear independence Metric space and norm Inner product Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space

More information

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton

More information

Prediction of the reliability of genomic breeding values for crossbred performance

Prediction of the reliability of genomic breeding values for crossbred performance Vandenplas et al. Genet Sel Evol 217 49:43 DOI 1.1186/s12711-17-318-1 Genets Seleton Evoluton RESERCH RTICLE Open ess Predton of the relablty of genom breedng values for rossbred performane Jéréme Vandenplas

More information

PHYSICS 212 MIDTERM II 19 February 2003

PHYSICS 212 MIDTERM II 19 February 2003 PHYSICS 1 MIDERM II 19 Feruary 003 Exam s losed ook, losed notes. Use only your formula sheet. Wrte all work and answers n exam ooklets. he aks of pages wll not e graded unless you so request on the front

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

Chapter 7. Ab initio Theory

Chapter 7. Ab initio Theory Chapter 7. Ab nto Theory Ab nto: from the frst prnples. I. Roothaan-Hall approah Assumng Born-Oppenhemer approxmaton, the eletron Hamltonan: Hˆ Tˆ e + V en + V ee Z r a a a + > r Wavefunton Slater determnant:

More information

10-701/ Machine Learning, Fall 2005 Homework 3

10-701/ Machine Learning, Fall 2005 Homework 3 10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40

More information

Optimization and Implementation for the Modified DFT Filter Bank Multicarrier Modulation System

Optimization and Implementation for the Modified DFT Filter Bank Multicarrier Modulation System Journal of Communatons Vol. 8, No. 0, Otober 203 Optmzaton and Implementaton for the odfed DFT Flter Ban ultarrer odulaton System Guangyu Wang, Wewe Zhang, Ka Shao, and Lng Zhuang Chongqng Key Laboratory

More information

8 : Learning in Fully Observed Markov Networks. 1 Why We Need to Learn Undirected Graphical Models. 2 Structural Learning for Completely Observed MRF

8 : Learning in Fully Observed Markov Networks. 1 Why We Need to Learn Undirected Graphical Models. 2 Structural Learning for Completely Observed MRF 10-708: Probablstc Graphcal Models 10-708, Sprng 2014 8 : Learnng n Fully Observed Markov Networks Lecturer: Erc P. Xng Scrbes: Meng Song, L Zhou 1 Why We Need to Learn Undrected Graphcal Models In the

More information

Chaos-Based Physical Layer Design for WSN Applications

Chaos-Based Physical Layer Design for WSN Applications Reent Advanes n Teleommunatons Crut Desgn Chaos-Based Physal Layer Desgn for WS Applatons STVA BRBR Department of letral Computer ngneerng The Unversty of Aukl Aukl, ew Zeal s.berber@aukl.a.nz SHU FG Department

More information

Introduton Ths work addresses the problem of eent 2-D lnear lterng n the dsrete Cosne transform (DCT) doman, whh s an mportant problem n the area of p

Introduton Ths work addresses the problem of eent 2-D lnear lterng n the dsrete Cosne transform (DCT) doman, whh s an mportant problem n the area of p Fast DCT Doman Flterng Usng the DCT and the DST Renato Kresh and Ner Merhav HP Israel Sene Center y Abstrat A method for eent spatal doman lterng, dretly n the DCT-IIe doman, s developed and proposed.

More information

Unified Subspace Analysis for Face Recognition

Unified Subspace Analysis for Face Recognition Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA

More information

π e ax2 dx = x 2 e ax2 dx or x 3 e ax2 dx = 1 x 4 e ax2 dx = 3 π 8a 5/2 (a) We are considering the Maxwell velocity distribution function: 2πτ/m

π e ax2 dx = x 2 e ax2 dx or x 3 e ax2 dx = 1 x 4 e ax2 dx = 3 π 8a 5/2 (a) We are considering the Maxwell velocity distribution function: 2πτ/m Homework Solutons Problem In solvng ths problem, we wll need to calculate some moments of the Gaussan dstrbuton. The brute-force method s to ntegrate by parts but there s a nce trck. The followng ntegrals

More information

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder. PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n

More information

MLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012

MLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012 MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

MOTION AND TEXTURE RATE-ALLOCATION FOR PREDICTION-BASED SCALABLE MOTION-VECTOR CODING

MOTION AND TEXTURE RATE-ALLOCATION FOR PREDICTION-BASED SCALABLE MOTION-VECTOR CODING MOTION AND TEXTRE RATE-ALLOCATION FOR PREDICTION-BASED SCALABLE MOTION-ECTOR CODING Joer Barbaren 1, Adran Munteanu, Fabo erdho, anns Andreopoulos, Jan Cornels and Peter Shelkens re nverstet Brussel (B)

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information

Introduction to Hidden Markov Models

Introduction to Hidden Markov Models Introducton to Hdden Markov Models Alperen Degrmenc Ths document contans dervatons and algorthms for mplementng Hdden Markov Models. The content presented here s a collecton of my notes and personal nsghts

More information

Grover s Algorithm + Quantum Zeno Effect + Vaidman

Grover s Algorithm + Quantum Zeno Effect + Vaidman Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the

More information

Modeling Mobility-Assisted Data Collection in Wireless Sensor Networks

Modeling Mobility-Assisted Data Collection in Wireless Sensor Networks Modelng Moblty-Asssted Data Colleton n Wreless Sensor Networks Hsham M. Almasaed and Ahmed E. Kamal Dept. of Eletral and Computer Eng., Iowa State Unversty, Ames, IA 11, USA E-mal:{hsham,kamal}@astate.edu

More information

Hidden Markov Models

Hidden Markov Models Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,

More information

Exact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction.

Exact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction. Exat nferene: ntroduton Exat nferene: ntroduton Usng a ayesan network to ompute probabltes s alled nferene n general nferene nvolves queres of the form: E=e E = The evdene varables = The query varables

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

Hidden Markov Model Cheat Sheet

Hidden Markov Model Cheat Sheet Hdden Markov Model Cheat Sheet (GIT ID: dc2f391536d67ed5847290d5250d4baae103487e) Ths document s a cheat sheet on Hdden Markov Models (HMMs). It resembles lecture notes, excet that t cuts to the chase

More information

Performance Modeling of Hierarchical Memories

Performance Modeling of Hierarchical Memories Performane Modelng of Herarhal Memores Marwan Sleman, Lester Lpsky, Kshor Konwar Department of omputer Sene and Engneerng Unversty of onnetut Storrs, T 0669-55 Emal: {marwan, lester, kshor}@engr.uonn.edu

More information