Factored Conditional Restricted Boltzmann Machines for Modeling Motion Style

Size: px
Start display at page:

Download "Factored Conditional Restricted Boltzmann Machines for Modeling Motion Style"

Transcription

1 Factored Condtona Restrcted Botzmann Machnes for Modeng Moton Stye Graham W. Tayor Geoffrey E. Hnton Department of Computer Scence, Unversty of Toronto, Toronto, Ontaro M5S 2G4, Canada Abstract The Condtona Restrcted Botzmann Machne (CRBM) s a recenty proposed mode for tme seres that has a rch, dstrbuted hdden state and permts smpe, exact nference. We present a new mode, based on the CRBM that preserves ts most mportant computatona propertes and ncudes mutpcatve three-way nteractons that aow the effectve nteracton weght between two unts to be moduated by the dynamc state of a thrd unt. We factorze the threeway weght tensor mped by the mutpcatve mode, reducng the number of parameters from O(N 3 ) to O(N 2 ). The resut s an effcent, compact mode whose effectveness we demonstrate by modeng human moton. Le the CRBM, our mode can capture dverse styes of moton wth a snge set of parameters, and the three-way nteractons greaty mprove the mode s abty to bend moton styes or to transton smoothy between them. 1. Introducton Drected graphca modes (or Bayes nets) have been a domnant paradgm n modes of statc data. Ther tempora counterparts, Dynamc Bayes nets, generaze many exstng modes such as the Hdden Marov Mode (HMM) and ts varous extensons. In a but the smpest drected modes, nference s made dffcut due to a phenomenon nown as expanng away where observng a chd node renders ts parents dependent. An aternatve to approxmate nference n drected modes s to use a speca type of undrected mode, the Restrcted Botzmann Machne (RBM) (Smoensy, 1987), that aows effcent, exact nference. The Restrcted Botzmann Machne has an effcent, ap- Appearng n Proceedngs of the 26 th Internatona Conference on Machne Learnng, Montrea, Canada, Copyrght 2009 by the author(s)/owner(s). proxmate earnng agorthm caed contrastve dvergence (CD) (Hnton, 2002). RBMs have been used n a varety of appcatons (Hnton & Saahutdnov, 2006; Saahutdnov et a., 2007) and ther propertes have become better understood over the ast few years (Weng et a., 2005; Carrera-Perpnan & Hnton, 2005; Saahutdnov & Murray, 2008). The CD earnng procedure has aso been mproved (Teeman, 2008). A maor motvaton for the use of RBMs s that they can be used as the budng bocs of deep beef networs (DBN), whch are earned effcenty by tranng greedy, ayer-byayer. DBNs have been shown to earn very good generatve modes of handwrtten dgts (Hnton et a., 2006), but they fa to mode patches of natura mages. Ths s because RBMs have dffcuty n capturng the smoothness constrant n natura mages: a snge pxe can usuay be predcted very accuratey by smpy nterpoatng ts neghbours. Osndero and Hnton (2008) ntroduced the Semrestrcted Botzmann Machne (SRBM) to address ths concern. The constrants on the connectvty of the RBM are reaxed to aow atera connectons between the vsbe unts n order to mode the par-wse correatons between nputs, thus aowng the hdden unts to focus on modeng hgher-order structure. SRBMs aso permt deep networs. Each tme a new eve s added, the prevous top ayer of unts s gven atera conectons, so, after the ayerby-ayer earnng s compete, a ayers except the topmost contan atera connectons between unts. SRBMs mae t possbe to earn deep beef nets that mode mage patches much better, but they st have strong mtatons that can be seen by consderng the overa generatve mode. The equbrum sampe generated at each ayer nfuences the ayer beow by controng ts effectve bases. The mode woud be much more powerfu f the equbrum sampe at the hgher eve coud contro the atera nteractons at the ayer beow usng a three-way, mutpcatve reatonshp. Memsevc and Hnton (2007) ntroduced a more powerfu mode, the gated CRBM, whch permtted such mutpcatve nteractons and was abe to earn rch, dstrbuted representatons of mage transformatons.

2 Factored Condtona Restrcted Botzmann Machnes In ths paper, we expore the dea of mutpcatve nteractons n a dfferent type of CRBM (Tayor et a., 2007). Instead of gatng atera nteractons wth hdden unts, we aow a set of context varabes to gate the three types of connectons ( sub-modes ) n the CRBM shown n Fg. 1. Our modfcaton of the CRBM archtecture does not change the desrabe propertes reated to nference and earnng but maes the mode context-senstve. Whe our mode s appcabe to genera tme seres where condtona data s avaabe (e.g. seasona varabes for modeng ranfa occurrences, economc ndcators for modeng fnanca nstruments) we appy our wor to capturng aspects of stye n data captured from human moton (mocap). Tayor et a. (2007) showed that a CRBM coud capture many dfferent styes wth a snge set of parameters. Generaton of dfferent styes was purey based on ntazaton, and the mode archtecture dd not aow contro of transtons between styes nor dd t permt stye bendng. By usng stye varabes to gate the connectons of a CRBM, we obtan a much more powerfu generatve mode that permts controed transtonng and bendng. We demonstrate that n a condtona mode, gatng s superor to smpy usng abes to bas the hdden unts, whch s the technque most commony apped to statc modes. Ths paper s aso part of a arge body of wor reated to the separaton of stye and content n moton. The abty to separatey specfy the stye (e.g. sad) and the content (e.g. wa to ocaton A) s hghy desrabe for anmators. Prevous wor has ooed at appyng user-specfed stye to an exstng moton sequence (Hsu et a., 2005; Torresan et a., 2007). The drawbac to these approaches s that the user must provde the content. We propose a generatve mode for content that adapts to stystc contros. Recenty, modes based on the Gaussan Process Latent Varabe Mode (Lawrence, 2004) have been successfuy apped to separate content and stye n human moton (Wang et a., 2007). The advantage of our approach over such methods s that our mode does not need to retan the tranng dataset (ust a few frames for ntazaton) and s thus sutabe for ow-memory devces. Furthermore, tranng s near n the number of frames, and so our mode can scae up to massve datasets, une the erne-based methods whch are cubc n the number of frames. The rch, dstrbuted hdden state of our mode means that t does not suffer from the from the mted representatona power of HMM-based methods (e.g. Brand & Hertzmann, 2000). 2. Bacground 2.1. Condtona RBMs The CRBM (Fg. 1) s a non-near generatve mode for tme seres data that uses an undrected mode wth bnary Hdden ayer Vsbe ayer t-2 t-1 t Fgure 1. Archtecture of the CRBM atent varabes, h, connected to a coecton of vsbe varabes, v. The vsbe varabes can use any dstrbuton n the exponenta famy (Weng et a., 2005), but for mocap data, we use rea-vaued Gaussan unts (Freund & Hausser, 1992). At each tme step t, v and h receve drected connectons from the vsbe varabes at the ast N tmesteps. To smpfy the presentaton, we w assume the data at t 1,..., t N s concatenated nto a hstory vector whch we ca v <t. We w use to ndex the eements of v <t. The mode defnes a ont probabty dstrbuton over v t and h t, condtona on v <t and mode parameters, θ: E = p(v t, h t v <t, θ) = exp ( E (v t, h t v <t, θ)) /Z (â,t v,t ) 2 2σ 2 ˆb,t h,t W v,t σ h,t (1) where Z s a constant caed the partton functon whch s exponentay expensve to compute exacty. The dynamc bases, â,t = a + A v,<t and ˆb,t = b + B v,<t, express the net nput from the past to the vsbe and hdden unts, respectvey. As s commony done, we set σ = 1. Such an archtecture maes on-ne nference effcent and aows us to tran by mnmzng contrastve dvergence (for detas, see Hnton, 2002). Tayor et a. (2007) apped the CRBM to synthesze nove moton and perform on-ne fng n of data ost durng moton capture. An mportant feature of the CRBM s that once t s traned, we can add ayers e n a Deep Beef Networ (Hnton et a., 2006). The prevous ayer CRBM s ept, and the sequence of hdden state vectors, whe drven by the data, s treated as a new nd of fuy observed data. The next

