Correspondence. Performance Evaluation for MAP State Estimate Fusion I. INTRODUCTION

Size: px
Start display at page:

Download "Correspondence. Performance Evaluation for MAP State Estimate Fusion I. INTRODUCTION"

Transcription

1 Correspondence Performance Evauaton for MAP State Estmate Fuson Ths paper presents a quanttatve performance evauaton method for the maxmum a posteror (MAP) state estmate fuson agorthm. Under dea condtons where data assocaton s assumed to be perfect, t has been shown that the MAP or best near unbased estmate (BLUE) fuson formua provdes the best near mnmum mean squared estmate (LMMSE) gven oca estmates under the near Gaussan assumpton for a statc system. However, for a dynamc system where fuson s recursvey performed by the fuson center on oca estmates generated from oca measurements, t s not obvous how the MAP agorthm w perform. In the past, severa performance evauaton methods have been proposed for varous fuson agorthms, ncudng smpe convex combnaton, cross-covarance combnaton, nformaton matrx, MAP fuson. However, not much has been done to quantfy the steady state behavor of these fuson methods for a dynamc system. The goa of ths wor s to present anaytca fuson performance resuts for MAP state estmate fuson wthout extensve Monte Caro smuatons, usng an approach deveoped for steady state performance evauaton for trac fuson. Two dfferent communcaton strateges are consdered: fuson wth wthout feedbac to the sensors. Anaytc curves for the steady state performance of the fuson agorthm for varous communcaton patterns are presented under dfferent operatng condtons. I. INTRODUCTION Mutsensor data fuson, the process of estmatng the state of enttes by combnng nformaton from mutpe sensors, has been wdey used n many appcatons such as surveance target tracng. The fuson process can be centrazed or dstrbuted. Centrazed fuson (CF), whch processes a sensor measurements at a snge ocaton, can theoretcay produce optma resuts, but may be mpractca due to communcaton or reabty consderatons. In dstrbuted fuson, on the other h, each sensor processes ts own measurements, communcates the oca trac estmates wth other sensors or processors to obtan goba trac estmates. Compared wth CF, dstrbuted fuson enjoys better reabty ower communcaton bwdth, but the fuson Manuscrpt receved September 10, 2002; revsed August 7, 2003; reeased for pubcaton November 25, IEEE Log No. T-AES/40/2/ Refereeng of ths contrbuton was hed by X. R. L /04/$17.00 c 2004 IEEE 706 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 40, NO. 2 APRIL 2004

2 agorthms are typcay more compcated. Ths paper focuses on a herarchca verson of dstrbuted fuson. The fuson process nvoves three steps. 1) At each oca ste, a sensor updates ts oca trac estmates (prors) at every sampng tme usng the oca sensor measurements. 2) After every n oca sampng steps, where n 1 prescrbes the communcaton rate, a the oca stes send ther estmates to a fuson ste, where goba trac estmates are computed based on not ony the oca measurements, but aso the avaabe goba pror nformaton at the fuson ste. 3) If a feedbac mechansm s empoyed, compete or parta fuson estmates s sent bac to be shared 1 wth the oca sensors. The above three steps consttute one fuson teraton, the prors at each teraton are updated by the estmates obtaned at the prevous teraton. For a statonary target that s observed ony once by the sensors, the trac state estmate fuson needs to be carred out ony once, whch eads to the snge-teraton case. In contrast, a target n most practca tracng systems s modeed as a dynamc process observed over mutpe tmes. Thus, the trac estmates need to be updated through mutpe fuson teratons based on sensor observatons communcatons. The oca estmates/tracs to be fused are generay correated, not ony due to the common process nose from the target beng traced, but aso due to shared common pror nformaton from prevous communcaton or the modes. The desgn of a hgh-performance fuson agorthm s compcated by these two sources of correaton among oca sensors. Extensve research has been done to desgn fuson agorthms that address the oca trac state correaton 2 [1 13]. The nformaton matrx (IM) based method ams at reconstructng the centrazed estmate from the oca estmates [8, 14]. Ths agorthm s optma 3 when the underyng target dynamc systems are determnstc (.e., no process nose), or when fu-rate communcaton (n = 1) s empoyed. However, when the process nose s not neggbe due to target maneuver sensors communcate nfrequenty to save communcaton bwdth, the reconstructon becomes an approxmaton, the agorthm may ony be near optma. The cross covarance (CC) based fuson agorthm derves the fuson formua from the statstca correaton between the oca trac 1 There s n genera more than one type of feedbac. In ths paper, the fuson estmates are used to repace the oca ones. 2 Ths correaton refers to the statstca correaton n the state estmates for a snge target. We assume that data assocaton s perfect do not address the trac to trac correaton probem. 3 In addton to the typca near Gaussan assumptons, t s aso assumed that there s no mscorreaton, msdetecton, or merged measurement n the process. estmates [10 11]. However, t does not tae nto account the common pror estmates, thus the trac state estmaton performance s suboptma [9]. Recenty, a fuson agorthm based on the MAP probabty concept was proposed [1]. Smar to the BLUE (best near unbased estmaton) fuson rue proposed n [2], the MAP fuson agorthm provdes the near mnmum mean square estmate (LMMSE) estmate gven the atest oca estmates under the near Gaussan assumpton n a statc stuaton (.e., snge teraton). Ths optmaty has so far ony been proved when the target s statc, both the oca sensors the fuson processor have perfect nowedge of the trac prors [3]. In a dynamc trac fuson system, the optma fused estmate s the best estmate condtoned on a pror measurements. The MAP agorthm, on the other h, ony ensures that the pror estmates used n subsequent teratons are the LMMSE estmate gven the prevous oca estmates; t s not the condtona estmate gven a the pror sensor measurements. Thus the assumptons for the optma MAP agorthm (based on a pror sensor measurements) may not be met exacty. Partcuary, the mpact of propagatng ths suboptma nformaton s not obvous, a detaed study s needed to anayze that. Furthermore, as shown ater n ths paper, the MAP agorthm needs the past covarance hstory between communcatons whch may or may not be avaabe off ne. When they are not avaabe, the communcaton oad coud ncrease dramatcay. Severa performance evauaton methods have been proposed to compare dfferent fuson agorthms [1, 3, 4], but they are ether based on a snge teraton anayss or a snapshot anayss where the correaton between oca estmates s assumed to be gven. However, for dynamc targets that are observed over mutpe tmes, we need to underst the steady state performance of the agorthm. An anaytca steady state performance evauaton for the MAP fuson agorthm s provded, usng an approach smar to that deveoped for trac fuson wth IM [5 7]. We evauate the performance of MAP fuson under two dfferent communcaton strateges. Specfcay, herarchca fuson wth wthout feedbac s consdered. Theoretca curves for the performance of the fuson agorthm wth varous communcaton patterns are gven. The resuts are compared wth those obtaned by the IM approach as we as the CC approach. The rest of ths paper s organzed as foows. Secton II presents the anayss dervaton of the fuson performance measure n terms of the covarance of the fuson state estmate error. The steady state covarance for herarchca fuson s derved. Secton III examnes the anaytc performance of trac fuson for dfferent nondetermnstc target dynamcs by varyng the process nose. CORRESPONDENCE 707

