Size: px
Start display at page:

Download "0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2"

Transcription

1 IEEE CVPR 000 Real-Time Trackin of Non-Riid Objects usin Mean Sift Dorin Comaniciu Visvanatan Rames Peter Meer Imain & Visualization Department Electrical & Computer Enineerin Department Siemens Corporate Researc Ruters University 755 Collee Road East, Princeton, NJ Brett Road, Piscataway, NJ Abstract A new metod for real-time trackin of non-riid objects seen from a movin camera isproposed. Te central computational module is based on te mean sift iterations and nds te most probable taret position in te current frame. Te dissimilarity between te taret model (its color distribution) and te taret candidates is expressed by a metric derived from te Battacaryya coecient. Te teoretical analysis of te approac sows tat it relates to te Bayesian framework wile providin a practical, fast and ecient solution. Te capability of te tracker to andle in real-time partial occlusions, sinicant clutter, and taret scale variations, is demonstrated for several imae sequences. Introduction Te ecient trackin of visual features in complex environments is a callenin task for te vision community. Real-time applications suc as surveillance and monitorin [0], perceptual user interfaces [4], smart rooms [6, 8], and video compression [] all require te ability to track movin objects. Te computational complexity of te tracker is critical for most applications, only a small percentae of a system resources bein allocated for trackin, wile te rest is assined to preprocessin staes or to i-level tasks suc as reconition, trajectory interpretation, and reasonin [4]. Tis paper presents a new approac to te real-time trackin of non-riid objects based on visual features suc as color and/or texture, wose statistical distributions caracterize te object of interest. Te proposed trackin is appropriate for a lare variety of objects wit dierent color/texture patterns, bein robust to partial occlusions, clutter, rotation in dept, and canes in camera position. It is a natural application to motion analysis of te mean sift procedure introduced earlier [6, 7]. Te mean sift iterations are employed to nd te taret candidate tat is te most similar to a iven taret model, wit te similarity bein expressed by a metric based on te Battacaryya coecient. Various test sequences sowed te superior trackin performance, obtained wit low computational complexity. Te paper is oranized as follows. Section presents and extends te mean sift property. Section 3 introduces te metric derived from te Battacaryya coef- cient. Te trackin aloritm is developed and analyzed in Section 4. Experiments and comparisons are iven in Section 5, and te discussions are in Section 6. Mean Sift Analysis We dene next te sample mean sift, introduce te iterative mean sift procedure, and present a new teorem sowin te converence for kernels wit convex and monotonic proles. For applications of te mean sift property in low level vision (lterin, sementation) see [6].. Sample Mean Sift Given a set f :::n of n points in te d- dimensional space R d, te multivariate kernel density estimate wit kernel K(x) and window radius (bandwidt), computed in te point s iven by ^f(x) = n d K x ; xi : () Te minimization of te averae lobal error between te estimate and te true density yields te multivariate Epanecnikovkernel [5, p.39] K E (x) = c; d (d + )( ;kxk ) if kxk < 0 oterwise () were c d is te volume of te unit d-dimensional spere. Anoter commonly used kernel is te multivariate normal K N (x) =() ;d= exp ; kxk : (3) Let us introduce te prole of a kernel K as a function k : [0 )! R suc tat K(x) = k(kxk ). For example, accordin to () te Epanecnikov prole is k E (x) = c; d (d + )( ; x) if x< 0 oterwise (4) and from (3) te normal prole is iven by k N (x) =() ;d= exp ; x : (5) Employin te prole notation we can write te density estimate () as ^f K (x) = n d k x ;! : (6) We denote (x) =;k 0 (x) (7) assumin tat te derivative of k exists for all x [0 ), except for a nite set of points. A kernel G can be dened as G(x) =C(kxk ) (8)

2 were C is a normalization constant. Ten, by takin te estimate of te density radient as te radient of te density estimate we ave ^rf K (x) r^f K (x)= n d+ = n d+ " ( ; x) x ;!# 4 x ; x ; x (x ; ) k 0 i! = x; x; n d+ 3 ;x! 5 (9) can be assumed to be were x; nonzero. Note tat te derivative of te Epanecnikov prole is te uniform prole, wile te derivative ofte normal prole remains a normal. Te last bracket in (9) contains te sample mean sift vector M G (x) and te density estimate at x ^f G (x) x i x; x; C n d ; x (0)! x ; () computed wit kernel G. Usin now (0) and (), (9) becomes ^rf K (x) = ^fg (x) =C M G(x) () from were it follows tat M G (x) = ^rf K (x) =C ^f G (x) : (3) Expression (3) sows tat te sample mean sift vector obtained wit kernel G is an estimate of te normalized density radient obtained wit kernel K. Tis is a more eneral formulation of te property rst remarked by Fukunaa [5, p.535]. j= :::. A Sucient Converence Condition Te mean sift procedure is dened recursively by computin te mean sift vector M G (x) and translatin te centerofkernel G by M G (x). Let us denote by y j te sequence of successive locations of te kernel G, were y j+ = x i y j ; y j ; j = ::: (4) is te weited mean at y j computed wit kernel G and y is te center of te initial kernel. Te density estimates computed wit kernel K in te points (4) are n o n o ^f K = ^fk (j) ^fk (y j ) : (5) j= ::: j= ::: Tese densities are only implicitly dened to obtain ^rf K. However we need tem to prove te converence of te sequences (4) and (5). Teorem If te kernel K as a convex and monotonic decreasin prole and te kernel G is dened accordin to (7) and (8), te sequences (4) and (5) are converent. Te Teorem eneralizes te converence sown in [6], were K was te Epanecnikov kernel, and G te uniform kernel. Its proof is iven in te Appendix. Note tat Teorem is also valid wen we associate to eac datapoint a positive weit w i. 3 Battacaryya Coecient Based Metric for Taret Localization Te task of ndin te taret location in te current frame is formulated as follows. Te feature z representin te color and/or texture of te taret model is assumed to ave a density function q z, wile te taret candidate centered at location y as te feature distributed accordin to p z (y). Te problem is ten to nd te discrete location y wose associated density p z (y) is te most similar to te taret density q z. To dene te similarity measure we takeinto account tat te probability of classication error in statistical ypotesis testin is directly related to te similarity of te two distributions. Te larer te probability of error, te more similar te distributions. Terefore, (contrary to te ypotesis testin), we formulate te taret location estimation problem as te derivation of te estimate tat maximizes te Bayes error associated wit te model and candidate distributions. For te moment, we assume tat te taret as equal prior probability to be presentatany location y in te neiborood of te previously estimated location. An entity closely related to te Bayes error is te Battacaryya coecient, wose eneral form is de- ned by [9] Z ppz (y) [p(y) q]= (y)q z dz : (6) Properties of te Battacaryya coecient suc as its relation to te Fiser measure of information, quality of te sample estimate, and explicit forms for various distributions are iven in [, 9]. Our interest in expression (6) is, owever, motivated by its near optimality iven by te relationsip to te Bayes error. Indeed, let us denote by and two sets of parameters for te distributions p and q and by =( p q ) a set of prior probabilities. If te value of (6) is smaller for te set tan for te set, it