3 Factored Condtona Restrcted Botzmann Machnes eve CRBM has the same archtecture as the frst (though t has bnary vsbe unts and we can change the number of hdden unts) and s traned n the exact same way. Upper eves of the networ can then mode more nterestng hgher-order structure. More ayers ad n capturng mutpe styes of moton, and permttng transtons between these styes (see Sec. 4) Gated Condtona Restrcted Botzmann Machnes Memsevc and Hnton (2007) ntroduced a way of mpementng mutpcatve nteractons n a condtona mode. The gated CRBM was deveoped n the context of earnng transformatons between mage pars. The dea s to mode an observaton (the output) gven ts prevous nstance (the nput) (e.g. neghbourng frames of vdeo). The gated CRBM has two equvaent vews: frst, as gated regresson (Fg. 2a), where hdden unts can bend sces of a transformaton matrx nto a near regresson, and second as moduated fters (Fg. 2b) where nput unts gate a set of bass functons used to reconstruct the output. In the atter vew, each settng of the nput unts defnes an RBM (whch means that condtona on the nput, nference and earnng n a gated CRBM are tractabe). For ease of presentaton, (a) (b) Fgure 2. Two vews of the Gated Botzmann Machne. Reproduced from (Memsevc & Hnton, 2007). et us consder the case where a nput, output, and hdden varabes are bnary (the extenson to rea-vaued nput and output varabes s straghtforward). As n Eq. 1, the gated CRBM descrbes a ont probabty dstrbuton through exponentatng and renormazng an energy functon. Ths energy functon captures a possbe correatons between the components of the nput, x, the output, v, and the hdden varabes, h: E (v, h x, θ) = W v h x a v c v h b h (2) where a, b ndex the standard bases and c ndex the gated bases, whch shft a unt condtonay. The parameters W are the components of a three-way weght tensor. The CD weght updates for earnng a gated CRBM are smar to a standard RBM Factorng To mode tme seres, we can consder the output of a gated CRBM to be the current frame of data, v = v t, and the nput to be the prevous frame (or frames), x = v <t. Ths means that the gated CRBM s a nd of autoregressve mode where a transformaton s composed from a set of smper transformatons. The number of possbe compostons s exponenta n the number of hdden unts, but the componenta nature of the hdden unts prevents the number of parameters n the mode from becomng exponenta, as t woud n a mxture mode. Because of the three-way weght tensor, the number of parameters s cubc (assumng that the numbers of nput, output and hdden unts are comparabe). In many appcatons, ncudng mocap, strong underyng reguartes n the data suggest that structure can be captured usng three-way, mutpcatve nteractons but wth ess than the cubcay many parameters mped by the weght tensor. Ths motvates us to factorze the nteracton tensor nto a product of parwse nteractons. If we appy the factorzaton to Eq. 2, the frst term becomes f W f v W f h W f x v h x, where f ndexes a set of determnstc factors. Superscrpts dfferentate the three types of parwse nteractons: Wf v connect output unts to factors (undrected), Wf h connect hdden unts to factors (undrected), and Wf x connect nput unts to factors (drected). If the number of factors s comparabe to the number of other unts, ths reduces the number of parameters from O(N 3 ) to O(N 2 ). Athough factorng has been motvated by the ntroducton of mutpcatve nteractons, modes that ony nvove parwse nteracton can aso be factored. 3. A Stye-Gated, Factored Mode We now consder modeng mutpe styes of human moton usng factored, mutpcatve, three-way nteractons. Hnton et a. (2006) showed that a good generatve mode of handwrtten dgts coud be but by connectng a seres of softmax abe unts to the topmost hdden ayer of a DBN (Fg. 3a). Campng a abe changed the energy andscape of the autoassocatve mode formed by the top two ayers, such that performng aternatng Gbbs sampng woud produce a ont sampe compatbe wth a partcuar dgt cass. It s easy to extend ths modfcaton to the CRBM, where dscrete stye abes bas the hdden unts. In a CRBM, however, the hdden unts aso condton on

