Reducing Frame Rate for Object Tracking

Size: px
Start display at page:

Download "Reducing Frame Rate for Object Tracking"

Transcription

1 Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg Abstract. Object trackng s commonly used n vdeo survellance, but typcally vdeo wth full frame rate s sent. We prevously have shown that full frame rate s not needed, but t s unclear what the approprate frame rate to send or whether we can further reduce the frame rate. Ths paper answers these questons for two commonly used object trackng algorthms (frame-dfferencng-based blob trackng and CAMSHIFT trackng). The paper provdes () an analytcal framework to determne the crtcal frame rate to send a vdeo for these algorthms wthout them losng the tracked object, gven addtonal knowledge about the object and key desgn elements of the algorthms, and () answers the questons of how we can modfy the object trackng to further reduce the crtcal frame rate. Our results show that we can reduce the 3 fps rate by up to 7 tmes for blob trackng n the scenaro of a sngle car movng across the camera vew, and by up to 13 tmes for CAMSHIFT trackng n the scenaro of a face movng n dfferent drectons. 1 Introducton Object trackng s a common operaton n vdeo survellance systems. However, gven an object trackng algorthm, t s unclear what frame rate s necessary to send. Typcally, vdeo s sent at the rate of full vdeo camera capacty, whch may not be the best opton f network bandwdth s lmted. Prevously, we have shown n [1] that frame rate can be sgnfcantly reduced wthout object trackng losng the object. We found that the crtcal frame rate for a gven algorthm depends on the speed of tracked object. The smple way to determne the crtcal frame rate s to run algorthm on a partcular vdeo sequence, droppng frames and notcng whch rate causes the algorthm to lose the object. Such approach however s not practcal, because objects n real survellance vdeos move wth dfferent speeds, and the crtcal frame rate therefore should depend on ths parameter. We suggest fndng crtcal frame rate usng analyss based on the algorthm s key desgn elements (specfc object detecton and trackng mechansm) and measured speed and sze of the tracked object. In ths paper, we focus on two trackng algorthms, blob trackng algorthm that reles on frame dfferencng and foreground object detecton by L et al. [2] as well as Kalman flter for trackng; and CAMSHIFT algorthm [3], n whch objects are represented as color hstograms, and trackng s performed usng mean

2 j Fg. 1. Droppng out of + j frames. s the drop gap. shft algorthm. We present an analytcal framework formalzng the dependency between vdeo frame rate and algorthms accuracy. We estmate crtcal frame rate usng analyss wth assumpton of known speed and sze of the tracked object. Guded by the estmaton, we slghtly modfy these trackng algorthms makng them adaptve and more tolerant to the vdeos wth even lower frame rate. In Secton 2, we present analyss of the crtcal frame rate for object trackng. In Secton 3, we demonstrate how the dependency between frame rate and accuracy can be estmated specfcally for the blob trackng. We also specfy the crtcal frame rate for ths algorthm. In Secton 4, we present smlar analyss for CAMSHIFT trackng. In Secton, we show how, usng our estmatons and measurement of speed and sze of the tracked object, we can modfy these trackng algorthms adaptng them to the reduced frame rate. Secton 6 ends the paper wth concluson and future works. 2 General Analyss We degrade temporal vdeo qualty by applyng the droppng pattern drop frames out of +j frames, where s drop gap,andj s the number of consecutve remanng frames (see Fgure 1). Note that the same frame rate can correspond to two dfferent droppng patterns, for nstance, droppng 2 out of 3 frames results n the same frame rate as droppng 4 out of 6 frames. The reason for choosng such droppng pattern s because we found that drop gap s more mportant factor for the performance of the trackng than smply a frame rate. Therefore, nstead of crtcal frame rate, we focus on fndng crtcal drop gap, whch would determne the correspondng frame rate. Frst, we present an estmaton of the crtcal drop gap for an object trackng algorthm wthout takng nto account the specfc method of detecton and trackng. For smplcty, consder a vdeo contanng a sngle movng object, whch can be accurately tracked by the algorthm. We can notce that droppng frames affects the speed of object. Snce vdeo s a sequence of dscrete frames, the speed of object can be understood as a dstance between the centers of object postons n two consecutve frames, whch we call nter-frame speed denoted as Δd. Wthout loss of generalty, we can say that for every object trackng algorthm there exsts a Δ d such that, f object moves for a larger dstance than Δ d, the algorthm loses t.