3 II. STEADY STATE ANALYSIS OF MAP STATE ESTIMATE FUSION The wor presented here focuses on a smpe case where the two state estmates obtaned from two oca processng nodes (sensors) are to be fused together. Apart from the typca near Gaussan assumptons, t s aso assumed that there are no mscorreaton, msdetecton, or merged measurements. A. Trac State Estmate Fuson System Descrpton As n [7], consder a smpe trac state estmate fuson system n whch two sensors are tracng the same target. The target state s modeed by a dscrete near tme nvarant dynamca system as x 1 = Fx Gv, =0,1,2,::: (1) where v s a zero-mean whte Gaussan process nose wth covarance Q. The measurement vectors of the two sensors are modeed as z (j) = H (j) x, j =1,2, =0,1,2,::: (2) where s a zero-mean whte Gaussan measurement nose wth covarance R (j).the measurement noses for the two sensors are assumed to be uncorreated. It s assumed that each sensor empoys a Kaman fter to generate a oca trac state estmate for each target. At the end of every n sampng ntervas, each oca sensor transmts ts state estmate to the fuson ste where trac state estmate fuson s performed. The fused trac w then be sent bac to the oca sensors when feedbac s on. The oca state estmates at tme are assumed to be mnmum varance based on prevous measurements, Z (j) = z (j), = 0,1,2,:::,, j = 1,2, namey, = E[x Z(j) ] wth the assocated error covarance P (j). B. MAP State Estmate Fuson Let ˆx P represent the fused state estmate ts assocated error covarance, respectvey. The MAP approach for trac-to-trac fuson, descrbed n [1], combnes trac state estmate at the fuson center as foows: ˆx = ˆx n W (1) (1) (ˆx ˆx n )W (2) (ˆx (2) ˆx n ) (3) P = P n xẑ 1 ẑẑ xẑ (4) where the gan matrx s defned as W [W (1) W (2) ]= xẑ 1 ẑẑ (5) xẑ [ 1 2 ] s the CC between the target state x the jont oca estmates ˆx (1) ˆ 11 ˆ 12 ẑ ẑẑ ˆx (2) ˆ 21 ˆ 22 s the covarance matrx of ẑ. These formuae (3) (4) can aso be shown to be optma n the LMMSE sense [2] gven the two oca estmates. The n-step predctor of the fused state vector ts covarance are ˆx n = F n ˆx n (6) P n = F n P n F n F GQG F : (7) It can be shown that ([2, 4], Appendx A) wth fu rate communcaton (n = 1) when feedbac s on, xẑ [ 1 2 ]=[P 1 P (1) P 1 P (2) ] (8) ẑẑ = P 1 P (1) P 1 P (1) P(2) = P 1 P (1) P(2) P(21) P P (2) P(12) where P (j) = P() P 1 P(j) s the CC between ˆx (). It can further be shown that n ths case (fu rate (9) communcaton wth feedbac), ths MAP fuson rue s agebracay equvaent to the IM fuson rue [5] s optma n the sense that the resut s the same as the one obtaned by the CF. However, when n>1, the MAP fuson resut s not the same as the CF resut. Ths s because at each MAP fuson teraton, the pror at the fuson ste s the LMMSE estmate gven the prevous oca estmates, not the condtona estmate gven a the pror measurements. To underst the mpact of propagatng ths suboptma nformaton, we need to derve the correspondng xẑ ẑẑ. It can be shown that (see Appendx B) = E[(x ˆx n )(ˆx () ˆx n ) ] = F n P n (F n A () 1 ) =1 j = E[(ˆx () ˆx n ˆx n ) ] =(F n A () 1 )P n (Fn A (j) 1 ) =1 =1 (F A () B () R j F GQG (F A () F 1 ) F 1 )GQG (F A (j) F 1 ) (10) (11) 708 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 40, NO. 2 APRIL 2004

4 where matrces A (), B (), =1,:::,n, =1,2are defned n Appendx B. Note that (10) (11) represent the MAP fuson estmate covarance wth communcaton nterva n feedbac on. When feedbac s off, smar but more compcated expressons can be obatned (see Appendx C for n>1 Appendx D for n =1). C. Steady State Error Covarance In the foowng performance anayss, we assume that the oca fters the fuson process have reached the steady state. Defne P o m P, P o m P n, m xẑ, o m ẑẑ, m, j m j. At the steady state, we have = F n P o (F n A () 1 ) =1 F GQG (F A () F 1 ) F n P o (12) j = P o j j E j (13) where,, j,e j are defned as beow, F n A () 1 (14) j E j Defne therefore, =1 =1 =1 F GQG (F A () F 1 ) (15) (F A () F 1 )GQG (F A (j) F 1 ) (16) B () 1 2 R j : (17), E11 E 12, E E 21 E 22 [ 1 2 ]=F n P o (18) o = P o E (19) P o = P 1 o o = P o (F n P o ) ( P o E) 1 ( P n o F ) (20) ˆx = ˆx n (F n P o ) ˆx (1) ( P o E) 1 ˆx n ˆx (2) : ˆx n (21) We further assume a the reguarty condtons, ncudng observabty controabty condtons, necessary to assure a unque exstence of a postve defnte souton to these matrx equatons. Note that (20) (21) represent a systematc recursve procedure to compute the MAP fuson estmate the assocated covarance for arbtrary communcaton nterva n. It can be easy seen that the souton to the steady state covarance satsfes the foowng matrx functon whch can be soved usng a successve approxmaton method P o = F n P n o F F GQG F (F n P o ) =1 ( P o E) 1 ( P n o F ): (22) Note that une the IM fuson where the estmated covarance s not the true covarance [7], n MAP fuson, we obtan the true covarance, namey III. x ()=E[(ˆx x )(ˆx x ) ]=P : (23) PERFORMANCE COMPARISON To evauate the MAP fuson performance, a smpe target dynamc mode same as the one used n [9] [11] s assumed, 1 T x 1 = 0 1 x T 2 =2 T v (24) wth sampng tme T = 1 zero-mean whte process nose v wth varance q. Note that for rea systems, a Brownan moton mode mght be preferred for sensors that are not synchronzed wth possby rom measurement tmes. The measurement of the two sensors are modeed as z m ()=[1 0]x w m, m = 1,2 (25) where the two measurement noses are assumed to be ndependent wth varance r m = 1. Ths mode assumes two synchronzed, fx measurement rate sensors, each generatng a 1-dmensona measurement wth dentca observaton matrx. Fgs. 1 3 show the theoretca resuts based on the anayss derved n Secton II for the herarchca MAP fuson wth feedbac. In these fgures, the ratos of the eements of the covarance matrx P P for a wde range of process nose q are gven, where p1 p2 P = p2 p3 CORRESPONDENCE 709