4 Factored Condtona Restrcted Botzmann Machnes nformaton from the past that s much stronger than the nformaton comng from the abe (Fg. 3b). The mode has earned to respect consstency of styes between frames and so w resst a transton ntroduced by changng the abe unts. (a) (b) Fgure 4. A factored CRBM whose nteractons are gated by reavaued stystc features. Fgure 3. a) In a deep beef networ, campng the abe unts changes the energy functon. b) In a condtona mode, abe nformaton s swamped by the sgna comng from the past. As n the gated CRBM, we are motvated to et stye change the nteractons of the unts as opposed to smpy ther effectve bases. Memsevc (2008) used factored three-way nteractons to aow the hdden unts of a gated CRBM to contro the effect of one vdeo frame on the subsequent vdeo frame. Fgure 4 shows a dfferent way of usng factored three-way nteractons to aow rea-vaued stye features, derved from dscrete stye abes, to contro three dfferent sets of parwse nteractons. Le the standard CRBM (Eq. 1), the mode defnes a ont probabty dstrbuton over v t and h t, condtona on the past N observatons, v <t, and mode parameters, θ. However, the dstrbuton s aso condtona on the stye abes, y t. Smar to our dscusson of the CRBM, we assume bnary stochastc hdden unts and rea-vaued vsbe unts wth addtve, Gaussan nose. For notatona ease, we assume σ = 1. The energy functon s: E (v t, h t v <t, y t, θ) = 1 (â,t v,t ) 2 2 Wf v Wf h Wf z v,t h,t z,t ˆb,t h,t. (3) f The three terms n Eq. 3 correspond to the three sub-modes (cooured bue, red, and green, respectvey n Fg. 4). For each sub-mode, what was a matrx of weghts s now repaced by three sets of weghts connectng unts to factors. The types of weghts are dfferentated agan by superscrpts. For exampe, the matrx of undrected weghts n the standard CRBM, W, has been repaced by three matrces nvoved n a factorzed, mutpcatve nteracton: Wf v, W f h, and W f z. The same process s apped to the other two sub-modes. Note that the three sub-modes may have a dfferent number of factors (whch we ndex by f, m, and n). The dynamc bases become: â,t = a + A v m A v<t m v,<t A z mz,t, (4) m ˆb,t = b + Bn h B v<t n v,<t Bnz z,t (5) n where the dynamc component of Eq. 4 and Eq. 5 s smpy the tota nput to the vsbe/hdden unt va the factors. The tota nput s a three-way product between the nput to the factors (comng from the past and from the stye features) and the weght from the factors to the vsbe/hdden unt. The dynamc bases ncude a statc component, a and b. As n the gated CRBM, we coud aso add three types of gated bases, correspondng to the parwse nteractons n each of the sub-modes. In our experments, we have not used any gated bases. The determnstc features, z t, are a near functon of the

5 Factored Condtona Restrcted Botzmann Machnes one-hot encoded stye abes, y t : z,t = p R p y p,t. (6) As wth other modes based on RBMs, the exstence of the partton functon means that maxmum ehood earnng s ntractabe. Nonetheess, t s easy to compute a good approxmaton to the gradent of an aternatve obectve functon caed the contrastve dvergence, whch eads to a set of very smpe gradent update rues. The updates for a W, A, and B parameters tae the form: X qr ) ( α q,t β r,t γ r,t 0 α q,t β r,t γ r,t K (7) t where α q,t ; q,,, s the unt connected to factor r; r f, m, n by weght X qr. Terms β r,t and γ r,t correspond to the tota nput that arrves at factor r from the two other types of unts nvoved n the three-way reatonshp. 0 s an expectaton wth respect to the data dstrbuton, and K s an expectaton wth respect to the ont dstrbuton obtaned from startng wth a tranng vector camped to the vsbes and performng K steps of aternatng Gbbs sampng (.e. CD-K). Consder two concrete exampes: W v f t v,t Wf h h,t v,t Wf h h,t W z W z f z,t 0 f z,t K, (8) A z m ( z,t A v mv,t A v<t m v,<t 0 t ) z,t A v mv,t A v<t m v,<t K. (9) The weghts connectng abes to features, R, can smpy be earned by bacpropagatng the gradents obtaned by CD. Snce these weghts affect a three sub-modes, ther updates are more compcated. Appyng the chan rue: R p ) ( C t y p,t 0 C t y p,t K, t C t = f + m + n W z f A z m B z n Wf v v,t Wf h h,t A v mv,t A v<t m v,<t Bnh h,t B v<t n v,<t. (10) The updates for the hdden and vsbe bases are the same as n the standard CRBM (Tayor et a., 2007) Parameter sharng In addton to the massve reducton n the number of free parameters obtaned by factorzng, further savngs may be obtaned by tyng some sets of parameters together. In the fuy parameterzed mode (Fg. 5a), there are 9 dfferent sets (matrces) of weghts but f we restrct the number of factors to be the same for each of the three sub-modes, four sets of parameters are dentca n dmenson: the weghts that orgnate from the nputs (past vsbe unts), the outputs (vsbe unts), the hdden unts and the features. Any combnaton of the compatbe parameters may be ted. Fg. 5b shows a fuy-shared parameterzaton. Ths has sghty ess than haf the number of parameters of the fuy parameterzed mode, assumng that the number of nput, output, hdden, and feature unts are comparabe. (a) Fgure 5. a) Fuy parameterzed mode wth each dot representng a dfferent set of parameters and dfferent coors denotng a dfferent number of factors n each sub-mode. b) Fu parameter sharng. In comparng dfferent reduced parameterzatons, tyng ony the feature-factor parameters, Wf z, Az m, and Bz n ed to modes that syntheszed the hghest quaty moton. When sharng the autoregressve weghts, A v<t m and Av m, wth non-autoregressve weghts, B v<t m and W f v, respectvey, we found that the component of the gradent reated to the autoregressve mode tended to domnate the weght update eary n earnng. Ths was due to the strength of the correaton between past and present compared to hdden and present or hdden and past. Wthodng the autoregressve component of the gradent for the frst 100 epochs, unt the hdden unts were abe to extract nterestng structure from the data, soved ths probem. In our reported experments we traned modes wth ony the feature-factor parameters ted. 4. Experments Sectons report the resuts of tranng severa modes wth data retreved from the CMU Graphcs Lab Moton Capture Database. We extracted a seres of 10 styzed (b)

