Adaptive Pixel Interpolation for Spatial Error Concealment

Size: px
Start display at page:

Download "Adaptive Pixel Interpolation for Spatial Error Concealment"

Transcription

1 J Sign Proess Syst (2010) 60: DOI /s y Aptive Pixel Interpoltion for Sptil Error Conelment Li Song & Xin M Reeive: 9 Novemer 2008 / Revise: 23 Mrh 2009 /Aepte: 30 Mrh 2009 /Pulishe online: 27 My 2009 # 2009 Springer Siene + Business Mei, LLC. Mnufture in The Unite Sttes Astrt Error onelment tehniques re wiely use s effiient wys to reover the lost informtion t the eoer. This pper proposes n ptive pixel interpoltion tehnique for sptil error onelment in the lok se oing system. For missing pixel in orrupte lok, its vlue is erive from four neighorhoos of the lok through interpoltion using multiple preition strtegy. The weighting rules of these four neighorhoo loks re refully esigne with regr to three ftors, the istne to the missing pixels within the given orrupte lok, the perentge of unorrupte pixels, n the similrity to the given orrupte lok. The propose metho works effetively in onseutive lok loss sitution, whih is ommon in rel pplitions of vieo trnsmission. Experimentl results show the propose tehnique gins more urte reovery of the missing pixels thn the existing shemes. Keywors Error onelment. Blok se oing. Pixel interpoltion 1 Introution Nowys, the lok-se vieo n imge ompression stnrs, suh s MPEG-2, H.264 n JPEG, re wiely use throughout the worl. However, the high ompression L. Song (*) : X. M Institute of Imge Communition n Informtion Proessing, Shng Key Lortory of Digitl Mei Proessing n Trnsmission, University of Shnghi Jio Tong University, Shnghi , Chin e-mil: song_li@sjtu.eu.n X. M e-mil: milnloo@hotmil.om effiieny might inrese the vulnerility to the trnsmission errors when multimei ontents re trnsporte over error prone hnnels. In the pst ee, reserhers hve propose three kins of methos to ensure the qulity of the trnsmitte vieo, i.e., error resiliene in enoer, error ontrol in hnnel n error onelment in reeiver [1]. In this pper, we fous on the lst metho whih n reover the orrupte t sptilly n/or temporlly n thus hieve oth goo ojetive n sujetive qulity t reeiver sie. So fr mny sptil error onelment methos hve een propose. To reover the missing pixel vlues n rete imges with goo visul qulity, the sptil error onelment tehnique exploits the orreltion etween the orrupte loks n their jent res. Missing mroloks n e reonstrute using simple iliner interpoltion (BI) from four pixels in surrouning mrolok [2], omplex iretionl interpoltion tehniques [3 5], n the DCT oeffiients interpoltion from the neighoring mro loks [6, 7]. More reently, some results emonstrte the improvements on the iretionl interpoltion methos [8 11], whih use ege piring methos suh s the vergepoints tehnique [9] n the Hough trnsform, to estimte the pixel pirs whih hve the similr ege informtion roun the orrupte res. These pixel pirs re then use to reover the missing ege informtion in the orrupte res. From sttistil point of view, nother populr pproh is vne se on mximum posteriori (MAP) tehniques. The est neighor mthing (BNM) metho propose in [12] mkes use of speil kin of prior informtion-lokwise similrity within the imge to reonstrut the lost loks. In ontrst, the metho propose in [13] employs pixelwise moels to hrterize the orreltion mong imge pixels y using the orienttion ptive interpoltion. Besies, the non uniform rtionl B-

