Posterior CramerRao Bounds for MultiTarget Tracking


 Griffin Watts
 1 years ago
 Views:
Transcription
1 Poseror CramerRao Bounds for MulTarge Trackng C. HUE INRA France JP. LE CADRE, Member, IEEE IRISA/CNRS France P. PÉREZ IRISA/INRIA France ACRONYMS B1 PCRB compued under he assumpon ha he assocaons are known B PCRB compued under he A1 and A assumpons B3 PCRB compued under he A1 and A3 assumpons CRB CramérRao bounds PCRB Poseror CramérRao bounds IRF Informaon reducon facor EM Expecaonmaxmzaon algorhm EKF Exended Kalman fler KF Kalman fler PDAF Probablsc daa assocaon fler JPDAF Jon probabls daa assocaon fler MHT Mulple hypoheses racker PMHT Probablsc mulple hypoheses racker MOPF Mulple objecs parcle fler RMSE Roo mean square error. Ths sudy s concerned wh mularge rackng (MTT. The CramérRao lower bound (CRB s he basc ool for nvesgang esmaon performance. Though bascally defned for esmaon of deermnsc parameers, has been exended o sochasc ones n a Bayesan seng. In he arge rackng area, we have hus o deal wh he esmaon of he whole rajecory, self descrbed by a Markovan model. Ths leads up o he recursve formulaon of he poseror CRB (PCRB. The am of he work presened here s o exend hs calculaon of he PCRB o MTT under varous assumpons. NOTATIONS A º B A B posve semdefne r X xnx ] T Y T X r X r Y E p Expecaon compued w.r.. he densy p J (p E[ log(p] Leer used as an ndex o denoe me varyngbeween0andt Leer used as an exponen o denoe one of he M arges j Leer used as an exponen o denoe one of he m measuremens a me P d Deecon probably Parameer of he Posson law modelng he number of false alarms V observaon volume. I. INTRODUCTION Manuscrp receved June 4, 003; revsed February 14, 004 and Aprl 19, 005; released for publcaon May 1, 005. IEEE Log No. TAES/4/1/ Refereeng of hs conrbuon was handled by P. K. Wlle. Auhors addresses: C. Hue, INRA, Cenre de Recherches de Toulouse, BP 7, F3136, Casane, Tolosan Cedex, France, Emal: JP. Le Cadre and P. Pérez, IRISA, Campus de Beauleu, 3504 Rennes Cedex, France /06/$17.00 c 006 IEEE Ths sudy s concerned wh mularge rackng (MTT,.e., he esmaon of he sae vecor made by concaenang he sae vecors of several arges. As assocaon beween measuremens and arges are unknown, MTT s much more complex han snglearge rackng. Exsng MTT algorhms generally presen wo basc ngredens: an esmaon algorhm coupled wh a daa assocaon mehod. Among he mos popular algorhms based on (exended Kalman flers (EKFs are he jon probablsc daa assocaon fler (JPDAF, he mulple hypohess racker (MHT or, more recenly, he probablsc MHT (PMHT. They vary on he assocaon mehod n use. Wh he developmen of he sequenal Mone Carlo (SMC mehods, new opporunes for MTT have appeared. The sae IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY
2 dsrbuon s hen esmaed wh a fne weghed sum of Drac mass cenered around parcles. The CramérRao lower bound (CRB [1] s wdely used for assessng esmaon performance. Though a grea deal of aenon has been pad o measures of performance such as rack 1 pury and correc assgnmen rao [] hese mehods are based on dscree assgnmens of measuremens o racks and are hus no unversally applcable. Ther neres s, o a large exen, due o he fac ha numerous MTT algorhms rely on hard assocaon. Whn hs framework hs ype of analyss s que pernen; bu here s a need for a smple and versale formulaon of a performance measure n he MTT conex; whch leads us o focus on CRB. These bounds are developed here n a general framework whch employs a probablsc srucure on he measuremenoarge assocaon. Agan, he dffculy of obanng CRB for MTT s due o a need for an assocaon beween measuremens and racks, and o ncorporae hs basc sep n he CRB calculaon. Thus, esmaon of he arge saes on he one hand, and of he measuremenorack assocaon probables on he oher, are ghly relaed. On anoher hand, whle he CRB s an essenal ool for analyzng performance of deermnsc sysems, he poseror CRB (PCRB s a measure of he maxmum nformaon whch can be exraced from a dynamc sysem when boh measuremens and sae are assumed o be random, hus evaluang performance of he bes unbased fler. Thus, performance analyss s now consdered n a Bayesan seup. Naurally, hs analyss deals wh racks and dmenson grows lnearly wh me. Que remarkably, has been shown ha a recursve Rccalke formulaon of he PCRB could be derved under reasonable assumpons. Here, we show ha hs framework s sll vald n he MTT seup and allows us o derve convenen bounds. Ths paper s organzed as follows. The MTT problem s nroduced n Secon II, followed by a bref background on PCRB for nonlnear flerng (Secon III. Secon IV s he core of hs manuscrp snce deals wh he dervaon of he PCRB for MTT, under varous assocaon modelngs. These bounds are llusraed by compuaonal resuls. II. THE MULTITARGET TRACKING PROBLEM A. General Framework Le M be he number of arges o rack, assumed o be known and fxed here. The ndex desgnaes one among he M arges and s always used as 1 By rack, we consder here a sequence of saes assocaed wh a Markovan model. superscrp. MTT consss n esmang he sae vecor made by concaenang he sae vecors of all arges. I s generally assumed ha he arges are movng accordng o ndependen Markovan dynamcs, even hough can be crczed lke n [3]. A me, X =(X 1,:::,XM follows he sae equaon decomposed n M paral equaons: X = F (X 1,V 8 =1,:::,M: (1 The noses (V and(v0 are supposed only o be whe boh emporally and spaally, and ndependen for 6= 0. The observaon vecor colleced a me s denoed by y =(y 1,:::,ym. The ndex j s used as frs superscrp o refer o one of he m measuremens. The vecor y s composed of deecon measuremens and cluer measuremens. The false alarms are assumed o be unformly dsrbued n he observaon area. Ther number s assumed o arse from a Posson densy ¹ f of parameer V where V s he volume of he observaon area and he average number of false alarms per un volume. As we do no know he orgn of each measuremen, one has o nroduce he vecor K o descrbe he assocaons beween he measuremens and he arges. Each componen K j s a random varable ha akes s values among f0,:::,mg. Thus, K j = ndcaes ha y j s assocaed wh he h arge f =1,:::,M and ha s a false alarm f.inhe frs case, y j s a realzaon of he sochasc process: Y j = H (X,Wj f K j = : ( Agan, he noses (W j and(w j0 are supposed only o be whe noses, ndependen for j 6= j 0.Wedo no assocae any knemac model o false alarms. A measuremen recepon, he ndexng of he measuremens s arbrary and all he measuremens have he same pror probably o be assocaed wh a gven model. Thevarables(K j,:::,m are hen supposed dencally dsrbued. Ther common law s defned wh he probably (¼ =1,:::,M : ¼ =P(K j = 8 j =1,:::,m : (3 The probably ¼ s hen he pror probably ha an arbrary measuremen s assocaed wh model. The erm model denoes he arge f =1,:::,M and he model of false alarms f = 0. Inuvely, hs probably represens he observably of arge for =1,:::,M. The¼ vecor s consdered as a realzaon of he sochasc vecor =( 0, 1,:::, M wh he followng pror dsrbuon on : p( =p( 0 p( 1,:::, M j 0 (4 where p( 1,:::, M j 0 s unform on he hyperplane defned by P M =1 = IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
3 To solve he daa assocaon some assumpons are commonly made [4]: A1. One measuremen can orgnae from one arge or from he cluer. A. One arge can produce zero or one measuremen a one me. A3. One arge can produce zero or several measuremens a one me. Assumpon A1 expresses ha he assocaon s exclusve and exhausve. Unresolved observaons are hen excluded. From a mahemacal pon of vew, P he oal probably heorem can be used and M ¼ = 1 for every. Assumpon A mples for j =1,:::,m are dependen. Assumpon A3 s ofen crczed because may no mach he physcal realy. However, allows o suppose he sochasc ndependence of he varables ha he assocaon varables K j and drascally reduces he complexy of he ¼ vecor esmaon. K j B. Revew of Man MTT Algorhms Le us now brefly revew he reamen of he daa assocaon problem. The followng algorhms essenally dffer accordng o her esmaon srucure (deermnsc or sochasc and her assocaon assumpons. Frs, he daa assocaon problem occurs as soon as here s uncerany n measuremen orgn and no only n he case of mulple arges. In he case of one snglearge rackng, he negraon of false alarms n he model hen mples daa assocaon. The probablsc daa assocaon fler (PDAF [5] akes no accoun hs uncerany under he classcal hypoheses A1 and A. The JPDAF s an exenson of he PDAF for mulple arges [6]. Boh hese algorhms are based on Kalman fler (KF and consequenly assume lnear models and addve Gaussan noses n (1 and (. The man approxmaon consss of assumng ha he predced law s sll Gaussan whereas s n realy a sum of Gaussan assocaed wh he dfferen assocaons. The MHT sll uses A1 and A bu allows he deecon of a new arge a each me sep [7]. To cope wh he exploson of he assocaon number, some of hem mus be gnored n he esmaon. For hese hree algorhms ((JPDAF, MHT, a pror sascal valdaon of he measuremens decreases he nal assocaon number. Ths valdaon s based on he fundamenal hypohess ha he law p(y j Y 1: 1 s Gaussan, cenered around he predced measuremen and wh he nnovaon covarance. The valdaon gae s hen usually defned as he measuremen se for whch he Mahalanobs dsance o he predced measuremen s lower han a ceran hreshold. Some deals can be found n [4] TABLE I Classfcaon of Man MTT Algorhms Accordng o Ther Assocaon Assumpon and Esmaon Srucure Assocaon Assumpon Esmaon srucure A1 A A1 A3 Kalman fler (JPDAF MHT EM PMHT parcle fler SIRJPDAF MOPF for nsance. Ths valdaon gae procedure wll no be consdered hroughou, whch means ha all he measuremens wll be aken no accoun. Unlke he above algorhms, he PMHT s based on he assumpons A1 and A3. I proposes he bach esmaon of mulple arges n cluer va an expecaonmaxmzaon (EM algorhm. Radcally dfferen from a deermnsc approach lke KFbased rackers or EMbased rackers, he sochasc approach developed quckly hese las years. SMC mehods [8] esmae he enre a poseror law of he saes and no only he frs momens of hs law lke KFbased rackers do. In he conex of MTT, parcle flers are parcularly appealng: as he assocaon needs only o be consdered a a gven me eraon, he complexy of daa assocaon s reduced. For a sae of ar of he proposed algorhms he reader can refer o [9]. Agan, we can dsngush algorhms usng A for solvng daa assocaon lke he sequenal mporance resamplng (JPDAF, SIRJPDAF [10] or usng A3 lke he mulple objecs parcle fler (MOPF [11]. Classfcaon of he above algorhms accordng o her assocaon assumpon and esmaon srucure are summarzed n Table I. III. BACKGROUND ON POSTERIOR CRAMÉRRAO BOUNDS FOR NONLINEAR FILTERING I s of grea neres o derve mnmum varance bounds on esmaon errors o have an dea of he maxmum knowledge on he saes ha can be expeced and o assess he qualy of he resuls of he proposed algorhms compared wh he bounds. Frs defned and used n he conex of consan parameer esmaon, he nverse of he Fsher nformaon marx, commonly called he CramérRao (CR bound, has been exended o he case of random parameer esmaon n [1], hen called he PCRB. Le X R n x be a sochasc vecor and Y R n y asochasc observaon vecor. The meansquare error of any esmae ˆX(Y sasfes he nequaly E( ˆX(Y X( ˆX(Y X T º J 1 (5 The nequaly means ha he dfference E( ˆX(Y X( ˆX(Y X T J 1 s a posve semdefne marx. HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 39
4 where J = logp X,Y s he Fsher nformaon marx and where he expecaons are w.r.. he jon densy p X,Y (X,Y under he followng condons. X,Y p X,Y exs and are absoluely negrable w.r.. X and Y. The esmaor bas Z B(X= ( ˆX(Y Xp YjX (Y j XdY R ny sasfes: lm B(Xp(X, 8 l =1,:::,n x : X l! 1 (6 Le us consder he nonlnear dscree sysem for a unque objec: ½ X = F (X 1,V (7 Y = H (X,W and he assocaed flerng problem,.e., he esmaon of X gven Y 0: =(Y0,:::,Y. A frs approach consss of usng a lnear Gaussan sysem equvalen o (7 lke n [1] and [13]. The error covarance of he nal sysem s hen lower bounded by he error covarance of he Gaussan sysem. Neverheless, wo major remarks can be made [14]. Frs, he equvalen noon s no precsely defned n [1] and [13]. Second, seems no lkely ha here always exss such a lnear Gaussan sysem for nsance f he probably densy funcon (pdf s mulmodal. A revew of hs approach can be found n [14]. The approach recenly developed by Tchavsky, e al. n [15] orgnally consders he Fsher nformaon marx for he esmaon of X gven Y 0: as a submarx of he Fsher nformaon marx assocaed wh he esmaon of X 0: gven Y 0:. Usng he noaons of [15], J(X 0: denoes he (( +1n x ( +1n x nformaon marx of X 0: and J X denoes he n x n x nformaon submarx of X whch s he nverse of he n x n x rgh lower block of [J(X 0: ] 1. To avod nverson of oo large marces, a recursve expresson of he bound J X has been presenedrecenlyn[15]and[16]andsummarzed by he followng formula: J X+1 = DX DX 1 (J X + DX 11 1 DX 1 (8 where DX 11 = E[ X X logp(x +1 j X ] D 1 X = E[ X +1 X logp(x +1 j X ] DX 1 = E[ X X +1 logp(x +1 j X ] = [DX 1 ] T D X = E[ X +1 X +1 logp(x +1 j X ] + E[ X +1 X +1 logp(y +1 j X +1 ] (9 and where he r and operaors denoe he frs and second paral dervaves, respecvely: r X =,:::,, Y = r X r Y T : (10 xnx The marx J 1 X +1 provdes a lower bound on he meansquare error of esmang X +1. I can be shown n [17] ha hs bound s overopmsc bu has he grea advanage o be recursvely compuable. Le us see now some exensons recenly proposed for he PCRB. A. Inegraon of Deecon Probably In [18], he auhors propose o negrae he deecon probably n he prevous bound. For a scenaro of gven lengh, he bound s compued as a weghed sum on every possble deecon/nondeecon sequence. As he number of erms of hs sum grows exponenally he less sgnfcan are no aken no accoun. B. Exenson o Measuremen Orgn Unceranes Several works have suded CRBs for models wh measuremen orgn unceranes, bu for a snglearge. The assocaon of each measuremen o he arge or o he false alarm model can be done under he classcal hypoheses A1 and A or under A1 and A3. As CRB was frs defned for parameer esmaon, models wh deermnsc rajecores have frs been suded. If he nose s Gaussan, has been shown n [19] and [0] ha, under A1 and A, he nverse of he nformaon marx can hen be wren as he produc of he nverse of he nformaon marx whou false alarms by an nformaon reducon facor, noed IRF and lower han uny. In [1], he auhors show ha here s also an IRF for he PMHT measuremen model,.e., under he hypoheses A1 and A3. In he case of dynamc models, he exenson of he bound (8 o he case of lnear and nonlnear flerng wh measuremen orgn uncerany due o cluer has been recenly suded n [] and [3]. The exenson manly consss of replacng he classc pdf of he measuremen gven he sae by he pdf of he measuremen vecor akng no accoun he measuremen uncerany. The conclusons are he followng. 1 Under he assumpon of a Gaussan observaon nose wh a dagonal covarance marx, an IRF dagonal marx appears n he PCRB. The PCRB does no show nsably whereas rackng algorhms can relavely easly be pu no wrong. 40 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
5 3 The PCRB would be more affeced by a low P d han by a hgh sae or nose covarance or by a hgh cluer densy. 4 For low deecon probables, he PCRB s really overopmsc (versus PDAF RMSE. IV. POSTERIOR CRAMÉRRAO BOUNDS FOR MULTITARGET TRACKING Now, le us see how he PCRB proposed n [15] can be exended and used n he case of mulple arges flerng defned by (1 and (. Noe ha n hs case, he measuremen vecor s composed of deecon measuremens ssued from he dfferen arges and of false alarms. The followng exenson hen akes no accoun smulaneously he measuremen uncerany and he exenson of one o mulple arges. Frs, he recursve equaon (8 can be obaned as well for mulple arges usng he srucure of he jon law: p(x 0:+1,Y 0:+1 =p(x 0:,Y 0: p(x +1 j X p(y +1 j X +1 : Ths srucure s sll rue for mulple arges, whch leads o he same recursve formula for he nformaon marx. As he arges are supposed o move accordng o ndependen dynamcs, we have logp(x 1:M +1 j X1:M = MX =1 (11 logp(x+1 j X : (1 Consequenly, he marces DX 11, DX 1 and he frs erm of DX are smply blockdagonal marces where he h block s compued w.r.. X and X+1.Iremanshe second erm of DX,.e.,E[ X1:M +1 logp(y X 1:M +1 j X+1 1:M]. +1 As n [], we can decompose hs erm accordng o he observaon number usng he oal probably heorem: E[ X1:M +1 logp(y X 1:M +1 j X+1 1:M ] +1 1X = P(m +1 E[ X1:M +1 logp(y m +1 X 1:M +1 j X+1 1:M ] : +1 m +1 =1 B(m +1 The probables P(m +1 aregvenby P(m +1 = ¹= d (13 ¹X ( V d exp V P ¹ d d : (14 d! To compue B(m +1, we have o face agan he assocaon problem: some addonnal hypoheses mus be formulaed o gve explc expressons of he lkelhood p(y m j X +1. The problem s ha hese hypoheses condon he esmaon algorhm, whle hey should no nfluence he heorecal bound. We propose here o derve hree bounds: B1, he PCRB compued under he assumpon ha he assocaons are known. B, he PCRB compued under he A1 and A assumpons. B3, he PCRB compued under he A1 and A3 assumpons. The followng lemma s used hroughou he sequel. LEMMA 1 Le X =(X 1,:::,X M R n x and Y R n y wo sochasc varables and 1, wo negers [1,:::, M], hen he followng expecaon equaly holds rue: E X E YjX [ X logp(y j X] X 1 = E X E YjX [r logp(y j X(r X X logp(y j 1 XT ]: Le us defne he followng noaon: for wo vecors, and p a probably law, (15 J (p =E[ log(p]: (16 In he nex hree paragraphs we descrbe J X1:M +1 (p(y m X 1:M +1 j X1:M +1 accordng o he assocaon +1 assumpons. A. PCRB B1 The assocaon vecor s supposed o be known. We hen have Xm logp(y = y m j X = x,k = k = logp(y j j x kj : (17 The graden of he loglkelhood w.r.. X s no zero only f here exss j such ha k j =. Inhs case, r X logp(y m j x,k = r X p(yj j x : (18 p(y j j x We fnally oban for all =1,:::,M: J X (p(y m X and r Xp(y j j x j x,k = E X E j (r X p(y j j x T Y jx p(y j j x (19 J X (p(y X 1 j x,k = 0 f 1 6= : (0 HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 41
6 B. PCRB B We can wre logp(y = y m j X = x A1 A = log X k p(y =(y 1,:::,ym j x,k p(k =log X k Ym p(y j j x,k p(k : (1 The probably p(k = k can be compued from he deecon probably P d, he number of false alarms ª k, her dsrbuon law ¹ f and he bnary varable D K ( equal o one f he objec s deeced, zero else: p(k = k = ª k! m! ¹ f (ª k MY =1 P DK ( d MY (1 P d (: D1 K ( The graden of he loglkelhood w.r.. X s Q Pk r X logp(y j x = r m X p(yj j x,k p(k : p(y j x (3 Le us denoe by k ¾ he assocaons ha assocae one measuremen o he h arge. Under A, here exss a mos one such measuremen, denoed j. Then, P k ¾ Qj6=j p(y j r X logp(y j x = j x,k p(k r X p(y j j x : p(y j x (4 Usng Lemma 1, we oban for all 1, =1,:::,M: =1 PMHT, he maxmzaon sep for ¼ depends on he preceden esmaes for X and vce versa. The esmaon qualy of one hen srongly affecs he esmaon qualy of he oher. Smlarly for he MOPF, he smulaed values for ¼ are used for smulaed X values and vce versa. In hs conex, seems o us naural o consder he PCRB for he esmaon of he jon vecor (,X. For all ha, he PCRB on he esmaon of X can be deduced from he global one by an nverson formula as we see laer. From he equaly P M ¼ =1andas¼0 s fxed a each nsan, we only consder he M 1 componens 1:M 1 =( 1,:::, M 1. Le us defne =( 1:M 1 ; he jon law s,x 1:M p +1 =p( 0:+1,Y 0:+1 =p p(y +1 j +1 p(x +1 j X p( +1 : (6 Le J( 0: be he nformaon marx of 0: assocaed wh p ; we are neresed n a recursve expresson on of he nformaon submarx J for esmang. Le us recall ha J s he nformaon submarx of whch s he nverse of he rgh lower block of [J( 0: ] 1. Usng he srucure of he jon law p +1 and he same argumen as n [15], he followng recursve formula can be shown (see he proof n he appendx: J +1 = D D 1 (J + D 11 1 D 1 (7 where 0 D 11 = J 0 (p(x +1 j X = 0 DX 11 0 D 1 = J +1 0 (p(x +1 j X = 0 DX 1 E[ X logp(y X 1 j X ] 6 = E X E Y jx 4 Pk ¾ 1 Q j6=j 1 p(yj j x,k p(k r X p(y 1 j1 j x 1 p(y j x X Y k ¾ p(y j j x,k p(k (r X j6=j p(y j 3 7 j x T 5 (5 where E X and E Y jx denoe, respecvely, he expecaon w.r.. he densy p(x andp(y j X. Le us noce ha he negrals w.r.. y are m n y dmensonal. C. PCRB B3 To our knowledge, algorhms usng A3 need a jon esmaon of X and ¼.Inhsway,forhe D = J (p(y +1 j +1 p(x +1 j X p( +1 (8 0 0 = 0 J X +1 X +1 (p(x +1 j X J (p( J (p(y +1 j +1 : Once J s recursvely compued, a lower bound on he meansquare error of esmang X sgvenbyhe 4 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
7 nverson formula appled o he rgh lower block J X of J J X # J = : J X E( ˆX(Y X( ˆX(Y X T º [J X J X J 1 J X ] 1 : (9 As a unform pror s assumed for he law, J (p( +1 s zero. To evaluae he hrd erm of D,wecanwre J X and he same expressons for 1 = M by replacng ¼ M by 1 P M 1 ¼. Noce ha under hese assocaon assumpons, all he negrals w.r.. y j are n y dmensonal. D. Mone Carlo Evaluaon for a BearngsOnly Applcaon Leusbegnwhhecasewhereheevoluon model s lnear and Gaussan. As n [15], we logp(y = y j = Á A1 A3 Ym = log p(y j j Á # Xm ¼ 0 M 1 = log V X ¼0 p(yj j x M + (p(y j j x p(yj j x M ¼ + p(yj j x M : (30 =1 For 6= M, he graden w.r.. X s Xm r r X logp(y j Á =¼ X p(y j j x p(y j : (31 j Á A smlar expresson for = M s obaned by replacng ¼ M by 1 P M 1 ¼.For =1,:::,M 1: Xm p(y j j x r logp(y j Á = p(yj j x M p(y j : (3 j Á Usng Lemma 1, we oban for 1, 6= M J X (p(y X 1 j =E[r X 1 (r X = E 4 ¼ 1 ¼ logp(y j T ] m X r p(y j j x 1 E X1 j Y j (r X p(y j j x p(y j j Á T 3 5 analycally oban he followng equales: DX 11 = dagff T V 1 F g, 3 DX 1 =dagf F T V 1 g and J X +1 X +1 (p(x +1 j X = dagf V 1 g. In he general case of an observaon model wh an addve Gaussan nose defned as follows: p(y j j x we have =(¼ ny de 1= exp f 1 (yj H(x T 1 (y j H(x g r X p(y 1 j j x 1 =p(yj j x 1 I reads for he PCRB B1: r X 1 (36 H T (x 1 1 (y j H(x 1 : J X (p(y X j X = E X r X H T (x 1 (r X H T (x T (37 (38 (33 and he same expressons for 1 or = M by replacng ¼ M by 1 P M 1 ¼. For 1, 6= M: 3.e., he blockdagonal marx whose h block s equal o F T 1 V F. J 1 Xm (p(y j = E 4 E Y j j (p(y j j x 1 p(yj j x M # 3 (p(y j j x p(yj j x M 5: p(y j (34 j Á For 1, 6= M: J (p(y X 1 j = E 4¼ 1 Xm E Y j j p(y j j x p(yj j x M p(y j r j Á X 1 p(y j j x 1 #3 5 (35 HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 43
8 for he PCRB B: J X X 1 P (p(y j X = E X r X H T (x k E ¾ p(y 1 j x,k p(k (yj1 H(x 1 Y jx p(y j x X k ¾ p(y j x,k p(k (y j H(x # T 1 (r X H T (x T # (39 and for he PCRB B3: J X (p(y X 1 j = E ¼ 1 ¼ J (p(y X 1 j = E 4¼ 1 r X 1 H T (x 1 1 Xm E Y j j p(y j j x 1 p(yj j x p(y j j Á (y j H(x 1 (yj H(x T # 1 (r X H T (x #: T (40 r X 1 H T (x 1 1 Xm E Y j j p(y j j x p(yj j x M p(y j j Á p(y j j x 1 (yj H(x 1 #3 5: (41 In he bearngsonly applcaon, we have n y = 1andhenH T = H ha leads o some wrng smplfcaons. We deal wh classcal bearngsonly expermens wh hree arges. In he conex of a slowly maneuverng arge, we have chosen a nearlyconsanvelocy model. 1 The Scenaro: The sae vecor X represens he coordnaes and he veloces n he xy plane: X =(x,y,vx,vy for = 1,,3. For each arge, he dscrezed sae equaon assocaed wh me perod s µ X+ = I I X 0 I + I 0 1 AV 0 I (4 where I s he deny marx n dmenson and V s a Gaussan zeromean vecor wh covarance marx V =dag[¾x,¾ y,¾ x,¾ y ]. A se of m measuremens s avalable a dscree mes and can be dvded no wo subses. 1 One subse s of rue measuremens whch follow (43. A measuremen produced by he h arge s generaed accordng o Y j =arcan µ y y obs x + W j x obs (43 where W j s a zeromean Gaussan nose wh covarance ¾w :05 rad ndependen of V,andx obs and y obs are he Caresan coordnaes of he observer, whch are known. We assume ha he measuremen produced by one arge s avalable wh a deecon probably P d. The oher subse s of false measuremens whose number follows a Posson dsrbuon wh mean V where s he mean number of false alarms per un volume. We assume hese false alarms are ndependen and unformly dsrbued whn he observaon volume V. The nal coordnaes of he arges and of he observer are he followng (n meer and meer/second, respecvely: X 1 0 = (00,1500,1, 0:5T, X 3 0 =( 00, 1500,1,0:5T X 0 = (0,0,1,0T X0 obs = (00, 3000,1:,0:5 T : (44 The observer s followng a legbyleg rajecory. Is velocy vecor s consan on each leg and modfed a he followng nsans, so ha: Ã! vx obs µ 00,600,900 0:6 = vy00,600,900 obs Ã vx obs 400,800 vy obs 400,800 0:3! µ :0 = 0:3 : The rajecores of he hree objecs and of he observer are ploed n Fg. 1(a. E. The Assocaed PCRB The hree bounds are frs nalzed o J X0 = P 1 X 0 for B1 andb andj 0 = P 1 0 for B3 wherep X0 = (45 44 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
9 Fg. 1. (a Trajecores of he hree arges and of he observer. (b Measuremens smulaed wh P d :9 and V =3. dagfxcov g wh X cov =dagf150,150,0:1,0:1g and P 0 =dagfdagf0:05, =1,:::,M 1g;P X0 g. Then, o esmae he marces needed n he recurson formulas (8 or (7, we perform Mone Carlo negraon by carryng ou P1 ndependen sae rajecores and for each of hem P ndependen measuremen realzaons, and addonally P3 ndependen realzaons of he ¼ vecor for he PCRB B3 (P1, P, and P3 have been fxed o 100 n he followng compuaons. For nsance, he esmae Ĵ X of J X s compued as X 1 X 1 where J(x p1 Ĵ X X 1 = 1 P1P XP1 XP p1=1 p=1 J(x p1,y p1,p (46,y p1,p s he quany whose expecaon s o be compued n (39. We hen obaned he marx nequales: E( 1:M 1:M ˆX +1 (Y X( ˆX +1 (Y XT º B for =1,,3: (47 In he scenaro descrbed above, he marces B dmenson s equal o dm = 3 4 = 1. To nerpre he nequales (47, we have derved he scalar meansquare error gven by he race of (47: 1:M E( ˆX +1 (Y XT 1:M ( ˆX +1 (Y X rb (48 and he nequaly on he volume of he marces defned as he deermnan a he power 1=dm: [dee( 1:M 1:M ˆX +1 (Y X( ˆX +1 (Y XT ] 1=dm º [deb ] 1=dm : (49 We have compued he race and he volume of he hree bounds for dfferen values of he parameers ¾ x, ¾ y, P d, V. Frs, for a dynamc nose sandard ¾ x = ¾ y :0005 ms 1, a deecon probably P d :9 and V = 1,,3, he race and he volume are ploed agans me on he hree frs rows of Fg.. The resuls on he fourh row have been obaned for a hgher dynamc nose sandard ¾ x = ¾ y :001 ms 1, P d :9 and V =1.Theffh and las row corresponds o a scenaro where a deecon hole s smulaed for he frs objec durng a hundred consecuve nsans, beween mes 600 and 700. Whaever he parameers values, he nsan or he funcon f of he bounds consdered (race or volume, we always have f(b f(b3 f(b1 wh a greaer gap beween f(b3 and f(b1 han beween f(b and f(b3. More precsely, frs means ha he opmal performance whch can be obaned wh an algorhm usng assumpons A1 and A are below he opmal performance whch can be obaned wh an algorhm usng assumpons A1 and A3. Second, he opmal performance obaned wh an algorhm assumng he assocaon s known s far beer han for he wo precedng cases. For all ha, nohng can be concluded on he relave performance of he SIRJPDA and of he MOPF for nsance. Such sudy needs he esmaon of he RMSE of boh algorhms over a hgh number of realzaons of he process and measuremen nose. For each couple of realzaon of boh noses, several runs of he algorhms are needed. To go back over he analyss of Fg., he plos presen wo peaks around mes 150 and 400. They correspond o nsans where bearngs from he hree arges are very close as shown n Fg. 1(b for one parcular realzaon of he rajecores and of he measuremens. Durng he second peak, he gap beween B and B3 on he one hand and B1 on he oher hand s wdenng. A slgh peak s also observed when he frs arge s no deeced (see las row of Fg.. Fnally, by comparng he hree frs rows, we observe ha he gap beween f(b and f(b3 s wdenng wh he cluer densy V. In all hese scenaros, as he deecon probably P d s srcly nferor o uny, may happen a one nsan ha no arge s deeced. If moreover no cluer measuremen s smulaed a ha nsan, he measuremen vecor Y s empy. In hs case, we smply se he expecaons J X +1 X +1 (p(y +1 j X +1 and J (p( +1 j X +1 o zero and he recursve formula (8 and (7 are reduced. V. CONCLUSION In hs manuscrp, an exenson of he PCRB from a snglearge o mularge flerng problem HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 45
10 Fg.. Trace and volume of he hree PCRB marces: B (dashed,b3 (sold,b1 (dashdoed. Lef column: race. Rgh column: volume. Frs (op row: ¾ x = ¾ y :0005 ms 1 and V = 1. Second row: ¾ x = ¾ y :0005 ms 1 and V =. Thrd row: ¾ x = ¾ y :0005 ms 1 and V = 3. Fourh row: ¾ x = ¾ y :0001 ms 1 and V = 1. Ffh (boom row: ¾ x = ¾ y :0005 ms 1 and a deecon hole beween mes 600 and 700 for objec IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
11 has been suded. Three bounds have been derved accordng o he assocaon assumpons beween he measuremens and he arges. Based on Mone Carlo negraon, esmaes of hese hree bounds have fnally been proposed and evaluaed for he bearngsonly applcaon. APPENDIX. RECURSIVE FORMULA OF PCRB B By defnon, he nformaon marx J( 0:+1 of 0:+1 assocaed wh he law p +1 can be expressed as J( 0:+1 = 6 4 J 0: 1 0: 1 (p +1 J 0: 1 (p +1 J : 1 (p J 0: 1 (p +1 J (p +1 J +1 (p +1 J 0: 1 +1 (p +1 J +1 (p +1 J (p +1 where J (p =E[ log(p]. Usng (6, reads J 0: 1 0: 1 (p +1 =J 0: 1 0: 1 (p J 0: 1 (p +1 =J 0: 1 (p J 0: 1 +1 (p +1 =J 0: 1 +1 (p (50 + J 0: 1 0: 1 (p(y +1 j +1 p(x +1 j X p( +1 (51 + J 0: 1 (p(y +1 j +1 p(x +1 j X p( +1 (5 + J 0: 1 (p(y +1 j +1 p(x +1 j X p( +1 J (p +1 =J (p +J (p(x +1 j X + J (p(y +1 j +1 p( +1 J +1 (p +1 =J +1 (p(x +1 j X + J +1 (p J (p +1 =J (p + J +1 (p(y +1 j +1 p( +1 + J (p(y +1 j +1 p(x +1 j X p( +1 : (53 (54 (55 (56 Usng (51 (56 and he noaon: A B J( 0: = we have he recursve formula: A B 0 6 J( 0:+1 = 4B C + D 11 where D 11 = J (p(x +1 j X D 1 = J +1 (p(x +1 j X B T C 0 D 1 T D 1 D D = J (p(y +1 j +1 p(x +1 j X p( +1 : ( (58 (59 Now, J +1 s he nverse of he rgh lower block of J( 0:+1 1. Usng wce a classcal nverson lemma, we oban 1 A J +1 = D [0 D 1 B 0 ] REFERENCES B T C + D 11 = D D 1 [C + D 11 B T A 1 B ] 1 D 1 D 1 = D D 1 [J + D 11 ] 1 D 1 : (60 [1] Van Trees, H. L. Deecon, Esmaon, and Modulaon Theory (Par I. New York: Wley, [] Chang, K. C., Mor, S. and Chong, C. Y. Performance evaluaon of rack naon n dense arge envronmens. IEEE Transacons on Aerospace and Elecronc Sysems, 30, 1 (1994, [3] Mahler, R. Mulsource mularge flerng: A unfed approach. SPIE Proceedngs, 3373 (1998, [4] BarShalom, Y., and Formann, T. E. Trackng and daa assocaon. New York: Academc Press, [5] BarShalom, Y., and Tse, E. Trackng n a cluered envronmen wh probablsc daa assocaon. In Proceedngs of he 4h Symposum on Nonlnear Esmaon Theory and s Applcaons, [6] Formann, T. E., BarShalom, Y., and Scheffe, M. Sonar rackng of mulple arges usng jon probablsc daa assocaon. IEEE Journal of Oceanc Engneerng, 8 (July 1983, [7] Red, D. An algorhm for rackng mulple arges. IEEE Transacons on Auomaon and Conrol, 4, 6 (1979, [8] Douce, A., De Freas, N., and Gordon, N. (Eds. Sequenal Mone Carlo Mehods n Pracce. New York: Sprnger, 001. [9] Hue, C., Le Cadre, JP., and Pérez, P. Sequenal Mone Carlo mehods for mulple arge rackng and daa fuson. IEEE Transacons on Sgnal Processng, 50, (Feb. 00, HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 47
12 [10] Oron, M., and Fzgerald, W. A Bayesan approach o rackng mulple arges usng sensor arrays and parcle flers. IEEE Transacons on Sgnal Processng, 50, (00, [11] Hue, C., Le Cadre, JP., and Pérez, P. Trackng mulple objecs wh parcle flerng. IEEE Transacons on Aerospace and Elecronc Sysems, 38, 3 (July 00, [1] Bobrovsky, B. Z., and Zaka, M. A lower bound on he esmaon error for Markov processes. IEEE Transacons on Auomac Conrol, 0, 6 (Dec. 1975, [13] Galdos, J. I. ACramérRao bound for muldmensonal dscreeme dynamcal sysems. IEEE Transacons on Auomac Conrol, 5, 1 (1980, [14] Kerr, T. H. Saus of CramérRaolke lower bounds for nonlnear flerng. IEEE Transacons on Aerospace and Elecronc Sysems, 5, 5 (Sep. 1989, [15] Tchavský, P., Muravchk, C., and Nehora, A. Poseror CramérRao bounds for dscreeme nonlnear flerng. IEEE Transacons on Sgnal Processng, 46, 5(May 1998, [16] Bergman, N. Recursve Bayesan esmaon: Navgaon and rackng applcaons. Ph.D. dsseraon, Lnköpng Unversy, Sweden, [17] Bobrovsky, B. Z., MayerWolf, E., and Zaka, M. Some classes of global CramérRao bounds. The Annals of Sascs, 15, 4 (1987, [18] Farna, A., Rsc, B., and Tmmoner, L. CramérRao bound for non lnear flerng wh P d < 1 and s applcaon o arge rackng. IEEE Transacons on Sgnal Processng, 50, 8 (00, [19] Jauffre, C., and BarShalom, Y. Track formaon wh bearng and frequency measuremens n cluer. IEEE Transacons on Aerospace and Elecroncs, 6, 6 (1990, [0] Krubajan, T., and BarShalom, Y. Low observable arge moon analyss usng amplude nformaon. IEEE Transacons on Aerospace and Elecorncs, 3, 4 (1996, [1] Ruan, Y., Wlle, P., and Sre, R. A comparson of he PMHT and PDAF rackng algorhms based on her model CRLBs. In Proceedngs of SPIE Aerosense Conference on Acquson, Trackng and Ponng, Orlando, FL, Apr [] Zhang, X., and Wlle, P. CramérRao bounds for dscreeme lnear flerng wh measuremen orgn unceranes. In Workshop on Esmaon, Trackng, and Fuson: A Trbue o Yaakov BarShalom, May 001. [3] Hernandez, M., Marrs, A., Gordon, N., Maskell, S., and Reed, C. CramérRao bounds for nonlnear flerng wh measuremen orgn uncerany. In Proceedngs of 5h Inernaonal Conference on Informaon Fuson, July IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 4, NO. 1 JANUARY 006
13 Carne Hue was born n She receved he M.Sc. degree n mahemacs and compuer scence n 1999 and he Ph.D. degree n appled mahemacs n 003, boh from he Unversy of Rennes, France. Snce he end of 003 she has been a fullme researcher a INRA, he French Naonal Insue for Agrculural Research. Her research neress nclude sascal mehods for model calbraon, daa assmlaon, sensvy analyss, and n parcular, he Bayesan approach for agronomc models. JeanPerre Le Cadre (M 93 receved he M.S. degree n mahemacs n 1977, he Docora de 3 eme cycle n 198, and he Docora d Ea n 1987, boh from INPG, Grenoble. From 1980 o 1989, he worked a he GERDSM (Groupe d Eudes e de Recherche en Deecon SousMarne, a laboraory of he DCN (Drecon des Consrucons Navales, manly on array processng. Snce 1989, he s wh IRISA/CNRS, where he s Dreceur de Recherche a CNRS. Hs neress are now opcs lke sysem analyss, deecon, mularge rackng, daa assocaon, and operaons research. Dr. Le Cadre has receved (wh O. Zugmeyer he Eurasp Sgnal Processng bes paper award (1993. Parck Pérez was born n He graduaed from ÉcoleCenralePars,France, n 1990 and receved he Ph.D. degree from he Unversy of Rennes, France, n Afer one year as an Inra posdocoral researcher n he Deparmen of Appled Mahemacs a Brown Unversy, Provdence, RI, he was apponed a Inra n 1994 as a full me researcher. From 000 o 004, he was wh Mcrosof Research n Cambrdge, U.K. In 004, he became senor researcher a Inra, and he s now wh he Vsa research group a Irsa/InraRennes. Hs research neress nclude probablsc models for undersandng, analysng, and manpulang sll and movng mages. HUE ET AL.: POSTERIOR CRAMERRAO BOUNDS FOR MULTITARGET TRACKING 49
Fall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 ByoungTak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A bnary sysem, s bondng beween wo blocks made of
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, MarchMay Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, MarchMay 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnanbased Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationCHAPTER 5: MULTIVARIATE METHODS
CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationShould Exact Index Numbers have Standard Errors? Theory and Application to Asian Growth
Should Exac Index umbers have Sandard Errors? Theory and Applcaon o Asan Growh Rober C. Feensra Marshall B. Rensdorf ovember 003 Proof of Proposon APPEDIX () Frs, we wll derve he convenonal SaoVara prce
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationPARTICLE METHODS FOR MULTIMODAL FILTERING
PARTICLE METHODS FOR MULTIMODAL FILTERIG Chrsan Musso ada Oudjane OERA DTIM. BP 72 92322 France. {mussooudjane}@onera.fr Absrac : We presen a quck mehod of parcle fler (or boosrap fler) wh local rejecon
More informationejournal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov
June 7 eournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple onedmensonal, onephase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationAnalysis And Evaluation of Econometric Time Series Models: Dynamic Transfer Function Approach
1 Appeared n Proceedng of he 62 h Annual Sesson of he SLAAS (2006) pp 96. Analyss And Evaluaon of Economerc Tme Seres Models: Dynamc Transfer Funcon Approach T.M.J.A.COORAY Deparmen of Mahemacs Unversy
More informationFTests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction
ECOOMICS 35*  OTE 9 ECO 35*  OTE 9 FTess and Analyss of Varance (AOVA n he Smple Lnear Regresson Model Inroducon The smple lnear regresson model s gven by he followng populaon regresson equaon, or
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal endpon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationKernelBased Bayesian Filtering for Object Tracking
KernelBased Bayesan Flerng for Objec Trackng Bohyung Han Yng Zhu Dorn Comancu Larry Davs Dep. of Compuer Scence RealTme Vson and Modelng Inegraed Daa and Sysems Unversy of Maryland Semens Corporae Research
More informationChalmers Publication Library
Chalmers Publcaon Lbrary Exended Objec Tracng usng a Radar Resoluon Model Ths documen has been downloaded from Chalmers Publcaon Lbrary CPL. I s he auhor s verson of a wor ha was aeped for publcaon n:
More information. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.
Mah Eb Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are
More informationAdvanced timeseries analysis (University of Lund, Economic History Department)
Advanced meseres analss (Unvers of Lund, Economc Hsor Dearmen) 3 Jan3 Februar and 63 March Lecure 4 Economerc echnues for saonar seres : Unvarae sochasc models wh Box Jenns mehodolog, smle forecasng
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationHow about the more general "linear" scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )?
lmcd Lnear ransformaon of a vecor he deas presened here are que general hey go beyond he radonal marvecor ype seen n lnear algebra Furhermore, hey do no deal wh bass and are equally vald for any se of
More informationNEW TRACKTOTRACK CORRELATION ALGORITHMS BASED ON BITHRESHOLD IN A DISTRIBUTED MULTISENSOR INFORMATION FUSION SYSTEM
Journal of Compuer Scence 9 (2): 695709, 203 ISSN: 5493636 203 do:0.3844/jcssp.203.695.709 Publshed Onlne 9 (2) 203 (hp://www.hescpub.com/jcs.oc) NEW TRACKTOTRACK CORRELATION ALGORITHMS BASED ON BITHRESHOLD
More informationLecture 2 M/G/1 queues. M/G/1queue
Lecure M/G/ queues M/G/queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly
More informationEpistemic Game Theory: Online Appendix
Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationOnline Supplement for Dynamic MultiTechnology. ProductionInventory Problem with Emissions Trading
Onlne Supplemen for Dynamc MulTechnology ProduconInvenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationRobustness of DEWMA versus EWMA Control Charts to NonNormal Processes
Journal of Modern Appled Sascal Mehods Volume Issue Arcle 8 53 Robusness of D versus Conrol Chars o Non Processes Saad Saeed Alkahan Performance Measuremen Cener of Governmen Agences, Insue of Publc
More informationA moving horizon scheme for distributed state estimation
. A movng horzon scheme for dsrbued sae esmaon arcello Farna, Gancarlo FerrarTrecae and Rccardo Scaoln The research of.f. and R.S. has receved fundng from European Communy hrough FP7/73 under gran agreemen
More information2. SPATIALLY LAGGED DEPENDENT VARIABLES
2. SPATIALLY LAGGED DEPENDENT VARIABLES In hs chaper, we descrbe a sascal model ha ncorporaes spaal dependence explcly by addng a spaally lagged dependen varable y on he rghhand sde of he regresson equaon.
More informationLi AnPing. Beijing , P.R.China
A New Type of Cpher: DICING_csb L AnPng Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.
More informationDiscrete Time Approximation and MonteCarlo Simulation of Backward Stochastic Differential Equations
Dscree Tme Approxmaon and MoneCarlo Smulaon of Backward Sochasc Dfferenal Equaons Bruno Bouchard Unversé Pars VI, PMA, and CREST Pars, France bouchard@ccrjusseufr Nzar Touz CREST Pars, France ouz@ensaefr
More informationImplementation of Quantized State Systems in MATLAB/Simulink
SNE T ECHNICAL N OTE Implemenaon of Quanzed Sae Sysems n MATLAB/Smulnk Parck Grabher, Mahas Rößler 2*, Bernhard Henzl 3 Ins. of Analyss and Scenfc Compung, Venna Unversy of Technology, Wedner Haupsraße
More informationPanel Data Regression Models
Panel Daa Regresson Models Wha s Panel Daa? () Mulple dmensoned Dmensons, e.g., crosssecon and me nodeonode (c) Pongsa Pornchawseskul, Faculy of Economcs, Chulalongkorn Unversy (c) Pongsa Pornchawseskul,
More informationHandout # 6 (MEEN 617) Numerical Integration to Find Time Response of SDOF mechanical system Y X (2) and write EOM (1) as two firstorder Eqs.
Handou # 6 (MEEN 67) Numercal Inegraon o Fnd Tme Response of SDOF mechancal sysem Sae Space Mehod The EOM for a lnear sysem s M X DX K X F() () X X X X V wh nal condons, a 0 0 ; 0 Defne he followng varables,
More informationAdditive Outliers (AO) and Innovative Outliers (IO) in GARCH (1, 1) Processes
Addve Oulers (AO) and Innovave Oulers (IO) n GARCH (, ) Processes MOHAMMAD SAID ZAINOL, SITI MERIAM ZAHARI, KAMARULZAMMAN IBRAHIM AZAMI ZAHARIM, K. SOPIAN Cener of Sudes for Decson Scences, FSKM, Unvers
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John ShaweTayer, An Inroducon o Suppor Vecor Machnes,
More informationChapter 2 Linear dynamic analysis of a structural system
Chaper Lnear dynamc analyss of a srucural sysem. Dynamc equlbrum he dynamc equlbrum analyss of a srucure s he mos general case ha can be suded as akes no accoun all he forces acng on. When he exernal loads
More informationStandard Error of Technical Cost Incorporating Parameter Uncertainty
Sandard rror of echncal Cos Incorporang Parameer Uncerany Chrsopher Moron Insurance Ausrala Group Presened o he Acuares Insue General Insurance Semnar 3 ovember 0 Sydney hs paper has been prepared for
More informationAlgorithm Research on Moving Object Detection of Surveillance Video Sequence *
Opcs and Phooncs Journal 03 3 3083 do:0.436/opj.03.3b07 Publshed Onlne June 03 (hp://www.scrp.org/journal/opj) Algorhm Research on Movng Objec Deecon of Survellance Vdeo Sequence * Kuhe Yang Zhmng Ca
More informationA Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGBD Information
A Novel Objec Deecon Mehod Usng Gaussan Mxure Codebook Model of RGBD Informaon Lujang LIU 1, Gaopeng ZHAO *,1, Yumng BO 1 1 School of Auomaon, Nanjng Unversy of Scence and Technology, Nanjng, Jangsu 10094,
More informationDetection of Waving Hands from Images Using Time Series of Intensity Values
Deecon of Wavng Hands from Images Usng Tme eres of Inensy Values Koa IRIE, Kazunor UMEDA Chuo Unversy, Tokyo, Japan re@sensor.mech.chuou.ac.jp, umeda@mech.chuou.ac.jp Absrac Ths paper proposes a mehod
More informationTHEORETICAL AUTOCORRELATIONS. ) if often denoted by γ. Note that
THEORETICAL AUTOCORRELATIONS Cov( y, y ) E( y E( y))( y E( y)) ρ = = Var( y) E( y E( y)) =,, L ρ = and Cov( y, y ) s ofen denoed by whle Var( y ) f ofen denoed by γ. Noe ha γ = γ and ρ = ρ and because
More information[Link to MITLab 6P.1 goes here.] After completing the lab, fill in the following blanks: Numerical. Simulation s Calculations
Chaper 6: Ordnary Leas Squares Esmaon Procedure he Properes Chaper 6 Oulne Cln s Assgnmen: Assess he Effec of Sudyng on Quz Scores Revew o Regresson Model o Ordnary Leas Squares () Esmaon Procedure o he
More informationPredicting and Preventing Emerging Outbreaks of Crime
Predcng and Prevenng Emergng Oubreaks of Crme Danel B. Nell Even and Paern Deecon Laboraory H.J. Henz III College, Carnege Mellon Unversy nell@cs.cmu.edu Jon work wh Seh Flaxman, Amru Nagasunder, Wl Gorr
More informationImprovement in Estimating Population Mean using Two Auxiliary Variables in TwoPhase Sampling
Improvemen n Esmang Populaon Mean usng Two Auxlar Varables n TwoPhase amplng Rajesh ngh Deparmen of ascs, Banaras Hndu Unvers(U.P.), Inda (rsnghsa@ahoo.com) Pankaj Chauhan and Nrmala awan chool of ascs,
More informationAdvanced Macroeconomics II: Exchange economy
Advanced Macroeconomcs II: Exchange economy Krzyszof Makarsk 1 Smple deermnsc dynamc model. 1.1 Inroducon Inroducon Smple deermnsc dynamc model. Defnons of equlbrum: ArrowDebreu Sequenal Recursve Equvalence
More informationThe Dynamic Programming Models for Inventory Control System with Timevarying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tmevaryng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 842363525459 Emal: rnh.h@due.edu.vn
More informationMultipriority Online Scheduling with Cancellations
Submed o Operaons Research manuscrp (Please, provde he manuscrp number!) Auhors are encouraged o subm new papers o INFORMS journals by means of a syle fle emplae, whch ncludes he journal le. However, use
More informationAbout Hydrodynamic Limit of Some Exclusion Processes via Functional Integration
Abou Hydrodynamc Lm of Some Excluson Processes va Funconal Inegraon Guy Fayolle Cyrl Furlehner Absrac Ths arcle consders some classes of models dealng wh he dynamcs of dscree curves subjeced o sochasc
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationNPTEL Project. Econometric Modelling. Module23: Granger Causality Test. Lecture35: Granger Causality Test. Vinod Gupta School of Management
P age NPTEL Proec Economerc Modellng Vnod Gua School of Managemen Module23: Granger Causaly Tes Lecure35: Granger Causaly Tes Rudra P. Pradhan Vnod Gua School of Managemen Indan Insue of Technology Kharagur,
More informationReal time processing with low cost uncooled plane array IR cameraapplication to flash nondestructive
hp://dx.do.org/0.6/qr.000.04 Real me processng wh low cos uncooled plane array IR cameraapplcaon o flash nondesrucve evaluaon By Davd MOURAND, JeanChrsophe BATSALE L.E.P.T.ENSAM, UMR 8508 CNRS, Esplanade
More informationSingleloop system reliabilitybased topology optimization considering statistical dependence between limitstates
Sruc Muldsc Opm 2011) 44:593 611 DOI 10.1007/s0015801106690 RESEARCH PAPER Sngleloop sysem relablybased opology opmzaon consderng sascal dependence beween lmsaes Tam H. Nguyen Junho Song Glauco H.
More informationCamShift Guided Particle Filter for Visual Tracking
CamShf Guded Parcle Fler for Vsual Trackng Zhaowen Wang, Xaokang Yang, Y Xu and Songyu Yu Insue of Image Communcaon and Informaon Processng Shangha Jao Tong Unversy, Shangha, PRC 200240 Emal: {whereaswll,xkyang,
More informationGeographically weighted regression (GWR)
Ths s he auhor s fnal verson of he manuscrp of Nakaya, T. (007): Geographcally weghed regresson. In Kemp, K. ed., Encyclopaeda of Geographcal Informaon Scence, Sage Publcaons: Los Angeles, 179184. Geographcally
More informationMODELING TIMEVARYING TRADINGDAY EFFECTS IN MONTHLY TIME SERIES
MODELING TIMEVARYING TRADINGDAY EFFECTS IN MONTHLY TIME SERIES Wllam R. Bell, Census Bureau and Donald E. K. Marn, Howard Unversy and Census Bureau Donald E. K. Marn, Howard Unversy, Washngon DC 0059
More informationarxiv: v1 [math.oc] 8 Sep 2015
Nonlnear Graden Algorhm for Parameer Esmaon: Exended verson Juan G RuedaEscobedo and Jame A oreno arxv:5090559v [mahoc] 8 Sep 05 Absrac Graden algorhms are classcal n adapve conrol and parameer esmaon
More informationA Paper presentation on. Department of Hydrology, Indian Institute of Technology, Roorkee
A Paper presenaon on EXPERIMENTAL INVESTIGATION OF RAINFALL RUNOFF PROCESS by Ank Cakravar M.K.Jan Kapl Rola Deparmen of Hydrology, Indan Insue of Tecnology, Roorkee247667 Inroducon Ranfallrunoff processes
More informationDiscrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationImage Morphing Based on Morphological Interpolation Combined with Linear Filtering
Image Morphng Based on Morphologcal Inerpolaon Combned wh Lnear Flerng Marcn Iwanowsk Insue of Conrol and Indusral Elecroncs Warsaw Unversy of Technology ul.koszykowa 7566 Warszawa POLAND el. +48 66 54
More informationParameter Estimation for Relational Kalman Filtering
Sascal Relaonal AI: Papers from he AAAI4 Workshop Parameer Esmaon for Relaonal Kalman Flerng Jaesk Cho School of Elecrcal and Compuer Engneerng Ulsan Naonal Insue of Scence and Technology Ulsan, Korea
More informationMEEN Handout 4a ELEMENTS OF ANALYTICAL MECHANICS
MEEN 67  Handou 4a ELEMENTS OF ANALYTICAL MECHANICS Newon's laws (Euler's fundamenal prncples of moon) are formulaed for a sngle parcle and easly exended o sysems of parcles and rgd bodes. In descrbng
More informationSensor Scheduling for Multiple Parameters Estimation Under Energy Constraint
Sensor Scheduln for Mulple Parameers Esmaon Under Enery Consran Y Wan, Mnyan Lu and Demoshens Tenekezs Deparmen of Elecrcal Enneern and Compuer Scence Unversy of Mchan, Ann Arbor, MI {yws,mnyan,eneke}@eecs.umch.edu
More informationParticle Filter Based Robot Selflocalization Using RGBD Cues and Wheel Odometry Measurements Enyang Gao1, a*, Zhaohua Chen1 and Qizhuhui Gao1
6h Inernaonal Conference on Elecronc, Mechancal, Informaon and Managemen (EMIM 206) Parcle Fler Based Robo Selflocalzaon Usng RGBD Cues and Wheel Odomery Measuremens Enyang Gao, a*, Zhaohua Chen and Qzhuhu
More informationInformation Fusion White Noise Deconvolution Smoother for TimeVarying Systems
Informaon Fuson Whe ose Deconoluon mooher for TmeVaryng ysems XaoJun un Yuan Gao and Z Deng Absrac Whe nose deconoluon or npu he nose esmaon problem has mporan applcaon bacground n ol sesmc eploraon.
More informationarxiv: v1 [math.oc] 11 Dec 2014
Nework Newon Aryan Mokhar, Qng Lng and Alejandro Rbero Dep. of Elecrcal and Sysems Engneerng, Unversy of Pennsylvana Dep. of Auomaon, Unversy of Scence and Technology of Chna arxv:1412.374v1 [mah.oc] 11
More informationImprovement in Estimating Population Mean using Two Auxiliary Variables in TwoPhase Sampling
Rajesh ngh Deparmen of ascs, Banaras Hndu Unvers(U.P.), Inda Pankaj Chauhan, Nrmala awan chool of ascs, DAVV, Indore (M.P.), Inda Florenn marandache Deparmen of Mahemacs, Unvers of New Meco, Gallup, UA
More informationInterClass Resource Sharing using Statistical Service Envelopes
In Proceedngs of IEEE INFOCOM 99 InerClass Resource Sharng usng Sascal Servce Envelopes Jngyu Qu and Edward W. Knghly Deparmen of Elecrcal and Compuer Engneerng Rce Unversy Absrac Neworks ha suppor mulple
More informationEqualization on Graphs: Linear Programming and Message Passing
Equalzaon on Graphs: Lnear Programmng and Message Passng Mohammad H. Taghav and Paul H. Segel Cener for Magnec Recordng Research Unversy of Calforna, San Dego La Jolla, CA 920930401, USA Emal: (maghav,
More informationDiffusion of Heptane in Polyethylene Vinyl Acetate: Modelisation and Experimentation
IOSR Journal of Appled hemsry (IOSRJA) eissn: 785736.Volume 7, Issue 6 Ver. I. (Jun. 4), PP 886 Dffuson of Hepane n Polyehylene Vnyl Aceae: odelsaon and Expermenaon Rachd Aman *, Façal oubarak, hammed
More informationComparison of Supervised & Unsupervised Learning in βs Estimation between Stocks and the S&P500
Comparson of Supervsed & Unsupervsed Learnng n βs Esmaon beween Socks and he S&P500 J. We, Y. Hassd, J. Edery, A. Becker, Sanford Unversy T I. INTRODUCTION HE goal of our proec s o analyze he relaonshps
More informationAnisotropic Behaviors and Its Application on Sheet Metal Stamping Processes
Ansoropc Behavors and Is Applcaon on Shee Meal Sampng Processes Welong Hu ETAEngneerng Technology Assocaes, Inc. 33 E. Maple oad, Sue 00 Troy, MI 48083 USA 4879300 whu@ea.com Jeanne He ETAEngneerng
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birthdeath process  Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brhdeah rocess  Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuousme Marovchans Grah and marx reresenaon Transen and
More informationDigital Speech Processing Lecture 20. The Hidden Markov Model (HMM)
Dgal Speech Processng Lecure 20 The Hdden Markov Model (HMM) Lecure Oulne Theory of Markov Models dscree Markov processes hdden Markov processes Soluons o he Three Basc Problems of HMM s compuaon of observaon
More informationSampling Coordination of Business Surveys Conducted by Insee
Samplng Coordnaon of Busness Surveys Conduced by Insee Faben Guggemos 1, Olver Sauory 1 1 Insee, Busness Sascs Drecorae 18 boulevard Adolphe Pnard, 75675 Pars cedex 14, France Absrac The mehod presenly
More informationForecasting customer behaviour in a multiservice financial organisation: a profitability perspective
Forecasng cusomer behavour n a mulservce fnancal organsaon: a profably perspecve A. Audzeyeva, Unversy of Leeds & Naonal Ausrala Group Europe, UK B. Summers, Unversy of Leeds, UK K.R. SchenkHoppé, Unversy
More informationSignal Diffusion Mapping: Optimal Forecasting with Time Varying Lags.
Absrac Sgnal Dffuson Mappng: Opmal Forecasng wh Tme Varyng Lags. Paul Gaskell Unversy of Souhampon, WAIS Frank McGroary Unversy of Souhampon, Fnance and Bankng Group Thanasss Tropans Unversy of Souhampon,
More informationSet point control in the state space setting
Downloaded from orb.du.dk on: Apr 28, 28 Se pon conrol n he sae space seng Poulsen, Nels Kjølsad Publcaon dae: 29 Documen Verson Publsher's PDF, also known as Verson of record Lnk back o DU Orb Caon (APA):
More informationMOTION ESTIMATION BY INTEGRATED LOW COST SYSTEM (VISION AND MEMS) FOR POSITIONING OF A SCOOTER VESPA
Archves of Phoogrammery, Carography and Remoe Sensng, Vol. 22, 2011, pp. 147158 ISSN 20832214 MOTION ESTIMATION BY INTEGRATED LOW COST SYSTEM (VISION AND MEMS) FOR POSITIONING OF A SCOOTER VESPA Albero
More informationMohammad H. AlTowaiq a & Hasan K. AlBzoor a a Department of Mathematics and Statistics, Jordan University of
Ths arcle was downloaded by: [Jordan Unv. of Scence & Tech] On: 05 Aprl 05, A: 0:4 Publsher: Taylor & Francs Informa Ld Regsered n England and ales Regsered umber: 07954 Regsered offce: Mormer House, 374
More informationVideoBased Face Recognition Using Adaptive Hidden Markov Models
VdeoBased Face Recognon Usng Adapve Hdden Markov Models Xaomng Lu and suhan Chen Elecrcal and Compuer Engneerng, Carnege Mellon Unversy, Psburgh, PA, 523, U.S.A. xaomng@andrew.cmu.edu suhan@cmu.edu Absrac
More informationarxiv: v4 [math.pr] 30 Sep 2016
arxv:1511.05094v4 [mah.pr] 30 Sep 2016 The Unfed Approach for Bes Choce Modelng Appled o AlernaveChoce Selecon Problems Rém Dendevel Absrac The objecve of hs paper s o show ha he socalled unfed approach
More informationForecasting the Convergence State of per Capital Income in Vietnam
Amercan Journal of Operaons Research, 3, 3, 487496 Publshed Onlne November 3 (hp://www.scrp.org/journal/ajor hp://dx.do.org/.436/ajor.3.3647 Forecasng he Convergence Sae of per Capal Income n Venam Nguyen
More informationA temporal fusion algorithm for multisensor tracking in wide areas
A emporal fuson algorhm for mulsensor rackng n wde areas O. Wallar, C. Moamed, M. Benjelloun Unversé du Loral Côe d'opale Laboraore ASL : 95 av P.L.Kng 62228 Calas, FRANCE Olver.Wallar@laslgw.unvloral.fr
More informationA ROBUST NONLINEAR MULTIVARIATE KALMAN FILTER FOR ARBITRAGE IDENTIFICATION IN HIGH FREQUENCY DATA
A ROBUST NONLINEAR MULTIVARIATE KALMAN FILTER FOR ARBITRAGE IDENTIFICATION IN HIGH FREQUENCY DATA P. J. BOLLAND AND J. T. CONNOR London Busness School Deparmen of Decson Scence Sussex Place, Regens Park
More informationJournal of Econometrics. The limit distribution of the estimates in cointegrated regression models with multiple structural changes
Journal of Economercs 46 (8 59 73 Conens lss avalable a ScenceDrec Journal of Economercs ournal homepage: www.elsever.com/locae/econom he lm dsrbuon of he esmaes n conegraed regresson models wh mulple
More informationDownloaded From: on 12/13/2013 Terms of Use:
On sonobuoy placemen for submarne rackng Mchael A. Kourzn a,davd J. Ballanyne a, Hyukjoon Km a,yaozhong Hu b a MITACSPINTS, Deparmen of Mahemacal and Sascal Scences a he Unversy of Albera, Edmonon, Canada
More informationPHYS 705: Classical Mechanics. Canonical Transformation
PHYS 705: Classcal Mechancs Canoncal Transformaon Canoncal Varables and Hamlonan Formalsm As we have seen, n he Hamlonan Formulaon of Mechancs,, are ndeenden varables n hase sace on eual foong The Hamlon
More informationConsensus of Multiagent Systems Under Switching Agent Dynamics and Jumping Network Topologies
Inernaonal Journal of Auomaon and Compung 35, Ocober 206, 438446 DOI: 0007/s633060960z Consensus of Mulagen Sysems Under Swchng Agen Dynamcs and Jumpng Nework Topologes ZhenHong Yang Yang Song,2
More informationGraydynamic EKF for Mobile Robot SLAM in Indoor Environment
Graydynamc EKF for Moble obo SLAM n Indoor Envronmen Peng Wang, Qbn Zhang, Zongha hen Deparmen of Auomaon, Unversy of Scence and echnology of hna, Hefe, 6, hna grapesonwang@gmalcom, zqb@malusceducn, chenzh@usceducn
More informationParameter Estimation of ThreePhase Induction Motor by Using Genetic Algorithm
360 Journal of Elecrcal Engneerng & Technology Vol. 4, o. 3, pp. 360~364, 009 Parameer Esmaon of ThreePhase Inducon Moor by Usng Genec Algorhm Seesa Jangj and Panhep Laohacha* Absrac Ths paper suggess
More informationLecture Notes 4. Univariate Forecasting and the Time Series Properties of Dynamic Economic Models
Tme Seres Seven N. Durlauf Unversy of Wsconsn Lecure Noes 4. Unvarae Forecasng and he Tme Seres Properes of Dynamc Economc Models Ths se of noes presens does hree hngs. Frs, formulas are developed o descrbe
More informationMoving Least Square Method for ReliabilityBased Design Optimization
Movng Leas Square Mehod for RelablyBased Desgn Opmzaon K.K. Cho, Byeng D. Youn, and RenJye Yang* Cener for CompuerAded Desgn and Deparmen of Mechancal Engneerng, he Unversy of Iowa Iowa Cy, IA 52242
More informationAnalytical Solution to Optimal Control by Orthogonal Polynomial Expansion
Proceedngs o he World Congress on Engneerng and Compuer cence WCEC, Ocober ,, an Francsco, UA Analycal oluon o Opmal Conrol by Orhogonal Polynomal Expanson B. ous,. A. avallae,. K. Yadavar Nravesh Absrac
More informationCalculus Chapter 1 Introduction to Calculus
Inroducon o Calculus Cal 13 Calculus Chaper 1 Inroducon o Calculus CHAPER 1 CALCULUS INRODUCION O hs chaper, whch replaces Chaper 4 n Physcs 2, s nended for sudens who have no had calculus, or as a calculus
More informationForeground Segmentation via Background Modeling on Riemannian Manifolds
2010 Inernaonal Conference on Paern Recognon Foreground Segmenaon va Bacground Modelng on Remannan Manfolds Ru Casero, João F. Henrques and Jorge Basa Insue of Sysems and Robocs, DEECFCTUC, Unversy of
More informationNovel RaoBlackwellized Particle Filter for Mobile Robot SLAM Using Monocular Vision
Inernaonal Journal of Compuer and Informaon Engneerng Novel RaoBlackwellzed Parcle Fler for Moble Robo SLAM Usng Monocular Vson Maoha L Bngrong Hong esu Ca and Ronghua Luo Inernaonal Scence Index Compuer
More informationMachine Vision based Microcrack Inspection in Thinfilm Solar Cell Panel
Sensors & Transducers Vol. 179 ssue 9 Sepember 2014 pp. 157161 Sensors & Transducers 2014 by FSA Publshng S. L. hp://www.sensorsporal.com Machne Vson based Mcrocrack nspecon n Thnflm Solar Cell Panel
More information