6 Factored Condtona Restrcted Botzmann Machnes wa sequences performed by subect 137. The was were abeed as cat, chcen, dnosaur, drun, gangy, gracefu, norma, od-man, sexy and strong. We baanced the dataset by repeatng the sequences 3-6 tmes (dependng on the orgna ength) so that our fna dataset contaned approxmatey 3000 frames of each stye at 60fps. A rotatons were converted to an exponenta map representaton. As n (Tayor et a., 2007), the root segment was expressed n a body-centred coordnate system whch s nvarant to ground-pane transatons and rotatons about the gravtatona vertca. A data was scaed to have zero mean and unt varance. We refer the reader to vdeos of our syntheszed data at gwtayor/pubcatons/cm2009/ Basene: the CRBM As a basene, we traned two CRBM modes foowng (Tayor et a., 2007) wth the foowng exceptons: At each teraton of CD earnng, we performed 10 steps of aternatng Gbbs sampng (CD-10). We added a sparsty term to the energy functon to genty encourage the hdden unts, whe drven by the data, to have an average actvaton of 0.2. Ths s the same nd of sparsty used n (Lee et a., 2008). At each teraton of CD earnng, we added Gaussan nose wth σ = 1 to each dmenson of v <t. A parameters used a earnng rate of 10 3, except for the autoregressve weghts whch used a earnng rate of LAYER MODEL A snge-ayer CRBM wth 1200 hdden unts and N = 12 was traned on the 10-stye data for 200 epochs wth the parameters beng updated after every 100 tranng cases. Each tranng case was a wndow of 13 consecutve frames and the order of the tranng cases was randomy permuted. In addton to the rea-vaued mocap data, the hdden unts receved nput from a one-hot encodng of the matchng stye abe. Respectng the condtona nature of our appcaton (generaton of styzed moton, as opposed to, say cassfcaton) ths abe was not reconstructed durng earnng. After tranng the mode, we generated moton by ntazng wth 12 frames of tranng data and hodng the abe unts camped to the stye matchng the ntazaton. Wth a snge ayer we can generate hgh-quaty moton of 9/10 styes (see the suppementa vdeos), however, the mode fas to produce good generaton of the od-man stye. We beeve that ths reates to the subte nature of ths partcuar moton. In examnng the actvty of the hdden unts over tme whe camped to tranng data, we observed that the mode devotes most of ts hdden capacty to capturng the more actve styes as t pays a hgher cost for fang to mode more pronounced frame-to-frame changes LAYER MODEL We aso earned a deeper networ by frst tranng a CRBM wth 600 bnary hdden unts and rea-vaued vsbe unts and then tranng a second eve CRBM wth 600 bnary hdden and 600 bnary vsbe unts. The data for tranng the second eve CRBM was the actvatons of the hdden unts of the frst eve CRBM whe drven by the tranng data. We added stye abes to the top ayer whe tranng the second eve CRBM. The frst mode was traned for 300 epochs, and the second eve was traned for 120 epochs. After tranng, the 2-hdden-ayer networ was abe to generate hgh-quaty was of a styes, ncudng od-man (see the suppementa vdeos). The second eve CRBM ayer effectvey repaces the pror over the frst ayer of hdden unts, p(h t v <t, θ), that s mpcty defned by the parameters of the frst CRBM. Ths provdes a better mode of the subte correatons between the features that the frst eve CRBM extracts from the moton Modeng wth Dscrete Stye Labes Usng the same 10-styes dataset, we traned a factored CRBM wth Gaussan vsbe unts whose parameters were gated by 100 rea-vaued features drven by the dscrete stye abes (Fg. 4). Ths mode had 600 hdden unts, 200 factors per sub-mode and N = 12. Feature-to-factor parameters were aso ted between sub-modes. A parameters used a earnng rate of 10 2, except for the autoregressve parameters A v m, Av<t m, Az m and the abe-to-feature parameters, R p, whch used a earnng rate of We traned the mode for 500 epochs. After tranng the mode, we tested ts abty to synthesze reastc moton by ntazng wth 12 frames of tranng data and hodng the abe unts camped to the matchng stye. The snge-ayer mode was abe to generate styzed content as we as the 2-ayer standard CRBM (see the suppementa vdeos). In addton, we were abe to nduce transtons between two or more styes by neary bendng the dscrete stye abe from one settng to another over 200 frames 1. We were further abe to bend together styes (e sexy and strong) by appyng a near nterpoaton of the dscrete abes. The resutng moton was more natura when a snge stye was domnant (e.g. an 0.8/0.2 bend). We beeve ths s smpy a case of better performance when the desred moton more cosey resembes the cases present n the tranng data set, so tranng on a few exampes of bends shoud greaty mprove ther generaton. 1 The number of frames was seected emprcay and provded a smooth transton, but the mode s not senstve to ths number. A quc (e.g. frame-to-frame) change of abes w smpy produce a ery transton.

7 Factored Condtona Restrcted Botzmann Machnes 4.3. Modeng wth Rea-vaued Stye Parameters The motons consdered thus far have been descrbed by a snge, dscrete abe such as gangy or drun. Moton stye, however, can be characterzed by mutpe dscrete abes or even contnuous factors such as the eve of fow, weght, tme and space formay defned n Laban Movement Anayss (Torresan et a., 2007). In the case of mutpe dscrete abes, our rea-vaued feature unts, z, can receve nput from mutpe categores of abes. For contnuous factors of stye, we can connect rea-vaued stye unts to the rea-vaued feature unts, or we can smpy gate the mode drecty by the contnous descrpton of stye. To test ths hypothess, we traned a mode exacty as n Sec. 4.2, but nstead of gatng connectons wth 100 reavaued feature unts, we gated wth 2 rea-vaued stye descrptors that were condtoned upon at every frame. Agan we traned wth wang data, but the data was captured specfcay for ths experment. One stye unt represented the speed of wang and the other, the strde ength. The tranng data conssted of nne sequences at 60fps, each approxmatey 6000 frames correspondng to the crossproduct of (sow, norma, fast) speed and (short, norma, ong) strde ength. The correspondng abes each had vaues of 1, 2 or 3. These vaues were chosen to avod the speca case of a gatng unts beng set at zero and nufyng the effectve weghts of the mode. After tranng for 500 epochs, the mode coud, as before, generate reastc moton accordng to the nne dscrete combnatons of speed and strde-ength wth whch t was traned based on ntazaton and settng the abe unts to match the abes n the tranng set. Furthermore, the mode supported both nterpoaton and extrapoaton aong the speed and strde ength axes and dd not appear overy senstve to ntazaton (see the suppementa vdeos) Quanttatve Evauaton In our experments so far, we have sought a quatatve comparson to the CRBM, based on the reasm of syntheszed moton. We have aso focused on the abty of a factored mode wth mutpcatve nteractons to synthesze transtons as we as nterpoate and extrapoate between styes present n the tranng data set. The appcaton does not naturay present a quanttatve comparson, but n the past, other tme seres modes have been compared by ther performance on the predcton of ether fu or parta hed-out frames (Tayor et a., 2007; Lawrence, 2007). We use the dataset frst proposed by (Hsu et a., 2005) whch conssts of abeed sequences of seven types of wang: (crouch, og, mp, norma, sde-rght, sway, wadde) each at three dfferent speeds (sow, medum, fast). We preprocessed the data to remove mssng or extremey nosy sectons, and smoothed wth a ow-pass fter before downsampng from 120 to 30fps. For each archtecture: unfactored/factored CRBM, and stye-gated unfactored/factored CRBM, we traned 21 dfferent modes on a stye and speed pars except one, whch we hed out for testng. Then, for each mode, we attempted to predct every subsequence of ength M n the test set, gven the past N = 6 frames. We repeated the experments for each archtecture, each tme reportng resuts averaged over the 21 modes. Predcton coud be performed by ntazng wth the prevous frame and Gbbs sampng n the same way we generated, but ths approach s subect to nose. We found that n a cases, ntegratng out the hdden unts and foowng the gradent of the negatve free energy (the og probabty of an observaton pus og Z ) wth respect to v t gave ess predcton error. Detas of how to compute the free energy by margnazng out the bnary hdden unts can be found n (Freund & Hausser, 1992). The archtectures were subect to dfferent earnng rates and so the number of epochs for whch to tran each mode were determned by settng asde 10% of the tranng set for vadaton. Fg. 6 presents the resuts. Wth amost haf the number of free parameters, the factored mode performed as we as the fuy parameterzed CRBM. Gatng wth stye nformaton gves an advantage n onger-term predcton because t prevents the mode from graduay changng the stye. The unfactored mode wth stye nformaton performed sghty worse than the factored mode and was extremey sow to tran (t too two days to tran whereas the other modes were each traned n a few hours). RMS predcton error (normazed data space) CRBM 600 (201,795) FCRBM (110,445) stye FCRBM (110,795) unfac stye CRBM 100 (218,445) Predct ahead nterva Fgure 6. Predcton experment. The number of free parameters are shown n parentheses. Error s reported n the normazed space n whch the modes are traned and s per-dmenson, perframe.