3 can be proved [9] tat, tere exists a set of priors for wic te error probability for te set is less tan te error probability for te set. In addition, startin from (6) upper and lower error bounds can be derived for te probability of error. Te derivation of te Battacaryya coecient from sample data involves te estimation of te densities p and q, for wic we employ te istoram formulation. Altou not te best nonparametric density estimate [5], te istoram satises te low computational cost imposed by real-time processin. We estimate te discrete density ^q P m = f^q u :::m (wit ^q u = ) from te m-bin istoram of P te taret model, wile m ^p(y) =f^p u (y) :::m (wit ^p u = ) is estimated at a iven location y from te m-bin istoram of te taret candidate. Hence, te sample estimate of te Battacaryya coecient isiven by ^(y) [^p(y) ^q] = p^pu (y)^q u : (7) Te eometric interpretation of (7) is te cosine of te anle between te m-dimensional, unit vectors ;p^p ::: p^p m > and ;p^q ::: p^q m >. Usin now (7) te distance between two distributions can be dened as d(y) = p ; [^p(y) ^q] : (8) Te statistical measure (8) is well suited for te task of taret localization since:. It is nearly optimal, due to its link to te Bayes error. Note tat te widely used istoram intersection tecnique [6] as no suc teoretical foundation.. It imposes a metric structure (see Appendix). Te Battacaryya distance [5, p.99] or Kullback diverence [8, p.8] are not metrics since tey violate at least one of te distance axioms. 3. Usin discrete densities, (8) is invariant to te scale of te taret (up to quantization eects). Historam intersection is scale variant [6]. 4. Bein valid for arbitrary distributions, te distance (8) is superior to te Fiser linear discriminant, wic yields useful results only for distributions tat are separated by te mean-dierence [5, p.3]. Similar measures were already used in computer vision. Te Cerno and Battacaryya bounds ave been employed in [0] to determine te eectiveness of ede detectors. Te Kullback diverence as been used in [7] for ndin te pose of an object in an imae. Te next section sows ow to minimize (8) as a function of y in te neiborood of a iven location, by exploitin te mean sift iterations. Only te distribution of te object colors will be considered, altou te texture distribution can be interated into te same framework. 4 Trackin Aloritm We assume in te sequel te support of two modules wic sould provide (a) detection and localization in te initial frame of te objects to track (tarets) [, 3], and (b) periodic analysis of eac object to account for possible updates of te taret models due to sinicant canes in color []. 4. Color Representation Taret Model Let fx? i :::n be te pixel locations of te taret model, centered at 0. We dene a function b : R! f :::m wic associates to te pixel at location x? i te index b(x? i ) of te istoram bin correspondin to te color of tat pixel. Te probability of te color u in te taret model is derived by employin a convex and monotonic decreasin kernel prole k wic assins a smaller weit to te locations tat are farter from te center of te taret. Te weitin increases te robustness of te estimation, since te periperal pixels are te least reliable, bein often aected by occlusions (clutter) or backround. Te radius of te kernel prole is taken equal to one, by assumin tat te eneric coordinates x and y are normalized wit x and y, respectively. Hence, we can write ^q u = C k(kx? i k ) [b(x? i ) ; u] (9) were is te Kronecker delta function. Te normalization constant C is derived by imposin te condition P m ^q u =, from were C = k(kx? i k ) (0) since te summation of delta functions for u =:::m is equal to one. Taret Candidates Let f :::n be te pixel locations of te taret candidate, centered at y in te current frame. Usin te same kernel prole k, but wit radius, te probability of te color u in te taret candidate is iven by X ^p u (y) =C n k! y ; [b(x i ) ; u] () were C is te normalization constant. Te radius of te kernel prole determines te number of pixels (i.e., te scale) of te P taret candidate. By imposin te m condition tat ^p u =we obtain C = y;xi k(k k ) : () Note tat C does not depend on y, since te pixel locations are oranized in a reular lattice, y bein one of te lattice nodes. Terefore, C can be precalculated for a iven kernel and dierent values of. 3

4 4. Distance Minimization Accordin to Section 3, te most probable location y of te taret in te current frame is obtained by minimizin te distance (8), wic is equivalent tomaxi- mizin te Battacaryya coecient ^(y). Te searc for te new taret location in te current frame starts at te estimated location ^y 0 of te taret in te previous frame. Tus, te color probabilities f^p u (^y 0 ) :::m of te taret candidate at location ^y 0 in te current frame ave to be computed rst. Usin Taylor expansion around te values ^p u (^y 0 ), te Battacaryya coecient (7)isapproximated as (after some manipulations) [^p(y) ^q] (^y 0 )^q u + ^q u ^p u (y) ^p p^pu u (^y 0 ) (3) were it is assumed tat te taret candidate f^p u (y) :::m does not cane drastically from te initial f^p u (^y 0 ) :::m, and tat ^p u (^y 0 ) > 0 for all u = :::m. Introducin now () in (3) we obtain [^p(y) ^q] were w i = p^pu (^y 0 )^q u + C [b( ) ; u] Xn s w i k s! y ; (4) ^q u ^p u (^y 0 ) : (5) Tus, to minimize te distance (8), te second term in equation (4) as to be maximized, te rst term bein independent of y. Te second term represents te density estimate computed wit kernel prole k at y in te current frame, wit te data bein weited by w i (5). Te maximization can be eciently acieved based on te mean sift iterations, usin te followin aloritm. Battacaryya Coecient [^p(y) ^q] Maximization Given te distribution f^q u :::m of te taret model and te estimated location ^y 0 of te taret in te previous frame:. Initialize te location of te taret in te current frame wit ^y 0, compute te distribution f^p u (^y 0 ) :::m,andevaluate [^p(^y 0 ) ^q] = P m p^pu (^y 0 )^q u :. Derive teweits fw i :::n accordin to (5). 3. Based on te mean sift vector, derive te new location of te taret (4) ^y = x iw i w i ^y0 ; ^y0 ; : (6) Update f^p u (^y ) :::m,andevaluate [^p(^y ) ^q] = P m p^pu (^y )^q u : 4. Wile [^p(^y ) ^q] <[^p(^y 0 ) ^q] Do ^y (^y 0 + ^y ). 5. If k^y ; ^y 0 k < Stop. Oterwise Set ^y 0 ^y and o to Step. Te proposed optimization employs te mean sift vector in Step 3 to increase te value of te approximated Battacaryya coecient expressed by (4). Since tis operation does not necessarily increase te value of [^p(y) ^q], te test included in Step 4 is needed to validate te new location of te taret. However, practical experiments (trackin dierent objects, for lon periods of time)sowed tat te Battacaryya coecient computed at te location dened by equation (6) was almost always larer tan te coecient correspondin to ^y 0. Less tan 0:% of te performed maximizations yielded cases were te Step 4 iterations were necessary. Te termination tresold used in Step 5 is derived by constrainin te vectors representin ^y 0 and ^y to be witin te same pixel in imae coordinates. Te trackin consists in runnin for eac frame te optimization aloritm described above. Tus, iven te taret model, te new location of te taret in te current frame minimizes te distance (8) in te neiborood of te previous location estimate. 4.3 Scale Adaptation Te scale adaptation sceme exploits te property of te distance (8) to be invariant to canes in te object scale. We simply modify te radius of te kernel prole wit a certain fraction (we used 0%), let te trackin aloritm to convere aain, and coose te radius yieldin te larest decrease in te distance (8). An IIR lter is used to derive te new radius based on te current measurements and old radius. 5 Experiments Te proposed metod as been applied to te task of trackin a football player marked by a and-drawn ellipsoidal reion (rst imae of Fiure ). Te sequence as 54 frames of pixels eac and te initial normalization constants (determined from te size of te taret model) were ( x y ) = (7 53). Te Epanecnikov prole (4) as been used for istoram computation, terefore, te mean sift iterations were computed wit te uniform prole. Te taret istoram as been derived in te RGB space wit bins. Te aloritm runs comfortably at 30 fps on a 600 MHz PC, Java implementation. Te trackin results are presented in Fiure. Te mean sift based tracker proved to be robust to partial occlusion, clutter, distractors (frame 40 in Fiure ), 4

