Robust Object Tracking with Online Multi-lifespan Dictionary Learning
|
|
- Leslie Joseph
- 6 years ago
- Views:
Transcription
1 203 IEEE Inernaional Conference on Compuer Vision Robus Objec Tracking wih Online Muli-lifespan Dicionary Learning Junliang Xing, Jin Gao, Bing Li, Weiming Hu Naional Laboraory of Paern Recogniion Insiue of Auomaion, CAS Beijing 0090, P. R. China Shuicheng Yan Dep. of Elecrical and Compuer Engineering Naional Universiy of Singapore Singapore 7576, Singapore Absrac Recenly, sparse represenaion has been inroduced for robus objec racking. By represening he objec sparsely, i.e., using only a few emplaes via l -norm minimizaion, hese so-called l -rackers exhibi promising racking resuls. In his work, we address he objec emplae building and updaing problem in hese l -racking approaches, which has no been fully sudied. We propose o perform emplae updaing, in a new perspecive, as an online incremenal dicionary learning problem, which is efficienly solved hrough an online opimizaion procedure. To guaranee he robusness and adapabiliy of he racking algorihm, we also propose o build a muli-lifespan dicionary model. By building arge dicionaries of differen lifespans, effecive objec observaions can be obained o deal wih he well-known drifing problem in racking and hus improve he racking accuracy. We derive effecive observaion models boh generaively and discriminaively based on he online muli-lifespan dicionary learning model and deploy hem o he Bayesian sequenial esimaion framework o perform racking. The proposed approach has been exensively evaluaed on en challenging video sequences. Experimenal resuls demonsrae he effeciveness of he online learned emplaes, as well as he sae-of-he-ar racking performance of he proposed approach.. Inroducion Visual objec racking, which aims o esimae he arge sae (e.g. posiion and size) in video sequences, is a very imporan research opic in he compuer vision field. I has many applicaions like visual surveillance, vehicle navigaion and human compuer ineracion [25]. Alhough many algorihms have been proposed in he las decades, objec racking sill remains a very challenging problem for realworld applicaions due o he difficulies like background cluering, image noises, illuminaion changes, objec occlusions and fas moions, as shown in Figure. Recenly, sparse coding based mehods have been suc- Figure. Typical difficulies in objec racking problem. () Image noises and background cluering (op-lef image), (2) illuminaion changes (op-righ image), (3) objec occlusions (boomlef image), and (4) fas objec moions (boom-righ image). The racking resuls using fixed emplaes, fully updaed emplaes, updae mehod in [9], [26], [22], [3] and he proposed mehod in his work are respecively ploed in eal, olive, purple, cyan, blue, green and red colors. Bes viewed in original color PDF file. cessfully applied o visual racking problem [9, 20, 5, 28, 3]. The basic assumpion in hese mehods is ha he arge can be represened as a linear combinaion of only a few elemens in a emplae se. Then he confidence of a arge candidae can be modeled using he reconsrucion error of he sparse represenaion. Denoing a emplae se of he arge wih m elemens as T =[, 2,..., m ] R n m, and a arge candidae as y R n, which is used as he observaions o esimae he objec sae x (see Secion 3.3 for more deails), he sparse represenaion of he candidae using he emplaes is obained by solving min Tc y λ c, () c where c R m is he coefficien vecor for he sparse represenaion, and λ is he regularizaion parameer o conrol he sparsiy of c. Based on he derived resul, he confidence of he candidae y wih respec o he arge sae x is naurally modeled as, /3 $ IEEE DOI 0.09/ICCV
2 p(y x) = Γ exp( α Tc y 2 2), (2) where α is a consan and Γ is a normalizaion facor o make p(y x) a valid probabiliy disribuion. Buil on his idea, previous works on sparse coding based objec racking have mainly focused on wo problems. One is how o design he objec emplaes. Mehods using global objec emplaes [9, 26], local image paches [3], or a combinaion of hem [28] have been proposed. The oher problem is how o solve he minimizaion problem o perform efficien racking, and relevan soluions include Inerior Poin mehod [9], Acceleraed Proximal Gradien approach [5], Leas Angle Regression algorihm [28, 3], and Augmened Lagrange Muliplier mehod [26]. Supposing ha we have already designed he objec emplaes and used hem o rack he arge via a cerain opimizaion procedure, how can we updae he objec emplaes effecively and efficienly? This is also a very imporan problem bu has no been paid much aenion in previous l -rackers. Exising l -rackers address he emplae updae problem usually by adoping some classic mehods (e.g. fixed emplaes wih no updaes [28] or incremenal updae wih replacing [9, 27]) or some inuiive sraegies [3, 26]. In his paper, we propose o perform he emplae updae problem in he racking scenario as an online incremenal dicionary learning problem. We also explore he emporal naure of he objec emplaes and propose o learn a muli-lifespan dicionary o improve he adapabiliy and robusness of a racking algorihm. We apply he online muli-lifespan dicionary learning model ino he Bayesian sequenial esimaion framework and design effecive observaion models boh generaively and discriminaively for a paricle filer implemenaion. Exensive experimens on public benchmark video sequences demonsrae he effeciveness of our online learned emplaes, and he sae-ofhe-ar racking performance of he proposed approach. 2. Relaed Work Objec racking mehods can be roughly grouped ino wo caegories: generaive and discriminaive. Generaive mehods, which use a descripive appearance model o represen he objec, perform racking as a searching problem over candidae regions o find he mos similar one. Examples of generaive racking mehods are eigenracker [6], mean shif racker [7], and fragmen racker []. Discriminaive mehods formulae objec racking as a binary classificaion problem and find he locaion ha can bes separae he arge from he background. Examples of discriminaive racking mehods are online boosing racker [], ensemble racker [3], and muli-insance learning racker [4]. Wih recen advances in sparse represenaion, sparse coding based objec rackers demonsrae o be a promising racking framework [9, 20, 5, 28, 3, 27, 26]. In he l -racker firs proposed by Xue and Lin [9], a combina- Table. Comparison of objec emplaes in popular l -rackers. Mehod Efficiency Building Updaing Robusness Adapiviy Xue and Lin[9] Low Manually Inuiively Low Low Xue and Lin[20] Low Manually Inuiively Low Low Bao e al. [5] High Manually Inuiively Low Low Zhang e al. [27] Low Manually Inuiively Low High Zhang e al. [26] High Manually Inuiively Low High Jia e al. [3] High Learned Learned Low High Zhong e al. [28] High Manually Inuiively High Low Proposed Mehod High Learned Learned High High ion of objec emplaes and rivial emplaes is employed o ackle he occlusion problem. To make he emplaes direcly robus o occlusion, local image paches can be used as he objec dicionary [3, 28]. In order o improve he efficiency of he opimizaion process, Xue and Lin [20] furher propose a minimal error bounded sraegy is o reduce he number of he l -norm relaed minimizaion problem, and laer some oher efficien opimizaion procedures are furher adoped o solve he problem [5, 28, 3, 26]. Besides emplae design and opimizaion mehod, emplae updae is even a more imporan problem in he sparse coding based racking framework. Alhough fixed objec emplae may work well for shor video sequences when he arge says nearly unchanged, i may be incompeen for long sequences where he arge ofen undergoes differen kinds of changes (see Figure ). To adap o appearance changes of he arge during racking, he emplaes in [9, 20, 5, 26] are updaed based on he weighs assigned o each emplae, and he similariies beween emplaes and he curren esimaion of he arge candidae. In [28], he global objec emplaes are kep fixed during racking o ensure he discriminaive power of he model, while he local pach emplaes are consanly updaed o adap o objec changes. In order o incremenally updae he emplaes, a more reasonable sraegy can be found in [3], where old emplaes are given slow updae probabiliies and he incremenal subspace learning algorihm in [22] is employed which resrics he emplae vecors o be orhogonal. Table gives a comparaive summary of he objec emplaes used in mos popular l rackers. Alhough all hese mehods provide differen sraegies conribuing o emplae updae, mos of hem use some predefined emplaes and updae hem inuiively, which may no fully unleash he poenial capabiliy of emplaes. The proposed online learning based emplae building and updaing algorihm, which is boh robus and adapive for racking, well addresses he problems of objec emplaes in he l rackers. 3. Proposed Approach Given he objec racking resuls, he main objecive of his paper is o online auomaically learn good objec emplaes, which can, in urn, benefi he ongoing objec racking process wih improved robusness and adapabiliy. Our core idea o achieve his objecive is rying no o impose heavy consrains on he emplae building and 666
3 Processed frames Processing... Process resul Resample Updae Esimae Firs frame... Previous frame Curren frame Draw Samples Legends: Draw Samples Learning SLD Discriminaive Observaion Model Objec Sample Background Sample Learn Dicionary Tracking Resul Resampled Paricle Updaed Paricle Draw Samples Learning Learning MLD LLD OMDL Generaive Observaion Model Muli-lifespan Dicionary Building Online Dicionary Learning Bayesian Sequenial Esimaion Figure 2. Overall descripion of he proposed approach. We perform emplae updae as an online dicionary learning problem and propose o learn a muli-lifespan dicionary, i.e. he Shor Lifespan Dicionary (SLD), he Middle Lifespan Dicionary (MLD) and he Long Lifespan Dicionary (LLD), o model he objec. The SLD learned from samples densely colleced from he previous frame makes he bes adapaion o he arge. The LLD learned from he mos accurae samples colleced from all he frames ensures he robusness of he model. The MLD, beween he SLD and he LLD, balances he adapabiliy and robusness of he final model. The Online Muli-lifespan Dicionary Learning (OMDL) model, ogeher wih he background samples colleced in he previous frame, is used o deduce observaion models boh generaively and discriminaively. These observaion models are hen applied ino he Bayesian sequenial esimaion framework using paricle filer implemenaion o perform adapive and robus objec racking. updaing process and making hem mos suiable for racking. To his end, we formulae his emplae building and updaing problem as online dicionary learning, which auomaically updaes objec emplaes ha can beer adap o he daa for racking. In order o furher improve he robusness and adapabiliy of he learned emplaes, we explore he emporal propery of he learned dicionary and propose o build a dicionary wih muliple lifespans o possess disinc emporal properies. Based on he learned mulilifespan dicionary, we deduce effecive observaion models boh generaively and discriminaively, and deploy hem ino he Bayesian sequenial esimaion framework o perform racking using a paricle filer implemenaion. Noe ha Li e al. [5] also use muliple deecors wih differen lifespans. Their objecive is o improve he compuaion efficiency of he muli-lifespan deecors which are used sequenially in a cascade paricle filer. Our muli-lifespan model, however, mainly aims o ease he conradicion beween he adapiviy and robusness of emplae based objec racking algorihms, and he muli-lifespan dicionaries are fused in parallel in a muli-sae paricle filer. Figure 2 gives he overall descripion of our approach, he deails of which are elaboraed in he following subsecions. 3.. Tracking as Online Dicionary Learning In sparse coding based racking algorihms, a arge candidae is represened as a linear combinaion of a few elemens from a emplae se. The building and updaing of his emplae se, herefore, have grea impac on he final racking resuls. Previous works usually build his emplae se by direcly sampling from he iniializaion of racking, and hen use some inuiive sraegies o updae he se during racking [9, 28, 3]. From a differen viewpoin, here we wan o auomaically learn his emplae se o make i bes adap o he video daa o be racked. We do no wan o impose any consrains on he learned emplaes, bu only expec ha hey can beer represen he arge ha have been racked and will be racked. Suppose all he possible arge candidaes are wihin a emplae se Y ={y,...,y N }, where y i R n denoes one n-dimensional sample and N is he emplae size which can be very large, since samples are coninually obained when a new frame has been racked. A good emplae se should hen have he minimal cos o represen all he elemens in his se. Denoe he represenaion cos funcion as: f(d) l(y, D), (3) Y y Y where D R n m is he learned emplae se, disinguished from he predefined emplae se T as in previous works, and l( ) is he loss funcion such ha l(y, D) is small if D is good a represening he candidae y. In a sparse coding based objec racking framework, he loss funcion can be naurally modeled as: l(y, D) min c R m 2 y Dc λ c. (4) To preven he l 2 -norm of D from being arbirarily large, which may lead o arbirarily small values of c, i usually consrains is columns d,...,d m o have l 2 -norms less 667
4 han or equal o. The consrain se of D hus can be represened as: D {D R n m, s.. j {,...,m}, d j 2 }. (5) Now, puing everyhing ogeher, he emplae learning can be formulaed as he following opimizaion problem, D =argmin D Y y Y l(y, D) s.. l(y, D) =min c 2 y Dc λ c D D. The above problem is also referred o as Dicionary Learning which has found many applicaions in signal processing [2, 24, 23], machine learning [8, 8] and laely compuer vision for face recogniion [6] and image resoraion [7]. Generally, i can be opimized using a wo-sep ieraed procedure: he firs sep fixes D and minimizes he cos funcion wih respec o he coefficien vecor c; and he second sep fixes he coefficien vecor c and performs gradien descen like mehods o minimize he cos funcion. In our scenario for emplae updaing in online objec racking, since he arge candidaes are obained consecuively, he above wo-sep ieraed procedure mus be redesigned o be performed in an online manner o learn he dicionary incremenally. In Algorihm, we summarize his redesigned procedure of online dicionary learning for emplae updae. The learning procedure receives he dicionary learned in he previous frame as inpu, and updaes he dicionary incremenally according o he samples colleced in he curren frame. In he algorihm, Sep is solved using he LARS mehod [9] and Sep 2 admis an analyical soluion. The involved marix inversion is calculaed in an online manner using he Sherman-Morrison formula [2] o make he learning process more efficien. The inroduced variables C and Y are inermediae resuls associaed wih he dicionary D and are sored for incremenal learning. The iniial value for D 0, C 0 and Y 0 are obained from he racker. To improve he robusness of he learned dicionary, muliple samples are colleced around he racking resul x in frame I, and M is he parameer o conrol he explici number of he colleced samples. Noe ha here we do no impose any consrains on he explici dicionary forma, which can be objec emplaes, image paches or even exraced feaures Muli-lifespan Dicionary Building The adapabiliy and robusness are he wo key characerisics ha a racker should possess. Adapabiliy means ha he racker should accommodae o arge appearance changes quickly, while robusness refers o he abiliy o keep on working under differen siuaions. These wo characerisics, however, ofen conradic wih each oher in many racking algorihms. As for emplae based objec racking, if he emplae is updaed wih a faser speed, he racker can beer adap o he changes of he arge bu (6) Algorihm Online dicionary learning for emplae updae Inpu: frame daa I, racking resuls x, learned dicionary D, C, Y in he previous frame, λ (regularizaion parameer), M (sample drawing number). Oupu: learned dicionary D in he curren frame. : Iniializaion: D D,C C,Y Y. 2: for i = M do 3: Sep : fixd o find he bes coefficiens, c (i) =argmin c R n 2 y(i) D c λ c. 4: Sep 2: fix{c (i) } o updae he dicionary, C C C c (i) D =argmin D D = ( i = C Y. +c (i) i j= j= c(j) c (i) C C c (i) 2 y(j) c (j), Y Y + y (i) c (i), Dc (j) λ c (j), ) ( i j= y(j) ) c (j), 5: end for 6: Save dicionary D, inermediae variable C and Y. may be more likely o drif due o noises accumulaed along wih fas updaing. On he conrary, if he emplae is updaed wih a slower speed, he racker is no easy o drif bu may no cach up wih he changes of he arge. Based on he formulaion of emplae updae using online dicionary learning, we explore he emporal properies of he learned dicionary and propose o build a muli-lifespan dicionary learning model o furher improve he racking effeciveness and guaranee adapabiliy and robusness simulaneously. In order o explore he properies of he online learned dicionary, we represen i using a 5-uple based on is learning procedure, i.e., D = D, C, Y, {y (i) s : e } M i=,λ, (7) where {y (i) s : e } M i= denoes all he candidaes sampled o rain he dicionary and compleely deerminae he learned dicionary ogeher wih regularizaion parameer λ. Here he subscrip s and e, i.e. he sar and end frame number of candidaes, reflec he emporal propery of he raining daa. By collecing raining candidaes from differen emporal inervals wih a corresponding sampling sraegy, we can learn dicionaries of muliple emporal properies. Muli-lifespan dicionaries provide a very good soluion o he conradicion when simulaneously pursuing he adapabiliy and robusness of he racker. As show in Figure 2, we simulaneously learn hree differen lifespan dicionaries, he Shor Lifespan Dicionary (SLD), he Middle Lifespan Dicionary (MLD), and he Here sampling sraegy refers o differen sampling variance and candidae number M in each frame. 668
5 Tracking Resul Learn SLD Learn MLD Learn LLD Negaive Samples Figure 3. Online dicionary learning for emplae updae. Line : racking resuls; Line 2-4: examples of he learned dicionaries a frame 00; Line 5-7: colleced negaive samples used for he discriminaive observaion model (see Secion 3.3). Long Lifespan Dicionary (LLD). The SLD is rained using he candidaes densely sampled only in he previous frame (i.e., s = ) and made he bes adapaion o he arge in curren frame. The LLD, on he conrary, is rained using accuraely sampled candidaes in all previous frames o esablish a robus objec appearance model (i.e., s =). Beween he SLD and LLD, he MLD ries o build an inermediae model ha compromises he modes buil by SLD and LLD (i.e., s =/2). Denoing SLD, MLD and LLD respecively as D S, D M and D L, he final online muli-lifespan dicionary learning model (OMDL) is represened as: D = { D S, D M, D L}. (8) In Figure 3, we give some examples of he hree lifespan dicionaries learned using he online dicionary learning algorihm. I can be observed ha he SLD successfully capures a more adapive objec appearance model, while he LLD builds a more robus objec appearance model. The MLD obains a good inermediae objec model ha balances he models buil by LLD and SLD Bayesian Sequenial Esimaion We deploy he OMDL model ino he Bayesian sequenial esimaion framework, which performs racking by solving he maximum a poserior (MAP) problem, ˆx =argmaxp(x y : ), (9) x where y : = {y,...,y } represens all he observaion candidaes unil he curren frame. The poserior probabiliy p(x y : ) is calculaed recursively by he Bayesian heorem using paricle filer [2], p(x y : ) p(x y ) p(x x )p(x y : )dx, (0) where p(x x ) is he dynamic model and p(x y ) is he observaion model. We employ he affine ransformaion o model he objec moion beween consecuive frames. The observaion model, which is of fundamenal imporance o he success of he racker, is modeled using he OMDL in boh generaive and discriminaive manners. The generaive observaion model using OMDL firs solves he problem min D P c y λ c, () c where D P = [ ] D S, D M, D L. Based on he soluion of his problem, he general observaion model is buil as: g(y x )= exp ( α D I c I y 2 2), (2) I {S,M,L} where superscrip I denoes he corresponding decomposiion of D and c, and α is a consan as in Eqn. (2). Here we fuse he reconsrucion confidences of he OMDL model equally o build he general observaion model. Alhough more sophisicaed sraegies, e.g. weighed fusing based on he reconsrucion error, can be adoped, we find his simple sraegy works well in he experimens. The discriminaive observaion model using OMDL firs collecs some background samples (denoed as D N, see Figure 3) around he arge in he previous frame and hen selecs he discriminaive feaures by solving he problem min D T s p λ s, (3) s where D =[D P, D N ] and p is he label vecor for D (+ for objec samples and - for background samples). The soluion of his problem is a vecor s wih indexes of non-zero elemens indicaing seleced feaures, which can be used o form he projecion marix P by removing all-zero rows of marix S =Diag(s 0). Afer solving min c D c y 2 2+λ c, wih D =PD, y =Py, (4) he discriminaive observaion model is buil as: d(y x )=exp ( β ( D P c P y 2 2 D N c N y 2 2)), (5) where he superscrip P and N are used o decompose D and c. The final observaion model is hen represened as, 4. Experimens p(y x ) g(y x )d(y x ). (6) We implemen he proposed approach in MATLAB and run he experimens on an Inel Core 3.4 GHz PC wih 4 GB memory. The regularizaion parameer λ in he sparse coding problems is fixed as 0.0. We use global objec emplae normalized o pixels as he raining daa o learn he muli-lifespan dicionary model. The dicionary numbers for he SLD, MLD and LLD are all se o 20 and incremenally learned wih 28, 8 and sample(s) respecively a every frame. The number of he negaive samples colleced a each frame is se o 60. The consan α and β o conrol he Gaussian kernel shape are se o 2.0 and 6.0 respecively. Noe ha hese parameers are fixed in all he experimens. We firs conduc experimens o compare he racking resuls using six differen emplae updae mehods. Then we evaluae he racking performance of our approach compared wih six sae-of-he-ar racking algorihms. A las, we give some analyses and discussions of our mehod. 669
6 Tracking Error (cener locaion disance) NU FU IU IU2 IU3 IU4 DLU Frame # (a) Tracking Error on car (b) Tracking Error on shaking (c) Tracking Error on faceocc2 (d) Tracking Error on animal Tracking Precision (overlap raio) NU FU IU IU2 IU3 IU4 DLU (e) Tracking Precision on car (f) Tracking Precision on shaking (g) Tracking Precision on faceocc Frame # (h) Tracking Precision on animal Figure 4. Tracking error and precision of seven differen mehods for emplae updae. The experimen is conduced on four challenging video sequences, including car, shaking, faceocc2 and animal. Bes viewed in original color PDF file. 4.. Templae Updae Mehod Evaluaion Templae updae is very imporan for objec racking, especially in complex scenes where he arge undergoes grea changes. We compare our dicionary learning mehod for emplae updae (DLU) wih six ypical ones, including no updaes (NU, using fixed emplaes), fully updae (FU, updaing he whole emplaes using he racking resuls in he curren frame), he inuiive updae mehod in [9] (IU) and [26] (IU2), he incremenal subspace learning mehod in [22] (IU3) and [3] (IU4). In order o concenrae on he emplae updae mehod and make a fair comparison, he emplaes in hese seven mehods are all buil from global arge appearances and he number of emplaes is se o 60. The effeciveness of he obained emplaes is judged by heir descripive power of he arge, which is evaluaed using he same measure generaed from Eqn. (2). The experimens are performed on four challenging image sequences, car, shaking, faceocc2 and animal (see Figure ) wih he same iniial recangles in he firs frame, which cover mos challenging siuaions for emplae updaing. We employ wo well-acceped merics, cener locaion disance and overlap raio, o respecively evaluae he racking error and precision of he seven emplae updae mehods. The cener locaion disance is normalized by he objec size. In Figure 4, we plo he full quaniaive experimenal resuls of he seven mehods on he four es sequences. Our dicionary learning mehod for emplae updae obains he minimal racking error and he highes racking precision on aggregae, especially on he es sequence animal, where all he oher emplae updae mehods fail o follow he deer running a high speed from he fifh frame bu only leaving our mehod o rack he arge unil he end of he sequence. I is really surprising ha he incremenal updae mehod in [22], which uses he eigenvecor of he arge samples as emplae and updaes i incremenally in he eigenspace, performs poorly on he four es sequences and even is no beer han he fixed emplae mehod and fully updae mehod. The reason behind his may be ha forcing he emplae o be orhoropic canno well adap o he challenging racking siuaions wih non-whie image noises, especially when using hese emplaes o perform sparse represenaion [23]. This may be he reason why Xu e al. [3] proposes a modified emplae updae mehod o beer deploy he subspace learning ino sparse represenaion. From Figure 4 i is observed ha fixed emplaes and fully updae mehod may perform well when he arge does no change much. Bu wih he accumulaion of racking errors and when he arge undergoes grea changes, hese wo mehods end o perform worse han oher four mehods using incremenal emplae updae. Noe ha in he car sequence, all he seven mehods fail o rack he car a abou he 300h frame when he car suddenly urns righ. This is because a generaive observaion model may no be enough o perform robus racking, which is also he reason why we deduce wo differen kinds of observaion models for he final algorihm in Secion Tracking Performance Evaluaion We furher evaluae he performance of our final racking approach on 0 video sequences popularly used in previous works [4, 4, 5, 28, 3, 0], including sylv, bike, david, woman, coke, jumping, and he four sequences used in he firs experimen. These en video sequences ogeher presen an even wider range of challenges o a racking algorihm (see Figure 5). The racking resuls are compared 670
7 Table 2. Average racking errors (in pixels). The bes and second bes resuls are respecively shown in red and blue colors. Sequence Frag IVT MIL VTD l MTT Ours sylv bike car david woman animal coke shaking jumping faceocc Average Table 3. Average racking precision. The bes and second bes resuls are respecively shown in red and blue colors. Sequence Frag IVT MIL VTD l MTT Ours sylv bike car david woman animal coke shaking jumping faceocc Average wih six sae-of-he-ar algorihms, he fragmen racker (Frag) [], he incremenal visual racking (IVT) algorihm [22], he muli-insance learning (MIL) racker [4], he visual racking decomposiion (VTD) mehod [4], he laes l -racker (l ) [5] and is muli-ask racking (MTT) version [27]. The implemenaions of hese algorihms are all provided by heir corresponding auhors wih suggesed parameer seings. To make a more fair comparison, we se he roaion parameers in he moion model of IVT, l, MTT and ours o be zero, since Frag, MIL and VTD do no roae he objec samples and he ground-ruhs of he es sequences also do no consider he roaion of he arge. All he seven algorihms are iniialized wih he same iniial bounding box according o he ground-ruh, wih oher parameers se as suggesed by heir corresponding auhors. We analyze he experimenal resuls boh quaniaively and qualiaively. Table 2 and 3 lis he average racking errors and precisions for all seven algorihms. The proposed racking approach, on he whole, performs well agains oher six algorihms, especially on he sequence sylv, woman, animal, coke, and jumping, on which some oher algorihms may fail o follow he arges bu ours can successfully rack hem unil he end of he sequence. The IVT, VTD and MTT also perform well on hese en sequences and can rack he arges in mos siuaions. Togeher wih he resuls in he firs experimen, i can be concluded ha he incremenal subspace learning mehod in IVT is more suiable o model he racking confidence direcly using he reconsrucion error over all he orhorhombic emplaes, raher han a few emplaes, which may lose oo much informaion. The emplaes learned using our dicionary learning mehod, on he conrary, can well adap o he racking daa, especially in he sparse coding based racking framework. In Figure 5, some example racking resuls are drawn o given a more vivid comparison. Due o he page limiaion, we provide more experimenal resuls in he supplemenary maerial Speed Analysis and Discussions Our racking algorihm runs a abou 2.5 fps in he curren MATLAB implemenaion wihou using opimizaion echnologies like parallel compuing or GPU acceleraion. Table 4 liss he speed of several popular l -rackers by running he codes provided by he corresponding auhors on our es plaform. For he firs wo l -rackers in Table 4, whose implemenaions are no publicly available, we calculae heir speed based on he repor from [5]. I can be observed ha our algorihm is faser han mos oher rackers. The main reason is ha our approach does no need o add he rivial emplaes as hose adoped in [9, 20, 5, 27] due o he design of observaion model. Therefore, alhough we use muli-lifespan dicionaries, he oal number of emplaes is grealy reduced, e.g., from 084 ( )o 60. Wha is more, currenly our learning for emplae updae is performed frame-by-frame for easy implemenaion, which may no be necessary for racking. I can be performed only every several frames, e.g., every five frames like in [28] and [3]. In ha implemenaion, he speed of he learning procedure can be furher improved. Table 4. Running speed comparison of several popular l -rackers. Algorihm [9] [20] [5] [27] [28] [3] Ours Speed 0.0fps 0.05fps fps 2fps 2.5fps 2.5fps 2.5fps 5. Conclusions and Fuure Work We sudy he emplae updae problem in he sparse coding based objec racking framework. We formulae he emplae updae problem as online dicionary learning, which make he emplae beer adap o he racking daa. We propose o learn a muli-lifespan dicionary o simulaneously ensure adapabiliy and robusness of he racker. The online learned muli-lifespan dicionary has been deployed ino he Bayesian sequenial esimaion framework using paricle filer o perform racking. Exensive experimens on challenging image sequences demonsrae he effeciveness of he proposed mehod. Currenly, he lifespan dicionary is only learned from global objec emplaes, and in our fuure work, we plan o add local image pach based dicionary o furher improve he racking performance. Acknowledgemen: This work is parly suppored by NSFC (Gran No ), he Naional 863 High-Tech R&D Program of China (Gran No. 202AA02504), he Naural Science Foundaion of Beijing (Gran No ), he Guangdong Naural Science Foundaion (Gran No. S ), and Singapore Minisry of Educaion (Gran No. MOE200-T2--087). 67
8 (a) sylv, in-plane and ou-of-plane roaions (b) bike, background cluering and fas moions (c) car, background cluering and illuminaion changes (d) david, scale variaions and viewpoin changes (e) woman, occlusions and viewpoin changes (f) animal, fas moions and blurs (g) coke, complex backgrounds and roaions (h) shaking, dynamic illuminaion changes and scale variaions (i) jumping, fas moions and blurs (j) faceocc2, occlusions and roaions Frag IVT MIL VTD L MTT Ours Figure 5. Example racking resuls of he seven differen algorihms. Our racking algorihm performs well agains he six sae-ofhe-ar racking algorihms, and works robusly and adapively under a lo of difficul siuaions, like complex backgrounds ((c) and (g)), illuminaion changes ((c) and (h)), roaions ((a) and (g)), fas moions ((b) and (c)), scale variaions ((d) and (h)), viewpoin changes ((d) and (e)), and occlusions ((e) and (j)). Bes viewed in original color PDF file. References [] A. Adam, E. Rivlin, and I. Shimshoni. Robus fragmens-based racking using he inegral hisogram. In CVPR, [2] M. Aharon, M. Elad, and A. Brucksein. K-SVD: An algorihm for designing overcomplee dicionaries for sparse represenaion. TSP, 54():43 22, [3] S. Avidan. Ensemble racking. TPAMI, 29(2):26 7, [4] B. Babenko, M. Yang, and S. Belongie. Robus objec racking wih online muliple insance learning. TPAMI, 33(8):69 32, 20. [5] C. Bao, Y. Wu, H. Ling, and H. Ji. Real ime robus l racker using acceleraed proximal gradien approach. In CVPR, 202. [6] M. Black and A. Jepson. Eigenracking: Robus maching and racking of ariculaed objecs using a view-based represenaion. IJCV, 25():63 84, 998. [7] D. Comaniciu and P. Meer. Kernel-based objec racking. TPAMI, 25(5):564 77, [8] K. Delgado, J. Murray, B. Rao, K. Engan, T. Lee, and T. Sejnowski. Dicionary learning algorihms for sparse represenaion. Neural Compu., 5(2):349 96, [9] B. Efron, T. Hasie, I. Johnsone, and R. Tibshirani. Leas angle regression. Ann. Sa., 32(2):407 5, [0] M. Godec, P. Roh, and H. Bischof. Hough-based racking of nonrigid objecs. CVIU, 7(0): , 203. [] H. Grabner, M. Grabner, and H. Bischof. Real-ime racking via online boosing. In BMVC, [2] M. Isard and A. Blake. Condensaion - condiional densiy propagaion for visual racking. IJCV, 29():5 28, 998. [3] X. Jia, H. Lu, and M. Yang. Visual racking via adapive srucural local sparse appearance model. In CVPR, 202. [4] J. Kwon and K. Lee. Visual racking decomposiion. In CVPR, 200. [5] Y. Li, H. Ai, T. Yamashia, S. Lao, and M. Kawade. Tracking in low frame rae video: A cascade paricle filer wih discriminaive observers of differen life spans. TPAMI, 30(0):728 40, [6] L. Ma, C. Wang, B. Xiao, and W. Zhou. Sparse represenaion for face recogniion based on discriminaive low-rank dicionary learning. In CVPR, 202. [7] J. Mairal, F. Bach, and J. Ponce. Task-driven dicionary learning. TPAMI, 34(4):79 804, 202. [8] J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online learning for marix facorizaion and sparse coding. JMLR, :9 60, 200. [9] X. Mei and H. Ling. Robus visual racking using l minimizaion. In ICCV, [20] X. Mei, H. Ling, Y. Wu, E. Blasch, and L. Bai. Minimum error bounded efficien l racker wih occlusion deecion. In CVPR, 20. [2] W. Press, S. Teukolsky, W. Veerling, and B. Flannery. Numerical Recipes: The Ar of Scienific Compuing (3rd Ediion). Cambridge Universiy Press, New York, [22] D. Ross, J. Lim, R. Lin, and M. Yang. Incremenal learning for robus visual racking. IJCV, 77(-3):25 4, [23] I. Tosic and P. Frossard. Dicionary learning. IEEE Signal Process. Mag., 28(2):27 38, 20. [24] M. Yaghoobi, T. Blumensah, and M. Davies. Dicionary learning for sparse approximaions wih he majorizaion mehod. TSP, 57(6):278 9, [25] A. Yilmaz, O. Javed, and M. Shah. Objec racking: A survey. ACM Compu. Surv., 38(4): 45, Aricle 3. [26] T. Zhang, B. Ghanem, S. Liu, and N. Ahuja. Low-rank sparse learning for robus visual racking. In ECCV, 202. [27] T. Zhang, B. Ghanem, S. Liu, and N. Ahuja. Robus visual racking via muli-ask sparse learning. In CVPR, 202. [28] W. Zhong, H. Lu, and M. Yang. Robus objec racking via sparsiybased collaboraive model. In CVPR,
Neural Network Model of the Backpropagation Algorithm
Neural Nework Model of he Backpropagaion Algorihm Rudolf Jakša Deparmen of Cyberneics and Arificial Inelligence Technical Universiy of Košice Lená 9, 4 Košice Slovakia jaksa@neuron.uke.sk Miroslav Karák
More informationFast Multi-task Learning for Query Spelling Correction
Fas Muli-ask Learning for Query Spelling Correcion Xu Sun Dep. of Saisical Science Cornell Universiy Ihaca, NY 14853 xusun@cornell.edu Anshumali Shrivasava Dep. of Compuer Science Cornell Universiy Ihaca,
More informationAn Effiecient Approach for Resource Auto-Scaling in Cloud Environments
Inernaional Journal of Elecrical and Compuer Engineering (IJECE) Vol. 6, No. 5, Ocober 2016, pp. 2415~2424 ISSN: 2088-8708, DOI: 10.11591/ijece.v6i5.10639 2415 An Effiecien Approach for Resource Auo-Scaling
More informationMore Accurate Question Answering on Freebase
More Accurae Quesion Answering on Freebase Hannah Bas, Elmar Haussmann Deparmen of Compuer Science Universiy of Freiburg 79110 Freiburg, Germany {bas, haussmann}@informaik.uni-freiburg.de ABSTRACT Real-world
More informationChannel Mapping using Bidirectional Long Short-Term Memory for Dereverberation in Hands-Free Voice Controlled Devices
Z. Zhang e al.: Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion in Hands-Free Voice Conrolled Devices 525 Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion
More informationMyLab & Mastering Business
MyLab & Masering Business Efficacy Repor 2013 MyLab & Masering: Business Efficacy Repor 2013 Edied by Michelle D. Speckler 2013 Pearson MyAccouningLab, MyEconLab, MyFinanceLab, MyMarkeingLab, and MyOMLab
More information1 Language universals
AS LX 500 Topics: Language Uniersals Fall 2010, Sepember 21 4a. Anisymmery 1 Language uniersals Subjec-erb agreemen and order Bach (1971) discusses wh-quesions across SO and SO languages, hypohesizing:...
More informationInformation Propagation for informing Special Population Subgroups about New Ground Transportation Services at Airports
Downloaded from ascelibrary.org by Basil Sephanis on 07/13/16. Copyrigh ASCE. For personal use only; all righs reserved. Informaion Propagaion for informing Special Populaion Subgroups abou New Ground
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationSpeech Emotion Recognition Using Support Vector Machine
Speech Emotion Recognition Using Support Vector Machine Yixiong Pan, Peipei Shen and Liping Shen Department of Computer Technology Shanghai JiaoTong University, Shanghai, China panyixiong@sjtu.edu.cn,
More informationSemi-Supervised Face Detection
Semi-Supervised Face Detection Nicu Sebe, Ira Cohen 2, Thomas S. Huang 3, Theo Gevers Faculty of Science, University of Amsterdam, The Netherlands 2 HP Research Labs, USA 3 Beckman Institute, University
More informationRule Learning With Negation: Issues Regarding Effectiveness
Rule Learning With Negation: Issues Regarding Effectiveness S. Chua, F. Coenen, G. Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX Liverpool, United
More informationACTIVITY: Comparing Combination Locks
5.4 Compound Events outcomes of one or more events? ow can you find the number of possible ACIVIY: Comparing Combination Locks Work with a partner. You are buying a combination lock. You have three choices.
More informationNational Taiwan Normal University - List of Presidents
National Taiwan Normal University - List of Presidents 1st Chancellor Li Ji-gu (Term of Office: 1946.5 ~1948.6) Chancellor Li Ji-gu (1895-1968), former name Zong Wu, from Zhejiang, Shaoxing. Graduated
More informationLEGO MINDSTORMS Education EV3 Coding Activities
LEGO MINDSTORMS Education EV3 Coding Activities s t e e h s k r o W t n e d Stu LEGOeducation.com/MINDSTORMS Contents ACTIVITY 1 Performing a Three Point Turn 3-6 ACTIVITY 2 Written Instructions for a
More informationarxiv: v1 [math.at] 10 Jan 2016
THE ALGEBRAIC ATIYAH-HIRZEBRUCH SPECTRAL SEQUENCE OF REAL PROJECTIVE SPECTRA arxiv:1601.02185v1 [math.at] 10 Jan 2016 GUOZHEN WANG AND ZHOULI XU Abstract. In this note, we use Curtis s algorithm and the
More informationIntroduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition
Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition Todd Holloway Two Lecture Series for B551 November 20 & 27, 2007 Indiana University Outline Introduction Bias and
More informationRule Learning with Negation: Issues Regarding Effectiveness
Rule Learning with Negation: Issues Regarding Effectiveness Stephanie Chua, Frans Coenen, and Grant Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationAustralian Journal of Basic and Applied Sciences
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Feature Selection Technique Using Principal Component Analysis For Improving Fuzzy C-Mean
More informationModel Ensemble for Click Prediction in Bing Search Ads
Model Ensemble for Click Prediction in Bing Search Ads Xiaoliang Ling Microsoft Bing xiaoling@microsoft.com Hucheng Zhou Microsoft Research huzho@microsoft.com Weiwei Deng Microsoft Bing dedeng@microsoft.com
More informationThe University of Amsterdam s Concept Detection System at ImageCLEF 2011
The University of Amsterdam s Concept Detection System at ImageCLEF 2011 Koen E. A. van de Sande and Cees G. M. Snoek Intelligent Systems Lab Amsterdam, University of Amsterdam Software available from:
More informationCLASSIFICATION OF TEXT DOCUMENTS USING INTEGER REPRESENTATION AND REGRESSION: AN INTEGRATED APPROACH
ISSN: 0976-3104 Danti and Bhushan. ARTICLE OPEN ACCESS CLASSIFICATION OF TEXT DOCUMENTS USING INTEGER REPRESENTATION AND REGRESSION: AN INTEGRATED APPROACH Ajit Danti 1 and SN Bharath Bhushan 2* 1 Department
More informationProduct Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments
Product Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments Vijayshri Ramkrishna Ingale PG Student, Department of Computer Engineering JSPM s Imperial College of Engineering &
More informationAssignment 1: Predicting Amazon Review Ratings
Assignment 1: Predicting Amazon Review Ratings 1 Dataset Analysis Richard Park r2park@acsmail.ucsd.edu February 23, 2015 The dataset selected for this assignment comes from the set of Amazon reviews for
More informationMachine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler
Machine Learning and Data Mining Ensembles of Learners Prof. Alexander Ihler Ensemble methods Why learn one classifier when you can learn many? Ensemble: combine many predictors (Weighted) combina
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationGenerative models and adversarial training
Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?
More informationSemi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration
INTERSPEECH 2013 Semi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration Yan Huang, Dong Yu, Yifan Gong, and Chaojun Liu Microsoft Corporation, One
More informationA Study of Video Effects on English Listening Comprehension
Studies in Literature and Language Vol. 8, No. 2, 2014, pp. 53-58 DOI:10.3968/4348 ISSN 1923-1555[Print] ISSN 1923-1563[Online] www.cscanada.net www.cscanada.org Study of Video Effects on English Listening
More informationTransfer Learning Action Models by Measuring the Similarity of Different Domains
Transfer Learning Action Models by Measuring the Similarity of Different Domains Hankui Zhuo 1, Qiang Yang 2, and Lei Li 1 1 Software Research Institute, Sun Yat-sen University, Guangzhou, China. zhuohank@gmail.com,lnslilei@mail.sysu.edu.cn
More informationClass-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification
Class-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification Tomi Kinnunen and Ismo Kärkkäinen University of Joensuu, Department of Computer Science, P.O. Box 111, 80101 JOENSUU,
More informationThe Current Situations of International Cooperation and Exchange and Future Expectations of Guangzhou Ploytechnic of Sports
The Current Situations of International Cooperation and Exchange and Future Expectations of Guangzhou Ploytechnic of Sports It plans to enroll students officially in 2015 Sports services and management
More informationarxiv: v1 [cs.lg] 3 May 2013
Feature Selection Based on Term Frequency and T-Test for Text Categorization Deqing Wang dqwang@nlsde.buaa.edu.cn Hui Zhang hzhang@nlsde.buaa.edu.cn Rui Liu, Weifeng Lv {liurui,lwf}@nlsde.buaa.edu.cn arxiv:1305.0638v1
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationWHEN THERE IS A mismatch between the acoustic
808 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 14, NO. 3, MAY 2006 Optimization of Temporal Filters for Constructing Robust Features in Speech Recognition Jeih-Weih Hung, Member,
More informationDOMAIN MISMATCH COMPENSATION FOR SPEAKER RECOGNITION USING A LIBRARY OF WHITENERS. Elliot Singer and Douglas Reynolds
DOMAIN MISMATCH COMPENSATION FOR SPEAKER RECOGNITION USING A LIBRARY OF WHITENERS Elliot Singer and Douglas Reynolds Massachusetts Institute of Technology Lincoln Laboratory {es,dar}@ll.mit.edu ABSTRACT
More informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationDeep Facial Action Unit Recognition from Partially Labeled Data
Deep Facial Action Unit Recognition from Partially Labeled Data Shan Wu 1, Shangfei Wang,1, Bowen Pan 1, and Qiang Ji 2 1 University of Science and Technology of China, Hefei, Anhui, China 2 Rensselaer
More informationConstructing Parallel Corpus from Movie Subtitles
Constructing Parallel Corpus from Movie Subtitles Han Xiao 1 and Xiaojie Wang 2 1 School of Information Engineering, Beijing University of Post and Telecommunications artex.xh@gmail.com 2 CISTR, Beijing
More informationEmpirical research on implementation of full English teaching mode in the professional courses of the engineering doctoral students
Empirical research on implementation of full English teaching mode in the professional courses of the engineering doctoral students Yunxia Zhang & Li Li College of Electronics and Information Engineering,
More informationWhy Is the Chinese Curriculum Difficult for Immigrants Children from Southeast Asia
Why Is the Chinese Curriculum Difficult for Immigrants Children from Southeast Asia Chiu-Jung Chen 1,* 1 Department of E-Learning, Design and Management, National Chia-yi University, Taiwan *Correspondence:
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationA survey of multi-view machine learning
Noname manuscript No. (will be inserted by the editor) A survey of multi-view machine learning Shiliang Sun Received: date / Accepted: date Abstract Multi-view learning or learning with multiple distinct
More informationSemantic Segmentation with Histological Image Data: Cancer Cell vs. Stroma
Semantic Segmentation with Histological Image Data: Cancer Cell vs. Stroma Adam Abdulhamid Stanford University 450 Serra Mall, Stanford, CA 94305 adama94@cs.stanford.edu Abstract With the introduction
More informationLOW-RANK AND SPARSE SOFT TARGETS TO LEARN BETTER DNN ACOUSTIC MODELS
LOW-RANK AND SPARSE SOFT TARGETS TO LEARN BETTER DNN ACOUSTIC MODELS Pranay Dighe Afsaneh Asaei Hervé Bourlard Idiap Research Institute, Martigny, Switzerland École Polytechnique Fédérale de Lausanne (EPFL),
More informationarxiv: v1 [cs.cv] 2 Jun 2017
Temporal Action Labeling using Action Sets Alexander Richard, Hilde Kuehne, Juergen Gall University of Bonn, Germany {richard,kuehne,gall}@iai.uni-bonn.de arxiv:1706.00699v1 [cs.cv] 2 Jun 2017 Abstract
More informationNCU IISR English-Korean and English-Chinese Named Entity Transliteration Using Different Grapheme Segmentation Approaches
NCU IISR English-Korean and English-Chinese Named Entity Transliteration Using Different Grapheme Segmentation Approaches Yu-Chun Wang Chun-Kai Wu Richard Tzong-Han Tsai Department of Computer Science
More informationCommon Core Exemplar for English Language Arts and Social Studies: GRADE 1
The Common Core State Standards and the Social Studies: Preparing Young Students for College, Career, and Citizenship Common Core Exemplar for English Language Arts and Social Studies: Why We Need Rules
More informationSyntactic Patterns versus Word Alignment: Extracting Opinion Targets from Online Reviews
Syntactic Patterns versus Word Alignment: Extracting Opinion Targets from Online Reviews Kang Liu, Liheng Xu and Jun Zhao National Laboratory of Pattern Recognition Institute of Automation, Chinese Academy
More informationComment-based Multi-View Clustering of Web 2.0 Items
Comment-based Multi-View Clustering of Web 2.0 Items Xiangnan He 1 Min-Yen Kan 1 Peichu Xie 2 Xiao Chen 3 1 School of Computing, National University of Singapore 2 Department of Mathematics, National University
More informationBAUM-WELCH TRAINING FOR SEGMENT-BASED SPEECH RECOGNITION. Han Shu, I. Lee Hetherington, and James Glass
BAUM-WELCH TRAINING FOR SEGMENT-BASED SPEECH RECOGNITION Han Shu, I. Lee Hetherington, and James Glass Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge,
More informationIdentification of Opinion Leaders Using Text Mining Technique in Virtual Community
Identification of Opinion Leaders Using Text Mining Technique in Virtual Community Chihli Hung Department of Information Management Chung Yuan Christian University Taiwan 32023, R.O.C. chihli@cycu.edu.tw
More informationSpeech Recognition at ICSI: Broadcast News and beyond
Speech Recognition at ICSI: Broadcast News and beyond Dan Ellis International Computer Science Institute, Berkeley CA Outline 1 2 3 The DARPA Broadcast News task Aspects of ICSI
More informationAn Introduction to Simio for Beginners
An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality
More informationImpact of Cluster Validity Measures on Performance of Hybrid Models Based on K-means and Decision Trees
Impact of Cluster Validity Measures on Performance of Hybrid Models Based on K-means and Decision Trees Mariusz Łapczy ski 1 and Bartłomiej Jefma ski 2 1 The Chair of Market Analysis and Marketing Research,
More informationFaculty Schedule Preference Survey Results
Faculty Schedule Preference Survey Results Surveys were distributed to all 199 faculty mailboxes with information about moving to a 16 week calendar followed by asking their calendar schedule. Objective
More informationLinking the Ohio State Assessments to NWEA MAP Growth Tests *
Linking the Ohio State Assessments to NWEA MAP Growth Tests * *As of June 2017 Measures of Academic Progress (MAP ) is known as MAP Growth. August 2016 Introduction Northwest Evaluation Association (NWEA
More informationMultiple Intelligence Theory into College Sports Option Class in the Study To Class, for Example Table Tennis
Multiple Intelligence Theory into College Sports Option Class in the Study ------- To Class, for Example Table Tennis LIANG Huawei School of Physical Education, Henan Polytechnic University, China, 454
More informationBLACKBOARD TRAINING PHASE 2 CREATE ASSESSMENT. Essential Tool Part 1 Rubrics, page 3-4. Assignment Tool Part 2 Assignments, page 5-10
BLACKBOARD TRAINING PHASE 2 CREATE ASSESSMENT Essential Tool Part 1 Rubrics, page 3-4 Assignment Tool Part 2 Assignments, page 5-10 Review Tool Part 3 SafeAssign, page 11-13 Assessment Tool Part 4 Test,
More informationPython Machine Learning
Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled
More informationEssentials of Ability Testing. Joni Lakin Assistant Professor Educational Foundations, Leadership, and Technology
Essentials of Ability Testing Joni Lakin Assistant Professor Educational Foundations, Leadership, and Technology Basic Topics Why do we administer ability tests? What do ability tests measure? How are
More informationEileen Bau CIE/USA-DFW 2014
Eileen Bau Frisco Liberty High School, 10 th Grade DECA International Development Career Conference (2013 and 2014) 1 st Place Editor/Head of Communications (LHS Key Club) Grand Champion at International
More informationRedirected Inbound Call Sampling An Example of Fit for Purpose Non-probability Sample Design
Redirected Inbound Call Sampling An Example of Fit for Purpose Non-probability Sample Design Burton Levine Karol Krotki NISS/WSS Workshop on Inference from Nonprobability Samples September 25, 2017 RTI
More informationMachine Learning and Development Policy
Machine Learning and Development Policy Sendhil Mullainathan (joint papers with Jon Kleinberg, Himabindu Lakkaraju, Jure Leskovec, Jens Ludwig, Ziad Obermeyer) Magic? Hard not to be wowed But what makes
More informationOVERVIEW OF CURRICULUM-BASED MEASUREMENT AS A GENERAL OUTCOME MEASURE
OVERVIEW OF CURRICULUM-BASED MEASUREMENT AS A GENERAL OUTCOME MEASURE Mark R. Shinn, Ph.D. Michelle M. Shinn, Ph.D. Formative Evaluation to Inform Teaching Summative Assessment: Culmination measure. Mastery
More informationMathematics subject curriculum
Mathematics subject curriculum Dette er ei omsetjing av den fastsette læreplanteksten. Læreplanen er fastsett på Nynorsk Established as a Regulation by the Ministry of Education and Research on 24 June
More informationE mail: Phone: LIBRARY MBA MAIN OFFICE
MASTER OF BUSINESS ADMINISTRATION 1 Jennifer Brandow, MBA Director E mail: mba@wsc.edu Phone: 402.375.7587 MBA OFFICE Gardner Hall 106 1111 Main St. Wayne, NE 68787 ADMISSIONS 402.375.7234 admissions@wsc.edu
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationSystem Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks
System Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks 1 Tzu-Hsuan Yang, 2 Tzu-Hsuan Tseng, and 3 Chia-Ping Chen Department of Computer Science and Engineering
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationRobust Speech Recognition using DNN-HMM Acoustic Model Combining Noise-aware training with Spectral Subtraction
INTERSPEECH 2015 Robust Speech Recognition using DNN-HMM Acoustic Model Combining Noise-aware training with Spectral Subtraction Akihiro Abe, Kazumasa Yamamoto, Seiichi Nakagawa Department of Computer
More informationAirplane Rescue: Social Studies. LEGO, the LEGO logo, and WEDO are trademarks of the LEGO Group The LEGO Group.
Airplane Rescue: Social Studies LEGO, the LEGO logo, and WEDO are trademarks of the LEGO Group. 2010 The LEGO Group. Lesson Overview The students will discuss ways that people use land and their physical
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationIn Workflow. Viewing: Last edit: 10/27/15 1:51 pm. Approval Path. Date Submi ed: 10/09/15 2:47 pm. 6. Coordinator Curriculum Management
1 of 5 11/19/2015 8:10 AM Date Submi ed: 10/09/15 2:47 pm Viewing: Last edit: 10/27/15 1:51 pm Changes proposed by: GODWINH In Workflow 1. BUSI Editor 2. BUSI Chair 3. BU Associate Dean 4. Biggio Center
More informationPREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES
PREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES Po-Sen Huang, Kshitiz Kumar, Chaojun Liu, Yifan Gong, Li Deng Department of Electrical and Computer Engineering,
More informationOn-the-Fly Customization of Automated Essay Scoring
Research Report On-the-Fly Customization of Automated Essay Scoring Yigal Attali Research & Development December 2007 RR-07-42 On-the-Fly Customization of Automated Essay Scoring Yigal Attali ETS, Princeton,
More informationMathematics. Mathematics
Mathematics Program Description Successful completion of this major will assure competence in mathematics through differential and integral calculus, providing an adequate background for employment in
More informationCurriculum Design Project with Virtual Manipulatives. Gwenanne Salkind. George Mason University EDCI 856. Dr. Patricia Moyer-Packenham
Curriculum Design Project with Virtual Manipulatives Gwenanne Salkind George Mason University EDCI 856 Dr. Patricia Moyer-Packenham Spring 2006 Curriculum Design Project with Virtual Manipulatives Table
More informationFUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria
FUZZY EXPERT SYSTEMS 16-18 18 February 2002 University of Damascus-Syria Dr. Kasim M. Al-Aubidy Computer Eng. Dept. Philadelphia University What is Expert Systems? ES are computer programs that emulate
More informationWord Segmentation of Off-line Handwritten Documents
Word Segmentation of Off-line Handwritten Documents Chen Huang and Sargur N. Srihari {chuang5, srihari}@cedar.buffalo.edu Center of Excellence for Document Analysis and Recognition (CEDAR), Department
More informationMathematics process categories
Mathematics process categories All of the UK curricula define multiple categories of mathematical proficiency that require students to be able to use and apply mathematics, beyond simple recall of facts
More informationFoundations of Knowledge Representation in Cyc
Foundations of Knowledge Representation in Cyc Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories This is an introduction to the foundations of knowledge representation
More informationThe Evolution of Random Phenomena
The Evolution of Random Phenomena A Look at Markov Chains Glen Wang glenw@uchicago.edu Splash! Chicago: Winter Cascade 2012 Lecture 1: What is Randomness? What is randomness? Can you think of some examples
More informationCollege Pricing. Ben Johnson. April 30, Abstract. Colleges in the United States price discriminate based on student characteristics
College Pricing Ben Johnson April 30, 2012 Abstract Colleges in the United States price discriminate based on student characteristics such as ability and income. This paper develops a model of college
More informationProbability estimates in a scenario tree
101 Chapter 11 Probability estimates in a scenario tree An expert is a person who has made all the mistakes that can be made in a very narrow field. Niels Bohr (1885 1962) Scenario trees require many numbers.
More informationAttributed Social Network Embedding
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, MAY 2017 1 Attributed Social Network Embedding arxiv:1705.04969v1 [cs.si] 14 May 2017 Lizi Liao, Xiangnan He, Hanwang Zhang, and Tat-Seng Chua Abstract Embedding
More information*Net Perceptions, Inc West 78th Street Suite 300 Minneapolis, MN
From: AAAI Technical Report WS-98-08. Compilation copyright 1998, AAAI (www.aaai.org). All rights reserved. Recommender Systems: A GroupLens Perspective Joseph A. Konstan *t, John Riedl *t, AI Borchers,
More informationFirst Grade Standards
These are the standards for what is taught throughout the year in First Grade. It is the expectation that these skills will be reinforced after they have been taught. Mathematical Practice Standards Taught
More informationOPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS
OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,
More informationWiggleWorks Software Manual PDF0049 (PDF) Houghton Mifflin Harcourt Publishing Company
WiggleWorks Software Manual PDF0049 (PDF) Houghton Mifflin Harcourt Publishing Company Table of Contents Welcome to WiggleWorks... 3 Program Materials... 3 WiggleWorks Teacher Software... 4 Logging In...
More informationTaxonomy-Regularized Semantic Deep Convolutional Neural Networks
Taxonomy-Regularized Semantic Deep Convolutional Neural Networks Wonjoon Goo 1, Juyong Kim 1, Gunhee Kim 1, Sung Ju Hwang 2 1 Computer Science and Engineering, Seoul National University, Seoul, Korea 2
More informationDetecting English-French Cognates Using Orthographic Edit Distance
Detecting English-French Cognates Using Orthographic Edit Distance Qiongkai Xu 1,2, Albert Chen 1, Chang i 1 1 The Australian National University, College of Engineering and Computer Science 2 National
More informationarxiv: v1 [cs.lg] 15 Jun 2015
Dual Memory Architectures for Fast Deep Learning of Stream Data via an Online-Incremental-Transfer Strategy arxiv:1506.04477v1 [cs.lg] 15 Jun 2015 Sang-Woo Lee Min-Oh Heo School of Computer Science and
More informationJ j W w. Write. Name. Max Takes the Train. Handwriting Letters Jj, Ww: Words with j, w 321
Write J j W w Jen Will Directions Have children write a row of each letter and then write the words. Home Activity Ask your child to write each letter and tell you how to make the letter. Handwriting Letters
More informationMassachusetts Institute of Technology Tel: Massachusetts Avenue Room 32-D558 MA 02139
Hariharan Narayanan Massachusetts Institute of Technology Tel: 773.428.3115 LIDS har@mit.edu 77 Massachusetts Avenue http://www.mit.edu/~har Room 32-D558 MA 02139 EMPLOYMENT Massachusetts Institute of
More informationCourse Outline. Course Grading. Where to go for help. Academic Integrity. EE-589 Introduction to Neural Networks NN 1 EE
EE-589 Introduction to Neural Assistant Prof. Dr. Turgay IBRIKCI Room # 305 (322) 338 6868 / 139 Wensdays 9:00-12:00 Course Outline The course is divided in two parts: theory and practice. 1. Theory covers
More informationEnd-of-Module Assessment Task
Student Name Date 1 Date 2 Date 3 Topic E: Decompositions of 9 and 10 into Number Pairs Topic E Rubric Score: Time Elapsed: Topic F Topic G Topic H Materials: (S) Personal white board, number bond mat,
More informationA simulated annealing and hill-climbing algorithm for the traveling tournament problem
European Journal of Operational Research xxx (2005) xxx xxx Discrete Optimization A simulated annealing and hill-climbing algorithm for the traveling tournament problem A. Lim a, B. Rodrigues b, *, X.
More information