8 Factored Condtona Restrcted Botzmann Machnes 5. Concuson Restrcted Botzmann Machnes have severa attractve computatona propertes whch carry through to the deeper archtectures of whch they form the core. From a generatve mode standpont, however, these deep networs have a defcency. Regardess of whether or not the ayers beow contan atera nteractons, sampng the hgher ayers can ony determne the effectve bases of the ayer beow. The gated CRBM s a mode n whch the hdden unts nfuence the atera nteractons of the ayer beow, provdng an exponenta number of (non-ndependent) possbe modes at a cost that s cubc n the number of parameters. If we ony et contextua nformaton (e stye) determne the effectve hdden bases of a CRBM, the sgna s swamped by the nformaton comng from the past. However, f we aow for a three-way, mutpcatve reatonshp e n the gated CRBM, context becomes a natura part of the mode, determnng the effectve weghts. The potenta bow-up n the number of parameters mped by such a mode s soved by factorzng the three-way tensors. When modeng human moton, our approach permts stye to change the effectve weghts of the networ va dscrete or rea-vaued representatons. Changng these stye-based factors durng generaton can nduce natura-oong transtons and permt nterpoaton and extrapoaton of styes n the tranng data. In our experments we aways condtoned on stye, and assumed that our tranng data had been abeed a pror. Ths added a supervsed favour to our otherwse unsupervsed modes. We beeve the more nterestng probem s the fuy unsupervsed settng ncudng the dscovery of stye n the ayers of bnary features. Future wor w contnue to focus on hgher-order nteractons (perhaps beyond thrd) but where stye-based descrptors are nferred rather than provded. References Brand, M., & Hertzmann, A. (2000). Stye machnes. Proc. SIGGRAPH (pp ). Carrera-Perpnan, M., & Hnton, G. (2005). On contrastve dvergence earnng. Proc. AISTATS (pp ). Freund, Y., & Hausser, D. (1992). Unsupervsed earnng of dstrbutons of bnary vectors usng 2-ayer networs. Proc. NIPS 4 (pp ). Hnton, G. (2002). Tranng products of experts by mnmzng contrastve dvergence. Neura Comput, 14, Hnton, G., Osndero, S., & Teh, Y. (2006). A fast earnng agorthm for deep beef nets. Neura Comp., 18, Hnton, G., & Saahutdnov, R. (2006). Reducng the dmensonaty of data wth neura networs. Scence, 313, Hsu, E., Pu, K., & Popovć, J. (2005). Stye transaton for human moton. Proc. SIGGRAPH (pp ). Lawrence, N. (2004). Gaussan process atent varabe modes for vsuasaton of hgh dmensona data. Proc. NIPS 16 (pp ). Lawrence, N. (2007). Learnng for arger datasets wth the gaussan process atent varabe mode. Proc. AISTATS. Lee, H., Eanadham, C., & Ng., A. (2008). Sparse deep beef net mode for vsua area V2. Proc. NIPS 20. Memsevc, R. (2008). Non-near atent factor modes for reveang structure n hgh-dmensona data. Doctora dssertaton, Unversty of Toronto. Memsevc, R., & Hnton, G. (2007). Unsupervsed earnng of mage transformatons. Proc. CVPR. Osndero, S., & Hnton, G. (2008). Modeng mage patches wth a drected herarchy of Marov random feds. Proc. NIPS 20 (pp ). Saahutdnov, R., Mnh, A., & Hnton, G. (2007). Restrcted Botzmann machnes for coaboratve fterngfterng. Proc. ICML (pp ). Saahutdnov, R., & Murray, I. (2008). On the quanttatve anayss of deep beef networs. Proc. ICML (pp ). Smoensy, P. (1987). Informaton processng n dynamca systems: Foundatons of harmony theory. In D. E. Rumehart, J. L. McCeand et a. (Eds.), Parae dstrbuted processng: Voume 1: Foundatons, Cambrdge: MIT Press. Tayor, G., Hnton, G., & Rowes, S. (2007). Modeng human moton usng bnary atent varabes. Proc. NIPS 19 (pp ). Teeman, T. (2008). Tranng restrcted Botzmann machnes usng approxmatons to the ehood gradent. Proc. ICML (pp ). Torresan, L., Hacney, P., & Breger, C. (2007). Learnng moton stye synthess from perceptua observatons. Proc. NIPS 19 (pp ). Wang, J., Feet, D., & Hertzmann, A. (2007). Mutfactor gaussan process modes for stye-content separaton. Proc. ICML (pp ). Weng, M., Rosen-Zv, M., & Hnton, G. (2005). Exponenta famy harmonums wth an appcaton to nformaton retreva. Proc. NIPS 17 (pp ).

Clustering based Two-Stage Text Classification Requiring Minimal Training Data

Clustering based Two-Stage Text Classification Requiring Minimal Training Data OI: 10.2298/CSIS120130044Z Custerng based Two-Stage Text Cassfcaton Requrng Mnma Tranng ata Xue Zhang 1,2 and Wangxn Xao 3,4 1 Key Laboratory of Hgh Confdence Software Technooges, Mnstry of Educaton, Pekng

More information

Multi-agent System for Custom Relationship Management with SVMs Tool

Multi-agent System for Custom Relationship Management with SVMs Tool Mut-agent System for Custom Reatonshp Management wth SVMs oo Yanshan Xao, Bo Lu, 3, Dan Luo, and Longbng Cao Guangzhou Asan Games Organzng Commttee, Guangzhou 5063, P.R. Chna Facuty of Informaton echnoogy,

More information

An Ensemble Classification Framework to Evolving Data Streams