5 and camera motion. Since no motion model as been assumed, te tracker adapted well to te nonstationary caracter of te player's movements, wic alternates abruptly between slow and fast action. In addition, te intense blurrin present in some frames and due to te camera motion, did not inuence te tracker performance (frame 50 in Fiure ). Te same eect, owever, can larely perturb contour based trackers Mean Sift Iterations Frame Index Fiure : Te number of mean sift iterations function of te frame index for te Football sequence. Te mean number of iterations is 4:9 per frame. Te number of mean sift iterations necessary for eac frame (one scale) in te Football sequence is sown in Fiure. One can identify two central peaks, correspondin to te movement ofte player to te center of te imae and back to te left side. Te last and larest peak is due to te fast movement from te left to te rit side. 0.9 Fiure : Football sequence: Trackin te player no. 75 wit initial window of7 53 pixels. Te frames 30, 75, 05, 40, and 50 are sown. Battacaryya Coefficient Initial location Converence point 0 0 Y Fiure 3: Values of te Battacaryya coecient correspondin to te marked reion (8 8 pixels) in frame 05 from Fiure. Te surface is asymmetric, due to te player colors tat are similar to te taret. Four mean sift iterations were necessary for te aloritm to convere from te initial location (circle). To demonstrate te eciency of our approac, Fiure 3 presents te surface obtained by computin te Battacaryya coecient for te rectanle marked in Fiure, frame 05. Te taret model (te selected elliptical reion in frame 30) as been compared wit te taret candidates obtained by sweepin te elliptical reion in frame 05 inside te rectanle. Wile most of te trackin approaces based on reions [3, 4,] 0 X

6 must perform an exaustive searc in te rectanle to nd te maximum, our aloritm convered in four iterations as sown in Fiure 3. Note tat since te basin of attraction of te mode covers te entire window, te correct location of te taret would ave been reaced also from farter initial points. An optimized computation of te exaustive searc of te mode [3] as a muc larer aritmetic complexity, dependin on te cosen searc area. Te new metod as been applied to track people on subway platforms. Te camera bein xed, additional eometric constraints and also backround subtraction can be exploited to improve te trackin process. Te followin sequences, owever, ave been processed wit te aloritm uncaned. A rst example is sown in Fiure 4, demonstratin te capability of te tracker to adapt to scale canes. Te sequence as 87 frames of pixels eac and te initial normalization constants were ( x y )= (3 37). Fiure 5 presents six frames from a minute sequence sowin te trackin of a person from te moment se enters te subway platform till se ets on te train ( 3600 frames). Te trackin performance is remarkable, takin into accounttelow quality ofte processed sequence, due to te compression artifacts. A torou evaluation of te tracker, owever, is subject to our current work. Te minimum value of te distance (8) for eac frame is sown in Fiure 6. Te compression noise determined te distance to increase from 0 (perfect matc) to a stationary value of about 0:3. Sinicant deviations from tis value correspond to occlusions enerated by oter persons or rotations in dept of te taret. Te lare distance increase at te end sinals te complete occlusion of te taret. 6 Discussion By exploitin te spatial radient of te statistical measure (8) te new metod acieves real-time trackin performance, wile eectively rejectin backround clutter and partial occlusions. Note tat te same tecnique can be employed to derive te measurement vector for optimal prediction scemes suc as te (Extended) Kalman lter [, p.56, 06], or multiple ypotesis trackin approaces [5, 9, 7, 8]. In return, te prediction can determine te priors (denin te presence of te taret in a iven neiborood) assumed equal in tis paper. Tis connection is owever beyond te scope of tis paper. A patent application as been led coverin te trackin aloritm toeter wit te Kalman extension and various applications [9]. We nally observe tat te idea of centroid computation is also employed in []. Te mean sift was used for trackin uman faces [4], by projectin te Fiure 4: Subway sequence: Te frames 500, 59, 600, 633, and 686 are sown (left-rit, top-down). istoram of a face model onto te incomin frame. However, te direct projection of te model istoram onto te new frame can introduce a lare bias in te estimated location of te taret, and te resultin measure is scale variant. Gradient based reion trackin as been formulated in [] by minimizin te enery of te deformable reion, but no real-time claims were made. APPENDIX ProofofTeorem Since n is nite te sequence ^f K is bounded, terefore, it is sucienttosow tat ^f K is strictly monotonic increasin, i.e., if y j 6= y j+ ten ^f K (j) < ^f K (j +), for all j = :::. By assumin witout loss of enerality tat y j = 0 we can write ^f K (j +); ^f K (j) = = n d " k! y ; x j+ i ; k # :(A.) 6

7 d Frame Index Fiure 6: Te detected minimum value of distance d function of te frame index for te minute Subway sequence. Te peaks in te rap correspond to occlusions or rotations in dept of te taret. For example, te peak of value d 0:6 corresponds to te partial occlusion in frame 3697, sown in Fiure 5. At te end of te sequence, te person bein tracked ets on te train, wic produces a complete occlusion. Fiure 5: Subway sequence: Te frames 340, 356, 3697, 5440, 608, and 668 are sown (left-rit, topdown). Te convexity of te prole k implies tat k(x ) k(x )+k 0 (x )(x ; x ) (A.) for all x x [0 ), x 6= x, and since k 0 = ;, te inequality (A.) becomes k(x ) ; k(x ) (x )(x ; x ): Usin now (A.) and (A.3) we obtain ^f K (j +); ^f K (j) n d+ = n d+ " y > j+ kxi k ;ky j+ ; k (A.3) y > j+ ;ky j+ k = n d+ X n ;ky j+ k # (A.4) and by employin (4) it results tat ^f K (j +); ^f K (j) n d+ ky j+k : (A.5) Since k is monotonic decreasin we P ave ;k 0 (x) n (x) 0 for all x [0 ). Te sum is strictly positive, since it was assumed to be nonzero in te denition of te mean sift vector (0). Tus, as lon as y j+ 6= y j = 0, te rit term of (A.5) is strictly positive, i.e., ^f K (j +); ^f K (j) > 0. Consequently, te sequence ^f K is converent. Toprove te converence of te sequence y j j= ::: we rewrite (A.5) but witout assumin tat y j = 0. After some alebra we ave ^f K (j+); ^f K (j) n ky j+;y d+ j k y j;! (A.6) Since ^f K (j + ) ; ^f K (j) converes to zero, (A.6) implies tat ky j+ ; y j k also converes to zero, i.e., yj is a Caucy sequence. Tis completes te j= ::: proof, since any Caucy sequence is converentinte Euclidean space. p Proof tat te distance d(^p ^q) = ; (^p ^q) is a metric Te proof is based on te properties of te Battacaryya coecient (7). Accordin to te Jensen's inequality [8, p.5] we ave (^p ^q)= p^pu^q u = s ^q u ^p u ^p u vu u t X m ^q u = (A.7) 7