5 Fg. 1. Rato of P1 for MAP fuson wth feedbac. Fg. 3. Rato of P3 for MAP fuson wth feedbac. Fg. 2. Rato of P2 for MAP wth feedbac. Fg. 4. Ratos of error epses area for MAP fuson wth feedbac. s the steady state error covarance matrx of the fused state P s the optma steady state error covarance matrx wth a snge sensor. Fg. 4 shows the ratos of the areas of the epses of uncertanty, A/A, whch are proportona to the square root of the determnant of the covarance matrces. The dotted nes are the anaytca resuts based on the CC approach derved n [11], the sod nes are the anaytca resuts based on (23) wth varous communcaton rates. It can be seen from these fgures that the anaytca fuson resuts are reatvey senstve to the process nose (partcuary for p3, snce veocty s not observed drecty) the communcaton nterva. Fgs. 5 6 compare the resuts of CC, IM, MAP, CF for n =4n = 8 respectvey. It can be seen from the fgures that MAP performs the best among the frst three agorthms. However, wth arge process nose ess frequent communcatons (n = 8), both IM MAP converge to the CC agorthm. It s to be noted that among the three agorthms, MAP s the most compcated one whe IM s the smpest one. Further more, as shown n (10) (11), to compute the CC, MAP needs the past covarance hstory between communcatons whch may or may Fg. 5. CC, IM, MAP fuson wth n =4. not be avaabe off ne. When they are not avaabe, the communcaton oad coud ncrease dramatcay. IV. CONCLUSIONS Ths paper presents a quanttatve performance evauaton method for the MAP trac state estmate 710 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 40, NO. 2 APRIL 2004