3 Δx orgnal vdeo drop gap = 1 Fg. 2. The schema of the dfference between object foreground detecton for orgnal vdeo and for vdeo wth dropped frames. Let Δd be the maxmal nter-frame speed of the object n the orgnal vdeo, when no frame droppng s appled yet. If we drop frames wth drop gap =1, the new maxmum nter-frame speed can be approxmated as Δd 1 = 2Δd. Then, for general frame droppng pattern, Δd =( +1)Δd. Assume we know the orgnal speed of the object and the algorthm s threshold Δ d. Then, we can compute the maxmum number of consecutve frames that can be dropped,.e., crtcal drop gap ĩ, as ĩ = Δ d Δd 1. (1) 3 Blob Trackng Algorthm For blob trackng algorthm, due to frame dfferencng detecton, the value ĩ depends on the sze and the speed of tracked object. If too many consecutve frames are dropped, the object n the current frame appear so far away from ts locaton n the prevous frame that the frame dfferencng operaton results n detectng two separate blobs (see Fgure 3(b)). Such trackng falure occurs when the dstance between blob detected n the prevous frame and blob n the current frame s larger than the sze of the object tself. Therefore, ths dstance s the threshold dstance Δ d. To determne ts value, we need to estmate the coordnates of the blob center n the current frame, whch depend on ts locaton and sze n the prevous frame. In ths analyss, we assume a sngle object monotonously movng n one drecton. Although ths assumpton consders only a smplfed scenaro, many practcal survellance vdeos nclude objects movng n a sngle drecton towards or away from the camera vew. Also, such movements of the object n camera s vew as rotatng or only changng n sze (when object goes away/towards camera vew but does not move sdeways) do not have a sgnfcant effect on frame dfferencng object detecton. We also assume, wthout loss of generalty, that the object moves from left to rght wth ts sze ncreasng lnearly. The assumpton allows us to consder only changes n coordnate x, and wdth w.

4 (a) Detected foreground object wth drop gap 14 frames. PETS21 vdeo. (b) Bnary mask of the frame n 3(a). Effect of drop gap on frame dfferencng. Fg. 3. The foreground object detecton based on frame dfferencng. Increase/decrease n sze s mportant because when tracked objects approach or move away from the camera, ther sze changes. In practce, when object moves n both x and y coordnates, the overall crtcal drop gap would be the mnmum of the two values estmated for correspondng coordnates. Consder the orgnal vdeo when no frames are dropped. We assume the average dstance between fronts of the blob when t shfts from the prevous frame to the current frame s Δx. We consder the front of the object because t s more accurately detected by frame dfferencng. When frame dfferencng s used, the resulted detected blob s the unon of the object presented n the prevous and current frames (see Fgure 3(b)). Therefore, when we drop frames, the wdth of the blob n the frame followng after the drop gap wll be larger than that n the orgnal vdeo sequence (see Fgure 2 for llustraton). However, the front of the blob would be detected n the same way as n the orgnal vdeo. Snce frame droppng affects sze of the detected object, we consder average change n sze as Δw. The superscrpt ndcates the sze of the drop gap, whch s when frames are not dropped. Assume that x k s x-coordnate of blob s center n k-th frame, then, we can estmate ts coordnate n the frame k + +1 as followng, x k++1 = x k +( +1)Δx ( +1) Δw 2. (2) If frames are dropped after frame k, the detected blob n the k ++1 frame s the unon of actual object appearng n frames k and k (as Fgure 2 llustrates). Then, the wdth dfference (wk++1 /2 w k /2) can be approxmated as ( +1)Δx /2. Therefore, the blob s center n the k frame can be estmated as, x k++1 = x k +( +1)Δx ( +1) Δx 2 = x k +( +1) Δx 2, (3) snce x k = x k.