8 wit p equality i ^p = ^q. Terefore, d(^p ^q) = ; (^p ^q) exists for all discrete distributions ^p and ^q, is positive, symmetric, and is equal to zero i ^p = ^q. Te trianle inequality can be proven as follows. Let us consider te discrete distributions ^p, ^q, and ^r, and dene te associated m-dimensional points p = ;p^p ::: p^p > m, q = ;p^q ::: p^q > m, and r = ;p^r ::: p^r > m on te unit yperspere, centered at te oriin. By takin into account te eometric interpretation of te Battacaryya coecient, te trianle inequality d(^p ^r)+d(^q ^r) d(^p ^q) (A.8) is equivalent to q ; cos( p r )+ q ; cos( q r ) q ; cos( p q ): (A.9) If we xte points p and q, and te anle between p and r, te left side of inequality (A.9) is minimized wen te vectors p, q, and r lie in te same plane. Tus, te inequality (A.9) can be reduced to a - dimensional problem tat can be easily demonstrated by employin te alf-anle sinus formula and a few trionometric manipulations. Acknowledment Peter Meer was supported by te NSF under te rant IRI References [] Y. Bar-Salom, T. Fortmann, Trackin and Data Association, Academic Press, London, 988. [] B. Bascle, R. Derice, \Reion Trackin trou Imae Sequences," IEEE Int'l Conf. Comp. Vis., Cambride, Massacusetts, 30{307, 995. [3] S. Birceld, \Elliptical Head Trackin usin intensity Gradients and Color Historams," IEEE Conf. on Comp. Vis. and Pat. Rec., Santa Barbara, 3{37, 998. [4] G.R. Bradski, \Computer Vision Face Trackin as a Component of a Perceptual User Interface," IEEE Work. on Applic. Comp. Vis., Princeton, 4{9, 998. [5] T.J. Cam, J.M. Re, \A multiple Hypotesis Approac to Fiure Trackin," IEEE Conf. on Comp. Vis. and Pat. Rec., Fort Collins, vol., 39{45, 999. [6] D. Comaniciu, P. Meer, \Mean Sift Analysis and Applications," IEEE Int'l Conf. Comp. Vis., Kerkyra, Greece, 97{03, 999. [7] D. Comaniciu, P. Meer, \Distribution Free Decomposition of Multivariate Data," Pattern Anal. and Applic., :{30, 999. [8] T.M. Cover and J.A. Tomas, Elements of Information Teory, Jon Wiley & Sons, New York, 99. [9] I.J. Cox, S.L. Hinorani, \An Ecient Implementation of Reid's Multiple Hypotesis Trackin Aloritm and Its Evaluation for te Purpose of Visual Trackin," IEEE Trans. Pattern Analysis Macine Intell., 8:38{ 50, 996. [0] Y. Cui, S. Samarasekera, Q. Huan, M Greienaen, \Indoor Monitorin Via te Collaboration Between a Periperal Senson and a Foveal Sensor," IEEE Worksop on Visual Surveillance, Bombay, India, {9, 998. [] A. Djouadi, O. Snorrason, F.D. Garber, \Te Quality oftrainin-sample Estimates of te Battacaryya Coecient," IEEE Trans. Pattern Analysis Macine Intell., :9{97, 990. [] A. Elefteriadis, A. Jacquin, \Automatic Face Location Detection and Trackin for Model-Assisted Codin of Video Teleconference Sequences at Low Bit Rates," Sinal Processin - Imae Communication, 7(3): 3{ 48, 995. [3] F. Ennesser, G. Medioni, \Findin Waldo, or Focus of Attention Usin Local Color Information," IEEE Trans. Pattern Anal. Macine Intell., 7(8):805{809, 995. [4] P. Fieut, D. Terzopoulos, \Color-Based Trackin of Heads and Oter Mobile Objects at Video Frame Rates," IEEE Conf. on Comp. Vis. and Pat. Rec, Puerto Rico, {7, 997. [5] K. Fukunaa, Introduction to Statistical Pattern Reconition, Second Ed., Academic Press, Boston, 990. [6] S.S. Intille, J.W. Davis, A.F. Bobick, \Real-Time Closed-World Trackin," IEEE Conf. on Comp. Vis. and Pat. Rec., Puerto Rico, 697{703, 997. [7] M. Isard, A. Blake, \Condensation - Conditional Density Propaation for Visual Trackin," Intern. J. Comp. Vis., 9():5{8, 998. [8] M. Isard, A. Blake, \ICondensation: Unifyin Low- Level and Hi-Level Trackin in a Stocastic Framework," European Conf. Comp. Vision, Freibur, Germany, 893{908, 998. [9] T. Kailat, \Te Diverence and Battacaryya Distance Measures in Sinal Selection," IEEE Trans. Commun. Tec., COM-5:5{60, 967. [0] S. Konisi, A.L. Yuille, J. Coulan, S.C. Zu, \Fundamental Bounds on Ede Detection: An Information Teoretic Evaluation of Dierent Ede Cues," IEEE Conf. on Comp. Vis. and Pat. Rec., Fort Collins, 573{ 579, 999. [] A.J. Lipton, H. Fujiyosi, R.S. Patil, \Movin Taret Classication and Trackin from Real-Time Video," IEEE Worksop on Applications of Computer Vision, Princeton, 8{4, 998. [] S.J. McKenna, Y. Raja, S. Gon, \Trackin Colour Objects usin Adaptive Mixture Models," Imae and Vision Computin, 7:3{9, 999. [3] N. Paraios, R. Derice, \Geodesic Active Reions for Motion Estimation and Trackin," IEEE Int'l Conf. Comp. Vis., Kerkyra, Greece, 688{674, 999. [4] R. Rosales, S. Sclaro, \3D trajectory Recovery for Trackin Multiple Objects and Trajectory Guided Reconition of Actions," IEEE Conf. on Comp. Vis. and Pat. Rec., Fort Collins, vol., 7{3, 999. [5] D.W. Scott, Multivariate Density Estimation, New York: Wiley, 99. [6] M.J. Swain, D.H. Ballard, \Color Indexin," Intern. J. Comp. Vis., 7():{3, 99. [7] P. Viola, W.M. Wells III, \Alinmentby Maximization of Mutual Information," IEEE Int'l Conf. Comp. Vis., Cambride, Massacusetts, 6{3, 995. [8] C. Wren, A. Azarbayejani, T. Darrell, A. Pentland, \Pnder: Real-Time Trackin of te Human Body," IEEE Trans. Pattern Analysis Macine Intell., 9:780{ 785, 997. [9] \Real-Time Trackin of Non-Riid Objects usin Mean Sift," US patent pendin. 8

Verifying Numerical Convergence Rates

Verifying Numerical Convergence Rates 1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and

More information

Kernel-Based Hand Tracking

Kernel-Based Hand Tracking Australian Journal of Basic and Applied Sciences, 3(4): 4017-4025, 2009 ISSN 1991-8178 2009, INSInet Publication Kernel-Based Hand Tracking 1 2 Aras Dargazany, Ali Solimani 1 Department of ECE, Shahrood

More information

FINITE DIFFERENCE METHODS

FINITE DIFFERENCE METHODS FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to

More information

Mean-Shift Tracking with Random Sampling

Mean-Shift Tracking with Random Sampling 1 Mean-Shift Tracking with Random Sampling Alex Po Leung, Shaogang Gong Department of Computer Science Queen Mary, University of London, London, E1 4NS Abstract In this work, boosting the efficiency of

More information

Improved dynamic programs for some batcing problems involving te maximum lateness criterion A P M Wagelmans Econometric Institute Erasmus University Rotterdam PO Box 1738, 3000 DR Rotterdam Te Neterlands

More information

Can a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade?

Can a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade? Can a Lump-Sum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lump-sum transfer rules to redistribute te

More information

2 Limits and Derivatives

2 Limits and Derivatives 2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line

More information

Research on the Anti-perspective Correction Algorithm of QR Barcode

Research on the Anti-perspective Correction Algorithm of QR Barcode Researc on te Anti-perspective Correction Algoritm of QR Barcode Jianua Li, Yi-Wen Wang, YiJun Wang,Yi Cen, Guoceng Wang Key Laboratory of Electronic Tin Films and Integrated Devices University of Electronic

More information

CHAPTER 7. Di erentiation

CHAPTER 7. Di erentiation CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.

More information

Optimized Data Indexing Algorithms for OLAP Systems

Optimized Data Indexing Algorithms for OLAP Systems Database Systems Journal vol. I, no. 2/200 7 Optimized Data Indexing Algoritms for OLAP Systems Lucian BORNAZ Faculty of Cybernetics, Statistics and Economic Informatics Academy of Economic Studies, Bucarest

More information

Practical Tour of Visual tracking. David Fleet and Allan Jepson January, 2006

Practical Tour of Visual tracking. David Fleet and Allan Jepson January, 2006 Practical Tour of Visual tracking David Fleet and Allan Jepson January, 2006 Designing a Visual Tracker: What is the state? pose and motion (position, velocity, acceleration, ) shape (size, deformation,

More information

An inquiry into the multiplier process in IS-LM model

An inquiry into the multiplier process in IS-LM model An inquiry into te multiplier process in IS-LM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 00-62763074 Internet Address: jefferson@water.pu.edu.cn

More information

Derivatives Math 120 Calculus I D Joyce, Fall 2013

Derivatives Math 120 Calculus I D Joyce, Fall 2013 Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te

More information

Robert Collins CSE598G. More on Mean-shift. R.Collins, CSE, PSU CSE598G Spring 2006

Robert Collins CSE598G. More on Mean-shift. R.Collins, CSE, PSU CSE598G Spring 2006 More on Mean-shift R.Collins, CSE, PSU Spring 2006 Recall: Kernel Density Estimation Given a set of data samples x i ; i=1...n Convolve with a kernel function H to generate a smooth function f(x) Equivalent

More information

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park

More information

Geometric Stratification of Accounting Data

Geometric Stratification of Accounting Data Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual

More information

Computer Science and Engineering, UCSD October 7, 1999 Goldreic-Levin Teorem Autor: Bellare Te Goldreic-Levin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an n-bit

More information

Schedulability Analysis under Graph Routing in WirelessHART Networks

Schedulability Analysis under Graph Routing in WirelessHART Networks Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,

More information

Pre-trial Settlement with Imperfect Private Monitoring

Pre-trial Settlement with Imperfect Private Monitoring Pre-trial Settlement wit Imperfect Private Monitoring Mostafa Beskar University of New Hampsire Jee-Hyeong Park y Seoul National University July 2011 Incomplete, Do Not Circulate Abstract We model pretrial

More information

SAMPLE DESIGN FOR THE TERRORISM RISK INSURANCE PROGRAM SURVEY

SAMPLE DESIGN FOR THE TERRORISM RISK INSURANCE PROGRAM SURVEY ASA Section on Survey Researc Metods SAMPLE DESIG FOR TE TERRORISM RISK ISURACE PROGRAM SURVEY G. ussain Coudry, Westat; Mats yfjäll, Statisticon; and Marianne Winglee, Westat G. ussain Coudry, Westat,

More information

Training Robust Support Vector Regression via D. C. Program

Training Robust Support Vector Regression via D. C. Program Journal of Information & Computational Science 7: 12 (2010) 2385 2394 Available at ttp://www.joics.com Training Robust Support Vector Regression via D. C. Program Kuaini Wang, Ping Zong, Yaoong Zao College

More information

Unemployment insurance/severance payments and informality in developing countries

Unemployment insurance/severance payments and informality in developing countries Unemployment insurance/severance payments and informality in developing countries David Bardey y and Fernando Jaramillo z First version: September 2011. Tis version: November 2011. Abstract We analyze

More information

Comparison between two approaches to overload control in a Real Server: local or hybrid solutions?

Comparison between two approaches to overload control in a Real Server: local or hybrid solutions? Comparison between two approaces to overload control in a Real Server: local or ybrid solutions? S. Montagna and M. Pignolo Researc and Development Italtel S.p.A. Settimo Milanese, ITALY Abstract Tis wor

More information

Lecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function

Lecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between

More information

The EOQ Inventory Formula

The EOQ Inventory Formula Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of

More information

Hands Tracking from Frontal View for Vision-Based Gesture Recognition

Hands Tracking from Frontal View for Vision-Based Gesture Recognition Hands Tracking from Frontal View for Vision-Based Gesture Recognition Jörg Zieren, Nils Unger, and Suat Akyol Chair of Technical Computer Science, Ahornst. 55, Aachen University (RWTH), 52074 Aachen, Germany

More information

2.23 Gambling Rehabilitation Services. Introduction

2.23 Gambling Rehabilitation Services. Introduction 2.23 Gambling Reabilitation Services Introduction Figure 1 Since 1995 provincial revenues from gambling activities ave increased over 56% from $69.2 million in 1995 to $108 million in 2004. Te majority

More information

Strategic trading and welfare in a dynamic market. Dimitri Vayanos

Strategic trading and welfare in a dynamic market. Dimitri Vayanos LSE Researc Online Article (refereed) Strategic trading and welfare in a dynamic market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt

More information

Strategic trading in a dynamic noisy market. Dimitri Vayanos

Strategic trading in a dynamic noisy market. Dimitri Vayanos LSE Researc Online Article (refereed) Strategic trading in a dynamic noisy market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt and Moral

More information

Distances in random graphs with infinite mean degrees

Distances in random graphs with infinite mean degrees Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree

More information

- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz

- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger

More information

TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS. Swati Dhingra London School of Economics and CEP. Online Appendix

TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS. Swati Dhingra London School of Economics and CEP. Online Appendix TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS Swati Dingra London Scool of Economics and CEP Online Appendix APPENDIX A. THEORETICAL & EMPIRICAL RESULTS A.1. CES and Logit Preferences: Invariance of Innovation

More information

SAT Subject Math Level 1 Facts & Formulas

SAT Subject Math Level 1 Facts & Formulas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses

More information

Projective Geometry. Projective Geometry

Projective Geometry. Projective Geometry Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,

More information

The modelling of business rules for dashboard reporting using mutual information

The modelling of business rules for dashboard reporting using mutual information 8 t World IMACS / MODSIM Congress, Cairns, Australia 3-7 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,

More information

Tracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object

More information

M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)

M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1) Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut

More information

Real Time Target Tracking with Pan Tilt Zoom Camera

Real Time Target Tracking with Pan Tilt Zoom Camera 2009 Digital Image Computing: Techniques and Applications Real Time Target Tracking with Pan Tilt Zoom Camera Pankaj Kumar, Anthony Dick School of Computer Science The University of Adelaide Adelaide,

More information

2.28 EDGE Program. Introduction

2.28 EDGE Program. Introduction Introduction Te Economic Diversification and Growt Enterprises Act became effective on 1 January 1995. Te creation of tis Act was to encourage new businesses to start or expand in Newfoundland and Labrador.

More information

Vehicle Tracking Using On-Line Fusion of Color and Shape Features

Vehicle Tracking Using On-Line Fusion of Color and Shape Features Vehicle Tracking Using On-Line Fusion of Color and Shape Features Kai She 1, George Bebis 1, Haisong Gu 1, and Ronald Miller 2 1 Computer Vision Laboratory, University of Nevada, Reno, NV 2 Vehicle Design

More information

On a Satellite Coverage

On a Satellite Coverage I. INTRODUCTION On a Satellite Coverage Problem DANNY T. CHI Kodak Berkeley Researc Yu T. su National Ciao Tbng University Te eart coverage area for a satellite in an Eart syncronous orbit wit a nonzero

More information

Instantaneous Rate of Change:

Instantaneous Rate of Change: Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over

More information

OPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS

OPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS New Developments in Structural Engineering and Construction Yazdani, S. and Sing, A. (eds.) ISEC-7, Honolulu, June 18-23, 2013 OPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS JIALI FU 1, ERIK JENELIUS

More information

Tangent Lines and Rates of Change

Tangent Lines and Rates of Change Tangent Lines and Rates of Cange 9-2-2005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims

More information

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous

More information

Segmentation & Clustering

Segmentation & Clustering EECS 442 Computer vision Segmentation & Clustering Segmentation in human vision K-mean clustering Mean-shift Graph-cut Reading: Chapters 14 [FP] Some slides of this lectures are courtesy of prof F. Li,

More information

Note nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1

Note nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1 Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te

More information

A system to monitor the quality of automated coding of textual answers to open questions

A system to monitor the quality of automated coding of textual answers to open questions Researc in Official Statistics Number 2/2001 A system to monitor te quality of automated coding of textual answers to open questions Stefania Maccia * and Marcello D Orazio ** Italian National Statistical

More information

Tracking Groups of Pedestrians in Video Sequences

Tracking Groups of Pedestrians in Video Sequences Tracking Groups of Pedestrians in Video Sequences Jorge S. Marques Pedro M. Jorge Arnaldo J. Abrantes J. M. Lemos IST / ISR ISEL / IST ISEL INESC-ID / IST Lisbon, Portugal Lisbon, Portugal Lisbon, Portugal

More information

Tracking People in 2 1 2 D. Ismail Haritaoglu, David Harwood and Larry S. Davis. University of Maryland. College Park, MD 20742, USA

Tracking People in 2 1 2 D. Ismail Haritaoglu, David Harwood and Larry S. Davis. University of Maryland. College Park, MD 20742, USA W 4 S: A Real-Time System for Detecting and Tracking People in 2 1 2 D Ismail Haritaoglu, David Harwood and Larry S. Davis Computer Vision Laboratory University of Maryland College Park, MD 20742, USA

More information

Theoretical calculation of the heat capacity

Theoretical calculation of the heat capacity eoretical calculation of te eat capacity Principle of equipartition of energy Heat capacity of ideal and real gases Heat capacity of solids: Dulong-Petit, Einstein, Debye models Heat capacity of metals

More information

Cyber Epidemic Models with Dependences

Cyber Epidemic Models with Dependences Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas

More information

28 Oscillations: The Simple Pendulum, Energy in Simple Harmonic Motion

28 Oscillations: The Simple Pendulum, Energy in Simple Harmonic Motion Chapter 8 Oscillations: The Simple Pendulum, Enery in Simple Harmonic Motion 8 Oscillations: The Simple Pendulum, Enery in Simple Harmonic Motion Startin with the pendulum bob at its hihest position on

More information

Chapter 7 Numerical Differentiation and Integration

Chapter 7 Numerical Differentiation and Integration 45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea

More information

Staffing and routing in a two-tier call centre. Sameer Hasija*, Edieal J. Pinker and Robert A. Shumsky

Staffing and routing in a two-tier call centre. Sameer Hasija*, Edieal J. Pinker and Robert A. Shumsky 8 Int. J. Operational Researc, Vol. 1, Nos. 1/, 005 Staffing and routing in a two-tier call centre Sameer Hasija*, Edieal J. Pinker and Robert A. Sumsky Simon Scool, University of Rocester, Rocester 1467,

More information

Object Tracking Initialization Using Automatic Moving Object Detection

Object Tracking Initialization Using Automatic Moving Object Detection Object Tracking Initialization Using Automatic Moving Object Detection Ka Ki Ng and Edward J. Delp Video and Image Processing Laboratories (VIPER) School of Electrical and Computer Engineering Purdue University

More information

Alan J. Lipton Hironobu Fujiyoshi Raju S. Patil. The Robotics Institute. Carnegie Mellon University. 5000 Forbes Avenue, Pittsburgh, PA, 15213

Alan J. Lipton Hironobu Fujiyoshi Raju S. Patil. The Robotics Institute. Carnegie Mellon University. 5000 Forbes Avenue, Pittsburgh, PA, 15213 Moving target classication and tracking from real-time video Alan J. Lipton Hironobu Fujiyoshi Raju S. Patil The Robotics Institute. Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA, 15213

More information

100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129

100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129 AUSTRIAN JOURNAL OF STATISTICS Volume 3 003, Number 1&, 99 19 Adaptive Regression on te Real Line in Classes of Smoot Functions L.M. Artiles and B.Y. Levit Eurandom, Eindoven, te Neterlands Queen s University,

More information

Equilibria in sequential bargaining games as solutions to systems of equations

Equilibria in sequential bargaining games as solutions to systems of equations Economics Letters 84 (2004) 407 411 www.elsevier.com/locate/econbase Equilibria in sequential bargaining games as solutions to systems of equations Tasos Kalandrakis* Department of Political Science, Yale

More information

Probabilistic Latent Semantic Analysis (plsa)

Probabilistic Latent Semantic Analysis (plsa) Probabilistic Latent Semantic Analysis (plsa) SS 2008 Bayesian Networks Multimedia Computing, Universität Augsburg Rainer.Lienhart@informatik.uni-augsburg.de www.multimedia-computing.{de,org} References

More information

Math 113 HW #5 Solutions

Math 113 HW #5 Solutions Mat 3 HW #5 Solutions. Exercise.5.6. Suppose f is continuous on [, 5] and te only solutions of te equation f(x) = 6 are x = and x =. If f() = 8, explain wy f(3) > 6. Answer: Suppose we ad tat f(3) 6. Ten

More information

GIS-BASED REAL-TIME CORRECTION OF DEVIATION ON VEHICLE TRACK *

GIS-BASED REAL-TIME CORRECTION OF DEVIATION ON VEHICLE TRACK * Proceedins of the 004 International Conference TP-038 on Dynamics, Instrumentation and Control, Nanin, China, Auust, 004 GIS-BASED REAL-TIME CORRECTION OF DEVIATION ON VEHICLE TRACK YUANLU BAO, YAN LIU

More information

MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION

MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION Tis tutorial is essential pre-requisite material for anyone stuing mecanical engineering. Tis tutorial uses te principle of

More information

Multivariate time series analysis: Some essential notions

Multivariate time series analysis: Some essential notions Capter 2 Multivariate time series analysis: Some essential notions An overview of a modeling and learning framework for multivariate time series was presented in Capter 1. In tis capter, some notions on

More information

Pretrial Settlement with Imperfect Private Monitoring

Pretrial Settlement with Imperfect Private Monitoring Pretrial Settlement wit Imperfect Private Monitoring Mostafa Beskar Indiana University Jee-Hyeong Park y Seoul National University April, 2016 Extremely Preliminary; Please Do Not Circulate. Abstract We

More information

Verification of Security Protocols with Lists: from Length One to Unbounded Length

Verification of Security Protocols with Lists: from Length One to Unbounded Length Verification of Security Protocols wit Lists: from Lengt One to Unbounded Lengt INRIA, Miriam Paiola and Bruno Blancet École Normale Supérieure, CNRS, Paris {paiola,blancet}@di.ens.fr Abstract. We present

More information

Vision based Vehicle Tracking using a high angle camera

Vision based Vehicle Tracking using a high angle camera Vision based Vehicle Tracking using a high angle camera Raúl Ignacio Ramos García Dule Shu gramos@clemson.edu dshu@clemson.edu Abstract A vehicle tracking and grouping algorithm is presented in this work

More information

SAT Math Must-Know Facts & Formulas

SAT Math Must-Know Facts & Formulas SAT Mat Must-Know Facts & Formuas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas

More information

On the Influence of the Prediction Horizon in Dynamic Matrix Control

On the Influence of the Prediction Horizon in Dynamic Matrix Control International Journal of Control Science and Enineerin 203, 3(): 22-30 DOI: 0.5923/j.control.203030.03 On the Influence of the Prediction Horizon in Dynamic Matrix Control Jose Manue l Lope z-gue de,*,

More information

A New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case

A New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case A New Cement to Glue Nonconforming Grids wit Robin Interface Conditions: Te Finite Element Case Martin J. Gander, Caroline Japet 2, Yvon Maday 3, and Frédéric Nataf 4 McGill University, Dept. of Matematics

More information

Fast and Robust Moving Object Segmentation Technique for MPEG-4 Object-based Coding and Functionality Ju Guo, Jongwon Kim and C.-C. Jay Kuo Integrated Media Systems Center and Department of Electrical

More information

Predicting the behavior of interacting humans by fusing data from multiple sources

Predicting the behavior of interacting humans by fusing data from multiple sources Predicting te beavior of interacting umans by fusing data from multiple sources Erik J. Sclict 1, Ritcie Lee 2, David H. Wolpert 3,4, Mykel J. Kocenderfer 1, and Brendan Tracey 5 1 Lincoln Laboratory,

More information

Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 269 Class Project Report

Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 269 Class Project Report Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 69 Class Project Report Junhua Mao and Lunbo Xu University of California, Los Angeles mjhustc@ucla.edu and lunbo

More information

Tracking in flussi video 3D. Ing. Samuele Salti

Tracking in flussi video 3D. Ing. Samuele Salti Seminari XXIII ciclo Tracking in flussi video 3D Ing. Tutors: Prof. Tullio Salmon Cinotti Prof. Luigi Di Stefano The Tracking problem Detection Object model, Track initiation, Track termination, Tracking

More information

ACT Math Facts & Formulas

ACT Math Facts & Formulas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as

More information

In other words the graph of the polynomial should pass through the points

In other words the graph of the polynomial should pass through the points Capter 3 Interpolation Interpolation is te problem of fitting a smoot curve troug a given set of points, generally as te grap of a function. It is useful at least in data analysis (interpolation is a form

More information

Channel Allocation in Non-Cooperative Multi-Radio Multi-Channel Wireless Networks

Channel Allocation in Non-Cooperative Multi-Radio Multi-Channel Wireless Networks Cannel Allocation in Non-Cooperative Multi-Radio Multi-Cannel Wireless Networks Dejun Yang, Xi Fang, Guoliang Xue Arizona State University Abstract Wile tremendous efforts ave been made on cannel allocation

More information

Haptic Manipulation of Virtual Materials for Medical Application

Haptic Manipulation of Virtual Materials for Medical Application Haptic Manipulation of Virtual Materials for Medical Application HIDETOSHI WAKAMATSU, SATORU HONMA Graduate Scool of Healt Care Sciences Tokyo Medical and Dental University, JAPAN wakamatsu.bse@tmd.ac.jp

More information

SWITCH T F T F SELECT. (b) local schedule of two branches. (a) if-then-else construct A & B MUX. one iteration cycle

SWITCH T F T F SELECT. (b) local schedule of two branches. (a) if-then-else construct A & B MUX. one iteration cycle 768 IEEE RANSACIONS ON COMPUERS, VOL. 46, NO. 7, JULY 997 Compile-ime Sceduling of Dynamic Constructs in Dataæow Program Graps Soonoi Ha, Member, IEEE and Edward A. Lee, Fellow, IEEE Abstract Sceduling

More information

Area-Specific Recreation Use Estimation Using the National Visitor Use Monitoring Program Data

Area-Specific Recreation Use Estimation Using the National Visitor Use Monitoring Program Data United States Department of Agriculture Forest Service Pacific Nortwest Researc Station Researc Note PNW-RN-557 July 2007 Area-Specific Recreation Use Estimation Using te National Visitor Use Monitoring

More information

Solutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in

Solutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in KOÇ UNIVERSITY, SPRING 2014 MATH 401, MIDTERM-1, MARCH 3 Instructor: BURAK OZBAGCI TIME: 75 Minutes Solutions by: KARATUĞ OZAN BiRCAN PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set

More information

We consider the problem of determining (for a short lifecycle) retail product initial and

We consider the problem of determining (for a short lifecycle) retail product initial and Optimizing Inventory Replenisment of Retail Fasion Products Marsall Fiser Kumar Rajaram Anant Raman Te Warton Scool, University of Pennsylvania, 3620 Locust Walk, 3207 SH-DH, Piladelpia, Pennsylvania 19104-6366

More information

SHAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGHTS ON ELECTRICAL LOAD PATTERNS

SHAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGHTS ON ELECTRICAL LOAD PATTERNS CIRED Worksop - Rome, 11-12 June 2014 SAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGTS ON ELECTRICAL LOAD PATTERNS Diego Labate Paolo Giubbini Gianfranco Cicco Mario Ettorre Enel Distribuzione-Italy

More information

To motivate the notion of a variogram for a covariance stationary process, { Ys ( ): s R}

To motivate the notion of a variogram for a covariance stationary process, { Ys ( ): s R} 4. Variograms Te covariogram and its normalized form, te correlogram, are by far te most intuitive metods for summarizing te structure of spatial dependencies in a covariance stationary process. However,

More information

A Comparative Study between SIFT- Particle and SURF-Particle Video Tracking Algorithms

A Comparative Study between SIFT- Particle and SURF-Particle Video Tracking Algorithms A Comparative Study between SIFT- Particle and SURF-Particle Video Tracking Algorithms H. Kandil and A. Atwan Information Technology Department, Faculty of Computer and Information Sciences, Mansoura University,El-Gomhoria

More information

Design and Analysis of a Fault-Tolerant Mechanism for a Server-Less Video-On-Demand System

Design and Analysis of a Fault-Tolerant Mechanism for a Server-Less Video-On-Demand System Design and Analysis of a Fault-olerant Mecanism for a Server-Less Video-On-Demand System Jack Y. B. Lee Department of Information Engineering e Cinese University of Hong Kong Satin, N.., Hong Kong Email:

More information

A HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER. Figure 1. Basic structure of an encoder.

A HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER. Figure 1. Basic structure of an encoder. A HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER Manoj Kumar 1 Mohammad Zubair 1 1 IBM T.J. Watson Research Center, Yorktown Hgts, NY, USA ABSTRACT The MPEG/Audio is a standard for both

More information

Artificial Neural Networks for Time Series Prediction - a novel Approach to Inventory Management using Asymmetric Cost Functions

Artificial Neural Networks for Time Series Prediction - a novel Approach to Inventory Management using Asymmetric Cost Functions Artificial Neural Networks for Time Series Prediction - a novel Approac to Inventory Management using Asymmetric Cost Functions Sven F. Crone University of Hamburg, Institute of Information Systems crone@econ.uni-amburg.de

More information

The finite element immersed boundary method: model, stability, and numerical results

The finite element immersed boundary method: model, stability, and numerical results Te finite element immersed boundary metod: model, stability, and numerical results Lucia Gastaldi Università di Brescia ttp://dm.ing.unibs.it/gastaldi/ INdAM Worksop, Cortona, September 18, 2006 Joint

More information

Chapter 10: Refrigeration Cycles

Chapter 10: Refrigeration Cycles Capter 10: efrigeration Cycles Te vapor compression refrigeration cycle is a common metod for transferring eat from a low temperature to a ig temperature. Te above figure sows te objectives of refrigerators

More information

Bonferroni-Based Size-Correction for Nonstandard Testing Problems

Bonferroni-Based Size-Correction for Nonstandard Testing Problems Bonferroni-Based Size-Correction for Nonstandard Testing Problems Adam McCloskey Brown University October 2011; Tis Version: October 2012 Abstract We develop powerful new size-correction procedures for

More information

Performance Evaluation of Selected Category of Public Sector Mutual Fund Schemes in India

Performance Evaluation of Selected Category of Public Sector Mutual Fund Schemes in India Performance Evaluation of Selected Category of Public Sector Mutual Scemes in India Dr. R. Karrupasamy Director, Department of Management Studies Neru College of Tecnology, Coimbatore, Sout India. Mrs.

More information

Detecting and Tracking Moving Objects for Video Surveillance

Detecting and Tracking Moving Objects for Video Surveillance IEEE Proc. Computer Vision and Pattern Recognition Jun. 3-5, 1999. Fort Collins CO Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen Gérard Medioni University of Southern California

More information

Introduction to Support Vector Machines. Colin Campbell, Bristol University

Introduction to Support Vector Machines. Colin Campbell, Bristol University Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.

More information

Catalogue no. 12-001-XIE. Survey Methodology. December 2004

Catalogue no. 12-001-XIE. Survey Methodology. December 2004 Catalogue no. 1-001-XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods

More information

What is Advanced Corporate Finance? What is finance? What is Corporate Finance? Deciding how to optimally manage a firm s assets and liabilities.

What is Advanced Corporate Finance? What is finance? What is Corporate Finance? Deciding how to optimally manage a firm s assets and liabilities. Wat is? Spring 2008 Note: Slides are on te web Wat is finance? Deciding ow to optimally manage a firm s assets and liabilities. Managing te costs and benefits associated wit te timing of cas in- and outflows

More information

1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution

1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution 1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis

More information

A KERNEL MAXIMUM UNCERTAINTY DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE RECOGNITION

A KERNEL MAXIMUM UNCERTAINTY DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE RECOGNITION A KERNEL MAXIMUM UNCERTAINTY DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE RECOGNITION Carlos Eduardo Thomaz Department of Electrical Enineerin, Centro Universitario da FEI, FEI, Sao Paulo, Brazil

More information

A Robust Multiple Object Tracking for Sport Applications 1) Thomas Mauthner, Horst Bischof

A Robust Multiple Object Tracking for Sport Applications 1) Thomas Mauthner, Horst Bischof A Robust Multiple Object Tracking for Sport Applications 1) Thomas Mauthner, Horst Bischof Institute for Computer Graphics and Vision Graz University of Technology, Austria {mauthner,bischof}@icg.tu-graz.ac.at

More information

Interactive Offline Tracking for Color Objects

Interactive Offline Tracking for Color Objects Interactive Offline Tracking for Color Objects Yichen Wei Jian Sun Xiaoou Tang Heung-Yeung Shum Microsoft Research Asia, Beijing, China {yichenw,jiansun,xitang,hshum}@microsoft.com Abstract In this paper,

More information