An Ensemble Classification Framework to Evolving Data Streams Internatona Journa of Scence and Research (IJSR) ISSN (Onne): 39-7064 An Ensembe Cassfcaton Framework to Evovng Data Streams Naga Chthra Dev. R MCA, (M.Ph), Sr Jayendra Saraswathy Maha Vdyaaya, Coege of

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Adaptive Multi-Compositionality for Recursive Neural Models with Applications to Sentiment Analysis

Adaptive Multi-Compositionality for Recursive Neural Models with Applications to Sentiment Analysis Proceedngs of the Twenty-Eghth AAAI Conference on Artfca Integence Adapte Mut-Compostonaty for Recurse Neura Modes wth Appcatons to Sentment Anayss L Dong Furu We Mng Zhou Ke Xu State Key Lab of Software

More information

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods Predcton of Success or Fa of on Dfferent Educatona Maors at the End of the Hgh Schoo th Artfca Neura Netors Methods Sayyed Mad Maznan, Member, IACSIT, and Sayyede Azam Aboghasempur Abstract The man obectve

More information

Predicting Advertiser Bidding Behaviors in Sponsored Search by Rationality Modeling

Predicting Advertiser Bidding Behaviors in Sponsored Search by Rationality Modeling Predctng Advertser Bddng Behavors n Sponsored Search by Ratonaty Modeng Hafeng Xu Centre for Computatona Mathematcs n Industry and Commerce Unversty of Wateroo Wateroo, ON, Canada hafeng.ustc@gma.com Dy

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population Cardovascuar Event Rsk Assessment Fuson of Indvdua Rsk Assessment Toos Apped to the Portuguese Popuaton S. Paredes, T. Rocha, P. de Carvaho, J. Henrques, J. Moras*, J. Ferrera, M. Mendes Abstract Cardovascuar

More information

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers Approxmaton Agorthms for Data Dstrbuton wth Load Baancng of Web Servers L-Chuan Chen Networkng and Communcatons Department The MITRE Corporaton McLean, VA 22102 chen@mtreorg Hyeong-Ah Cho Department of

More information

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times Asymptotcay Optma Inventory Contro for Assembe-to-Order Systems wth Identca ead Tmes Martn I. Reman Acate-ucent Be abs, Murray H, NJ 07974, marty@research.be-abs.com Qong Wang Industra and Enterprse Systems

More information

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL SIMPLIFYING NDA PROGRAMMING WITH PROt SQL Aeen L. Yam, Besseaar Assocates, Prnceton, NJ ABSRACf The programmng of New Drug Appcaton (NDA) Integrated Summary of Safety (ISS) usuay nvoves obtanng patent

More information

Expressive Negotiation over Donations to Charities

Expressive Negotiation over Donations to Charities Expressve Negotaton over Donatons to Chartes Vncent Contzer Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh, PA 523, USA contzer@cs.cmu.edu Tuomas Sandhom Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh,

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

TCP/IP Interaction Based on Congestion Price: Stability and Optimality

TCP/IP Interaction Based on Congestion Price: Stability and Optimality TCP/IP Interacton Based on Congeston Prce: Stabty and Optmaty Jayue He Eectrca Engneerng Prnceton Unversty Ema: jhe@prncetonedu Mung Chang Eectrca Engneerng Prnceton Unversty Ema: changm@prncetonedu Jennfer

More information

An Efficient Job Scheduling for MapReduce Clusters

An Efficient Job Scheduling for MapReduce Clusters Internatona Journa of Future Generaton ommuncaton and Networkng, pp. 391-398 http://dx.do.org/10.14257/jfgcn.2015.8.2.32 An Effcent Job Schedung for MapReduce usters Jun Lu 1, Tanshu Wu 1, and Mng We Ln

More information

Neural Network-based Colonoscopic Diagnosis Using On-line Learning and Differential Evolution

Neural Network-based Colonoscopic Diagnosis Using On-line Learning and Differential Evolution Neura Networ-based Coonoscopc Dagnoss Usng On-ne Learnng and Dfferenta Evouton George D. Magouas, Vasss P. Paganaos * and Mchae N. Vrahats * Department of Informaton Systems and Computng, Brune Unversty,

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center 56 IEICE TRANS. COMMUN., VOL.E96 B, NO. JANUARY 203 PAPER Speca Secton on Networ Vrtuazaton, and Fuson Patform of Computng and Networng Dynamc Vrtua Networ Aocaton for OpenFow Based Coud Resdent Data Center

More information

Off-line and on-line scheduling on heterogeneous master-slave platforms

Off-line and on-line scheduling on heterogeneous master-slave platforms Laboratore de Informatque du Paraésme Écoe Normae Supéreure de Lyon Unté Mxte de Recherche CNRS-INRIA-ENS LYON-UCBL n o 5668 Off-ne and on-ne schedung on heterogeneous master-save patforms Jean-Franços

More information

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

Dropout: A Simple Way to Prevent Neural Networks from Overfitting Journal of Machne Learnng Research 15 (2014) 1929-1958 Submtted 11/13; Publshed 6/14 Dropout: A Smple Way to Prevent Neural Networks from Overfttng Ntsh Srvastava Geoffrey Hnton Alex Krzhevsky Ilya Sutskever

More information

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem REVISTA DE MÉTODOS CUANTITATIVOS PARA LA ECONOMÍA Y LA EMPRESA (12) Págnas 5 38 Dcembre de 2011 ISSN: 1886-516X DL: SE-2927-06 URL: http://wwwupoes/revmetcuant/artphp?d=51 Branch-and-Prce and Heurstc Coumn

More information

XAC08-6 Professional Project Management

XAC08-6 Professional Project Management 1 XAC08-6 Professona Project anagement Ths Lecture: Tte s so manager shoud ncude a s management pan a document that gudes any experts agree Some faure project to Ba, ba, ba, ba Communcaton anagement Wee

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties*

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties* Predctve Contro of a Smart Grd: A Dstrbuted Optmzaton Agorthm wth Centrazed Performance Propertes* Phpp Braun, Lars Grüne, Chrstopher M. Keett 2, Steven R. Weer 2, and Kar Worthmann 3 Abstract The authors

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

On-Line Trajectory Generation: Nonconstant Motion Constraints

On-Line Trajectory Generation: Nonconstant Motion Constraints 2012 IEEE Internatona Conference on Robotcs and Automaton RverCentre, Sant Pau, Mnnesota, USA May 14-18, 2012 On-Lne Trajectory Generaton: Nonconstant Moton Constrants Torsten Kröger Abstract A concept

More information

Swing-Free Transporting of Two-Dimensional Overhead Crane Using Sliding Mode Fuzzy Control

