Kernel-Based Bayesian Filtering for Object Tracking
|
|
- Clinton Marsh
- 6 years ago
- Views:
Transcription
1 Kernel-Based Bayesan Flerng for Objec Trackng Bohyung Han Yng Zhu Dorn Comancu Larry Davs Dep. of Compuer Scence Real-Tme Vson and Modelng Inegraed Daa and Sysems Unversy of Maryland Semens Corporae Research Semens Corporae Research College Park, MD 74, USA Prnceon, NJ 854, USA Prnceon, NJ 854, USA {bhhan, Absrac Parcle flerng provdes a general framework for propagang probably densy funcons n non-lnear and non-gaussan sysems. However, he algorhm s based on a Mone Carlo approach and samplng s a problemac ssue, especally for hgh dmensonal problems. Ths paper presens a new kernelbased Bayesan flerng framework, whch adops an analyc approach o beer approxmae and propagae densy funcons. In hs framework, he echnques of densy nerpolaon and densy approxmaon are nroduced o represen he lkelhood and he poseror denses by Gaussan mxures, where all parameers such as he number of mxands, her wegh, mean, and covarance are auomacally deermned. The proposed analyc approach s shown o perform samplng more effcenly n hgh dmensonal space. We apply our algorhm o he real-me rackng problem, and demonsrae s performance on real vdeo sequences as well as synhec examples. Inroducon Parcle flerng s a Mone Carlo approach o solve he recursve Bayesan flerng problem. Alhough provdes racable soluons o non-lnear and non-gaussan sysems, s faced wh praccal ssues such as sample degeneracy and sample mpovershmen []. Moreover, o acheve relable flerng, he sample sze can grow exponenally as he dmenson of he sae space ncreases. To overcome hese ssues, we explore an analyc approach o approxmae densy funcons and nroduce a new kernel-based flerng scheme. The man dea of hs work s o manan an analyc represenaon of relevan densy funcons and propagae hem over me. In hs paper, kernel-based densy represenaon s adoped.. Relaed Work There have been many paramerc densy represenaons proposed for varous applcaons. In [5, ], he auhors sugges Gaussan mxure models, bu her mehod requres knowledge of he number of componens, whch s dffcul o know n advance. A more elaborae densy represenaon s descrbed n [], where a 3-componen mxure s used for he arge modelng n objec rackng problem, bu hs approach canno overcome he drawback of paramerc mehods. Kernel densy esmaon [8] s a wdely used non-paramerc approach n compuer vson. Is major advanage s he flexbly o represen very complcaed denses effecvely. Bu s very hgh memory requremens and compuaonal complexy nhb he use of hs mehod. For Bayesan flerng, Cham and Rehg [3] nroduce a pecewse Gaussan funcon o specfy he racker sae, n whch he seleced Gaussan componens characerze he neghborhoods around he modes. Ths dea s appled o mulple hypohess rackng n a hgh dmensonal space body racker, bu he samplng and he poseror compuaon are no sraghforward. The closes work o our paper s [3] where he poseror s represened wh a Gaussan mxure n a parcle fler framework. However, hs soluon may no provde a compac represenaon for he poseror, and he predcon and he updae seps are oversmplfed.. Our Approach In hs paper, we exend our prevous work [9] whch provdes he man framework of Kernel-based Bayesan flerng. We nroduce densy approxmaon and densy nerpolaon o represen densy funcons effcenly and effecvely. In boh echnques, he densy funcon s represened by a Gaussan mxure, where he number of mxands, her weghs, means and covarances are auomacally deermned. The densy approxmaon s based on a mode fndng algorhm [6, 7] derved from varable-bandwdh mean-shf whch provdes he mehodology o consruc a compac represenaon wh a small number of Gaussan kernels. A densy nerpolaon echnque s nroduced o oban a connuous represenaon of he measuremen lkelhood funcon. Unscened ransformaon UT) [, 6] s also adoped o deal wh non-lnear sae ranson models. These echnques are negraed no he Bayesan flerng framework. In he new kernel-based Bayesan flerng algorhm, he connuous represenaons of densy funcons are propagaed over me. The advanage of mananng an analyc represenaon of densy funcons les n effcen samplng. Ths s mporan for solvng hgh dmensonal problems. A mul-sage samplng sraegy s nroduced n densy nerpolaon for accurae approxmaon of he measuremen lkelhood funcon. The new
2 algorhm s appled o real-me objec rackng, and s performance s demonsraed hrough varous expermens. Ths paper s organzed as follows. Secon nroduces he new densy propagaon echnque n he Bayesan flerng framework. Secon 3 and 4 explan he densy approxmaon and he densy nerpolaon mehod, respecvely. Secon 5 demonsraes s performance by varous smulaon resuls wh synhec examples. Fnally, s demonsraed n secon 6 how our algorhm can be appled o objec rackng n real vdeos. Bayesan Flerng In hs secon, we nroduce he new Bayesan flerng framework, where he relevan densy funcons are approxmaed by kernel-based represenaons and propagaed over me.. Overvew In a dynamc sysem, he process and measuremen model are gven by x = gx,u ) ) z = hx,v ) ) where v and u are he process and he measuremen nose, respecvely. The sae varable x =,...,n) s characerzed by s probably densy funcon esmaed from he sequence of measuremens z =,...,n). In he sequenal Bayesan flerng framework, he condonal densy of he sae varable gven he measuremens s propagaed hrough predcon and updae sages, px z : ) = px x )px z : )dx 3) px z : ) = k pz x )px z : ) 4) where k = pz x )px z : )dx s a normalzaon consan ndependen of x. px z : ) s he pror probably densy funcon pdf), px z : ) s he predced pdf and pz x ) s he measuremen lkelhood funcon. The poseror pdf a me sep, px z : ), s used as he pror pdf n me sep +. A each me sep, he condonal dsrbuon of he sae varable x gven a sequence of measuremens z s represened by a Gaussan mxure. Our goal s o rean such a represenaon hrough he sages of predcon and updae, and o represen he poseror probably n he followng sep wh he same mxure form. The proposed flerng framework s descrbed as follows. Frs, unscened ransformaon UT) [, 6] s used o derve a mxure represenaon of he predced pdf px z : ). Second, he densy nerpolaon echnque wh a mul-sage samplng s nroduced o approxmae he lkelhood funcon wh an mxure form. By mulplyng wo mxure funcons, he poseror pdf s obaned hrough equaon 4). To preven he number of mxands from growng oo large, an algorhm of densy approxmaon based on mode fndng s appled o derve a compac represenaon for he poseror pdf.. Predcon by Unscened Transform Denoe by x =,...,n ) a se of means n R d and by P he correspondng covarance marces a me sep. Le each Gaussan have a wegh κ wh n = κ =, and le he pror densy funcon be gven by px z : ) = n π) d/ P = κ exp / D x,x ) ),P The unscened ransformaon [, 6] s a mehod for calculang he sascs of a random varable whch undergoes a non-lnear ransformaon. X,) X,j) = x = x d + λ)p ) j j =,...,d X,j) = x + d + λ)p ) j d j = d +,...,d W,) = λ/d + λ) W,j) = /d + λ) j =,...,d 6) where λ s a scalng parameer and d + λ)p ) j s he h row or column of he marx square roo of d + λ)p. W,j) s he wegh assocaed wh he j-h sgma pon where d j= W,j) =. These sgma vecors are propagaed hrough he non-lnear funcon, X,j) 5) = gx,j) ) =,...,d 7) and he mean and covarance for x are approxmaed usng a weghed sample mean and covarance of he poseror sgma pons, x = P = d = d = W,j) X,j) W,j) X,j) x )X,j) x ) + Q 8) where Q s he covarance marx for he process nose. For each mode n he pror, UT s appled ndependenly and he densy afer predcon s as follows. px z : ) = n π) d/ = κ P exp / D x, x, P ) ) 9) where κ = κ. Ths non-lnear ransformaon s guaraneed o be accurae up o he second order of he Taylor expanson.
3 .3 Mul-sage Samplng and Inerpolaon of Measuremen Lkelhood In conras o varous parcle flers, we represen he measuremen lkelhood funcon n an analyc form. A connuous approxmaon of he lkelhood funcon s nerpolaed from dscree samples. A mul-sage samplng scheme s nroduced o mprove he approxmaon progressvely. The advanage of he analyc represenaon s ha provdes a global vew of he landscape of he lkelhood funcon and hus enables effcen sample placemen..3. Mul-sage samplng Unlke he SIR algorhm [] whch uses he predced pdf as he proposal dsrbuon, we employ he mul-sage samplng sraegy and progressvely updae he proposal funcon based on he observaon. The predced pdf s used as he nal proposal dsrbuon q. q x ) = px z : ) ) Assume ha n oal, N samples are o be drawn o oban measuremen daa. In our mul-sage samplng scheme, N/m samples are drawn n he frs sage from he nal proposal dsrbuon ), where m s he number of samplng sages. An nal approxmaon of he lkelhood funcon p z x ) s obaned hrough surface nerpolaon wh Gaussan kernels. Deals of he densy nerpolaon algorhm s provded n secon 4. The proposal funcon s hen updaed by a lnear combnaon of he nal proposal dsrbuon and he curren approxmaon of he lkelhood funcon p z x ). We repeaedly approxmae he lkelhood funcon from avalable samples and updae he proposal dsrbuon. p j z x ) = τ τ exp D x,x,r ) ) ) q j x ) = α j )q j x ) + α j p j z x ) pj z x )dx ) where =,..., j m N, j =,...,m, and α j [, ] s adapaon rae. Snce he nformaon of he observaon s ncorporaed no he proposal dsrbuon o gude samplng, he mul-sage samplng sraegy explores he lkelhood surface more effcenly han convenonal parcle flers. Thus, s especally advanageous n dealng wh hgh dmensonal sae space..3. Approxmaon of lkelhood funcon As dscussed prevously, he measuremen lkelhood s esmaed hrough he mul-sage samplng. Wh samples drawn from he mproved proposal dsrbuons, nermedae lkelhood funcons are consruced and used o updae he proposal dsrbuons. Afer m-sep repeon of hs procedure, he fnal measuremen dsrbuon s obaned. Algorhm presens Algorhm Measuremen Sep : S = φ : q x ) = px z : ) 3: for = o m do 4: draw sample s from proposal dsrbuon S = {sj) s j) q x ), j =,..., N/m} 5: S = S S 6: assgn mean and covarance for he elemen n S m ) N m +j = sj) Q ) N m +j = c dagknn k)...knn d k)) I 5) 7: compue lkelhood of each new sample l ) N m +j = hm ) N +j,v ) m 8: compue A and b for every elemen n S 9: w = nnlsa,b) 7) : p z x ) = τ j Nτj,x j,r j ) where τ = w, x = m, and R = Q p : q x ) = α )q x ) + α z x ) j ) p z x )dx : end for 3: pz x ) = p m z x ) he complee procedure o compue he lkelhood funcon, and he fnal measuremen funcon wh m Gaussans a me s gven by pz x ) = π) d/ m = τ R / exp D x,x,r ) ) 3) where τ, x andr are he wegh, mean and covarance marx of he -h kernel..4 Updae Snce boh he predced pdf and he measuremen funcons are represened by Gaussan mxures, he poseror pdf, as he produc of wo Gaussan mxures, can also be represened by a Gaussan mxure. Denoe he Gaussan componens of he predced pdf and he lkelhood funcon by N κ, x, P ) =,...,n ) and Nτ j,xj,rj ) j =,...,m ) respecvely, he produc of he wo dsrbuons s as follows. where n = ) N κ, x, P m ) Nτ j,xj,rj ) = n m = j= j= N κ τj,mj,σj ) 4) m j = Σ j P ) x + Rj ) x j ) 5) Σ j = P ) + R j ) ) 6) The resulng densy funcon n 4) s a weghed Gaussan mxure. However, he exponenal ncrease n he number of
4 componens over me could make he whole procedure nracable. In order o avod hs suaon, a densy approxmaon echnque s proposed o manan a compac ye accurae densy represenaon even afer densy propagaon hrough many me seps. Deals of he densy approxmaon algorhm s gven n secon 3. Afer he updae sep, he fnal poseror dsrbuon s gven by px z : ) = π) d/ n = P κ exp / D x,x,p ) ) where n s he number of componens a me sep. 3 Densy Approxmaon In hs secon, we revew an erave procedure of mode deecon derved from varable-bandwdh mean-shf [7], and densy approxmaon usng he mode deecon echnque [9]. 3. Mode Deecon and Densy Approxmaon 7) Suppose ha Nκ,x,P ) =...n) s a Gaussan kernel wh wegh κ, mean x, and covarance P n he d- dmensonal sae space, where n = κ =. Then, we defne he sample pon densy esmaor compued a pon x by ˆfx) = where π) d/ n = κ exp ) P / D x,x,p ) 8) D x,x,p ) x x ) P x x ). 9) Our purpose s o oban he compac represenaon of he densy funcon whch s a Gaussan mxure. The mode locaon and s wegh are found by mean-shf algorhm, and he covarance marx assocaed wh each mode s compued by usng Hessan marx. To fnd he graden ascen drecon a x, he varablebandwdh mean-shf vecor a x s gven by mx) = n = where he weghs ω x) = ω x)p ) n = ω x)p x ) x ) κ P / exp D x,x,p ) ) n = κ P / exp D x,x,p ) ) ) sasfy n = ω x) =. By compung he mean-shf vecor mx) and ranslang he locaon x by mx) eravely, a local maxmum of underlyng densy funcon s deeced. A formal check for he maxmum nvolves he compuaon of he Hessan marx n κ Ĥx) = π) d/ P = /exp ) D x,x,p ) P x x)x x) ) P P ) whch should be negave defne. If s no negave defne, he convergence pon mgh be a saddle pon or a local mnmum. In hs case, kernels assocaed wh such modes should be resored and consdered as separae modes for furher processng. The approxmae densy s obaned by deecng he mode locaon for every sample pon x and assgnng a sngle Gaussan kernel for each mode. Suppose ha he approxmae densy has n unque modes of x j j =... n ) wh assocaed wegh κ j whch s equal o he sum of he kernel weghs converged o x j. The Hessan marx Ĥj of each mode s used for he compuaon of P j as follows. P j = κ d+ j π Ĥ j ) d+ Ĥ j ) 3) The basc dea of equaon 3) s o f he covarance usng he curvaure n he neghborhood of he mode. The fnal densy approxmaon s hen gven by fx) = π) d/ n = κ P exp / D x, x, P ) ) 4) and n n s sasfed n mos cases. The approxmaon error ˆfx) fx) can be evaluaed sraghforwardly. 3. Performance of Approxmaon The accuracy of he densy approxmaon s demonsraed n Fgure. From a one-dmensonal dsrbuon composed of fve weghed Gaussans, samples are drawn, and he scale parameer s assgned as dscussed n secon 4.. Mean Inegraed Squared Error MISE) beween he orgnal and he approxmaed denses s calculaed for he error esmaon. The resul n fgure shows ha he mode fndng based on mean-shf and he covarance esmaon usng he Hessan s very accurae. Fgure shows he performance of he densy approxmaon whch s accurae enough o replace kernel densy esmaon n he mul-dmensonal case. 4 Densy Inerpolaon The densy approxmaon presened n secon 3 s an algorhm o fnd a compac represenaon when he mean, he covarance and he wegh for each kernel are gven. In he measuremen sep of Bayesan flerng, he lkelhood values are
5 By hs mehod, samples n dense areas have small scales and he densy wll be represened accuraely, bu sparse areas convey only relavely rough nformaon abou he densy funcon a) Fgure : Comparsons beween kernel densy esmaon and densy approxmaon D). For he approxmaon, samples are drawn from he orgnal dsrbuon N.,, ), N.35, 7, 4 ), N.5, 7, 8 ), N., 5, 6 ), and N., 7, 3 ). a) kernel densy esmaon b) densy approxmaon MISE = ).5 x 3.5 x 3 b) 4. Inerpolaon A Gaussan kernel s assgned o each sample for whch mean and covarance corresponds o he sample locaon and he scale s nalzed by he mehod n secon 4., respecvely. When he lkelhood value on each sample s gven, he wegh for each kernel can be compued by he Non-Negave Leas Square NNLS) mehod [4]. Denoe x as he mean locaon and P as he covarance marx for he -h sample =,...,n). Also, suppose ha l s he lkelhood value on he -h sample. The lkelhood a x j nduced by he -h kernel s gven by p x j ) = exp ) π) d/ P / D x j,x,p ). 6) a) b) 4 6 Defne an n n marx A havng an enry p x j ) n, j), and an n vecor b havng l n s -h row. Then, he wegh vecor w can be compued by solvng he followng consraned leas square problem, Fgure : Comparson beween kernel densy esmaon and densy approxmaons D). a) kernel densy esmaon b) densy approxmaon 4 samples, MISE = ) known for a se of samples. In hs case, he lkelhood surface can be nerpolaed from sample lkelhood. In hs secon, we descrbe he densy nerpolae algorhm. 4. Inal Scale Selecon One of he lmaons of kernel-based algorhms s ha hey nvolve he specfcaon of a scale parameer. Varous research has been performed for he scale selecon problem [, 7, 9], bu s very dffcul o fnd he opmal scale n general. Below, we explan a sraegy o deermne he scale parameer for he densy esmaon based on neares neghbors. The basc dea of hs mehod s very smple, and smlar approaches are dscussed n [4, 5]. Each sample s nended o cover he local regon around self n he d-dmensonal sae space wh s scale. For hs purpose, k-neares neghbors KNN) s used, and he kernel bandwdh scale) s deermned by he dsance o he k-h neares neghbor of a sample. Defne KNN jk) j d) o be he dsance o k-h neares neghbor from sample n he j-h dmenson, and hen he covarance marx P for -h sample s gven by P = c dagknn k) KNN k)...knn d k)) I 5) where c s a consan dependen upon he number of samples and he dmensonaly, and I s a d-dmensonal deny marx. mn w Aw b 7) subjec o w for =,...,n, and s denoed by w = nnlsa,b). The sze of marx A s deermned by he number of samples. When he sample sze s large, sparse marx operaon mehods can be used o solve w effcenly. Usually, many of he weghs wll be zero and he fnal densy funcon wll be a mxure of Gaussans wh a small number of componens. The densy nerpolaon smulaes he heavyaled densy funcon more accuraely han he densy approxmaon nroduced n secon 3, whle he densy approxmaon generally produces a more compac represenaon. 4.3 Performance of Inerpolaon Fgure 3 shows one-dmensonal densy nerpolaon resuls. For each case, samples are drawn and he nal scale for each sample s gven as explaned n secon 4.. The esmaed densy funcon approxmaes he orgnal densy very accuraely as seen n fgure 3. Two dfferen Gaussan mxures N.,, ) N.35, 7, 4 ) N.5, 7, 8 ) N., 5, 6 ) N., 7, 3 ) n example, and N.5,, 5 ) N., 5, 4 ) N.35, 6, 8 ) N.5, 75, 6 ) N.5, 9, 3 ) n example are esed for he nerpolaon. When 5 ndependen realzaons are performed, MISE and s varance are very small for boh examples as shown n able.
6 . orgnal densy. densy nerpolaon.9.9 x 3 x orgnal densy.3.. a) example densy nerpolaon 6 4 a) 4 6 Fgure 4: Comparson beween orgnal densy funcon and densy nerpolaon D). a) orgnal densy funcon b) densy nerpolaon wh 3 non-zero wegh componens 6 4 b) The frs process model s gven by he followng equaon, b) example Fgure 3: Two examples of orgnal densy funcons and her nerpolaons. In he nerpolaon graphs rgh), black sars represen he sample locaons samples). In case a) and b), and 4 componens have non-zero weghs, respecvely. x = x 5x + + x T x + 8 cos. )) + u 8) where s he vecor whose elemens are all ones. The process nose u s drawn from a Gaussan dsrbuon N,, I) ) where I s he deny marx. The measuremen model s gven by a non-lnear funcon Table : Error of densy nerpolaon MISE VAR example example Also, a mul-dmensonal densy funcon s nerpolaed n he same manner, and s performance s dscussed nex. In fgure 4, he densy nerpolaon produces a very accurae and sable resul when samples are drawn from he orgnal densy funcon MISE = , VAR = on average over 5 runs). These resuls show ha surface nerpolaon s a suffcenly accurae mehod o approxmae densy funcon gven samples and her correspondng lkelhood. 5 Smulaon In hs secon, synhec rackng examples are smulaed, and he performance of he kernel-based Bayesan flerng s compared wh he SIR algorhm []. Two dfferen process models one lnear and he oher non-lnear are seleced, and smulaons are performed for varous dmensons such as D, 3D, 5D, D, D and 5D. The accumulaed Mean Squared Error MSE) hrough 5 me seps s calculaed n each run, and 5 dencal expermens are made based on he same daa for accurae error esmaon. z = xt x + v 9) where v s drawn from a Gaussan dsrbuon N,,I ). For he esmaon of he measuremen funcon, ffy parcles parcles 5 sages) are drawn, and he poseror s esmaed and propagaed hrough he me sep 5). Fgure 5 demonsraes smulaon resuls by comparng MSE s and varances of boh algorhms. Accordng o our expermen wh he frs model, he SIR fler shows beer or equvalen performance n low dmensons such as D and 3D, bu our mehod sars o ouperform n hgh dmensons more han 5D. MSE dmenson a) Error varance dmenson b) Varance Fgure 5: MSE and varance of for MSE. Kernel-based Bayesan flerng wh 5 parcles blue sar), SIR wh 5 parcles red crcle), and SIR fler wh 5 parcles black square) for model. The second process model s very smple lnear model gven by x = x + cos )) + u 3)
7 where u N,, I) ). The same observaon model as equaon 9) s employed, and ffy samples are drawn for every smulaon. Kernel-based Bayesan flerng yelds smaller error n he hgh dmenson as n prevous case, and he dealed resuls are presened n fgure 6. MSE varance by he nverse exponenaon of he Bhaacharyya dsance beween he arge and he canddae hsograms as suggesed n [8]. Based on he lkelhood of each parcle and he nal covarance marx derved by he mehod n secon 4., he measuremen densy s consruced by densy nerpolaon. Two sequences are esed n our expermen. In he frs sequence, wo objecs a hand carryng a can are racked wh samples 4 samples 5 sages). The sae space s descrbed by a dmensonal vecor, whch s he concaenaon of wo 5 dmensonal vecors represenng wo ndependen ellpses as follows..5.5 x, y, lx, ly, r, x, y, lx, ly, r ) 3) dmenson a) Error dmenson b) Varance Fgure 6: MSE and varance of for MSE kernel-based Bayesan flerng wh 5 samples blue sar), SIR fler wh 5 parcles red crcle), and SIR fler wh 5 parcles black square) for model. Two dfferen process models produce almos smlar resuls, and kernel-based Bayesan flerng shows beer performance n hgh dmensonal cases as expeced. In order o demonsrae he benef of kernel-based parcles, we run he SIR algorhm wh 5 samples, and compare he performance wh our kernel-based Bayesan flerng wh 5 samples. Surprsngly, he MSE s of he wo cases are almos he same, and our algorhm has smaller varance of MSE han he SIR algorhm. Ths resul suggess ha kernel-based Bayesan flerng can be appled effecvely o hgh dmensonal applcaons, especally, when many samples are no avalable and he observaon process s very me-consumng. 6 Objec Trackng Parcle flerng provdes a convenen mehod for esmang and propagang he densy of sae varables regardless of he underlyng dsrbuon and he gven sysem n he Bayesan framework. Addonally, our kernel-based Bayesan flerng has an advanage of managng mul-modal densy funcons wh a relavely small number of samples. In hs secon, we demonsrae he performance of he kernel-based Bayesan flerng by rackng objecs n real vdeos. The overall rackng procedure s equvalen o wha s descrbed n secon 5, and we explan he process and he measuremen models brefly. A random walk s assumed for he process model snce s very dffcul o descrbe he accurae moon before he observaon, even hough our algorhm can accommodae he general non-lnear funcon by unscened ransformaon descrbed n secon.. 5-sage samplng s ncorporaed as nroduced n secon.3, and he lkelhood of each parcle s compued where x and y =, ) are he locaon of ellpses, lx s he lengh of x-axs, ly s he lengh of y-axs, and r s he roaon varable. The rackng resul s shown n fgure 7, and our algorhm successfully racks wo objecs for he whole sequence excep he perod ha he sde of he can s compleely occluded around 47h frame. a) = 43 b) = 34 c) = 387 d) = 456 e) = 57 c) = 898 Fgure 7: Objec rackng resul of can sequence. The upper bodes of wo persons are racked n he second sequence, n whch one occludes he oher compleely several mes. The sae vecor s consruced by he same mehod as n he can sequence, bu wo recangles are used nsead of ellpses. A 6 dmensonal vecor x, y, scale) for each recangle s used o descrbe he sae, and samples samples 5 sages) are used. Fgure 8 a) demonsraes he rackng resuls, and our algorhm shows good performance n spe of severe occlusons. The racker based on SIR algorhm s also mplemened, and compared wh our algorhm. As seen n fgure 8 b), he SIR algorhm shows unsable performance for he same sequence. Accordng o expermens, one would need o run he SIR algorhm usng abou 4 parcles o oban a comparable resul wh our algorhm usng samples.
8 a) resul by our mehod a) resul by he SIR algorhm Fgure 8: Objec rackng resul of person sequence a =, 95, 33, 93, 7, 3. 7 Dscusson and Concluson In hs paper, we proposed a new Bayesan flerng framework where analyc represenaons are used o approxmae relevan densy funcons. Densy approxmaon and nerpolaon echnque are nroduced n densy propagaon. Varous smulaons and ess on objec rackng n real vdeos show he effecveness of our densy approxmaon mehods and he kernel-based Bayesan flerng. By mananng analyc represenaons of he densy funcons, we can sample n he sae space more effecvely and more effcenly. Ths advanage s sgnfcan for hgh dmensonal problems. In addon, he approxmaon error can be monored and analyzed. Our fuure work s focused on analyzng he approxmaon error n he poseror dsrbuon and s propagaon over me. Acknowledgmen The suppor by Semens Corporae Research and VACE projec DOD4H84) s graefully acknowledged. References [] I. Abramson, On bandwdh varaon n kernel esmaes - a square roo law, The Annals of Sascs, vol., no. 4, pp. 7 3, 98. [] S. Arulampalam, S. Maskell, N. Gordon, and T. Clapp, A uoral on parcle flers for on-lne non-lnear/non-gaussan Bayesan rackng, IEEE Trans. Sgnal Process., vol. 5, no., pp ,. [3] T. Cham and J. Rehg, A mulple hypohess approach o fgure rackng, n Proc. IEEE Conf. on Compuer Vson and Paern Recognon, For Collns, CO, volume II, 999, pp [4] W. Cleveland, Robus locally weghed regresson and smoohng scaerplos, J. Amer. Sas. Assn., vol. 74, pp , 979. [5] W. Cleveland and C. Loader, Smoohng by local regresson: Prncples and mehods, Sascal Theory and Compuaonal Aspecs of Smoohng, pp. 49, 996. [6] D. Comancu and P. Meer, Mean shf: A robus approach oward feaure space analyss, IEEE Trans. Paern Anal. Machne Inell., vol. 4, no. 5, pp ,. [7] D. Comancu, V. Ramesh, and P. Meer, The varable bandwdh mean shf and daa-drven scale selecon, n Proc. 8h Inl. Conf. on Compuer Vson, Vancouver, Canada, volume I, July, pp [8] A. Elgammal, R. Duraswam, D. Harwood, and L. Davs, Background and foreground modelng usng nonparamerc kernel densy esmaon for vsual survellance, Proceedngs of IEEE, vol. 9, pp. 5 63,. [9] B. Han, D. Comancu, Y. Zhu, and L. Davs, Incremenal densy approxmaon and kernel-based bayesan flerng for objec rackng, n Proc. IEEE Conf. on Compuer Vson and Paern Recognon, Washngon DC, 4, pp [] M. Isard and A. Blake, Condensaon - Condonal densy propagaon for vsual rackng, Inl. J. of Compuer Vson, vol. 9, no., 998. [] A. Jepson, D. Flee, and T. El-Maragh, Robus onlne appearance models for vsual rackng, n Proc. IEEE Conf. on Compuer Vson and Paern Recognon, Hawa, volume I,, pp [] S. Juler and J. Uhlmann, A new exenson of he Kalman fler o nonlnear sysems, n Proceedngs SPIE, volume 368, 997, pp [3] J. Koecha and P. Djurc, Gaussan sum parcle flerng, IEEE Trans. Sgnal Process., vol. 5, no., pp. 6 6, 3. [4] C. L. Lauwon and B. J. Hanson, Solvng Leas Squares Problems. Prence-Hall, 974. [5] S. McKenna, Y. Raja, and S. Gong, Trackng colour objecs usng adapve mxure models, Image and Vson Compung Journal, vol. 7, pp. 3 9, 999. [6] R. Merwe, A. Douce, N. Freas, and E. Wan, The unscened parcle fler, Techncal Repor CUED/F-INFENG/TR 38, Cambrdge Unversy Engneerng Deparmen,. [7] B. Park and J. Marron, Comparson of daa-drven bandwdh selecors, J. of Amer. Sa. Assoc., vol. 85, pp. 66 7, 99. [8] P. Perez, C. Hue, J. Vermaak, and M. Gangne, Color-based probablsc rackng, n Proc. European Conf. on Compuer Vson, Copenhagen, Denmark, volume I,, pp [9] S. Sheaher and M. Jones, A relable daa-based bandwdh selecon mehod for kernel densy esmaon, J. Royal Sas. Soc. B, vol. 53, pp , 99. [] C. Sauffer and W. Grmson, Learnng paerns of acvy usng real-me rackng, IEEE Trans. Paern Anal. Machne Inell., vol., no. 8, pp ,.
Fall 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 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 informationdoi: info:doi/ /
do: nfo:do/0.063/.322393 nernaonal Conference on Power Conrol and Opmzaon, Bal, ndonesa, -3, June 2009 A COLOR FEATURES-BASED METHOD FOR OBJECT TRACKNG EMPLOYNG A PARTCLE FLTER ALGORTHM Bud Sugand, Hyoungseop
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 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 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 informationComputer Robot Vision Conference 2010
School of Compuer Scence McGll Unversy Compuer Robo Vson Conference 2010 Ioanns Rekles Fundamenal Problems In Robocs How o Go From A o B? (Pah Plannng) Wha does he world looks lke? (mappng) sense from
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 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 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 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 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 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 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 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 informationOn computing differential transform of nonlinear non-autonomous functions and its applications
On compung dfferenal ransform of nonlnear non-auonomous funcons and s applcaons Essam. R. El-Zahar, and Abdelhalm Ebad Deparmen of Mahemacs, Faculy of Scences and Humanes, Prnce Saam Bn Abdulazz Unversy,
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 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 informationSingle and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation
Sngle and Mulple Objec Trackng Usng a Mul-Feaure Jon Sparse Represenaon Wemng Hu, We L, and Xaoqn Zhang (Naonal Laboraory of Paern Recognon, Insue of Auomaon, Chnese Academy of Scences, Bejng 100190) {wmhu,
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 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 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 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 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 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 informationNew M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)
Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor
More informationEffect of Resampling Steepness on Particle Filtering Performance in Visual Tracking
102 The Inernaonal Arab Journal of Informaon Technology, Vol. 10, No. 1, January 2013 Effec of Resamplng Seepness on Parcle Flerng Performance n Vsual Trackng Zahdul Islam, Ch-Mn Oh, and Chl-Woo Lee School
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 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 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 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 informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
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 informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
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 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 informationObject Tracking Based on Visual Attention Model and Particle Filter
Inernaonal Journal of Informaon Technology Vol. No. 9 25 Objec Trackng Based on Vsual Aenon Model and Parcle Fler Long-Fe Zhang, Yuan-Da Cao 2, Mng-Je Zhang 3, Y-Zhuo Wang 4 School of Compuer Scence and
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 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 informationCamShift Guided Particle Filter for Visual Tracking
CamShf Guded Parcle Fler for Vsual Trackng Zhaowen Wang, Xaokang Yang, Y Xu and Songyu Yu Insue of Image Communcaon and Informaon Processng Shangha Jao Tong Unversy, Shangha, PRC 200240 E-mal: {whereaswll,xkyang,
More informationNormal Random Variable and its discriminant functions
Noral Rando Varable and s dscrnan funcons Oulne Noral Rando Varable Properes Dscrnan funcons Why Noral Rando Varables? Analycally racable Works well when observaon coes for a corruped snle prooype 3 The
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 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 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 informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
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 informationPARTICLE FILTER BASED VEHICLE TRACKING APPROACH WITH IMPROVED RESAMPLING STAGE
ISS: 0976-910(OLIE) ICTACT JOURAL O IMAGE AD VIDEO PROCESSIG, FEBRUARY 014, VOLUME: 04, ISSUE: 03 PARTICLE FILTER BASED VEHICLE TRACKIG APPROACH WITH IMPROVED RESAMPLIG STAGE We Leong Khong 1, We Yeang
More informationBoosted LMS-based Piecewise Linear Adaptive Filters
016 4h European Sgnal Processng Conference EUSIPCO) Boosed LMS-based Pecewse Lnear Adapve Flers Darush Kar and Iman Marvan Deparmen of Elecrcal and Elecroncs Engneerng Blken Unversy, Ankara, Turkey {kar,
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
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 Bayesian algorithm for tracking multiple moving objects in outdoor surveillance video
A Bayesan algorhm for racng mulple movng obecs n oudoor survellance vdeo Manunah Narayana Unversy of Kansas Lawrence, Kansas manu@u.edu Absrac Relable racng of mulple movng obecs n vdes an neresng challenge,
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 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 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 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 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 informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationFitting a Conditional Linear Gaussian Distribution
Fng a Condonal Lnear Gaussan Dsrbuon Kevn P. Murphy 28 Ocober 1998 Revsed 29 January 2003 1 Inroducon We consder he problem of fndng he maxmum lkelhood ML esmaes of he parameers of a condonal Gaussan varable
More informationApproximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy
Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae
More informationFace Detection: The Problem
Face Deecon and Head Trackng Yng Wu yngwu@ece.norhwesern.edu Elecrcal Engneerng & Comuer Scence Norhwesern Unversy, Evanson, IL h://www.ece.norhwesern.edu/~yngwu Face Deecon: The Problem The Goal: Idenfy
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
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 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 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 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 informationA HIERARCHICAL KALMAN FILTER
A HIERARCHICAL KALMAN FILER Greg aylor aylor Fry Consulng Acuares Level 8, 3 Clarence Sree Sydney NSW Ausrala Professoral Assocae, Cenre for Acuaral Sudes Faculy of Economcs and Commerce Unversy of Melbourne
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 informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu
More informationPSO Algorithm Particle Filters for Improving the Performance of Lane Detection and Tracking Systems in Difficult Roads
Sensors 2012, 12, 17168-17185; do:10.3390/s121217168 Arcle OPEN ACCESS sensors ISSN 1424-8220 www.mdp.com/journal/sensors PSO Algorhm Parcle Flers for Improvng he Performance of Lane Deecon and Trackng
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as
More informationEnhancement of Particle Filter Resampling in Vehicle Tracking via Genetic Algorithm
01 UKSm-AMSS 6h European Modellng Symposum Enhancemen of Parcle Fler Resamplng n Vehcle Trackng va Genec Algorhm We Leong Khong, We Yeang Ko, Y Kong Chn, Me Yeen Choong, Kenneh Tze Kn Teo Modellng, Smulaon
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 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 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 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 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 informationA Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information
A Novel Objec Deecon Mehod Usng Gaussan Mxure Codebook Model of RGB-D Informaon Lujang LIU 1, Gaopeng ZHAO *,1, Yumng BO 1 1 School of Auomaon, Nanjng Unversy of Scence and Technology, Nanjng, Jangsu 10094,
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 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 informationF-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction
ECOOMICS 35* -- OTE 9 ECO 35* -- OTE 9 F-Tess and Analyss of Varance (AOVA n he Smple Lnear Regresson Model Inroducon The smple lnear regresson model s gven by he followng populaon regresson equaon, or
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 informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
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 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 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 informationDetection of Waving Hands from Images Using Time Series of Intensity Values
Deecon of Wavng Hands from Images Usng Tme eres of Inensy Values Koa IRIE, Kazunor UMEDA Chuo Unversy, Tokyo, Japan re@sensor.mech.chuo-u.ac.jp, umeda@mech.chuo-u.ac.jp Absrac Ths paper proposes a mehod
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 informationAlgorithm Research on Moving Object Detection of Surveillance Video Sequence *
Opcs and Phooncs Journal 03 3 308-3 do:0.436/opj.03.3b07 Publshed Onlne June 03 (hp://www.scrp.org/journal/opj) Algorhm Research on Movng Objec Deecon of Survellance Vdeo Sequence * Kuhe Yang Zhmng Ca
More information. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.
Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons
More informationSurvival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System
Communcaons n Sascs Theory and Mehods, 34: 475 484, 2005 Copyrgh Taylor & Francs, Inc. ISSN: 0361-0926 prn/1532-415x onlne DOI: 10.1081/STA-200047430 Survval Analyss and Relably A Noe on he Mean Resdual
More informationUse of Kalman Filtering and Particle Filtering in a Benzene Leachate Transport Model
Sudy of Cvl Engneerng and Archecure (SCEA Volume Issue 3, Sepember 03 www.sepub.org/scea Use of Kalman Flerng and Parcle Flerng n a Benzene Leachae Transpor Model Shoou-Yuh Chang, and Skdar Laf * Dep.
More informationMoving Least Square Method for Reliability-Based Design Optimization
Movng Leas Square Mehod for Relably-Based Desgn Opmzaon K.K. Cho, Byeng D. Youn, and Ren-Jye Yang* Cener for Compuer-Aded Desgn and Deparmen of Mechancal Engneerng, he Unversy of Iowa Iowa Cy, IA 52242
More informationABSTRACT KEYWORDS. Bonus-malus systems, frequency component, severity component. 1. INTRODUCTION
EERAIED BU-MAU YTEM ITH A FREQUECY AD A EVERITY CMET A IDIVIDUA BAI I AUTMBIE IURACE* BY RAHIM MAHMUDVAD AD HEI HAAI ABTRACT Frangos and Vronos (2001) proposed an opmal bonus-malus sysems wh a frequency
More informationCH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC
CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal
More information