2 292 J Sign Proess Syst (2010) 60: spline (NURBS) interpoltion [14], n lok mthing interpoltion [15] re employe for onseutive lok loss pttern. Other pprohes re lso ville, inluing ontent or moel ptive onelment metho [16, 17], projetion-onto-onvex-set (POCS) [18] n nonliner ptter lignment [19]. Mny methos mentione ove hieve goo onelment results in the se of isolte lok loss pttern, nevertheless they work ineffetively in onseutive lok loss sitution. Inee, it is more ommon to pketize severl onseutive loks into one single pket for most vieo n imge trnsmission pplitions. In this pper, we improve the existing BNM metho y esigning n ptive pixel interpoltion tehnique. Our min ontriutions re three-fol: 1) The missing lok is reovere in pixel-y-pixel mnner; 2) Weighting rules re well-esigne to hieve promising reonstrution of eh pixel; 3) A priority-se oneling orer is resse to gretly llevite the error-propgtion prolem. Experimentl results show our metho hieves superior performne in omprison with severl stte-of-the-rt methos. The rest of this pper is orgnize s follows. Setion 2 provies rief review of the BNM metho. The etile esription of the ptive pixel interpoltion proessing n lso e foun. Setion 3 presents extensive experiment results. Finlly, onluing remrks re given in Setion 4. 2 Aptive Pixel Interpoltion 2.1 Overview of the BNM Metho The BNM metho propose in [12] mkes use of lokwise similrity within the imge to reonstrut the lost loks. It Figure 2 Illustrtion for templte mthing. tkes surrouning neighorhoo of the lost lok s templte n performs templte mthing within given serhing rnge, s shown in Fig. 1. The est nite lok is the one whose neighorhoo most losely resemles the templte of the trget lost lok. The men squre error (MSE) or sum of solute ifferenes (SAD) etween the orresponing neighorhoo pixels is use s the mthing mesure of two loks. The lost lok is reovere using the pixel vlues opie or trnsforme from the orresponing prt of the est nite lok. The BNM metho n perform well in the plin res without omplex eges n textures. However, its ury in omplex res is limite s it oes not tke some importnt ftors into onsiertion, suh s intensity vritions of pixels withine the templte n ontext informtion of eh missing pixel. In the next susetions, we will inite how we perform ptive preitions for eh missing pixel in lost lok y seleting ifferent neighorhoo of the trget lok s the mthing templte. 2.2 Pixel-Wise Preition Through Templte Mthing of Different Neighorhoos Figure 1 The reovery of lost lok in BNM metho. Let p(x,y) n (x,y) represent the pixel vlue n inry sttus t position (x, y) in the imge, respetively. The inry sttus of eh pixel inites whether it is vli, i.e., (x,y)=1 mens (x,y) is originlly goo or hs een onele, n (x,y)=0 mens it is orrupte ut hs not een onele so fr.

3 J Sign Proess Syst (2010) 60: Figure 3 Preition for ifferent missing pixels A n B y top neighorhoo mthing. Lost Blok Lost Blok Suppose tht the lost lok (MxM) hs four neighor regions ville, whih re enote s R L,R R,R T, n R B (Left, Right, Top, n Bottom) n form templte sets {R X : X = L, R, T, B}. In our metho, four nite preition vlues for eh missing pixel will e otine y performing templte mthing for eh neighor region. The preition for missing pixel p involves the following two steps. First, the est nite region R X is etermine within serhing rnge (enote y W) in the imge y using templte mthing. The men solute ifferenes (MAD) etween R X n the trget region with the sme size re use s the riterion to evlute the mthing result. Seon, the orresponing pixel p, whose reltive position to the R is equl to the reltive position of p to R X, oul e set s the preition for p erive from neighor region R X. In orer to improve the ury of preition p, three onstrints re impose s elow: 1) eh pixel in the est nite region R X shoul e vli; 2) p must e vli; 3) p must e pixel outsie urrent lok eing onele, euse we voi to reover the missing pixel from onele pixel in the sme orrupte lok for preventing the possile error propgtion. These onstrints introue some moifitions to the onventionl region mthing metho. As shown in Fig. 2, rel sttisti vlues vlues from similrity ftor funtion Similrity ftor MMAD vlue Figure 4 Similrity ftor from the rel sttisti results n those estimte y formultion with the T s =20. Figure 5 The selete pixels n the iretion long whih the priority of eh lost MB is lulte.