6 The ast equaty foows from the orthogonaty prncpe. Wth, ẑẑ j = E[(ˆx () ˆx 1 ˆx 1 ) ] Fg. 6. CC, IM, MAP fuson wth n =8. fuson agorthm. In partcuar, the steady state performance for herarchca fuson archtecture wth or wthout feedbac s anayzed n deta. It has been nown that the MAP agorthm taes nto account the oca estmate correaton due to both common pror common process nose whe the IM agorthm ony consders the common pror. It has aso been shown that the MAP fuson provdes the best (LMMSE) estmates under the near Gaussan assumpton n a statc stuaton (.e., snge teraton). Ths paper presents a systematc anaytca procedure for a dynamc stuaton provdes the theoretca curves for the steady state performance of the MAP fuson agorthm wth varous communcaton patterns. The resuts are compared wth the one obtaned by the IM approach as we as the CC approach. APPENDIX A When feedbac s on, ˆx (1) 1 = ˆx (2) 1 = ˆx 1. To derve (8) (9), from (3) (4), wth xẑ [ 1 2 ], we have 4 = E[(x ˆx 1 )(ˆx () ˆx 1 ) ] = E[(x ˆx 1 )[(x ˆx 1 ) (x ˆx () )] ] = P 1 E[(x ˆx 1 )(x ˆx () ) ] = P 1 E[[(x ˆx () () )(ˆx ˆx 1 )](x ˆx () ) ] = P 1 P () () E[(ˆx ˆx 1 )(x ˆx () ) ] = P 1 P () : (26) 4 Note that for smpcty, we have removed the condtonng varabe Z from a equatons. = E[[(ˆx () x )(x ˆx 1 )] [( x )(x ˆx 1 )] ] = P 1 E[(ˆx () x (j) )(ˆx x ) ] E[(ˆx () x )(x ˆx 1 ) ] E[(x ˆx 1 x ) ] = P 1 P (j) P() P(j) : Obvousy, from (27), when = j, = P 1 P (). Aso, n (27) But P (j) () = E[(ˆx x (j) )(ˆx x ) ] = E[[(ˆx 1 x )(ˆx () ˆx 1 )] [(ˆx 1 x ˆx 1 )] ]: (ˆx 1 x )(ˆx () ˆx 1 ) =(ˆx 1 x ) K () H () (ˆx 1 x )K () w () =[I K () H () ](ˆx 1 x )K () H () w () =[IP () H() R ()1 H () ](ˆx 1 x )K () w () (27) = P () P1 1 (ˆx 1 x )K () w () (28) P (j) = P() P1 1 E[[(ˆx 1 x )(ˆx 1 x ) ] P 1 1 P(j) K() E[w () = P () P1 1 P(j) K () R (j) K (j) w(j) ]K (j) where K () s the Kaman gan. Notce that n (28), when the measurement noses from two sensors are ndependent, P (j) = P () P1 1 P(j). APPENDIX B Wth n>1, when feedbac s on, ˆx (1) n = ˆx (2) n = ˆx n. CORRESPONDENCE 711

7 It can be shown that = A(j) (j) 1 ˆx n z (j) n = A (j) (j) 1 ˆx n = A (j) (j) 1 ˆx n =1 =1 =1 =1 H (j) F x n H (j) x n h= =1 n h H(j) F h Gv n n (29) where A (j) n1 = I, A(j) = A (j) 1 P(j) n P(j) nn1 1 F, = A (j) 1 P(j) n H(j) R (j)1. Notce that x = F n x n F Gv n (30) z (j) n = H(j) x n n = H (j) F x n H (j) F h Gv nh n, h=1 =1 =1,:::,n: (31) Wth (30) (31), the equates h H(j) F h = F A (j) F 1 (32) h= =1 H (j) F = F n A (j) 1 (33) we have ˆx n =(x ˆx n x ) Therefore, =(x ˆx n )A (j) (j) 1 (ˆx n x n ) =1 A (j) F 1 Gv n =1 n =(x ˆx n )A (j) 1 (ˆx n x n ) A (j) F 1 Gv n n : =1 j = E[(x ˆx n ˆx n ) ] = F n P n (F n A (j) 1 ) =1 =1 (34) F GQG (F A (j) F 1 ) (35) j = E[(ˆx () ˆx n ˆx n ) ] =(F n A () 1 )P n (Fn A (j) 1 ) =1 =1 APPENDIX C (F A () F 1 )GQG (F A (j) F 1 ) B () R j (36) Wth n>1, when feedbac s off, at each oca sensor, when, t s possbe to wrte [7], = P(j) s = P (j) s. P (j)1 s1 P (j)1 s1 1 P(j) s F(P (j) s P (j) s H (j) R (j)1 z (j) P (j)1 s1 =1 H (j) R (j)1 z (j) 12 P(j) s H (j) R (j)1 z (j) 1 ) = A (j)n n z (j) n (37) P (j)1 where A (j) = P (j) s s1 F, From (37) (30) (31) = A(j)n n =1 =1 H (j) F x n = A (j) P (j) s H (j) R (j)1. H (j) F h Gv nh h=1 n (38) ˆx n =(x ˆx n x ) =(x ˆx n )A (j)n ( n x n ) A (j)1 F 1 Gv n n =1 (39) where n (39) the equates (32) (33) have been used. From (39), we have j = E[(x ˆx n ˆx n ) ] =1 = F n P n F F n P cf(j) n A(j)n F GQG (F A (j)1 ) (40) =1 712 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 40, NO. 2 APRIL 2004

8 where P cf(j) n = E[(ˆx n x n n x n ) ]: From (39), we aso have where j = E[(ˆx () ˆx n ˆx n ) ] = F n P n F F n P cf(j) n A(j)n A ()n P cf() n F A ()n P (j)) n A(j)n (F A (j)1 F 1 )GQG =1 (F A (j)1 F 1 ) =1 B () R j P (j) (j) = E[(ˆx n n x (j) n )(ˆx n x n ) ]: APPENDIX D Defne P cf(j) 1 := E[(ˆx 1 x )(ˆx () 1 x) ] = E[(Fˆx 11 Fx 1 Gv 1 ) (Fˆx () 11 Fx Gv 1 ) ] (41) (42) = FP cf(j) 11 F GQG : (43) When feedbac s off, xẑ [ 1 defnton = E[(x ˆx 1 )(ˆx () ˆx 1 ) ] 2 ], where by = E[(x ˆx 1 )[(x ˆx 1 ) (x ˆx () )] ] = P 1 E[(x ˆx 1 )(x ˆx ()) ]: (44) Note that ˆx () x = P() P()1 () 1 (ˆx 1 x )Kw() where K s the Kaman gan. Therefore E[(x ˆx 1 )(x ˆx () ) ], = E[(x ˆx 1 )(x ˆx () 1 ) P ()1 1 P() ] = P 1 P cf() 1 P()1 1 P() : (45) Susttutng (45) nto (44), we obtan = P 1 P cf() 1 P()1 1 P() : (46) Thecovarancematrxsgvenby ẑẑ, where j = E[(ˆx () ˆx 1 ˆx 1 ) ] = E[[(ˆx () x )(x ˆx 1 )][( x )(x ˆx 1 )] ] = P 1 E[(ˆx () x (j) )(ˆx x ) ] E[(ˆx () x )(x ˆx 1 ) ]E[(x ˆx 1 x ) ] = P 1 P (j) P() P()1 1 P() P(j) 1 P(j)1 1 P(j) (47) Equatons (46) (47) can be equvaenty derved from Appendx C by tang the speca case of n = 1. Usng (43) A (j) 1 = P(j) P(j)1 F for n =1, 1 (40) becomes j = E[(x ˆx 1 ˆx 1 ) ] = FP 11 F FP cf(j) 11 A(j) GQG (I A (j) ) =(FP 11 F GQG ) (FP cf(j) 11 A(j) GQG A (j) ) ) = P 1 P cf(j) 1 P(j)1 1 P(j) whch concdes wth (46). Smary, the equvaence between (42) (47) can be estabshed. REFERENCES K. C. CHANG Dept. of SEOR, 4A6 George Mason Unversty Farfax, VA E-ma: (chang@gmu.edu) ZHI TIAN Dept. of Eectrca Computer Engneerng Mchgan Technoogca Unversty Houghton, MI SHOZO MORI ALPHATECH, Inc. San Dego, CA CHEE-YEE CHONG [1] Mor, S., Barer, W. H., Chong, C. Y., Chang, K. C. (2002) Trac assocaton trac fuson wth non-determnstc target dynamcs. IEEE Transactons on Aerospace Eectronc Systems, 38, 2 (Apr. 2002), [2] L, X-R., Zhu, Y., Han, C. (2000) Unfed optma near estmaton fuson Part I: Unfed modes fuson resuts. In Proceedngs of Fuson 00, Pars, [3] L, X-R., Zhang, K. (2001) Optma near estmaton fuson Part IV: Optmaty effcency of dstrbuted fuson. In Proceedngs of Fuson 01, Montrea, Aug [4] Chong, C. Y., Mor, S. (2001) Convex combnaton covarance ntersecton agorthms n dstrbuted fuson. In Proceedngs of Fuson 01, Montrea, Aug CORRESPONDENCE 713