Swing-Free Transporting of Two-Dimensional Overhead Crane Using Sliding Mode Fuzzy Control Swng-Free Transportng of Two-Dmensona Overhead Crane Usng Sdng Mode Fuzzy Contro Dantong Lu, Janqang, Dongn Zhao, and We Wang Astract An adaptve sdng mode fuzzy contro approach s proposed for a two-dmensona

More information

Logistic Regression. Steve Kroon

Logistic Regression. Steve Kroon Logstc Regresson Steve Kroon Course notes sectons: 24.3-24.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro

More information

Georey E. Hinton. University oftoronto. Email: zoubin@cs.toronto.edu. Technical Report CRG-TR-96-1. May 21, 1996 (revised Feb 27, 1997) Abstract

Georey E. Hinton. University oftoronto. Email: zoubin@cs.toronto.edu. Technical Report CRG-TR-96-1. May 21, 1996 (revised Feb 27, 1997) Abstract The EM Algorthm for Mxtures of Factor Analyzers Zoubn Ghahraman Georey E. Hnton Department of Computer Scence Unversty oftoronto 6 Kng's College Road Toronto, Canada M5S A4 Emal: zoubn@cs.toronto.edu Techncal

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Bayesian Network Based Causal Relationship Identification and Funding Success Prediction in P2P Lending

Bayesian Network Based Causal Relationship Identification and Funding Success Prediction in P2P Lending Proceedngs of 2012 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 25 (2012) (2012) IACSIT Press, Sngapore Bayesan Network Based Causal Relatonshp Identfcaton and Fundng Success

More information

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks A Smpe Congeston-Aware Agorthm for Load Baancng n Datacenter Networs Mehrnoosh Shafee, and Javad Ghader, Coumba Unversty Abstract We study the probem of oad baancng n datacenter networs, namey, assgnng

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. Sequential Optimizing Investing Strategy with Neural Networks

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. Sequential Optimizing Investing Strategy with Neural Networks MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sequental Optmzng Investng Strategy wth Neural Networks Ryo ADACHI and Akmch TAKEMURA METR 2010 03 February 2010 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE

More information

A Continuous Restricted Boltzmann Machine with a Hardware-Amenable Learning Algorithm

A Continuous Restricted Boltzmann Machine with a Hardware-Amenable Learning Algorithm A Contnuous Restrcted Boltzmann Machne wth a Hardware-Amenable Learnng Algorthm Hsn Chen and Alan Murray Dept. of Electroncs and Electrcal Engneerng, Unversty of Ednburgh, Mayfeld Rd., Ednburgh, EH93JL,

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

Hacia un Modelo de Red Inmunológica Artificial Basado en Kernels. Towards a Kernel Based Model for Artificial Immune Networks

Hacia un Modelo de Red Inmunológica Artificial Basado en Kernels. Towards a Kernel Based Model for Artificial Immune Networks Haca un Modeo de Red Inmunoógca Artfca Basado en Kernes Towards a Kerne Based Mode for Artfca Immune Networs Juan C. Gaeano, Ing. 1, Fabo A. Gonzáez, PhD. 1 Integent Systems Research Lab, Natona Unversty

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

A study on the ability of Support Vector Regression and Neural Networks to Forecast Basic Time Series Patterns

A study on the ability of Support Vector Regression and Neural Networks to Forecast Basic Time Series Patterns A study on the ablty of Support Vector Regresson and Neural Networks to Forecast Basc Tme Seres Patterns Sven F. Crone, Jose Guajardo 2, and Rchard Weber 2 Lancaster Unversty, Department of Management

More information

RELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT

RELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE

More information

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation Increasng Supported VoIP Fows n WMNs through n-based Aggregaton J. Oech, Y. Hamam, A. Kuren F SATIE TUT Pretora, South Afrca oechr@gma.com T. Owa Meraa Insttute Counc of Scentfc and Industra Research (CSIR)

More information

SUPPORT VECTOR MACHINE FOR REGRESSION AND APPLICATIONS TO FINANCIAL FORECASTING

SUPPORT VECTOR MACHINE FOR REGRESSION AND APPLICATIONS TO FINANCIAL FORECASTING SUPPORT VECTOR MACHINE FOR REGRESSION AND APPICATIONS TO FINANCIA FORECASTING Theodore B. Trafas and Husen Ince Schoo of Industra Engneerng Unverst of Okahoma W. Bod Sute 4 Norman Okahoma 739 trafas@ecn.ou.edu;

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Research on Single and Mixed Fleet Strategy for Open Vehicle Routing Problem

Research on Single and Mixed Fleet Strategy for Open Vehicle Routing Problem 276 JOURNAL OF SOFTWARE, VOL 6, NO, OCTOBER 2 Research on Snge and Mxed Feet Strategy for Open Vehce Routng Probe Chunyu Ren Heongjang Unversty /Schoo of Inforaton scence and technoogy, Harbn, Chna Ea:

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

Adaptive Fractal Image Coding in the Frequency Domain

Adaptive Fractal Image Coding in the Frequency Domain PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 2-22 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

A neuro-fuzzy collaborative filtering approach for Web recommendation. G. Castellano, A. M. Fanelli, and M. A. Torsello *

A neuro-fuzzy collaborative filtering approach for Web recommendation. G. Castellano, A. M. Fanelli, and M. A. Torsello * Internatonal Journal of Computatonal Scence 992-6669 (Prnt) 992-6677 (Onlne) Global Informaton Publsher 27, Vol., No., 27-39 A neuro-fuzzy collaboratve flterng approach for Web recommendaton G. Castellano,

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

A Fast Incremental Spectral Clustering for Large Data Sets

A Fast Incremental Spectral Clustering for Large Data Sets 2011 12th Internatonal Conference on Parallel and Dstrbuted Computng, Applcatons and Technologes A Fast Incremental Spectral Clusterng for Large Data Sets Tengteng Kong 1,YeTan 1, Hong Shen 1,2 1 School

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

USING EMPIRICAL LIKELIHOOD TO COMBINE DATA: APPLICATION TO FOOD RISK ASSESSMENT.

USING EMPIRICAL LIKELIHOOD TO COMBINE DATA: APPLICATION TO FOOD RISK ASSESSMENT. Submtted to the Annas of Apped Statstcs USING EMPIRICA IKEIHOOD TO COMBINE DATA: APPICATION TO FOOD RISK ASSESSMENT. By Amée Crépet, Hugo Harar-Kermadec and Jessca Tressou INRA Mét@rs and INRA COREA Ths

More information

Realistic Image Synthesis

Realistic Image Synthesis Realstc Image Synthess - Combned Samplng and Path Tracng - Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random

More information

Fragility Based Rehabilitation Decision Analysis