5 As was mentoned, Δ d = xĩ xĩk, where ĩ ndcates the crtcal drop k+ĩ+1 gap. The falure of the blob trackng mples that Δ d = wk, where value w k s the wdth of the blob detected n frame k. Therefore, from equaton (3), we obtan wk = Δ d =(ĩ +1) Δx 2, from whch we can fnd the crtcal drop gap to be ĩ = 2w k 1. (4) Δx In practce, values wk and Δx can be determned by ether keepng the hstory of speed and sze of tracked object or by estmatng ther average values for a partcular survellance ste. In addton to the estmaton of the crtcal drop gap for blob trackng, we can estmate the dependency functon between accuracy of the algorthm and vdeo frame rate. Such estmaton s possble because of the way drop gap affects the accuracy of the frame dfferencng object detecton algorthm used n blob trackng. We can defne blob detecton error for a partcular frame as the dstance between blob centers detected n ths frame for the degraded vdeo (wth dropped frames) and the orgnal vdeo. Then, the average error, denoted as ɛ j,sthe average blob trackng error for all frames n the vdeo. Ths ɛ j functon can be used as accuracy metrc for the blob trackng depctng the tradeoff between trackng accuracy and vdeo frame rate. Usng equatons (2) and (3) we can estmate the blob trackng error for k++1 frame as followng, ( x k++1 x Δx Δw ) k++1 =( +1) =( +1)C, () 2 where constant C depends on the sze and the speed of object n the orgnal vdeo. Snce we apply the droppng pattern drop frames out of + j frames, we need to estmate the blob trackng error for each of the remanng j frames n the vdeo. There s no error n detectng blob for j 1 frames that do not have drop gap n front of them,.e., for these frames, the result of the frame dfferencng would be the same as n orgnal vdeo wth no droppng. Therefore, the average error for all j frames s the error estmated for the frame, whch follows the drop gap (equaton ()) dvded by j: ɛ j = +1 j ( Δx Δw ) 2 = +1 C. (6) j Note the mportant property of ths functon that the average error s proportonal to and nversely proportonal to j. We performed experments to valdate the estmaton of the average blob trackng error ɛ j. We use several vdeos from VSOR vdeo database, PETS21 datasets, as well as vdeos we shot on campus wth a hand-held camera (example screenshots n Fgure 3(a), Fgure 4(c), and Fgure 4(d)). Vdeos nclude movng

6 (a) Fast movng face shot wth a webcam (CAMSHIFT face trackng). tory (CAMSHIFT face (b) From database by SEQAM labora- trackng). (c) Shot on campus wth hand-held camera (blob trackng). (d) From VISOR vdeo database (blob trackng). Fg. 4. Snapshot examples of vdeos used n our experments. cars, person on a bcycle and people walkng n a dstance. We ran blob trackng algorthm on these vdeos and appled dfferent droppng patterns. We plot the resulted average error aganst drop gap when value j s 1, 3, 6, and 12. The results are shown n Fgure (a) (orgnal vdeo s 18 frames of , 3 fps) and Fgure 6(a) (orgnal vdeo s 148 frames of 32 26, 3 fps). Fgure (a) shows the resulted average trackng error plotted aganst the drop gap when value j s 1, 3, 6, and 12. It can be noted from the Fgure (a) that for each fxed value j the average error s proportonal to. Also, average error s nversely proportonal to j, as ndcated by the angles of each lne n the graph (for nstance, angle of the lne marked as s three tmes larger than the angle of the lne ). Fgure 6(a) demonstrates smlar results. These expermental results strongly support our analytcal estmaton of the average error gven n the equaton (6). The fgures do not reflect the crtcal drop gap value because even for large drop gaps the blob trackng dd not lose the track of the car n ths test vdeo sequence.