4 294 J Sign Proess Syst (2010) 60: Tle 1 Influene of the prmeter of sttus ftor. T Len Pepper Zel we enote (x,y) s the position of the upper-left pixel in R X (X=Tin Fig. 2), (k,l) s the reltive position offset etween the nite region R X n R X, n (i,j) s pixel s reltive position to the upper-left pixel in the region. M n N re with n height of the missing lok, respetively. Then the first onstrint n e esrie s ¼ xþ ð k þ i; y þ l þ jþ ¼ 1j8ði; jþ 2 R X ð1þ n the other two onstrints n form nother set: 4 2 ¼ fmþ ð k; n þ l ¼ 1jðk; lþ 2 Wg ð2þ Bse on the ove nlysis, the templte mthing for eh pixel p(m,n) n e formulte s follows. ðk; lþ ¼ rg min MADðR X ; k; lþ ð3þ MAD¼ 1 MN R X XM 1 X N 1 i¼0 j¼0 j pxþi; ð yþj ði; jþ ; nðk; lþ Þ pxþiþk; ð yþjþlþj ð4þ Figure 3 gives n illustrtion of the erivtion proess isusse ove, where preitions for two speifi pixels re etermine uring templte mthing of top neighorhoo. Aoring to the onstrints impose on the templte mthing, ifferent pixels woul e ssigne with ifferent est mthing regions though the sme neighor type is selete, s epite in Fig. 3. In sufigure 3 (), the pixel enote y A hs vli orresponing pixel A 1, while the orresponene B 1 of pixel B is not vli in this se. However, pixel B n get vli preition B 2, ut pixel A fils to get preition A 2, s shown in Fig. 3(). Until now, we otin four preitions for eh missing pixel p (m,n) y using four templtes with ifferent orienttion. In the next susetion, we will isuss how to estlish ptive weighting sheme for reonstrution of p. 2.3 Reover Missing Pixel In the preition proess s mentione in the previous susetion, three mjor ftors re eqully importnt for finl reonstrution of missing pixel, one four preitions re hieve from eh neighorhoo R X (X=L,R,TorB): 1) Distne ftor: the istne etween the missing pixel p n the region templte R X. 2) Similrity ftor: the miniml MAD (MMAD) lulte y templte mthing to fin the preition vlue for p. 3) Sttus ftor: the sttus of the region, ll pixels re either originlly goo or lrey reovere. Here we further give the etile explntion of these ftors Distne Ftor Mny interpoltion-se sptil EC methos, suh s those in [3 5], show tht the loser Tle 2 PSNR (B) omprison in isolte error sitution. Imge BI [2] BNM [12] Wng s [6] Sun s [18] Prk s [14] Go s [9] Sirikm s [10] ours Len Pepper Zel Foremn Tle 3 PSNR (B) omprison in onseutive error sitution. Imge BI [2] BNM [12] Wng s [6] Sun s [18] Prk s [14] Hsi s [15] Go s [9] Sirikm s [10] Ghrvi s [11] ours Len Pepper Zel Foremn

5 J Sign Proess Syst (2010) 60: Figure 6 Comprison etween BI, BNM n the propose metho for Len in isolte error sitution, () the error imge () the BI s result () the Figure 7 omprison etween BI, BNM n the propose metho for Pepper in isolte error sitution, () the error imge () the BI s result () the

6 296 J Sign Proess Syst (2010) 60: neighor region is to missing pixel p, the more ontriution it mkes towrs the reonstrution of p. Let represent the istne etween the pixel p n the speifi neighor region R X, then we opt the simple iliner interpoltion ie to set the istne ftor f : f ðr X ; m; nþ ¼M þ 1 ðm; nþ ð5þ Similrity Ftor The similrity etween the templte region n its est mth is expete to e lose to the one etween the preition n the missing pixel. Thus the MMAD vlue n e use to mesure the qulity of the ultimte reovery results. Generlly speking, preition otine with smller MMAD vlue shoul ontriute more to the reonstrution of missing pixel. In orer to quntittively evlute the effet of MMAD on reonstrution of the missing pixel p, we perform extensive experiments to ount the proportion of the orret (extly the sme s the originl ones in imge) preitions mong ll the preitions hving the sme MMAD vlue. The vlues of MMAD re normlize y the mximum vlue to hve the rnge [0, 1]. To only regr the effet of MMAD, the istne ftor n the sttus ftor re kept fixe uring the tests. Finlly, the similrity ftor is formulte s truntion funtion of the normlize MMAD urves s elow: 8 1=2; >< NMAD 1 T f s ðr X ; m; nþ ¼ s NMAD < Ts ð6þ >: 0 ; otherwise where prmeter T s is etermine empirilly. Figure 4 shows the vlues estimte y (6) in the se of =1, the rel ifferene vlues etween the preition n the missing pixel is lso provie for omprison purpose. It n e foun tht Eq.(6) well represents the proximity of the reonstrution to the missing pixel. Sttus Ftor The neighorhoo with ifferent vli sttus shoul hve ifferent impts on the pixel in missing lok. A preition otine from n unorrupte neighorhoo shoul mke ominnt ontriution to the reovery of the missing pixel. In ontrst, the preition generte y onele region shoul ount for little. Aoringly we set the sttus ftor f s elow: f ðr X ; m; nþ ¼ 8 < 1; goo region : 1=T ; onele region where T is preefine onstnt. ð7þ Figure 8 omprison etween BI, BNM n the propose metho for Zel in isolte error sitution, () the error imge () the BI s result () the