9 [5] Chang, K. C., Tan, Z., Saha, R. K. (1998) Performance evauaton of trac fuson wth nformaton fter. In Proceedngs of the Frst Internatona Conference on Mutsource-Mutsensor Informaton Fuson, LasVegas, NV, Juy 1998, [6] Chang, K. C. (2000) Evauatng herarchca trac fuson wth nformaton matrx fter. In Proceedngs of Fuson 00, Pars, [7] Chang, K. C., Tan, Z., Saha, R. (2002) Performance evauaton of trac fuson wth nformaton fter. IEEE Transactons on Aerospace Eectronc Systems, 38, 2 (Apr. 2002). [8] Chong, C. Y., Chang, K. C., Mor, S. (1986) Dstrbuted tracng n dstrbuted sensor networs. In Proceedngs of the Amercan Contro Conference, Seatte, [9] Chang, K. C., Saha, R. K., Bar-Shaom, Y. (1997) On optma trac-to-trac fuson, IEEE Transactons on Aerospace Eectronc Systems, 33, 4 (Oct. 1997), [10] Bar-Shaom, Y. (1981) On the trac-to-trac correaton probem. IEEE Transactons on Automatc Contro, 26, 2(Apr. 1981), [11] Bar-Shaom, Y., Campo, L. (1986) The effect of the common process nose on the two-sensor fused-trac covarance. IEEE Transactons on Aerospace Eectronc Systems, 22, 6 (Nov. 1986), [12] Drummond, O. E. (1995) Feedbac n trac fuson wthout process nose. In Proceedngs of the SPIE Conference on Sgna Data Processng of Sma Targets, Vo. 2561, 1995, [13] Chong, C. Y., Mor, S., Chang, K. C., Barer, W. (1999) Archtectures agorthms for trac assocaton fuson. In Proceedngs of the Second Internatona Conference on Informaton Fuson, Juy 1999, [14] Chong, C. Y. (1979) Herarchca estmaton. In Proceedngs of MIT/ONR Worshop on C 3, New Assgnment-Based Data Assocaton for Tracng Move-Stop-Move Targets We present a new assgnment-based agorthm for data assocaton n tracng ground targets empoyng evasve move-stop-move maneuvers usng grgound movng target Indcator (GMTI) reports obtaned from an arborne sensor. To avod detecton by the GMTI sensor, the targets deberatey stop for some tme before movng agan. The sensor does not detect a target when the atter s rada veocty (aong the ne-of-sght from the sensor) fas beow a certan mnmum detectabe veocty (MDV). Even n the absence of move-stop-move maneuvers, the detecton has a ess-than-unty probabty (P D < 1) dueto obscuraton threshodng. Then, t s of nterest, when a target s not detected, to deveop a systematc technque that can dstngush between ac of detecton due to P D < 1 ac of detecton due to a stop (or a near stop). Prevousy, ths probem was soved usng a varabe structure nteractng mutpe mode (VS-IMM) estmator wth a stopped target mode (VS-IMM-ST) wthout expcty addressng data assocaton. We deveop a nove two-dummy assgnment approach for move-stop-move targets that consders both the probem of data assocaton as we as fterng. Typcay, n assgnment-based data assocaton a dummy measurement s used to denote the nondetecton event. The use of the stard snge-dummy assgnment, whch does not he move-stop-move moton expcty, can resut n broen tracs. The new agorthm proposed here hes the evasve move-stop-move moton by ntroducng a second dummy measurement to represent nondetecton due to the MDV. We aso present a ehood-rato-based trac deeton scheme for move-stop-move targets. Usng ths two-dummy data assocaton agorthm, the trac correspondng to a move-stop-move target s ept ave durng mssed detectons both due to MDV due to P D < 1. In addton, one can obtan reductons n both rms estmaton errors as we as the tota number of trac breaages. I. INTRODUCTION Ths paper focuses on the probem of tracng ground targets usng ground movng target ndcator (GMTI) reports obtaned from an arborne sensor. The sensor measurements consst of range, azmuth, Manuscrpt receved September 26, 2002; revsed March 18, June 25, December 15, 2003; reeased for pubcaton December 15, IEEE Log No. T-AES/40/2/ Refereeng of ths contrbuton was hed by P. K. Wett /04/$17.00 c 2004 IEEE 714 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 40, NO. 2 APRIL 2004

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He

More information

Globally Optimal Multisensor Distributed Random Parameter Matrices Kalman Filtering Fusion with Applications

Globally Optimal Multisensor Distributed Random Parameter Matrices Kalman Filtering Fusion with Applications Sensors 2008, 8, 8086-8103; DOI: 10.3390/s8128086 OPEN ACCESS sensors ISSN 1424-8220 www.mdp.com/journa/sensors Artce Gobay Optma Mutsensor Dstrbuted Random Parameter Matrces Kaman Fterng Fuson wth Appcatons

More information

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

Nested case-control and case-cohort studies

Nested case-control and case-cohort studies Outne: Nested case-contro and case-cohort studes Ørnuf Borgan Department of Mathematcs Unversty of Oso NORBIS course Unversty of Oso 4-8 December 217 1 Radaton and breast cancer data Nested case contro

More information

Delay tomography for large scale networks

Delay tomography for large scale networks Deay tomography for arge scae networks MENG-FU SHIH ALFRED O. HERO III Communcatons and Sgna Processng Laboratory Eectrca Engneerng and Computer Scence Department Unversty of Mchgan, 30 Bea. Ave., Ann

More information

COXREG. Estimation (1)

COXREG. Estimation (1) COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards

More information

Neural network-based athletics performance prediction optimization model applied research

Neural network-based athletics performance prediction optimization model applied research Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped

More information

On the Power Function of the Likelihood Ratio Test for MANOVA

On the Power Function of the Likelihood Ratio Test for MANOVA Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat

More information

Optimum Selection Combining for M-QAM on Fading Channels

Optimum Selection Combining for M-QAM on Fading Channels Optmum Seecton Combnng for M-QAM on Fadng Channes M. Surendra Raju, Ramesh Annavajjaa and A. Chockangam Insca Semconductors Inda Pvt. Ltd, Bangaore-56000, Inda Department of ECE, Unversty of Caforna, San

More information

Synchronized Multi-sensor Tracks Association and Fusion

Synchronized Multi-sensor Tracks Association and Fusion Synchronzed Mult-sensor Tracks Assocaton and Fuson Dongguang Zuo Chongzhao an School of Electronc and nformaton Engneerng X an Jaotong Unversty Xan 749, P.R. Chna Zlz_3@sna.com.cn czhan@jtu.edu.cn Abstract

More information

A DIMENSION-REDUCTION METHOD FOR STOCHASTIC ANALYSIS SECOND-MOMENT ANALYSIS

A DIMENSION-REDUCTION METHOD FOR STOCHASTIC ANALYSIS SECOND-MOMENT ANALYSIS A DIMESIO-REDUCTIO METHOD FOR STOCHASTIC AALYSIS SECOD-MOMET AALYSIS S. Rahman Department of Mechanca Engneerng and Center for Computer-Aded Desgn The Unversty of Iowa Iowa Cty, IA 52245 June 2003 OUTLIE

More information

Research Article H Estimates for Discrete-Time Markovian Jump Linear Systems