7 Average Error Blob Trackng (a) Average Error Adaptve Blob Trackng (b) Fg.. Accuracy of orgnal and adaptve blob trackng algorthm for PETS21 vdeo (snapshot n Fgure 3(a)). 4 CAMSHIFT Algorthm CAMSHIFT object trackng [4] reles on color hstogram detecton and mean shft algorthm for trackng. The algorthm searches for a gven object s hstogram nsde a subwndow of the current frame of the vdeo, whch s computed as 1% of the object sze detected n the prevous frame. Therefore, f the object, moves between two frames from ts orgnal locaton for a dstance larger than half of ts sze, the algorthm wll lose the track of the object. Hence, assumng we drop frames before frame k + + 1, the threshold dstance Δ d = w k 2, where wk s the wdth of the blob detected n frame k. Snce CAMSHIFT does not use frame dfferencng, drop gap does not have an addtonal effect on object s sze. Therefore, we can estmate the center of the blob after drop gap usng the equaton (2) nstead of equaton (3). Hence, the crtcal drop gap can be derrved as wk ĩ = 2Δx 1. (7) Δw Estmatng the average trackng error loses ts meanng for CAMSHIFT trackng because t uses a smple threshold for detecton of the object n the current frame. If the drop gap of the gven frame droppng pattern s less than crtcal drop gap n equaton (7), the algorthm contnue trackng the object, otherwse t loses t. And the crtcal drop gap depends on the changes n speed and sze of the object.

8 Average Error Blob Trackng (a) Average Error Adaptve Blob Trackng (b) Fg. 6. Accuracy of orgnal and adaptve blob trackng algorthm for VISOR vdeo (snapshot n Fgure 4(d)). We performed experments wth CAMSHIFT trackng algorthm to verfy our analytcal estmaton of the crtcal drop gap (equaton (7)). We used several vdeos of a movng face shot wth a smple web-cam, vdeos of talkng heads by SEQAM laboratory and some move clps (example screenshots n Fgure 4(a) and Fgure 4(b)). Fgure 8(a) (orgnal vdeo s 6 frames of , 3 fps) and Fgure 7 (orgnal vdeo s 33 frames of 32 23, 3 fps) show average trackng error vs. drop gap for CAMSHIFT trackng and varous frame droppng patterns. Fgure 7, correspondng to the vdeo of a talkng head (see snapshot n Fgure 4(b)), demonstrates that trackng algorthm does not lose the face even when drop gap s 14 frames. The reason s because the face n the vdeo does not move around and s always present n the search subwndow of CAMSHIFT tracker. However, for the experments shown n Fgure 8(a), the vdeo wth fast movng head was used (see snapshot n Fgure 4(a)). It can be noted that the algorthm does not lose the face untl value of drop gap s 8, because for the smaller drop gaps, the face s stll wthn a search subwndow and can be detected by the hstogram matchng. The fluctuatons n the average error for the larger drop gaps appear because the face s ether lost by the tracker or, for some large enough gaps, t would move out of the subwndow and move back n, hence the tracker does not lose t. We conducted experments wth more vdeos and observed that the crtcal drop gap value s smaller for vdeos wth faster movng faces and larger for vdeos wth slower movng faces. These observatons agree wth equaton (7).