7 J Sign Proess Syst (2010) 60: Figure 9 omprison etween BI, BNM n the propose metho for Foremn in isolte error sitution, () the error imge () the BI s result () the Now, we n integrte the ovementione three ftors into weight funtion of the preitions in the ontext of ifferent neighorhoos for p. Let w(r X,m,n) enote the weight vlue of the preition p(r X,m,n) from neighor region R X, then we hve wr ð X ; m; n Þ ¼ f ðr X ; m; nþf s ðr X ; m; nþf ðr X ; m; nþ ð8þ n the reonstrute vlue of the missing pixel p(m,n) is: r 1 ðm; nþ ¼ X X ¼L:R;T;B wr ð X ; m; nþpr ð X ; m; nþ! þ 1 X wr ð X ; m; nþ Pm; ð nþ ð9þ X ¼L:R;T; B where r 1 (m, n) represents the reovery vlue for pixel p(m,n). pm; ð nþ is the verge vlue of the ville pixels in 3x3 sliing winow entere t pixel p, whih is introue to llevite the ill effets of the outliers mong the preitions. As reviewe in setion 2.1, BNM nnot hieve goo results in the omplex re in n imge, ut it works well in the plin re. Therefore, we further integrte the norml BNM results into the propose metho to improve its performne in the plin re in n imge. Speifilly, the reovery proeure is expne s follows: 1) Fining the est mthing lok of the orrupte lok through templte mthing y the BNM metho. As shown in Fig. 1, neighorhoo B is use s templte. 2) Clulting the intensity vrition of the pixels within templte B. 3) Otining the ultimte reovery vlue r(m,n) s: rm; ð n Þ ¼ r 1ðm; nþs þ r 2 ðm; nþt s f s ðb; m; nþ s þ T s f s ðb; m; nþ ð10þ where r 1 (m,n) is the reovery vlue previously otine, n r 2 (m,n) is the reovery vlue for p otine y the BNM. f s (B,m,n) is the similrity ftor isusse efore with the MMAD etween the region lok B n its est mth. T σ is the prmeter to just the BNM s ontriution to the finl results. 2.4 Conseutive Blok Loss Sitution In the previous isussion, we ssume tht the four neighor regions of orrupte lok re ll ville, whih n e lle the isolte lok loss. But in prtie, loks re

8 298 J Sign Proess Syst (2010) 60: Figure 10 omprison etween BI, BNM n the propose metho for Len in onseutive error sitution, () the error imge () the BI s result () the Figure 11 omprison etween BI, BNM n the propose metho for Pepper in onseutive error sitution, () the error imge () the BI s result () the

9 J Sign Proess Syst (2010) 60: Figure 12 omprison etween BI, BNM n the propose metho for Zel in onseutive error sitution, () the error imge () the BI s result () the Figure 13 omprison etween BI, BNM n the propose metho for Foremn in onseutive error sitution, () the error imge () the BI s result () the

10 300 J Sign Proess Syst (2010) 60: Tle 4 PSNR (B) omprison in rnom error sitution for Len. Error Pttern BI[2] BNM[12] ours 5% % % orrupte onseutively more often. In this sitution, sine some neighoring regions of missing lok my e unville, we n only use ville neighorhoos to reover the lost informtion. Then we moify Eq. (9) to: r 1 ðm; nþ ¼ X R X RV þ wr ð X ; m; n 1 X R X RV ÞPR ð X ; m; nþ wr ð X ; m; nþ! Pm; ð nþ ð11þ where RV is the vli neighorhoo set. Another prolem to e solve in this sitution is the onele orer of the lost loks. In [8], the uthor resses this prolem in the ontext of imge inpinting n inites tht ifferent reovery orer woul result in quite ifferent results. The missing pixels towrs whih there re more geometri isophote flowing n more vli neighor pixels shoul e inpinte firstly. The isophote flow is efine s the ege informtion in the imge with the iretion perpeniulr to the whole ounry rossing through the missing pixel. Here we re motivte to exploit priority onstrint to reover given orrupte lok, where two ftors re onsiere: 1) the volume size of isophote flowing towrs the lok; 2) the ville neighor informtion roun the lok. In orer to lulte the isophote of lost lok in imge, we estlish set W p ompose of ville neighor pixels, whose istne to the nerest ounry of the lok is one pixel wie, s shown in Fig. 5. Then the isophote strength of the MB n e ompute s elow: I s ¼ mxðege strengthði; jþþ; ði; jþ 2 4 p ð12þ Where ege strengthði; jþis lulte y Soel opertor (13) long the iretion perpeniulr to the lok s ounry nerest to the pixel t (i,j), s illustrte in Fig sole x A; sole y A ð13þ The vilility of neighor informtion (enote s CR x ) roun the lost lok oul e onfirme y the pixel sttus. Figure 14 omprison etween BI, BNM n the propose metho for Len in 10% rnom error sitution, () the error imge () the BI s result () the