Research Article H Estimates for Discrete-Time Markovian Jump Linear Systems Mathematca Probems n Engneerng Voume 213 Artce ID 945342 7 pages http://dxdoorg/11155/213/945342 Research Artce H Estmates for Dscrete-Tme Markovan Jump Lnear Systems Marco H Terra 1 Gdson Jesus 2 and

More information

Image Classification Using EM And JE algorithms

Image Classification Using EM And JE algorithms Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu

More information

Associative Memories

Associative Memories Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete

More information

DISTRIBUTED PROCESSING OVER ADAPTIVE NETWORKS. Cassio G. Lopes and Ali H. Sayed

DISTRIBUTED PROCESSING OVER ADAPTIVE NETWORKS. Cassio G. Lopes and Ali H. Sayed DISTRIBUTED PROCESSIG OVER ADAPTIVE ETWORKS Casso G Lopes and A H Sayed Department of Eectrca Engneerng Unversty of Caforna Los Angees, CA, 995 Ema: {casso, sayed@eeucaedu ABSTRACT Dstrbuted adaptve agorthms

More information

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks Shengyang Sun, Changyou Chen, Lawrence Carn Suppementary Matera: Learnng Structured Weght Uncertanty n Bayesan Neura Networks Shengyang Sun Changyou Chen Lawrence Carn Tsnghua Unversty Duke Unversty Duke

More information

On Uplink-Downlink Sum-MSE Duality of Multi-hop MIMO Relay Channel

On Uplink-Downlink Sum-MSE Duality of Multi-hop MIMO Relay Channel On Upn-Downn Sum-MSE Duat of Mut-hop MIMO Rea Channe A Cagata Cr, Muhammad R. A. handaer, Yue Rong and Yngbo ua Department of Eectrca Engneerng, Unverst of Caforna Rversde, Rversde, CA, 95 Centre for Wreess

More information

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Interference Agnment and Degrees of Freedom Regon of Ceuar Sgma Channe Huaru Yn 1 Le Ke 2 Zhengdao Wang 2 1 WINLAB Dept of EEIS Unv. of Sc.

More information

Distributed Moving Horizon State Estimation of Nonlinear Systems. Jing Zhang

Distributed Moving Horizon State Estimation of Nonlinear Systems. Jing Zhang Dstrbuted Movng Horzon State Estmaton of Nonnear Systems by Jng Zhang A thess submtted n parta fufment of the requrements for the degree of Master of Scence n Chemca Engneerng Department of Chemca and

More information

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Pote Water-fng for Weghted Sum-rate Maxmzaton n MIMO B-MAC Networks under Mutpe near Constrants An u 1, Youjan u 2, Vncent K. N. au 3, Hage

More information

Retrodirective Distributed Transmit Beamforming with Two-Way Source Synchronization

Retrodirective Distributed Transmit Beamforming with Two-Way Source Synchronization Retrodrectve Dstrbuted Transmt Beamformng wth Two-Way Source Synchronzaton Robert D. Preuss and D. Rchard Brown III Abstract Dstrbuted transmt beamformng has recenty been proposed as a technque n whch

More information

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods Uncertanty Specfcaton and Propagaton for Loss Estmaton Usng FOSM Methods J.W. Baer and C.A. Corne Dept. of Cv and Envronmenta Engneerng, Stanford Unversty, Stanford, CA 94305-400 Keywords: Sesmc, oss estmaton,

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

A finite difference method for heat equation in the unbounded domain

A finite difference method for heat equation in the unbounded domain Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy

More information

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2 Note 2 Lng fong L Contents Ken Gordon Equaton. Probabty nterpretaton......................................2 Soutons to Ken-Gordon Equaton............................... 2 2 Drac Equaton 3 2. Probabty nterpretaton.....................................

More information

COMBINING SPATIAL COMPONENTS IN SEISMIC DESIGN

COMBINING SPATIAL COMPONENTS IN SEISMIC DESIGN Transactons, SMRT- COMBINING SPATIAL COMPONENTS IN SEISMIC DESIGN Mchae O Leary, PhD, PE and Kevn Huberty, PE, SE Nucear Power Technooges Dvson, Sargent & Lundy, Chcago, IL 6060 ABSTRACT Accordng to Reguatory

More information

Networked Cooperative Distributed Model Predictive Control Based on State Observer

Networked Cooperative Distributed Model Predictive Control Based on State Observer Apped Mathematcs, 6, 7, 48-64 ubshed Onne June 6 n ScRes. http://www.scrp.org/journa/am http://dx.do.org/.436/am.6.73 Networed Cooperatve Dstrbuted Mode redctve Contro Based on State Observer Ba Su, Yanan

More information

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows: APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng

More information

Chapter 6. Rotations and Tensors

Chapter 6. Rotations and Tensors Vector Spaces n Physcs 8/6/5 Chapter 6. Rotatons and ensors here s a speca knd of near transformaton whch s used to transforms coordnates from one set of axes to another set of axes (wth the same orgn).

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Prediction Error of the Multivariate Additive Loss Reserving Method for Dependent Lines of Business

Prediction Error of the Multivariate Additive Loss Reserving Method for Dependent Lines of Business Predcton Error of the Mutvarate Addtve Loss Reservng Method for Dependent Lnes of Busness by Mchae Merz and Maro V Wüthrch ABSTRACT Often n non-fe nsurance, cams reserves are the argest poston on the abty

More information

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES 8 TH INTERNATIONAL CONERENCE ON COMPOSITE MATERIALS REAL-TIME IMPACT ORCE IDENTIICATION O CRP LAMINATED PLATES USING SOUND WAVES S. Atobe *, H. Kobayash, N. Hu 3 and H. ukunaga Department of Aerospace

More information

A CONSTRAINT GENERATION INTEGER PROGRAMMING APPROACH TO INFORMATION THEORETIC SENSOR RESOURCE MANAGEMENT

A CONSTRAINT GENERATION INTEGER PROGRAMMING APPROACH TO INFORMATION THEORETIC SENSOR RESOURCE MANAGEMENT A CONSTRAINT GENERATION INTEGER PROGRAMMING APPROACH TO INFORMATION THEORETIC SENSOR RESOURCE MANAGEMENT Jason L. Wams, 1, John W. Fsher III, Aan S. Wsy 1, 1 Laboratory for Informaton and Decson Systems

More information

Optimal and Suboptimal Linear Receivers for Time-Hopping Impulse Radio Systems

Optimal and Suboptimal Linear Receivers for Time-Hopping Impulse Radio Systems MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.mer.com Optma and Suboptma Lnear Recevers for Tme-Hoppng Impuse Rado Systems Snan Gezc Hsash Kbayash H. Vncent Poor Andreas F. Mosch TR2004-052 May

More information

Analysis of Bipartite Graph Codes on the Binary Erasure Channel

Analysis of Bipartite Graph Codes on the Binary Erasure Channel Anayss of Bpartte Graph Codes on the Bnary Erasure Channe Arya Mazumdar Department of ECE Unversty of Maryand, Coege Par ema: arya@umdedu Abstract We derve densty evouton equatons for codes on bpartte

More information

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun

More information

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,

More information

Signal Processing 142 (2018) Contents lists available at ScienceDirect. Signal Processing. journal homepage:

Signal Processing 142 (2018) Contents lists available at ScienceDirect. Signal Processing. journal homepage: Sgna Processng 142 (218) 32 329 Contents sts avaabe at ScenceDrect Sgna Processng ourna homepage: www.esever.com/ocate/sgpro Sepan-Bangs-type formuas the reated Msspecfed Cramér-Rao Bounds for Compex Eptcay

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing reyword Whte aancng wth Low Computaton Cost for On- oard Vdeo Capturng Peng Wu Yuxn Zoe) Lu Hewett-Packard Laboratores Hewett-Packard Co. Pao Ato CA 94304 USA Abstract Whte baancng s a process commony