9 Average Error CAMSHIFT Face Trackng Fg. 7. Accuracy of orgnal and adaptve CAMSHIFT trackng algorthm for vdeo wth slow movng face (snapshot n Fgure 4(a)). Adaptve Trackng We propose to modfy blob trackng and CAMSHIFT algorthms and make them more tolerant to vdeo wth low frame rate. We have shown that average error and the crtcal frame rate of trackng algorthms depend on speed and sze of the object n the orgnal vdeo. Therefore, f we record these characterstcs for prevous frames, the locaton and the sze of object n the frame that follows a drop gap can be approxmated. Adjustng to frame droppng n such way allows us to reduce the average error for blob trackng algorthm and ncrease the crtcal drop gap for the CAMSHIFT algorthm. Blob trackng algorthm tracks the detected foreground object usng the smplfed verson of Kalman flter: x k =(1 α)x k 1 + αz k, where x k and x k 1 represent estmated coordnates of the object n the current and prevous frames, z k s the output of the object detector, and α 1 s some constant. When α =1, then the tracker trusts the measurement z k fully and ts average error can be estmated by equaton (6). In cases when α<1, the accuracy of the trackng aganst the frame droppng worsens, due to the larger shfts n blobs centers for vdeos wth hgh drop gap. We propose usng adaptve Kalman flter [] to make blob trackng more tolerant to the frame droppng. We apply the flter only to the wdth of the object, because the front s detected correctly by frame dfferencng (see Fgure 2). The flter can be defned as followng, w k = w k 1 + K k (w k 1 + u k ) Pk = P k + Q k P k =(1 K k ) P k K k = P k ( P k + R k ), where Q k and R k are the process and measurement nose covarances; w k s the new estmate of the blob s wdth n the current frame; w k 1 s blob s wdth n the last not dropped frame; u k s the wdth measurement provded by the frame-dfferencng based detector. Kalman flter depends on correct estmaton of the error parameters, Q k and R k. By lookng at Fgure 2, we can set Q k =(Δw ) 2, whch estmates how bg the tracked object should be at frame k compare to ts wdth before the

10 Average Error CAMSHIFT Face Trackng (a) Average Error Adaptve CAMSHIFT Face Trackng (b) Fg. 8. Accuracy of orgnal and adaptve CAMSHIFT trackng algorthm for vdeo wth fast movng face (snapshot n Fgure 4(a)). drop gap at frame k. R k s essentally the error of the measurement,.e., the output of the foreground object detector, therefore, R k =(w k++1 w k++1 )2. Snce w k++1 can be estmated as w k +( +1)Δx and w k++1 as w k +( + 1)Δw, we can approxmate R k =( +1) 2 (Δx Δw ) 2. We obtan the values of Δw and Δx by recordng the speed of the object and how fast t grows n sze usng last two avalable frames. To compare how adaptve Kalman flter mproves the accuracy of blob trackng, we performed the same experments varyng frame droppng pattern. The average error for blob trackng wth adaptve Kalman flter s plotted n Fgure (b) and Fgure 6(b), whch can be compared to results wth orgnal algorthm n Fgure (a) and Fgure 6(a) respectvely. We can note that the accuracy of the adaptve blob trackng algorthm s mproved for larger drop gaps (larger frame rate reducton). In both fgures, Fgure (b) and Fgure 6(b), the angles of the lnes n the graph are not nversely proportonal to j anymore, gvng fundamentally dfferent bound on the average error. All lnes wth j>1 are almost parallel to x-axs. It means that Kalman flter adapts very well to the drastc changes n speed and sze of the object that occur due to the frame droppng. The constant ncrease n the average error for j = 1, s because, for such droppng pattern, all remanng frames are separated by drop gaps. In ths scenaro, adaptve Kalman flter accumulates the approxmaton error of object s sze and speed. Therefore, the crtcal frame rate can be acheved wth j that s at least equalto2.ifwetake = 12, the orgnal frame rate s reduced by 7 tmes.