11 J Sign Proess Syst (2010) 60: Figure 15 omprison etween BI, BNM n the propose metho for Len in 20% rnom error sitution, () the error imge () the BI s result () the Hene, we estimte the onfiene i; ð jþ of these informtion pixel y pixel. The umultion of the onfiene is use to set the priority vlue PR x of eh neighor: 8 < i; ð jþ ¼ : 0; ði; jþ is lost 1; ði; jþ is goo 1=T ; ði; jþ is onele CR x ¼ X ði;jþr x ði; jþ PR x ¼ I s CR x ð14þ ð15þ ð16þ The lok with the highest priority vlue is selete to onel urrent missing lok. It shoul e notie tht the priority vlues of the remining missing loks shoul e upte fter finishing oneling the selete one. 3 Experimentl Results Stte-of-the-rt sptil error onelment methos [2, 6, 9 12, 14, 15, 18] re provie for omprison purpose, mong whih two methos re esigne speilly for the onseutive lok loss sitution n hieve etter results. Themethoproposein[6] is performe in DCT omin. The methos isusse in [14] n[18] respetively use NUBRS n POCS tehnique. The pprohes in [9 11] fous on improving interpoltion methos. Exept the experimentl results re offere se on our implementtion sttion, ll the results re ite from the originl ppers. We hoose severl stnr imges, inluing Len, Pepper, n Zel with the size of 512x512 n the foremn vieo sequene with the size of 352x288. In our experiments, lok size is fixe t 16x16, the serh rnge W is 48x32, n the neighor region size equls to 1x16 for ll the test imges. The threshol vlue in similrity ftor (T s ) is set to 20 y mny experiments, n the justing prmeter T σ equl to I s of Eq. (12) to mke it ptive with imge. As for the prmeter of sttus ftor (T ), we try ifferent vlues for severl test imges in onseutive error ptterns (25% lok-loss rtio) to eie its proper vlue. Tle 1 shows optiml prmeter is little flutunt with ifferent imges, ut ifferenes re negligile. Thus, T tkes fixe vlue 2. Firstly two kins of ifferent lok-loss situtions re investigte. One kin of imges re pture uner the se of isolte lok losses with the lok-loss rtio of 10%, while the other one is pture uner the se of onseutive lok losses with the lok-loss rtio of 25%. Tle 2 shows the omprison results in the se of isolte lok losses, while Tle 3 shows the results of onseutive lok losses. Moreover, the visul