More information

Demodulation of PPM signal based on sequential Monte Carlo model

Demodulation of PPM signal based on sequential Monte Carlo model Internatona Journa of Computer Scence and Eectroncs Engneerng (IJCSEE) Voume 1, Issue 1 (213) ISSN 232 428 (Onne) Demoduaton of M sgna based on seuenta Monte Caro mode Lun Huang and G. E. Atkn Abstract

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Downlink Power Allocation for CoMP-NOMA in Multi-Cell Networks

Downlink Power Allocation for CoMP-NOMA in Multi-Cell Networks Downn Power Aocaton for CoMP-NOMA n Mut-Ce Networs Md Shpon A, Eram Hossan, Arafat A-Dwe, and Dong In Km arxv:80.0498v [eess.sp] 6 Dec 207 Abstract Ths wor consders the probem of dynamc power aocaton n

More information

3. Stress-strain relationships of a composite layer

3. Stress-strain relationships of a composite layer OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

G : Statistical Mechanics

G : Statistical Mechanics G25.2651: Statstca Mechancs Notes for Lecture 11 I. PRINCIPLES OF QUANTUM STATISTICAL MECHANICS The probem of quantum statstca mechancs s the quantum mechanca treatment of an N-partce system. Suppose the

More information

L-Edge Chromatic Number Of A Graph

L-Edge Chromatic Number Of A Graph IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma

More information

Outline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]

Outline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1] DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm

More information

Estimation of Markov Jump Systems with Mode Observation One-Step Lagged to State Measurement

Estimation of Markov Jump Systems with Mode Observation One-Step Lagged to State Measurement Estmaton of Marov Jump Systems wth Mode Observaton One-Step Lagged to State Measurement Yan Lang, Zengfu Wang, Ll We, Yongme Cheng, Quan Pan College of Automaton Northwestern Polytechncal Unversty X an,

More information

Journal of Multivariate Analysis

Journal of Multivariate Analysis Journa of Mutvarate Anayss 3 (04) 74 96 Contents sts avaabe at ScenceDrect Journa of Mutvarate Anayss journa homepage: www.esever.com/ocate/jmva Hgh-dmensona sparse MANOVA T. Tony Ca a, Yn Xa b, a Department

More information

Predicting Model of Traffic Volume Based on Grey-Markov

Predicting Model of Traffic Volume Based on Grey-Markov Vo. No. Modern Apped Scence Predctng Mode of Traffc Voume Based on Grey-Marov Ynpeng Zhang Zhengzhou Muncpa Engneerng Desgn & Research Insttute Zhengzhou 5005 Chna Abstract Grey-marov forecastng mode of

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO

More information

Parameter Estimation for Dynamic System using Unscented Kalman filter

Parameter Estimation for Dynamic System using Unscented Kalman filter Parameter Estmaton for Dynamc System usng Unscented Kalman flter Jhoon Seung 1,a, Amr Atya F. 2,b, Alexander G.Parlos 3,c, and Klto Chong 1,4,d* 1 Dvson of Electroncs Engneerng, Chonbuk Natonal Unversty,

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Decentralized Adaptive Control for a Class of Large-Scale Nonlinear Systems with Unknown Interactions

Decentralized Adaptive Control for a Class of Large-Scale Nonlinear Systems with Unknown Interactions Decentrazed Adaptve Contro for a Cass of Large-Scae onnear Systems wth Unknown Interactons Bahram Karm 1, Fatemeh Jahangr, Mohammad B. Menhaj 3, Iman Saboor 4 1. Center of Advanced Computatona Integence,

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information

Hidden Markov Models

Hidden Markov Models Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,

More information

Appendix for An Efficient Ascending-Bid Auction for Multiple Objects: Comment For Online Publication

Appendix for An Efficient Ascending-Bid Auction for Multiple Objects: Comment For Online Publication Appendx for An Effcent Ascendng-Bd Aucton for Mutpe Objects: Comment For Onne Pubcaton Norak Okamoto The foowng counterexampe shows that sncere bddng by a bdders s not aways an ex post perfect equbrum

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Cyclic Codes BCH Codes

Cyclic Codes BCH Codes Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator

More information

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS

GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS F. Rodríguez Henríquez (1), Member, IEEE, N. Cruz Cortés (1), Member, IEEE, J.M. Rocha-Pérez (2) Member, IEEE. F. Amaro Sánchez

More information

Inthem-machine flow shop problem, a set of jobs, each

Inthem-machine flow shop problem, a set of jobs, each THE ASYMPTOTIC OPTIMALITY OF THE SPT RULE FOR THE FLOW SHOP MEAN COMPLETION TIME PROBLEM PHILIP KAMINSKY Industra Engneerng and Operatons Research, Unversty of Caforna, Bereey, Caforna 9470, amnsy@eor.bereey.edu

More information

Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast

Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast Snge-Source/Snk Network Error Correcton Is as Hard as Mutpe-Uncast Wentao Huang and Tracey Ho Department of Eectrca Engneerng Caforna Insttute of Technoogy Pasadena, CA {whuang,tho}@catech.edu Mchae Langberg