11 We also modfed the CAMSHIFT trackng algorthm, adjustng the sze of ts search subwndow to the frame droppng. We smply ncreased the subwndow sze n the current frame by Δx, where s the drop gap. The average error of ths adaptve CAMSHIFT algorthm for the vdeo wth fast movng face s shown n Fgure 8(b). Comparng wth the results of orgnal algorthm n Fgure 8(a), we can notce that the adaptve tracker performs sgnfcantly better for the larger drop gaps. The experments show that we can drop 13 frames out of 14 wth a tradeoff n small average error. It means that CAMSHIFT algorthm, for ths partcular vdeo sequence, can accurately track the face wth frame rate reduced by 13 tmes from the orgnal. For the news vdeos of talkng heads, where face does not move sgnfcantly around, adaptve algorthm performs wth exactly the same accuracy results as the orgnal algorthm. Therefore, Fgure 7 llustrates essentally both versons of the algorthm, orgnal and adaptve. These experments demonstrate that by usng analyss to modfy CAMSHIFT algorthm, we can mprove ts performance on vdeos wth fast movng faces, whle retanng the orgnal accuracy on vdeos wth slow movng faces. 6 Concluson In ths paper, we use analyss to estmate the tradeoff between accuracy of two common trackng algorthms and vdeo frame rate. Such estmaton depends on the speed and sze of the tracked object, and therefore, n practce, such measurements of the object need to be taken (for nstance, runnng average of these values durng the last few frames). We also show that slght modfcatons to exstng algorthms can sgnfcantly mprove ther accuracy for the vdeo wth larger reductons n frame rate. These fndngs motvate us to use reasonng for determnng crtcal frame rate (not just runnng many dfferent experments) for other vdeo analyss algorthms. The fndngs also encourage the development of the new object trackng algorthms robust to hghly degraded vdeo. References 1. Korshunov, P., Oo, W.T.: Crtcal vdeo qualty for dstrbuted automated vdeo survellance. In: Proceedngs of the ACM Internatonal Conference on Multmeda, ACMMM, Sngapore (November 2) L, L., Huang, W., Gu, I.Y., Tan, Q.: Foreground object detecton from vdeos contanng complex background. In: Proceedngs of the ACM Internatonal Conference on Multmeda, ACMMM 3, Berkeley, CA, USA (November 23) Bradsk, G.R.: Computer vson face trackng as a component of a perceptual user nterface. In: Proceedngs of the Forth IEEE Workshop on Applcatons of Computer Vson, WACV 98, Prnceton, NJ (January 1998) Boyle, M.: The effects of capture condtons on the CAMSHIFT face tracker. Techncal Report , Department of Computer Scence, Unversty of Calgary, Alberta, Canada (21). Welsh, G., Bshop, G.: An ntroducton to the kalman flter. In: Proceedngs of SIGGRAPH 21. Volume Course 8., Los Angeles, CA, USA (August 21)

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Multi-view 3D Position Estimation of Sports Players

Multi-view 3D Position Estimation of Sports Players Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search

Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Adaptive Load Shedding for Windowed Stream Joins

Adaptive Load Shedding for Windowed Stream Joins Adaptve Load Sheddng for Wndowed Stream Jons Buğra Gedk, Kun-Lung Wu, Phlp S. Yu, Lng Lu College of Computng, Georga Tech Atlanta GA 333 {bgedk,lnglu}@cc.gatech.edu IBM T. J. Watson Research Center Yorktown

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

ABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN*

ABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN* ARC: An End-to-End Rate Adaptaton Scheme for Multmeda Streamng over Wreless LAN We Wang Soung C Lew Jack Y Lee Department of Informaton Engneerng he Chnese Unversty of Hong Kong Shatn N Hong Kong {wwang2

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School

More information

Face Tracking Using Motion-Guided Dynamic Template Matching

Face Tracking Using Motion-Guided Dynamic Template Matching ACCV2002: The 5th Asan Conference on Computer Vson, 23--25 January 2002, Melbourne, Australa. Face Trackng Usng Moton-Guded Dynamc Template Matchng Lang Wang, Tenu Tan, Wemng Hu atonal Laboratory of Pattern

More information

arxiv: v3 [cs.ds] 7 Feb 2017

arxiv: v3 [cs.ds] 7 Feb 2017 : A Two-stage Sketch for Data Streams Tong Yang 1, Lngtong Lu 2, Ybo Yan 1, Muhammad Shahzad 3, Yulong Shen 2 Xaomng L 1, Bn Cu 1, Gaogang Xe 4 1 Pekng Unversty, Chna. 2 Xdan Unversty, Chna. 3 North Carolna

More information

Fast Feature Value Searching for Face Detection

Fast Feature Value Searching for Face Detection Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com

More information

A Hybrid Scheme for Perceptual Object Window Design with Joint Scene Analysis and Eye-Gaze Tracking for Media Encoding based on Perceptual Attention

A Hybrid Scheme for Perceptual Object Window Design with Joint Scene Analysis and Eye-Gaze Tracking for Media Encoding based on Perceptual Attention A Hybrd Scheme for Perceptual Object Wndow Desgn wth Jont Scene Analyss and Eye-Gaze Trackng for Meda Encodng based on Perceptual Attenton Javed I. Khan and Oleg Komogortsev Meda Communcatons and Networkng

More information

Face Detection with Deep Learning

Face Detection with Deep Learning Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local Quaternary Patterns and Feature Local Quaternary Patterns Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Incremental MQDF Learning for Writer Adaptive Handwriting Recognition 1

Incremental MQDF Learning for Writer Adaptive Handwriting Recognition 1 200 2th Internatonal Conference on Fronters n Handwrtng Recognton Incremental MQDF Learnng for Wrter Adaptve Handwrtng Recognton Ka Dng, Lanwen Jn * School of Electronc and Informaton Engneerng, South

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Key-Selective Patchwork Method for Audio Watermarking

Key-Selective Patchwork Method for Audio Watermarking Internatonal Journal of Dgtal Content Technology and ts Applcatons Volume 4, Number 4, July 2010 Key-Selectve Patchwork Method for Audo Watermarkng 1 Ch-Man Pun, 2 Jng-Jng Jang 1, Frst and Correspondng

More information

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Adaptive Load Shedding for Windowed Stream Joins

Adaptive Load Shedding for Windowed Stream Joins Adaptve Load Sheddng for Wndowed Stream Jons Bu gra Gedk College of Computng, GaTech bgedk@cc.gatech.edu Kun-Lung Wu, Phlp Yu T.J. Watson Research, IBM {klwu,psyu}@us.bm.com Lng Lu College of Computng,

More information

Dynamic Camera Assignment and Handoff

Dynamic Camera Assignment and Handoff 12 Dynamc Camera Assgnment and Handoff Br Bhanu and Ymng L 12.1 Introducton...338 12.2 Techncal Approach...339 12.2.1 Motvaton and Problem Formulaton...339 12.2.2 Game Theoretc Framework...339 12.2.2.1

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE,

More information

Delayed Features Initialization for Inverse Depth Monocular SLAM

Delayed Features Initialization for Inverse Depth Monocular SLAM Delayed Features Intalzaton for Inverse Depth Monocular SLAM Rodrgo Mungua and Anton Grau Department of Automatc Control, Techncal Unversty of Catalona, UPC c/ Pau Gargallo, 5 E-0808 Barcelona, Span, {rodrgo.mungua;anton.grau}@upc.edu

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Adaptive Silhouette Extraction and Human Tracking in Dynamic. Environments 1

Adaptive Silhouette Extraction and Human Tracking in Dynamic. Environments 1 Adaptve Slhouette Extracton and Human Trackng n Dynamc Envronments 1 X Chen, Zhha He, Derek Anderson, James Keller, and Marjore Skubc Department of Electrcal and Computer Engneerng Unversty of Mssour,

More information

2 ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE (a) Ambgutes from person re dentfcaton n solaton (b) Assocatng groups of people may reduce ambgutes n mat

2 ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE (a) Ambgutes from person re dentfcaton n solaton (b) Assocatng groups of people may reduce ambgutes n mat ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE 1 Assocatng Groups of People We-Sh Zheng jason@dcs.qmul.ac.uk Shaogang Gong sgg@dcs.qmul.ac.uk Tao Xang txang@dcs.qmul.ac.uk School of EECS, Queen Mary Unversty

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information