12 302 J Sign Proess Syst (2010) 60: qulity omprisons etween BI, BNM n the propose metho re illustrte from Figs. 6, 7, 8, 9, 10, 11, 12 n 13. In terms of PSNR, our onelment result is higher or omprle with stte-of-the-rt methos ([9, 10]) for Len n foremn in the isolte lok loss se. As for Pepper n Zel imge, we notie these two imges hve ovious illumintion vrition whih mke the similrity ftor n the justing prmeter (ompute y Soel opertor) impreise, thus result in egrtion of reovery qulity. However, the sujetive pereption of our metho presente in Fig. 7() n Fig. 8() prove to e stisftory. In the onseutive error sitution, our metho outperforms others in most test imges exept Zel, in whih Ghrvi s metho[11] is 0.35 higher thn us. This exeption n e overlooke in ontext of error onelment. As for visul qulity omprison, the propose metho n reover the ege informtion well n protet the none-ege re well from the isturne of wrong eges. In prtie, errors often hppen to one imge in rnom wy. To simulte suh ses, we further set three ifferent rnom ptterns inste of the regulr ptterns with the lokloss rtio of 5%, 10% n 20% respetively. Tle 4 shows the PSNR omprison results for Len n orresponing sujetive improvements n e notie in Figs. 14 n 15, espeilly in the re of omplex texture strutures like eyes. 4 Conlusions We hve propose n ptive pixel interpoltion tehnique for sptil error onelment in the lok se oing system. For missing pixel in orrupte lok, we otin set of preition vlues erive from four neighorhoos of the lok n then the missing pixel n e reovere through ptive interpoltion, lying ifferent importne on these preition vlues. More importntly, it enles the reovery of the onseutive loks loss, whih is the most often t loss pttern in prtie. Aknowlegements This work ws supporte in prt y Ntionl Nturl Siene Fountion of Chin ( , , ), n Reserh Fun for the Dotorl Progrm of Higher Eution of Chin ( ). Referenes 1. Wng, Y., & Zhu, Q. (1998). Error ontrol n onelment for vieo ommunition: review. Pro IEEE, 86(5), oi: / Aign, S., & Fzel, K. (1995). Temporl n sptil error onelment tehniques for hierrhil mpeg-2 vieo oe. In Pro. IEEE int. onf. ommunition, ICC, June 3, Kwok, W., & Sun, H. (1993). Multi-iretionl interpoltion for sptil error onelment. IEEE Trnstions on Consumer Eletronis, 39(3), oi: / Slm, P., Shroff, N. B., Coyle, E. J., & Delp, E. J. (1995). Error onelment tehniques for enoe vieo strems. In Pro. Int. Conf. Imge Proessing, Ot. 1, Suh, J. W., & Ho, Y. S. (1997). Error onelment se on iretionl interpoltion. IEEE Trnstions on Consumer Eletronis, 43(3), oi: / Wng, Y., & Zhu, Q. (1991). Signl loss reovery in DCT-se imge n vieo oes, In Pro. SPIE Conf. Visul Communition n Imge Proessing, Nov 1605, Prk, J. W., Kim, J. W., & Lee, S. U. (1997). DCT oeffiients reovery-se error onelment tehnique n its pplition to the MPEG-2 it strem error. IEEE Trnstions on Ciruits n Systems for Vieo Tehnology, 7(10), oi: / Criminisi, A., Perez, P., & Toym, K. (2004). Region filling n ojet removl y exemplr-se imge inpinting. IEEE Trnstions on Imge Proessing, 13(9), oi: / TIP Go,Y.,Wng,J.,Liu,Y.Q.,Yng,X.K.,&Wng,J.(2007).Sptil error onelment tehnique using verge points, In Pro. IEEE int. onf. Aoustis, Speeh n Signl Proessing, ICASSP, April. 1, Sirikm, A., & Kumwilikk, W. (2007). New sptil error onelment using ynmi texture estimtion n geometri interpoltion, In Pro. IEEE int. onf. Multimei n Expo, ICME, July. (pp ). 11. Ghrvi, H., & Go, S. (2008). Sptil interpoltion lgorithm for error onelment, In Pro. IEEE int. onf. Aoustis, Speeh n Signl Proessing, ICASSP, Mrh April Wng, Z., Yu, Y., & Zhng, D. (1998). Best neighorhoo mthing: An informtion loss restortion tehnique for lokse imge oing systems. IEEE Trnstions on Imge Proessing, 7(6), oi: / Li, X., & Orhr, M. (2002). Novel sequentil error-onelment tehniques using orienttion ptive interpoltion. IEEE Trnstions on Ciruits n Systems for Vieo Tehnology, 12(10), oi: /tcsvt Prk, J. W., & Lee, S. U. (1999). Reovery of orrupte imge t se on the NURBS interpoltion. IEEE Trnstions on Ciruits n Systems for Vieo Tehnology, 9(10), oi: / Hsi, S. C. (2004). An ege-oriente sptil interpoltion for onseutive lok error onelment. IEEE Signl Proessing Letters, 11(6), oi: /lsp Zhng, R. F., Zhou, Y. H., & Hung, X. D. (2004). Contentptive sptil error onelment for vieo ommunition. IEEE Trnstions on Consumer Eletronis, 50(1), oi: /tce Agrfiotis, D., Bull, D., & Cngrjh, C. N. (2006). Enhne error onelment with moe seletion. IEEE Trnstions on Ciruits n Systems for Vieo Tehnology, 16(8), oi: /tcsvt Sun, H., & Kwok, W. (1995). Conelment of mge lok trnsform oe imges using projetion onto onvex set. IEEE Trnstions on Imge Proess., 4(4), oi: / Kumwilisk, W., & Hrtung, F. (2004). An intrfrme error onelment: nonliner pttern lignment n iretionl interpoltion, In Pro. IEEE int. onf. Imge Proessing, ICIP, Ot.2,

13 J Sign Proess Syst (2010) 60: Li Song reeive the B.S. n M.S. egrees in eletroni engineering from Nnjin University of siene n tehnology in 1997 n 2000, n the PhD egree from Shnghi Jio tong University, Shnghi, P.R. Chin, in He is urrently leturer in the Institute of Imge Communition n Informtion Proessing, Deprtment of Eletroni Engineer, Shnghi Jiotong University, Shnghi, Chin. He hs pulishe over 30 reserh ppers n file 15 ptents. His reserh interests re in the res of signl proessing, imge n vieo oing, omputer vision, n mhine lerning. Xin M reeive the B.S. egrees in eletroni engineering from Shnghi Jiotong University in His reserh interests inlue imge ommunition n informtion proessing.

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Using Red-Eye to improve face detection in low quality video images

Using Red-Eye to improve face detection in low quality video images Using Re-Eye to improve fe etetion in low qulity vieo imges Rihr Youmrn Shool of Informtion Tehnology University of Ottw, Cn youmrn@site.uottw. Any Aler Shool of Informtion Tehnology University of Ottw,

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing

More information

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services Slle Sptio-temporl Continuous uery Proessing for Lotion-wre Servies iopeng iong Mohme F. Mokel Wli G. Aref Susnne E. Hmrush Sunil Prhkr Deprtment of Computer Sienes, Purue University, West Lfyette, IN

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