Fragility Based Rehabilitation Decision Analysis .171. Fraglty Based Rehabltaton Decson Analyss Cagdas Kafal Graduate Student, School of Cvl and Envronmental Engneerng, Cornell Unversty Research Supervsor: rcea Grgoru, Professor Summary A method s presented

More information

ECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble

ECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble 1 ECE544NA Fnal Project: Robust Machne Learnng Hardware va Classfer Ensemble Sa Zhang, szhang12@llnos.edu Dept. of Electr. & Comput. Eng., Unv. of Illnos at Urbana-Champagn, Urbana, IL, USA Abstract In

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Simple Interest Loans (Section 5.1) :

Simple Interest Loans (Section 5.1) : Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

More information

Bypassing Synthesis: PLS for Face Recognition with Pose, Low-Resolution and Sketch

Bypassing Synthesis: PLS for Face Recognition with Pose, Low-Resolution and Sketch Bypassng Synthess: PLS for Face Recognton wth Pose, Low-Resoluton and Setch Abhshe Sharma Insttute of Advanced Computer Scence Unversty of Maryland, USA bhoaal@umacs.umd.edu Davd W Jacobs Insttute of Advanced

More information

1. Introduction. Graham Kendall School of Computer Science and IT ASAP Research Group University of Nottingham Nottingham, NG8 1BB gxk@cs.nott.ac.

1. Introduction. Graham Kendall School of Computer Science and IT ASAP Research Group University of Nottingham Nottingham, NG8 1BB gxk@cs.nott.ac. The Co-evoluton of Tradng Strateges n A Mult-agent Based Smulated Stock Market Through the Integraton of Indvdual Learnng and Socal Learnng Graham Kendall School of Computer Scence and IT ASAP Research

More information

7.5. Present Value of an Annuity. Investigate

7.5. Present Value of an Annuity. Investigate 7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on

More information

Damage detection in composite laminates using coin-tap method

Damage detection in composite laminates using coin-tap method Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT

ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT M USHA AND K MADHANA: ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT M.

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

Using Content-Based Filtering for Recommendation 1

Using Content-Based Filtering for Recommendation 1 Usng Content-Based Flterng for Recommendaton 1 Robn van Meteren 1 and Maarten van Someren 2 1 NetlnQ Group, Gerard Brandtstraat 26-28, 1054 JK, Amsterdam, The Netherlands, robn@netlnq.nl 2 Unversty of

More information

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance Applcaton of Quas Monte Carlo methods and Global Senstvty Analyss n fnance Serge Kucherenko, Nlay Shah Imperal College London, UK skucherenko@mperalacuk Daro Czraky Barclays Captal DaroCzraky@barclayscaptalcom

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Visual Stabilization of Beating Heart Motion by Model-Based Transformation of Image Sequences

Visual Stabilization of Beating Heart Motion by Model-Based Transformation of Image Sequences Vsual Stablzaton of Beatng Heart Moton by Model-Based ransformaton of Image Sequences Evgenya Bogatyreno and Uwe D. Hanebec Abstract In order to assst a surgeon whle operatng on a beatng heart, vsual stablzaton

More information

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle The Dynamcs of Weath and Income Dstrbuton n a Neocassca Growth Mode * Stephen J. Turnovsy Unversty of Washngton, Seatte Ceca García-Peñaosa CNRS and GREQAM March 26 Abstract: We examne the evouton of the

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

Comparison of workflow software products

Comparison of workflow software products Internatona Conference on Computer Systems and Technooges - CompSysTech 2006 Comparson of worfow software products Krasmra Stoova,Todor Stoov Abstract: Ths research addresses probems, reated to the assessment

More information

An interactive system for structure-based ASCII art creation

An interactive system for structure-based ASCII art creation An nteractve system for structure-based ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract Non-Photorealstc Renderng (NPR), whose am

More information

THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION

THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION Internatonal Journal of Electronc Busness Management, Vol. 3, No. 4, pp. 30-30 (2005) 30 THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION Yu-Mn Chang *, Yu-Cheh

More information

The Application of Fractional Brownian Motion in Option Pricing

The Application of Fractional Brownian Motion in Option Pricing Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com

More information

CFD Simulation of Cloud and Tip Vortex Cavitation on Hydrofoils

CFD Simulation of Cloud and Tip Vortex Cavitation on Hydrofoils ICMF 007, Lepzg, Germany, Juy 9 3, 007 CFD Smuaton of Coud and Tp Vortex Cavtaton on Hydrofos Th. Fran, C. Lfante, S. Jebauer, M. Kuntz and K. Rec ) ANSYS Germany, CFX Deveopment Staudenfedweg, D-8364

More information

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

Evaluating credit risk models: A critique and a new proposal

Evaluating credit risk models: A critique and a new proposal Evaluatng credt rsk models: A crtque and a new proposal Hergen Frerchs* Gunter Löffler Unversty of Frankfurt (Man) February 14, 2001 Abstract Evaluatng the qualty of credt portfolo rsk models s an mportant

More information

Modelling of Web Domain Visits by Radial Basis Function Neural Networks and Support Vector Machine Regression

Modelling of Web Domain Visits by Radial Basis Function Neural Networks and Support Vector Machine Regression Modellng of Web Doman Vsts by Radal Bass Functon Neural Networks and Support Vector Machne Regresson Vladmír Olej, Jana Flpová Insttute of System Engneerng and Informatcs Faculty of Economcs and Admnstraton,

More information

A Dynamic Energy-Efficiency Mechanism for Data Center Networks

A Dynamic Energy-Efficiency Mechanism for Data Center Networks A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

A Resources Allocation Model for Multi-Project Management

A Resources Allocation Model for Multi-Project Management A Resources Aocaton Mode for Mut-Proect Management Hamdatou Kane, Aban Tsser To cte ths verson: Hamdatou Kane, Aban Tsser. A Resources Aocaton Mode for Mut-Proect Management. 9th Internatona Conference

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika. VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Improved SVM in Cloud Computing Information Mining

Improved SVM in Cloud Computing Information Mining Internatonal Journal of Grd Dstrbuton Computng Vol.8, No.1 (015), pp.33-40 http://dx.do.org/10.1457/jgdc.015.8.1.04 Improved n Cloud Computng Informaton Mnng Lvshuhong (ZhengDe polytechnc college JangSu

More information

An Integrated Approach for Maintenance and Delivery Scheduling in Military Supply Chains

An Integrated Approach for Maintenance and Delivery Scheduling in Military Supply Chains An Integrated Approach for Mantenance and Delvery Schedulng n Mltary Supply Chans Dmtry Tsadkovch 1*, Eugene Levner 2, Hanan Tell 2 and Frank Werner 3 2 1 Bar Ilan Unversty, Department of Management, Ramat

More information