More information

Optimal Guaranteed Cost Control of Linear Uncertain Systems with Input Constraints

Optimal Guaranteed Cost Control of Linear Uncertain Systems with Input Constraints Internatona Journa Optma of Contro, Guaranteed Automaton, Cost Contro and Systems, of Lnear vo Uncertan 3, no Systems 3, pp 397-4, wth Input September Constrants 5 397 Optma Guaranteed Cost Contro of Lnear

More information

Lecture 3: Shannon s Theorem

Lecture 3: Shannon s Theorem CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts

More information

Sampling-based Approach for Design Optimization in the Presence of Interval Variables

Sampling-based Approach for Design Optimization in the Presence of Interval Variables 0 th Word Congress on Structura and Mutdscpnary Optmzaton May 9-4, 03, Orando, orda, USA Sampng-based Approach for Desgn Optmzaton n the Presence of nterva Varabes Davd Yoo and kn Lee Unversty of Connectcut,

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

A Three-Phase State Estimation in Unbalanced Distribution Networks with Switch Modelling

A Three-Phase State Estimation in Unbalanced Distribution Networks with Switch Modelling A Three-Phase State Estmaton n Unbaanced Dstrbuton Networks wth Swtch Modeng Ankur Majumdar Student Member, IEEE Dept of Eectrca and Eectronc Engneerng Impera Coege London London, UK ankurmajumdar@mperaacuk

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

More information

A Derivative-Free Algorithm for Bound Constrained Optimization

A Derivative-Free Algorithm for Bound Constrained Optimization Computatona Optmzaton and Appcatons, 21, 119 142, 2002 c 2002 Kuwer Academc Pubshers. Manufactured n The Netherands. A Dervatve-Free Agorthm for Bound Constraned Optmzaton STEFANO LUCIDI ucd@ds.unroma.t

More information

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva Econ 39 - Statstcal Propertes of the OLS estmator Sanjaya DeSlva September, 008 1 Overvew Recall that the true regresson model s Y = β 0 + β 1 X + u (1) Applyng the OLS method to a sample of data, we estmate

More information

The Leak Detection of Heating Pipe Based on Multi-Scale Correlation Algorithm of Wavelet

The Leak Detection of Heating Pipe Based on Multi-Scale Correlation Algorithm of Wavelet Sensors & Transducers Vo. 5 Speca Issue December 03 pp. 80-88 Sensors & Transducers 03 by IFSA http://www.sensorsporta.com The Lea Detecton of Heatng Ppe Based on ut-scae Correaton Agorthm of Waeet Xufang

More information

Module III, Lecture 02: Correlation Functions and Spectral Densities

Module III, Lecture 02: Correlation Functions and Spectral Densities Modue III, Lecture : orreaton Functons and Spectra enstes The ony part of Boch Redfed Wangsness spn reaxaton theory that we coud say nothng about n the prevous ecture were the correaton functons. They

More information

Reliability Sensitivity Algorithm Based on Stratified Importance Sampling Method for Multiple Failure Modes Systems

Reliability Sensitivity Algorithm Based on Stratified Importance Sampling Method for Multiple Failure Modes Systems Chnese Journa o Aeronautcs 3(010) 660-669 Chnese Journa o Aeronautcs www.esever.com/ocate/ca Reabty Senstvty Agorthm Based on Strated Importance Sampng Method or Mutpe aure Modes Systems Zhang eng a, u

More information

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1 Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com

More information

Autonomous State Space Models for Recursive Signal Estimation Beyond Least Squares

Autonomous State Space Models for Recursive Signal Estimation Beyond Least Squares Autonomous State Space Modes for Recursve Sgna Estmaton Beyond Least Suares Nour Zama, Reto A Wdhaber, and Hans-Andrea Loeger ETH Zurch, Dept of Informaton Technoogy & Eectrca Engneerng ETH Zurch & Bern

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Item calibration in incomplete testing designs

Item calibration in incomplete testing designs Pscoógca (20), 32, 07-32 Item cabraton n ncompete testng desgns Theo JHM Eggen * & Norman D Verhest** *Cto/Unversty of Twente, The etherands **Cto, The etherands Ths study dscusses the justfabty of tem

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

Asynchronous Data Fusion With Parallel Filtering Frame

Asynchronous Data Fusion With Parallel Filtering Frame I.J. Informaton echnoogy and Computer cence -9 ubshed Onne June n C http://.mecs-press.org/ Asynchronous Data Fuson Wth arae Fterng Frame a Department of Informaton ngneerng Zhenghou Coege of Anma usbandry

More information

Radar Trackers. Study Guide. All chapters, problems, examples and page numbers refer to Applied Optimal Estimation, A. Gelb, Ed.

Radar Trackers. Study Guide. All chapters, problems, examples and page numbers refer to Applied Optimal Estimation, A. Gelb, Ed. Radar rackers Study Gude All chapters, problems, examples and page numbers refer to Appled Optmal Estmaton, A. Gelb, Ed. Chapter Example.0- Problem Statement wo sensors Each has a sngle nose measurement

More information

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When

More information

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Lecture 12: Classification

Lecture 12: Classification Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna

More information

Parametric fractional imputation for missing data analysis

Parametric fractional imputation for missing data analysis Secton on Survey Research Methods JSM 2008 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Wayne Fuller Abstract Under a parametrc model for mssng data, the EM algorthm s a popular tool

More information

A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization

A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization Journa of Machne Learnng Research 18 17 1-5 Submtted 9/16; Revsed 1/17; Pubshed 1/17 A Genera Dstrbuted Dua Coordnate Optmzaton Framework for Reguarzed Loss Mnmzaton Shun Zheng Insttute for Interdscpnary

More information

GENERATIVE AND DISCRIMINATIVE CLASSIFIERS: NAIVE BAYES AND LOGISTIC REGRESSION. Machine Learning

GENERATIVE AND DISCRIMINATIVE CLASSIFIERS: NAIVE BAYES AND LOGISTIC REGRESSION. Machine Learning CHAPTER 3 GENERATIVE AND DISCRIMINATIVE CLASSIFIERS: NAIVE BAYES AND LOGISTIC REGRESSION Machne Learnng Copyrght c 205. Tom M. Mtche. A rghts reserved. *DRAFT OF September 23, 207* *PLEASE DO NOT DISTRIBUTE

More information