Compression of Concentric Mosaic Scenery with Alignment and 3D Wavelet Transform Lin Luo a, Yunnan Wu a, Jin Li b, Ya-Qin Zhang b,

Compression of Concentric Mosaic Scenery with Alignment and 3D Wavelet Transform Lin Luo a, Yunnan Wu a, Jin Li b, Ya-Qin Zhang b, Compression of Conentri Mosi Senery with Alignment n 3D Wvelet Trnsform Lin Luo, Yunnn Wu, Jin Li, Y-Qin Zhng, University of Siene & Tehnology of Chin Hefei, Anhui Provine, 230026, P.R.Chin Mirosoft Reserh

More information

Prefetching in an Intelligent Memory Architecture Using a Helper Thread

Prefetching in an Intelligent Memory Architecture Using a Helper Thread Prefething in n Intelligent Memory Arhiteture Using Helper Thre Yn Solihin, Jejin Lee, n Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University solihin,torrells @s.uiu.eu jlee@se.msu.eu

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in

More information

A new way to evaluate steel sheet surfaces

A new way to evaluate steel sheet surfaces A new wy to evlute steel sheet surfes L. Blunt X. ing W. Zeng T. Asim Centre for Preision Tehnologies (CPT) University of Huersfiel Queensgte Huersfiel UK HD1 3DH Tel.: + 44-1484-473634 E-mil: x.ing@hu..uk

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

WORKSHOP 8B TENSION COUPON

WORKSHOP 8B TENSION COUPON WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the

More information

Comparison-based Choices

Comparison-based Choices Comprison-se Choies John Ugner Mngement Siene & Engineering Stnfor University Joint work with: Jon Kleinerg (Cornell) Senhil Mullinthn (Hrvr) EC 17 Boston June 28, 2017 Preiting isrete hoies Clssi prolem:

More information

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

WORKSHOP 8A TENSION COUPON

WORKSHOP 8A TENSION COUPON WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion

More information

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents Hsh-bse Subgrph Query Proessing Metho for Grph-struture XML Douments Hongzhi Wng Hrbin Institute of Teh. wngzh@hit.eu.n Jinzhong Li Hrbin Institute of Teh. lijzh@hit.eu.n Jizhou Luo Hrbin Institute of

More information

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems Amerin Journl of Intelligent Systems. 0; (): -5 DOI: 0. 593/j.jis.000.0 Cellulr-se Popultion to Enhne Geneti Algorithm for Assignment Prolems Hossein Rjlipour Cheshmehgz *, Hiollh Hron, Mohmm Rez Myoi

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chpter 14 Grph Contrtion n Connetivity So fr we hve mostly overe tehniques for solving problems on grphs tht were evelope in the ontext of sequentil lgorithms. Some of them re esy to prllelize while others

More information

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:

More information

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1 Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

More information

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of

More information

Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs

Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 http://jwn.eursipjournls.om/ontent///4 RESEARCH Open Aess Performne hrteriztion of CSMA/CA pte multi-user MIMO wre MAC in WLANs Anup Thp,

More information

1 Which of the following keyword can not be appeared inside the class? a)virtual b)static c)template d)friend c

1 Which of the following keyword can not be appeared inside the class? a)virtual b)static c)template d)friend c 1 Whih of the following keywor n not e ppere insie the lss? )virtul )stti )templte )frien 2 Wht is templte? )Templte is formul for reting generi lss )Templte is use to mnipulte lss )Templte is use for

More information

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures An Effiient Algorithm for the Physil Mpping of Clustere Tsk Grphs onto Multiproessor Arhitetures Netrios Koziris Pnyiotis Tsnks Mihel Romesis George Ppkonstntinou Ntionl Tehnil University of Athens Dept.

More information

INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES

INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES In: Bretr F, Pierrot-Deseilligny M, Vosselmn G (Es) Lser snning 2009, IAPRS, Vol. XXXVIII, Prt 3/W8 Pris, Frne, Septemer 1-2, 2009 INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES B. Jutzi Institute

More information

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE 24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled C2 Right Angled Trigonometry Ojetive: To know nd e le to use trigonometri rtios in rightngled tringles opposite C Definition Trigonometry ws developed s method of mesuring ngles without ngulr units suh

More information

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

Using a User-Level Memory Thread for Correlation Prefetching

Using a User-Level Memory Thread for Correlation Prefetching Using User-Level Memory Thre for Correltion Prefething Yn Solihin Jejin Lee Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University http://iom.s.uiu.eu http://www.se.msu.eu/ jlee Astrt

More information

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

Generating Editors for Direct Manipulation of Diagrams

Generating Editors for Direct Manipulation of Diagrams Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e

More information

Profile Based Sub-Image Search in Image Databases

