Face Alignment through Subspace Constrained MeanShifts


 Bathsheba Lester
 1 years ago
 Views:
Transcription
1 Face Algnment through Subspace Constraned MeanShfts Jason M. Saragh, Smon Lucey, Jeffrey F. Cohn The Robotcs Insttute, Carnege Mellon Unversty Pttsburgh, PA 15213, USA Abstract Deformable model fttng has been actvely pursued n the computer vson communty for over a decade. As a result, numerous approaches have been proposed wth varyng degrees of success. A class of approaches that has shown substantal promse s one that makes ndependent predctons regardng locatons of the model s landmarks, whch are combned by enforcng a pror over ther jont moton. A common theme n nnovatons to ths approach s the replacement of the dstrbuton of probable landmark locatons, obtaned from each local detector, wth smpler parametrc forms. Ths smplfcaton substtutes the true objectve wth a smoothed verson of tself, reducng senstvty to local mnma and outlyng detectons. In ths work, a prncpled optmzaton strategy s proposed where a nonparametrc representaton of the landmark dstrbutons s maxmzed wthn a herarchy of smoothed estmates. The resultng update equatons are remnscent of meanshft but wth a subspace constrant placed on the shape s varablty. Ths approach s shown to outperform other exstng methods on the task of generc face fttng. 1. Introducton Deformable model fttng s the problem of regsterng a parametrzed shape model to an mage such that ts landmarks correspond to consstent locatons on the object of nterest. It s a dffcult problem as t nvolves an optmzaton n hgh dmensons, where appearance can vary greatly between nstances of the object due to lghtng condtons, mage nose, resoluton and ntrnsc sources of varablty. Many approaches have been proposed for ths wth varyng degrees of success. Of these, one of the most promsng s one that uses a patchbased representaton and assumes mage observatons made for each landmark are condtonally ndependent [2, 3, 4, 5, 16]. Ths leads to better generalzaton wth lmted data compared to holstc representatons [10, 11, 14, 15], snce t needs only account for local correlatons between pxel values. However, t suffers from detecton ambgutes as a drect result of ts local representaton. As such, care should be taken n combnng detecton results from the varous local detectors n order to steer optmzaton towards the desred soluton. Our key contrbuton n ths paper les n the realzaton that a number of popular optmzaton strateges are all, n some way, smplfyng the dstrbuton of landmark locatons obtaned from each local detector usng a parametrc representaton. The motvaton of ths smplfcaton s to ensure that the approxmate objectve functon: () exhbts propertes that make optmzaton effcent and numercally stable, and () stll approxmately preserve the true certanty/uncertanty assocated wth each local detector. The queston then remans: how should one smplfy these local dstrbutons n order to satsfy () and ()? We address ths by usng a nonparametrc representaton that leads to an optmzaton n the form of subspace constraned meanshfts. 2. Background 2.1. Constraned Local Models Most fttng methods employ a lnear approxmaton to how the shape of a nonrgd object deforms, coned the pont dstrbuton model (PDM) [2]. It models nonrgd shape varatons lnearly and composes t wth a global rgd transformaton, placng the shape n the mage frame: x = sr( x + Φ q)+t, (1) where x denotes the 2Dlocaton of the PDM s th landmark and p = {s, R, t, q} denotes the parameters of the PDM, whch consst of a global scalng s, a rotaton R, a translaton t and a set of nonrgd parameters q. In recent years, an approach to that utlzes an ensemble of local detectors (see [2, 3, 4, 5, 16]) has attracted some nterest as t crcumvents many of the drawbacks of holstc approaches, such as modelng complexty and senstvty to lghtng changes. In ths work, we wll refer to these methods collectvely as constraned local models (CLM) 1. 1 Ths term should not be confused wth the work n [5] whch s a partcular nstance of CLM n our nomenclature.
2 optmzaton proceeds by maxmzng: n p({l = algned} n p) = p(l = algned x ) (4) Fgure 1. Illustraton of CLM fttng and ts two components: () an exhaustve local search for feature locatons to get the response maps {p(l = algned I,x)} n, and () an optmzaton strategy to maxmze the responses of the PDM constraned landmarks. All nstantatons of CLMs can be consdered to be pursung the same two goals: () perform an exhaustve local search for each PDM landmark around ther current estmate usng some knd of feature detector, and () optmze the PDM parameters such that the detecton responses over all of ts landmarks are jontly maxmzed. Fgure 1 llustrates the components of CLM fttng. Exhaustve Local Search: In the frst step of CLM fttng, a lkelhood map s generated for each landmark poston by applyng local detectors to constraned regons around the current estmate. A number of feature detectors have been proposed for ths purpose. One of the smplest, proposed n [16], s the lnear logstc regressor whch gves the followng response map for the th landmark 2 : p(l = algned I,x) = exp{αc (I; x)+β}, (2) where l s a dscrete random varable denotng whether the th landmark s correctly algned or not, I s the mage, x s a 2D locaton n the mage, and C s a lnear classfer: C (I; x) =w T [ I(y1 );... ; I(y m ) ] + b, (3) wth {y } m Ω x (.e. an mage patch). An advantage of usng ths classfer s that the map can be computed usng effcent convoluton operatons. Other feature detectors have also been used to great effect, such as the Gaussan lkelhood [2] and the Haarbased boosted classfer [3]. Optmzaton: Once the response maps for each landmark have been found, by assumng condtonal ndependence, 2 Not all CLM nstances requre a probablstc output from the local detectors. Some, for example [2, 5], only requre a smlarty measure or a match score. However, these matchng scores can be nterpreted as the result of applyng a monotonc functon to the generatng probablty. For example, the Mahalanobs dstance used n [2] s the negatve log of the Gaussan lkelhood. In the nterest of clarty and succnctness, dscussons n ths work assume that responses are probabltes. wth respect to the PDM parameters p, where x s parameterzed as n Equaton (1) and dependence on the mage I s dropped for succnctness. It should be noted that some forms of CLMs pose Equaton (4) as mnmzng the summaton of local energy responses (see 2.2). The man dffculty n ths optmzaton s how to avod local optma whlst affordng an effcent evaluaton. Treatng Equaton (4) as a generc optmzaton problem, one may be tempted to utlze general purpose optmzaton strateges here. However, as the responses are typcally nosy, these optmzaton strateges have a tendency to be unstable. The smplex based method used n [4] has been shown to perform reasonably for ths task snce t s a gradentfree based generc optmzer, whch renders t somewhat nsenstve to measurement nose. However, convergence may be slow when usng ths method, especally for a complex PDM wth a large number of parameters Optmzaton Strateges In ths secton, a revew of current methods for CLM optmzaton s presented. These methods ental replacng the true response maps, {p(l x)} n, wth smpler parametrc forms and performng optmzaton over these nstead of the orgnal response maps. As these parametrc densty estmates are a knd of smoothed verson of the orgnal responses, senstvty to local mnma s generally reduced. Actve Shape Models: The smplest optmzaton strategy for CLM fttng s that used n the Actve Shape Model (ASM) [2]. The method entals frst fndng the locaton wthn each response map for whch the maxmum was attaned: µ = [ µ 1 ;...; µ n ]. The objectve of the optmzaton procedure s then to mnmze the weghted least squares dfference between the PDM and the coordnates of the peak responses: Q(p) = n w x µ 2, (5) where the weghts {w } n reflect the confdence over peak response coordnates and are typcally set to some functon of the responses at {µ } n, makng t more resstant towards such thngs as partal occluson, where occluded landmarks wll be more weakly weghted. Equaton (5) s teratvely mnmzed by takng a frst order Taylor expanson of the PDM s landmarks: x x c + J p, (6)
3 and solvng for the parameter update: ( n ) 1 p = w J T J n w J T (µ x c ), (7) whch s then appled addtvely to the current parameters: p p + p. Here, J =[J 1 ;...; J n ] s the Jacoban and x c = [ x c 1 ;...; xc n] s the current shape estmate. From the probablstc perspectve ntroduced n 2.1, the ASM s optmzaton procedure s equvalent to approxmatng the response maps wth an sotropc Gaussan estmator: p(l = algned x) N (x; µ,σ 2 I), (8) where w = σ 2. Wth ths approxmaton, takng the negatve log of the lkelhood n Equaton (4) results n the objectve n Equaton (5). Convex Quadratc Fttng: Although the approxmaton descrbed above s smple and effcent, n some cases t may be a poor estmate of the true response map. Frstly, the landmark detectors, such as the lnear classfer descrbed n 2.1, are usually mperfect n the sense that the maxmum of the response may not always concde wth the correct landmark locaton. Secondly, as the features used n detecton consst of small mage patches they often contan lmted structure, leadng to detecton ambgutes. The smplest example of ths s the aperture problem, where detecton confdence across the edge s better than along t (see example response maps for the nose brdge and chn n Fgure 2). To account for these problems, a method coned convex quadratc fttng (CQF) has been proposed recently [16]. The method fts a convex quadratc functon to the negatve log of the response map. Ths s equvalent to approxmatng the response map wth a full covarance Gaussan: p(l = algned x) N (x; µ, Σ ). (9) The mean and covarance are maxmum lkelhood estmates gven the response map: Σ = α x (x µ )(x µ ) T ; µ = α x x, x Ψ x c x Ψ x c (10) where Ψ x c s a 2Drectangular grd centered at the current landmark estmate x c (.e. the search wndow), and: α x = p(l = algned x) y Ψ xc p(l = algned y). (11) Wth ths approxmaton, the objectve can be wrtten as the mnmzaton of: n Q( p) = x c + J p µ 2, (12) Σ 1 Fgure 2. Response maps, p(l = algned x), and ther approxmatons used n varous methods, for the outer left eye corner, the nose brdge and chn. Red crosses on the response maps denote the true landmark locatons. The GMM approxmaton has fve cluster centers. The KDE approxmatons are shown for σ 2 {20, 5, 1}. the soluton of whch s gven by: ( n ) 1 n p = J T Σ 1 J J T Σ 1 (µ x c ). (13) A Gaussan Mxture Model Estmate: Although the response map approxmaton n CQF may overcome some of the drawbacks of ASM, ts process of estmaton can be poor n some cases. In partcular, when the response map s strongly multmodal, such an approxmaton smoothes over the varous modes (see the example response map for the eye corner n Fgure 2). To account for ths, n [8] a Gaussan mxture model (GMM) was used to approxmate the response maps: p(l = algned x) K π k N (x; µ k, Σ k ), (14) k=1 where K denotes the number of modes and {π k } K k=1 are the mxng coeffcents for the GMM of the th PDM landmark. Treatng the mode membershp for each landmark, {z } n, as hdden varables, the maxmum lkelhood soluton can be found usng the expectatonmaxmzaton (EM) algorthm, whch maxmzes: p({l } n p) = n k=1 K p (z = k, l x ). (15) The Estep of the EM algorthm nvolves computng the posteror dstrbuton over the latent varables {z } n : p(z = k l, x )= where p(z = k) =π k and: p(z = k) p(l z = k, x ) K j=1 p(z = j) p(l z = j, x ), (16) p(l = algned z = k, x )=N (x ; µ k, Σ k ). (17)
4 In the Mstep, the expectaton of the negatve log of the complete data s mnmzed: { n }] Q(p) =E q(z) [ log p(l = algned,z x ), (18) where q(z) = n p (z l = algned, x ). Lnearzng the shape model as n Equaton (6), ths Qfuncton takes the form: n K Q( p) w k J p y k 2 + const, (19) Σ 1 k k=1 where w k = p (z = k l = algned, x ) and y k = µ k x c, the soluton of whch s gven by: ( n ) 1 K p = w k J T Σ 1 k J n K w k J T Σ 1 k y k. k=1 k=1 (20) Although the GMM s a better approxmaton of the response map compared to the Gaussan approxmaton n CQF, t exhbts two major drawbacks. Frstly, the process of estmatng the GMM parameters from the response maps s a nonlnear optmzaton n tself. It s only locally convergent and requres the number of modes to be chosen apror. As GMM fttng s requred for each PDM landmark, t consttutes a large computaton overhead. Although some approxmatons can be made, they are generally suboptmal. For example, n [8], the modes are chosen as the Klargest responses n the map. The covarances are parametrzed sotropcally, wth ther varance heurstcally set as the scaled dstance to the closest mode n the prevous teraton of the CLM fttng algorthm. Such an approxmaton allows an effcent estmate of the GMM parameters wthout the need for a costly EM procedure at the cost of a poorer approxmaton of the true response map. The second drawback of the GMM response map approxmaton s that the approxmated objectve n Equaton (15) s multmodal. As such, CLM fttng wth the GMM smplfcaton s prone to termnatng n local optma. Although good results were reported n [8], n that work the PDM was parameterzed usng a mxture model as opposed to the more typcal Gaussan parameterzaton, whch places a stronger pror on the way the shape can vary. 3. Subspace Constraned MeanShfts Rather than approxmatng the response maps for each PDM landmark usng parametrc models, we consder here the use of a nonparametrc representaton. In partcular, we propose the use of a homoscedastc kernel densty estmate (KDE) wth an sotropc Gaussan kernel: p(l = algned x) α µ N (x; µ,σ 2 I), (21) µ Ψ x c where α µ s the normalzed true detector response defned n Equaton (11). Wth ths representaton the kernel centers are fxed as defned through Ψ x c (.e. the grd nodes of the search wndow). The mxng weghts, α µ, can be obtaned drectly from the true response map. Snce the response s an estmate of the probablty that a partcular locaton n the mage s the algned landmark locaton, such a choce for the mxng coeffcents s reasonable. Compared to parametrc representatons, KDE has the advantage that no nonlnear optmzaton s requred to learn the parameters of ts representaton. The only remanng free parameter s the varance of the Gaussan kernel, σ 2, whch regulates the smoothness of the approxmaton. Snce one of the man problems wth a GMM based representaton s the computatonal complexty and suboptmal nature of fttng a mxture model to the response maps, f σ 2 s set apror, then optmzng over the KDE can be expected to be more stable and effcent. Maxmzng the objectve n Equaton (4) wth a KDE representatons s nontrval as the objectve s nonlnear and typcally multmodal. However, n the case where no shape pror s placed on the way the PDM s landmarks can vary, the problem reverts to ndependent maxmzatons of the KDE for each landmark locaton separately. Ths s because the landmark detectons are assumed to be ndependent, condtoned on the PDM s parameterzaton. A common approach for maxmzaton over a KDE s to use the well known meanshft algorthm [1]. It conssts of fxed pont teratons of the form: ( ) (τ +1) x α µ N x (τ ) ; µ,σ 2 I ( )µ, µ Ψ x c y Ψ x α c y N x (τ ) ; y,σ 2 I (22) where τ denotes the tmestep n the teratve process. Ths fxed pont teraton scheme fnds a mode of the KDE, where an mprovement s guaranteed at each step by vrtue of ts nterpretaton as a lower bound maxmzaton [6]. Compared to other optmzaton strateges, meanshft s an attractve choce as t does not use a step sze parameter or a lne search. Equaton (22) s smply appled teratvely untl some convergence crteron s met. To ncorporate the shape model constrant nto the optmzaton procedure, one mght consder a two step strategy: () compute the meanshft update for each landmark, and () constran the meanshfted landmarks to adhere to the PDM s parameterzaton usng a leastsquares ft: Q(p) = n x x (τ +1) 2. (23) Ths s remnscent of the ASM optmzaton strategy, where the locaton of the response map s peak s replaced wth the meanshfted estmate. Although such a strategy s attractve n ts smplcty, t s unclear how t relates to the global
5 Algorthm 1 Subspace Constraned MeanShfts Requre: I and p. 1: whle not converged(p) do 2: Compute responses {Eqn. (2)} 3: Lnearze shape model {Eqn. (6)} 4: Precompute pseudonverse of Jacoban (J ) 5: Intalze parameter updates: p 0 6: whle not converged( p) do 7: Compute meanshfted landmarks {Eqn. (22)} 8: Apply subspace constrant {Eqn. (24)} 9: end whle 10: Update parameters: p p + p 11: end whle 12: return p Fgure 3. Illustraton of a the use of a precomputed grd for effcent meanshft. Kernel evaluatons are precomputed between c and all other nodes n the grd. To approxmate the true kernel evaluaton, x s assumed to concde wth c and the lkelhood of any response map grd locaton can be attaned by a table lookup. objectve n Equaton (4). Gven the form of the KDE representaton n Equaton (21), one can treat t smply as a GMM. As such, the dscussons n 2.2 on GMMs are drectly applcable here, replacng the number of canddates K wth the number of grd nodes n the search wndow Ψ x c, the mxture weghts π k wth α µ, and the covarances Σ k wth the scaled dentty σ 2 I. When usng the lnearzed shape model n Equaton (6) and maxmzng the global objectve n Equaton (4) usng the EM algorthm, the soluton for the so called Q functon of the Mstep takes the form: [ p = J (τ +1) x 1 x c 1 ;... ; x (τ +1) n ] x c n, (24) where J (τ +1) denotes the pseudonverse of J, and x s the mean shfted update for the th landmark gven n Equaton (22). Ths s smply the Gauss Newton update for the least squares PDM constrant n Equaton (23). As such, under a lnearzed shape model, the two step strategy for maxmzng the objectve n Equaton (4) wth a KDE representaton shares the propertes of a general EM optmzaton, namely: provably mprovng and convergent. The complete fttng procedure, whch we wll refer to as subspace constraned meanshfts (SCMS), s outlned n Algorthm 1. In the followng, two further nnovatons are proposed, whch address dffcultes regardng local optma and the computatonal expense of kernel evaluatons. Kernel Wdth Relaxaton: The response map approxmatons dscussed n 2.2 can be though of as a form of smoothng. Ths explans the relatve performance of the varous methods. The Gaussan approxmatons smooth the most but approxmate the true response map the poorest, whereas smoothng effected by the GMM s not as aggressve but exhbts of a degree of senstvty towards local optma. One mght consder usng the Gaussan and GMM approxmatons n tandem, where the Gaussan approxma ton s used to get wthn the convergence basn of the GMM approxmaton. However, such an approach s nelegant and affords no guarantee that the mode of the Gaussan approxmaton les wthn the convergence basn of the GMM s. Wth the KDE approxmaton n SCMS a more elegant approach can be devsed, whereby the complexty of the response map estmate s drectly controlled by the varance of the Gaussan kernel (see Fgure 2). The gudng prncple here s smlar to that of optmzng on a Gaussan pyramd. It can be shown that when usng Gaussan kernels, there exsts a σ 2 < such that the KDE s unmodal, regardless of the dstrbuton of samples [13]. As σ 2 s reduced, modes dvde and smoothness of the objectve s terran decreases. However, t s lkely that the optmum of the objectve at a larger σ 2 s closest to the desred mode of the objectve wth a smaller σ 2, promotng ts convergence to the correct mode. As such, the polcy under whch σ 2 s reduced acts to gude optmzaton towards the global optmum of the true objectve. Drawng parallels wth exstng methods, as σ 2 the SCMS update approaches the soluton of a homoscedastc Gaussan approxmated objectve functon. As σ 2 s reduced, the KDE approxmaton resembles a GMM approxmaton, where the approxmaton for smaller σ 2 settngs s smlar to a GMM approxmaton wth more modes. Precomputed Grd: In the KDE representaton of the response maps, the kernel centers are placed at the grd nodes defned by the search wndow. From the perspectve of GMM fttng, these kernels represent canddates for the true landmark locatons. Although no optmzaton s requred for determnng the number of modes, ther centers and mxng coeffcents, the number of canddates used here s much larger than what would typcally be used n a general GMM estmate (.e. GMM based representatons typcally use K<10, whereas the search wndow sze typcally has > 100 nodes). As such, the computaton of the posteror n Equaton (16) wll be more costly. However, f the var
6 ProportonofImages ASM(88ms) CQF(98ms) GMM(2410ms) KDE(121ms) MultPeFttngCurve ProportonofImages XM2VTSFttngCurve ASM(84ms) CQF(93ms) GMM(2313ms) KDE(117ms) ShapeRMSError ShapeRMSError (a) (b) Fgure 4. Fttng Curves for the ASM, CQF, GMM and KDE optmzaton strateges on the MultPe and XM2VTS databases. ance σ 2 s known apror, then some approxmatons can be made to sgnfcantly reduce computatonal complexty. The man overhead when computng the meanshft update s n evaluatng the Gaussan kernel between the current landmark estmate and every grd node n the response map. Snce the grd locatons are fxed and σ 2 s assumed to be known, one mght choose to precompute the kernel for varous settngs of x. In partcular, a smple choce would be to precompute these values along a grd sampled at or above the resoluton of the response map grd Ψ x c. Durng fttng one smply fnds the locaton n ths grd closest to the current estmate of a PDM landmark and estmate the kernel evaluatons by assumng the landmark s actually placed at that node (see Fgure 3). Ths only nvolves a table lookup and can be performed effcently. The hgher the granularty of the grd the better the approxmaton wll be, at the cost of greater storage requrements but wthout a sgnfcant ncrease n computatonal complexty. Although such an approxmaton runs the strctly mprovng propertes of EM, we emprcally show n 4 that accurate fttng can stll be acheved wth ths approxmaton. In our mplementaton, we found that such an approxmaton reduced the average fttng tme by one half. 4. Experments Database Specfc Experments: We compared the varous CLM optmzatons strateges dscussed above on the problem of generc frontal face fttng on two databases: () the CMU Pose, Illumnaton and Expresson Database (Mult Pe) [7], and () the XM2VTS database [12]. The MultPe database s annotated wth a 68pont markup used as ground truth landmarks. We used 762 frontal face mages of 339 subjects. The XM2VTS database conssts of 2360 frontal face mages of 295 subjects for whch ground truth annotatons are publcly avalable but dfferent from the 68pont markup we have for MultPe. XM2VTS contans neutral expresson only whereas MultPe contans sgnfcant expresson varatons. A 4fold cross valdaton was performed on both MultPe and XM2VTS, separately, where the mages were parttoned nto three sets of nonoverlappng subject denttes. In each tral, three parttons were used for tranng and the remander for testng. On these databases we compared four types of optmzaton strateges: () ASM [2], () CQF [16], () GMM [8], and (v) the KDE method proposed n 3. For GMM, we emprcally set K =5and used the EM algorthm to estmate the parameters of the mxture model. For KDE, we used a varance relaxaton polcy of σ 2 = {20, 10, 5, 1} and a grd spacng of 0.1pxels n ts effcent approxmaton. In all cases the lnear logstc regressor descrbed n 2.1 was used. The local experts were (11 11)pxels n sze and the exhaustve local search was performed over a (15 15) pxel wndow. As such, the only dfference between the varous methods compared here s ther optmzaton strategy. In all cases, the scale and locaton of the model was ntalzed by an offtheshelf face detector, the rotaton and nonrgd parameters n Equaton (1) set to zero (.e. the mean shape), and the model ft untl the optmzaton converged. Results of these experments can be found n Fgure 4, where the graphs (fttng curves) show the proporton of mages at whch varous levels of maxmum perturbaton was exhbted, measured as the rootmeansquared (RMS) error between the ground truth landmarks and the resultng ft. The average fttng tmes for the varous methods on a 2.5GHz Intel Core 2 Duo processor are shown n the legend. The results show a consstent trend n the relatve performance of the four methods. Frstly, CQF has the capac
7 ShapeRMSError ASM GMM CQF KDE Frame Fgure 5. Top row: Trackng results on the FGNet Talkng Face database for frames {0, 1230, 4200}. Clockwse from top left are fttng results for ASM, CQF, KDE and GMM. Bottom: Plot of shape RMS error from ground truth annotatons throughout the sequence ty to sgnfcantly outperform ASM. As dscussed n 2.2 ths s due to CQF s ablty to account for drectonal uncertanty n the response maps as well as beng more robust towards outlyng responses. However, CQF has a tendency to oversmooth the response maps, leadng to lmted convergence accuracy. GMM shows an mprovement n accuracy over CQF as shown by the larger number of samples that converged to smaller shape RMS errors. However, t has the tendency to termnate n local optma due to ts multmodal objectve. Ths can be seen by ts poorer performance than CQF for reconstructons errors above 4.2 pxels RMS n MultPe and 5pxels RMS n XM2VTS. In contrast, KDE s capable of attanng even better accuraces than GMM but stll retans a degree of robustness towards local optma, where ts performance over grossly msplaced ntalzatons s comparable to CQF. Fnally, despte the sgnfcant mprovement n performance, KDE exhbts only a modest ncrease n computatonal complexty compared to ASM and CQF. Ths s n contrast to GMM that requres much longer fttng tmes, manly due to the complexty of fttng a mxture model to the response maps. OutofDatabase Experments: Testng the performance of fttng algorthms on mages outsde of a partcular database s more meanngful as t gves a better ndcaton on how well the method generalzes. However, ths s rarely conducted as t requres the tedous process of annotatng new mages wth the PDM confguraton of the tranng set. Here, we utlze the freely avalable FGNet talkng face sequence 3. Quanttatve analyss on ths sequence s possble snce ground truth annotatons are avalable n the same format as that n XM2VTS. We ntalze the model usng a face detector n the frst frame and ft consecutve frames usng the PDM s confguraton n the prevous frame as an ntal estmate. The same model used n the databasespecfc experments was used here, except that t was traned on all mages n XM2VTS. In Fgure 5, the shape RMS error for each frame s plotted for the four optmzaton strateges beng compared. The relatve performance of the varous strateges s smlar to that n the databasespecfc experments, wth KDE yeldng the best performance. ASM and GMM are partcularly unstable on ths sequence, wth GMM loosng track at around frame 4200, and fals to recover untl the end of the sequence. Fnally, we performed a qualtatve analyss of KDE s performance on the Faces n the Wld database [9]. It contans mages taken under varyng lghtng, resoluton, mage nose and partal occluson. As before, the model was ntalzed usng a face detector and ft usng the XM2VTS TalkngFace/talkng_face.html
8 Fgure 6. Example fttng results on the Faces n the Wld database usng a model traned usng the XM2VTS database. Top row: Male subjects. Mddle row: female subjects. Bottom row: partally occluded faces. traned model. Some fttng results are shown n Fgure 6. Results suggest that KDE exhbts a degree of robustness towards varatons typcally encountered n real mages. 5. Concluson The optmzaton strategy for deformable model fttng was nvestgated n ths work. Varous exstng methods were posed wthn a consstent probablstc framework where they were shown to make dfferent parametrc approxmatons to the true lkelhood maps of landmark locatons. A new approxmaton was then proposed that uses a nonparametrc representaton. Two further nnovatons were proposed n order to reduce computatonal complexty and avod local optma. The proposed method was shown to outperform three other optmzaton strateges on the task of generc face fttng. Future work wll nvolve nvestgatons nto the effects of dfferent local detectors types and shape prors on the optmzaton strateges. References [1] Y. Cheng. Mean Shft, Mode Seekng, and Clusterng. PAMI, 17(8): , [2] T. F. Cootes and C. J. Taylor. Actve Shape Models  Smart Snakes. In BMVC, pages , [3] D. Crstnacce and T. Cootes. Boosted Actve Shape Models. In BMVC, volume 2, pages , [4] D. Crstnacce and T. F. Cootes. A Comparson of Shape Constraned Facal Feature Detectors. In FG, pages , [5] D. Crstnacce and T. F. Cootes. Feature Detecton and Trackng wth Constraned Local Models. In EMCV, pages , [6] M. Fashng and C. Tomas. Mean Shft as a Bound Optmzaton. PAMI, 27(3), [7] R. Gross, I. Matthews, S. Baker, and T. Kanade. The CMU Multple Pose, Illumnaton and Expresson (MultPIE) Database. Techncal report, Robotcs Insttute, Carnege Mellon Unversty, [8] L. Gu and T. Kanade. A Generatve Shape Regularzaton Model for Robust Face Algnment. In ECCV 08, [9] G. B. Huang, M. Ramesh, T. Berg, and E. LearnedMller. Labeled Faces n the Wld: A Database for Studyng Face Recognton n Unconstraned Envronments. Techncal Report 0749, Unversty of Massachusetts, Amherst, [10] X. Lu. Generc Face Algnment usng Boosted Appearance Model. In CVPR, pages 1 8, [11] I. Matthews and S. Baker. Actve Appearance Models Revsted. IJCV, 60: , [12] K. Messer, J. Matas, J. Kttler, J. Lüttn, and G. Matre. XM2VTSDB: The Extended M2VTS Database. In AVBPA, pages 72 77, [13] M. A. C.P. nán and C. K. I. Wllams. On the Number of Modes of a Gaussan Mxture. Lecture Notes n Computer Scence, 2695: , [14] M. H. Nguyen and F. De la Torre Frade. Local Mnma Free Parameterzed Appearance Models. In CVPR, [15] J. Saragh and R. Goecke. A Nonlnear Dscrmnatve Approach to AAM Fttng. In ICCV, [16] Y. Wang, S. Lucey, and J. Cohn. Enforcng Convexty for Improved Algnment wth Constraned Local Models. In CVPR, 2008.
Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)
Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationCS 2750 Machine Learning. Lecture 17a. Clustering. CS 2750 Machine Learning. Clustering
Lecture 7a Clusterng Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square Clusterng Groups together smlar nstances n the data sample Basc clusterng problem: dstrbute data nto k dfferent groups such that
More informationNonlinear data mapping by neural networks
Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationLogistic Regression. Steve Kroon
Logstc Regresson Steve Kroon Course notes sectons: 24.324.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationThe Analysis of Outliers in Statistical Data
THALES Project No. xxxx The Analyss of Outlers n Statstcal Data Research Team Chrysses Caron, Assocate Professor (P.I.) Vaslk Karot, Doctoral canddate Polychrons Economou, Chrstna Perrakou, Postgraduate
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationGRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM
GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM BARRIOT JeanPerre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jeanperre.barrot@cnes.fr 1/Introducton The
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationDetecting Global Motion Patterns in Complex Videos
Detectng Global Moton Patterns n Complex Vdeos Mn Hu, Saad Al, Mubarak Shah Computer Vson Lab, Unversty of Central Florda {mhu,sal,shah}@eecs.ucf.edu Abstract Learnng domnant moton patterns or actvtes
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationClustering Gene Expression Data. (Slides thanks to Dr. Mark Craven)
Clusterng Gene Epresson Data Sldes thanks to Dr. Mark Craven Gene Epresson Proles we ll assume we have a D matr o gene epresson measurements rows represent genes columns represent derent eperments tme
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationLatent Class Regression. Statistics for Psychosocial Research II: Structural Models December 4 and 6, 2006
Latent Class Regresson Statstcs for Psychosocal Research II: Structural Models December 4 and 6, 2006 Latent Class Regresson (LCR) What s t and when do we use t? Recall the standard latent class model
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationHallucinating Multiple Occluded CCTV Face Images of Different Resolutions
In Proc. IEEE Internatonal Conference on Advanced Vdeo and Sgnal based Survellance (AVSS 05), September 2005 Hallucnatng Multple Occluded CCTV Face Images of Dfferent Resolutons Ku Ja Shaogang Gong Computer
More informationBypassing Synthesis: PLS for Face Recognition with Pose, LowResolution and Sketch
Bypassng Synthess: PLS for Face Recognton wth Pose, LowResoluton and Setch Abhshe Sharma Insttute of Advanced Computer Scence Unversty of Maryland, USA bhoaal@umacs.umd.edu Davd W Jacobs Insttute of Advanced
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul  PUCRS Av. Ipranga,
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationRealistic Image Synthesis
Realstc Image Synthess  Combned Samplng and Path Tracng  Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random
More informationAn Algorithm for DataDriven Bandwidth Selection
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 25, NO. 2, FEBRUARY 2003 An Algorthm for DataDrven Bandwdth Selecton Dorn Comancu, Member, IEEE Abstract The analyss of a feature space
More informationUsing Mixture Covariance Matrices to Improve Face and Facial Expression Recognitions
Usng Mxture Covarance Matrces to Improve Face and Facal Expresson Recogntons Carlos E. homaz, Duncan F. Glles and Raul Q. Fetosa 2 Imperal College of Scence echnology and Medcne, Department of Computng,
More informationCHAPTER 14 MORE ABOUT REGRESSION
CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationTime Series Analysis in Studies of AGN Variability. Bradley M. Peterson The Ohio State University
Tme Seres Analyss n Studes of AGN Varablty Bradley M. Peterson The Oho State Unversty 1 Lnear Correlaton Degree to whch two parameters are lnearly correlated can be expressed n terms of the lnear correlaton
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationClustering Gene Expression Data
Clusterng Gene Expresson Data BMI/CS 576 www.bostat.wsc.edu/bm576/ Mark Craven craven@bostat.wsc.edu Fall 2011 Gene expresson profles we ll assume we have a 2D matrx of gene expresson measurements rows
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationHuman Tracking by Fast Mean Shift Mode Seeking
JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 1 Human Trackng by Fast Mean Shft Mode Seekng [10 font sze blank 1] [10 font sze blank 2] C. Belezna Advanced Computer Vson GmbH  ACV, Venna, Austra Emal:
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationLecture 5,6 Linear Methods for Classification. Summary
Lecture 5,6 Lnear Methods for Classfcaton Rce ELEC 697 Farnaz Koushanfar Fall 2006 Summary Bayes Classfers Lnear Classfers Lnear regresson of an ndcator matrx Lnear dscrmnant analyss (LDA) Logstc regresson
More informationAbstract. Clustering ensembles have emerged as a powerful method for improving both the
Clusterng Ensembles: {topchyal, Models jan, of punch}@cse.msu.edu Consensus and Weak Parttons * Alexander Topchy, Anl K. Jan, and Wllam Punch Department of Computer Scence and Engneerng, Mchgan State Unversty
More informationSOLVING CARDINALITY CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM BY BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM
SOLVIG CARDIALITY COSTRAIED PORTFOLIO OPTIMIZATIO PROBLEM BY BIARY PARTICLE SWARM OPTIMIZATIO ALGORITHM Aleš Kresta Klíčová slova: optmalzace portfola, bnární algortmus rojení částc Key words: portfolo
More informationDamage detection in composite laminates using cointap method
Damage detecton n composte lamnates usng contap method S.J. Km Korea Aerospace Research Insttute, 45 EoeunDong, YouseongGu, 35333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The contap test has the
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationExhaustive Regression. An Exploration of RegressionBased Data Mining Techniques Using Super Computation
Exhaustve Regresson An Exploraton of RegressonBased Data Mnng Technques Usng Super Computaton Antony Daves, Ph.D. Assocate Professor of Economcs Duquesne Unversty Pttsburgh, PA 58 Research Fellow The
More informationAn Empirical Study of Search Engine Advertising Effectiveness
An Emprcal Study of Search Engne Advertsng Effectveness Sanjog Msra, Smon School of Busness Unversty of Rochester Edeal Pnker, Smon School of Busness Unversty of Rochester Alan RmmKaufman, RmmKaufman
More informationSupport vector domain description
Pattern Recognton Letters 20 (1999) 1191±1199 www.elsever.nl/locate/patrec Support vector doman descrpton Davd M.J. Tax *,1, Robert P.W. Dun Pattern Recognton Group, Faculty of Appled Scence, Delft Unversty
More informationAn interactive system for structurebased ASCII art creation
An nteractve system for structurebased ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract NonPhotorealstc Renderng (NPR), whose am
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationLearning from Multiple Outlooks
Learnng from Multple Outlooks Maayan Harel Department of Electrcal Engneerng, Technon, Hafa, Israel She Mannor Department of Electrcal Engneerng, Technon, Hafa, Israel maayanga@tx.technon.ac.l she@ee.technon.ac.l
More informationGeorey E. Hinton. University oftoronto. Email: zoubin@cs.toronto.edu. Technical Report CRGTR961. May 21, 1996 (revised Feb 27, 1997) Abstract
The EM Algorthm for Mxtures of Factor Analyzers Zoubn Ghahraman Georey E. Hnton Department of Computer Scence Unversty oftoronto 6 Kng's College Road Toronto, Canada M5S A4 Emal: zoubn@cs.toronto.edu Techncal
More informationBayesian Cluster Ensembles
Bayesan Cluster Ensembles Hongjun Wang 1, Hanhua Shan 2 and Arndam Banerjee 2 1 Informaton Research Insttute, Southwest Jaotong Unversty, Chengdu, Schuan, 610031, Chna 2 Department of Computer Scence &
More informationTracking with NonLinear Dynamic Models
CHAPTER 2 Trackng wth NonLnear Dynamc Models In a lnear dynamc model wth lnear measurements, there s always only one peak n the posteror; very small nonlneartes n dynamc models can lead to a substantal
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationRiskbased Fatigue Estimate of Deep Water Risers  Course Project for EM388F: Fracture Mechanics, Spring 2008
Rskbased Fatgue Estmate of Deep Water Rsers  Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationA machine vision approach for detecting and inspecting circular parts
A machne vson approach for detectng and nspectng crcular parts DuMng Tsa Machne Vson Lab. Department of Industral Engneerng and Management YuanZe Unversty, ChungL, Tawan, R.O.C. Emal: edmtsa@saturn.yzu.edu.tw
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationSolving Factored MDPs with Continuous and Discrete Variables
Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent
More informationCredit Limit Optimization (CLO) for Credit Cards
Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsnyng Wu b a Professor (Management Scence), Natonal Chao
More informationSIMPLE LINEAR CORRELATION
SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationMultiplePeriod Attribution: Residuals and Compounding
MultplePerod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationRegression Models for a Binary Response Using EXCEL and JMP
SEMATECH 997 Statstcal Methods Symposum Austn Regresson Models for a Bnary Response Usng EXCEL and JMP Davd C. Trndade, Ph.D. STATTECH Consultng and Tranng n Appled Statstcs San Jose, CA Topcs Practcal
More informationCharacterization of Assembly. Variation Analysis Methods. A Thesis. Presented to the. Department of Mechanical Engineering. Brigham Young University
Characterzaton of Assembly Varaton Analyss Methods A Thess Presented to the Department of Mechancal Engneerng Brgham Young Unversty In Partal Fulfllment of the Requrements for the Degree Master of Scence
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationAdaptive Fractal Image Coding in the Frequency Domain
PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 222 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL
More information2.4 Bivariate distributions
page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationAn Enhanced SuperResolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced SuperResoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement YuChuan Kuo ( ), ChenYu Chen ( ), and ChouShann Fuh ( ) Department of Computer Scence
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationEvaluating credit risk models: A critique and a new proposal
Evaluatng credt rsk models: A crtque and a new proposal Hergen Frerchs* Gunter Löffler Unversty of Frankfurt (Man) February 14, 2001 Abstract Evaluatng the qualty of credt portfolo rsk models s an mportant
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationCorrelation Filters for Object Alignment
03 IEEE Conference on Computer Vson and Pattern Recognton Correlaton Flters for Object Algnment Vshnu aresh Boddet Carnege Mellon Unversty naresh@cmuedu Takeo Kanade Carnege Mellon Unversty tk@cscmuedu
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationGender Classification for RealTime Audience Analysis System
Gender Classfcaton for RealTme Audence Analyss System Vladmr Khryashchev, Lev Shmaglt, Andrey Shemyakov, Anton Lebedev Yaroslavl State Unversty Yaroslavl, Russa vhr@yandex.ru, shmaglt_lev@yahoo.com, andrey.shemakov@gmal.com,
More informationProperties of Indoor Received Signal Strength for WLAN Location Fingerprinting
Propertes of Indoor Receved Sgnal Strength for WLAN Locaton Fngerprntng Kamol Kaemarungs and Prashant Krshnamurthy Telecommuncatons Program, School of Informaton Scences, Unversty of Pttsburgh Emal: kakst2,prashk@ptt.edu
More informationFast Fuzzy Clustering of Web Page Collections
Fast Fuzzy Clusterng of Web Page Collectons Chrstan Borgelt and Andreas Nürnberger Dept. of Knowledge Processng and Language Engneerng OttovonGuerckeUnversty of Magdeburg Unverstätsplatz, D396 Magdeburg,
More informationCHAPTER 5 RELATIONSHIPS BETWEEN QUANTITATIVE VARIABLES
CHAPTER 5 RELATIONSHIPS BETWEEN QUANTITATIVE VARIABLES In ths chapter, we wll learn how to descrbe the relatonshp between two quanttatve varables. Remember (from Chapter 2) that the terms quanttatve varable
More informationBERNSTEIN POLYNOMIALS
OnLne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationTime Domain simulation of PD Propagation in XLPE Cables Considering Frequency Dependent Parameters
Internatonal Journal of Smart Grd and Clean Energy Tme Doman smulaton of PD Propagaton n XLPE Cables Consderng Frequency Dependent Parameters We Zhang a, Jan He b, Ln Tan b, Xuejun Lv b, HongJe L a *
More informationActiveClean: Interactive Data Cleaning While Learning Convex Loss Models
ActveClean: Interactve Data Cleanng Whle Learnng Convex Loss Models Sanjay Krshnan, Jannan Wang, Eugene Wu, Mchael J. Frankln, Ken Goldberg UC Berkeley, Columba Unversty {sanjaykrshnan, jnwang, frankln,
More informationDisagreementBased MultiSystem Tracking
DsagreementBased MultSystem Trackng Quannan L 1, Xnggang Wang 2, We Wang 3, Yuan Jang 3, ZhHua Zhou 3, Zhuowen Tu 1 1 Lab of Neuro Imagng, Unversty of Calforna, Los Angeles 2 Huazhong Unversty of Scence
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationEye Center Localization on a Facial Image Based on MultiBlock Local Binary Patterns
Eye Center Localzaton on a Facal Image Based on MultBloc Local Bnary Patterns Anatoly tn, Vladmr Khryashchev, Olga Stepanova Yaroslavl State Unversty Yaroslavl, Russa anatolyntnyar@gmal.com, vhr@yandex.ru,
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More information