Profile Based Sub-Image Search in Image Databases Profile Bsed Su-Imge Serh in Imge Dtses Vishwkrm Singh 1, Amuj K. Singh 2 Deprtment of Computer Siene, University of Cliforni, Snt Brr, USA 1 vsingh@s.us.edu, 2 muj@s.us.edu Astrt Su-imge serh with high

More information

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding Triple/Qudruple Ptterning Lyout Deomposition vi Novel Liner Progrmming nd Itertive Rounding Yio Lin, Xioqing Xu, Bei Yu, Ross Bldik nd Dvid Z. Pn ECE Dept., University of Texs t Austin, Austin, TX USA

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

Structure in solution spaces: Three lessons from Jean-Claude

Structure in solution spaces: Three lessons from Jean-Claude Struture in solution spes: Three lessons from Jen-Clue Dvi Eppstein Computer Siene Deprtment, Univ. of Cliforni, Irvine Conferene on Meningfulness n Lerning Spes: A Triute to the Work of Jen-Clue Flmgne

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2)

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2) Seurity Issues in the Optimize Link Stte Routing Protool version 2 (OLSRv2) Thoms Heie Clusen, Ulrih Hererg To ite this version: Thoms Heie Clusen, Ulrih Hererg. Seurity Issues in the Optimize Link Stte

More information

[SYLWAN., 158(6)]. ISI

[SYLWAN., 158(6)]. ISI The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI

More information

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms Using SIMD Registers n Instrutions to Enle Instrution-Level Prllelism in Sorting Algorithms Timothy Furtk furtk@s.ulert. José Nelson Amrl mrl@s.ulert. Roert Niewiomski niewio@s.ulert. Deprtment of Computing

More information

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors Evluting Regulr Expression Mthing Engines on Network n Generl Purpose Proessors Mihel Behi Wshington University Computer Siene n Engineering St. Louis, MO 63130-4899 mehi@se.wustl.eu Chrlie Wisemn Wshington

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,

More information

INTEGRATED WORKFLOW ART DIRECTOR

INTEGRATED WORKFLOW ART DIRECTOR ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

Approximate Joins for Data Centric XML

Approximate Joins for Data Centric XML Approximte Joins for Dt Centri XML Nikolus Augsten 1, Mihel Böhlen 1, Curtis Dyreson, Johnn Gmper 1 1 Fulty of Computer Siene, Free University of Bozen-Bolzno Dominiknerpltz 3, Bozen, Itly {ugsten,oehlen,gmper}@inf.uniz.it

More information

Proceedings 23rd Annual Conference IEEE/EMBS Oct.25-28, 2001, Istanbul, TURKEY

Proceedings 23rd Annual Conference IEEE/EMBS Oct.25-28, 2001, Istanbul, TURKEY Alignment of Serilly Aquire Slies using Glol Proeeings 23r Annul Conferene IEEE/EMBS Ot.25-28, 2001, Istnul, TURKEY Energy Funtion Stelios KRINIDIS, Christophoros NIKOU, Ionnis PITAS Deprtment of Informtis,

More information

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow Shifting n Comption for the High-Level Synthesis of Designs with Complex Control low Sumit Gupt Nikil Dutt Rjesh Gupt Alexnru Niolu Center for Emee Computer Systems Shool of Informtion n Computer Siene

More information

Kinetic Collision Detection: Algorithms and Experiments

Kinetic Collision Detection: Algorithms and Experiments Kineti Collision Detetion: Algorithms n Experiments Leonis J. Guis Feng Xie Li Zhng Computer Siene Deprtment, Stnfor University Astrt Effiient ollision etetion is importnt in mny rooti tsks, from high-level

More information

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its

More information

Calculus Differentiation

Calculus Differentiation //007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte

More information

Computational geometry

Computational geometry Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

Multi-dimensional Selectivity Estimation Using Compressed Histogram Information*

Multi-dimensional Selectivity Estimation Using Compressed Histogram Information* Multi-dimensionl Seletivity Estimtion Using Compressed Histogrm Informtion* Ju-Hong Lee Deo-Hwn Kim Chin-Wn Chung À Deprtment of Informtion nd Communition Engineering À Deprtment of Computer Siene Kore

More information

Deflation DFA: Remembering History is Adequate

Deflation DFA: Remembering History is Adequate This full text pper ws peer reviewe t the iretion of IEEE Communitions Soiety subjet mtter experts for publition in the IEEE ICC 21 proeeings Defltion DFA: Remembering History is Aequte Yi Tng 1, Tinfn

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

More information

Rolling Back Remote Provisioning Changes. Dell Command Integration for System Center

Rolling Back Remote Provisioning Changes. Dell Command Integration for System Center Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION

More information