Robust Mean Shift Tracking with Corrected Background-Weighted Histogram
|
|
- Allen Chandler
- 6 years ago
- Views:
Transcription
1 Robust Mean Shft Trackng wth Corrected Background-Weghted Hstogram Jfeng Nng, Le Zhang, Davd Zhang and Chengke Wu Abstract: The background-weghted hstogram (BWH) algorthm proposed n [] attempts to reduce the nterference of background n target localzaton n mean shft trackng. However, n ths paper we prove that the weghts assgned to pxels n the target canddate regon by BWH are proportonal to those wthout background nformaton,.e. BWH does not ntroduce any new nformaton because the mean shft teraton formula s nvarant to the scale transformaton of weghts. We then propose a corrected BWH (CBWH) formula by transformng only the target model but not the target canddate model. The CBWH scheme can effectvely reduce background s nterference n target localzaton. The expermental results show that CBWH can lead to faster convergence and more accurate localzaton than the usual target representaton n mean shft trackng. Even f the target s not well ntalzed, the proposed algorthm can stll robustly track the object, whch s hard to acheve by the conventonal target representaton. Keywords: Object Trackng, Mean Shft, Background nformaton, Target ntalzaton Correspondng author. Le Zhang s wth the Bometrcs Research Center, Dept. of Computng, The Hong Kong Polytechnc Unversty, Kowloon, Hong Kong, Chna. Emal: cslzhang@comp.polyu.edu.hk. Ths work s supported by the Hong Kong Polytechnc Unversty Internal Research Grant (A-SA08) and the Natonal Scence Foundaton Councl of Chna under Grants and Jfeng Nng s wth the Bometrcs Research Center, Dept. of Computng, The Hong Kong Polytechnc Unversty, Kowloon, Hong Kong, Chna, and the State Key Laboratory of Integrated Servce Networks, Xdan Unversty, X an, Chna. Emal: jf_nng@sna.com. Davd Zhang s wth the Bometrcs Research Center, Dept. of Computng, The Hong Kong Polytechnc Unversty, Kowloon, Hong Kong, Chna. Emal: csdzhang@comp.polyu.edu.hk. Chengke Wu s wth the State Key Laboratory of Integrated Servce Networks, Xdan Unversty, X an, Chna. Emal: ckwu@xdan.edu.cn.
2 . Introducton Object trackng s an mportant task n computer vson. Many algorthms [] have been proposed to solve the varous problems arsen from noses, clutters and occlusons n the appearance model of the target to be tracked. Among varous object trackng methods, the mean shft trackng algorthm [,, 4] s a popular one due to ts smplcty and effcency. Mean shft s a nonparametrc densty estmator whch teratvely computes the nearest mode of a sample dstrbuton [5]. After t was ntroduced to the feld of computer vson [6], mean shft has been adopted to solve varous problems, such as mage flterng, segmentaton [3, 3, 5, 8-9] and object trackng [,, 8-0,, 4, 6, 7]. In the mean shft trackng algorthm, the color hstogram s used to represent the target because of ts robustness to scalng, rotaton and partal occluson [,, 7]. However, the mean shft algorthm s prone to local mnma when some of the target features present n the background. Therefore, n [], Comancu et al. further proposed the background-weghted hstogram (BWH) to decrease background nterference n target representaton. The strategy of BWH s to derve a smple representaton of the background features and use t to select the salent components from the target model and target canddate model. More specfcally, BWH attempts to decrease the probablty of promnent background features n the target model and canddate model and thus reduce the background s nterference n target localzaton. Such an dea s reasonable and ntutve, and some works have been proposed to follow ths dea [0-]. In [0], the object s parttoned nto a number of fragments and then the target model of each fragment s enhanced by usng BWH. Dfferent from the orgnal BWH transformaton, the weghts of background features are derved from the dfferences between the fragment and background colors. In [], the target s represented by combnng BWH and adaptve kernel densty estmaton, whch extends the searchng range of the mean shft algorthm. In addton, Allen et al. [] proposed a parallel mplementaton of mean shft
3 algorthm wth adaptve scale and BWH, and demonstrated the effcency of ther technque n a SIMD computer. All the above BWH based methods am to decrease the dstracton of background n target locaton to enhance mean-shft trackng. Unfortunately, all of them do not notce that the BWH transformaton formula proposed n [] s actually ncorrect, whch wll be proved n ths paper. In ths paper we demonstrate that the BWH algorthm wll smultaneously decrease the probablty of promnent background features n the target model and target canddate model. Thus BWH s equvalent to a scale transformaton of the weghts obtaned by the usual target representaton method n the target canddate regon. Meanwhle, the mean shft teraton formula s nvarant to the scale transformaton of weghts. Therefore, the mean shft trackng wth BWH n [, 0-] s exactly the same as the mean shft trackng wth usual target representaton. Based on the mean shft teraton formula, the key to effectvely explot the background nformaton s to decrease the weghts of promnent background features. To ths end, we propose to transform only the target model but not the target canddate model. A new formula for computng the pxel weghts n the target canddate regon s then derved. The proposed corrected background-weghted hstogram (CBWH) can truly acheve what the orgnal BWH method wants: reduce the nterference of background n target localzaton. An mportant advantage of the proposed CBWH method s that t can work robustly even f the target model contans much background nformaton. Thus t reduces greatly the senstvty of mean shft trackng to target ntalzaton. In the experments, we can see that even when the ntal target s not well selected, the proposed CBWH algorthm can stll correctly track the object, whch s hard to acheve by the usual target representaton. The rest of the paper s organzed as follows. Secton ntroduces brefly the mean shft algorthm and the BWH method. Secton 3 proves that the BWH method s equvalent to the 3
4 conventonal mean shft trackng method, and then the CBWH algorthm s presented. Secton 4 presents experments to test the proposed CBWH method. Secton 5 concludes the paper.. Mean Shft Trackng and Background-Weghted Hstogram. Target Representaton In object trackng, a target s usually defned as a rectangle or an ellpsodal regon n the frame and the color hstogram s used to represent the target. Denote by { } x n = the normalzed pxels n the target regon, whch has n pxels. The probablty of a feature u, whch s actually one of the m color hstogram bns, n the target model s computed as [, ] ˆ { qˆ } q= u u m n ; * = ( ) * ˆu x δ ( x ) q = C k b u () = where ˆq s the target model, q ˆu s the probablty of the u th element of ˆq, δ s the * Kronecker delta functon, ( ) b assocates the pxel x * to the hstogram bn, k(x) s an x n * sotropc kernel profle, and constant C s C k ( x = ) =. Smlarly, the probablty of the feature u=,,, m n the target canddate model from the target canddate regon centered at poston y s gven by { } = ( ) = ˆ ( y) pˆ y p u u m n h y x p = C k b u = h () ; ˆ ( ) u (y) h δ x where ˆp( y ) s the target canddate model, ˆ ( y) p s the probablty of the u th element of u ˆp( y ), { x } = n h are pxels n the target canddate regon centered at y, h s the bandwdth and C h s the normalzed constant C h n h y x = k. = h 4
5 . Mean Shft Trackng Algorthm A key ssue n the mean shft trackng algorthm s the computaton of an offset from the current locaton y to a new locaton y accordng to the mean shft teraton equaton n h y x x w g = = h y (3) n h y x w g = h m qˆ w = b u u δ ( x) u= pˆ ( y (4) ) where g( x ) s the shadow of the kernel profle k( x ) : g( x) k ( x) u =. For the convenence of expresson, we denote by g y x g =. Thus Eq. (3) can be re-wrtten as: h y nh nh = x wg wg (5) = = Wth Eq. (5), the mean shft trackng algorthm can fnd the most smlar regon to the target object n the new frame..3 Background-Weghted Hstogram (BWH) In target trackng, often the background nformaton s ncluded n the detected target regon. If the correlaton between target and background s hgh, the localzaton accuracy of the object wll be decreased. To reduce the nterference of salent background features n target localzaton, a representaton model of background features was proposed by Comancu et al. [] to select dscrmnatve features from the target regon and the target canddate regon. In [], the background s represented as { ˆu } u m m o (wth o ˆ = ) and t s calculated = by the surroundng area of the target. The background regon s three tmes the sze of the target as suggested n []. Denote by ô the mnmal non-zero value n { o ˆu }. The u= m = u 5
6 coeffcents { ( ˆ v ˆ u = mn o ou,) } = u m (6) are used to defne a transformaton between the representatons of target model and target canddate model. The transformaton reduces the weghts of those features wth low v u,.e. the salent features n the background. Then the new target model s * ( ) δ ( ) n u u = qˆ = C v k x b x u (7) wth the normalzaton constant canddate model s C = n ( ) * m x ( x * uδ u ) k v b u = =. The new target n h y x pˆ u( y) = Cv h u k δ b( x) u = h (8) where C h = nh. k v b u y x m ( h ) uδ ( x) u = = The above BWH transformaton ams to reduce the effects of promnent background features n the target canddate regon on the target localzaton. In next secton, however, we wll prove that BWH cannot acheve ths goal because t s equvalent to the usual target representaton under the mean shft trackng framework. 3. The Corrected Background-Weghted Hstogram Scheme 3. The Equvalence of BWH Representaton to Usual Representaton By the mean shft teraton formula (5), n the target canddate regon the weghts of ponts (referrng to Eq. (4)) determne the convergence of the trackng algorthm. Only when the 6
7 weghts of promnent features n the background are decreased, the relevance of background nformaton for target localzaton can be reduced. Let s analyze the weght changes by usng the BWH transform. Denote by w the weght of pont x computed by the BWH n the target canddate regon. It can be derved by Eq. (4) that m qˆ u w = δ b( x) u pˆ (9) u= u ( y) Let u be the bn ndex n the feature space whch corresponds to pont x n the canddate regon. We have b( ) δ x u =. So Eq. (9) can be smplfed as u u ( ) w = qˆ pˆ y (0) Substtute Eqs. (7) and (8) nto Eq. (0), there s w = n * ( x ) δ ( ) Cv k b x u u j j j= n h y x j Cv h u k δ b( x j) u j= h By removng the common factor the normalzaton factors C and v u from the numerator and denomnator and substtutng C h nto the above equaton, we have * ( ) δ ( ) n C k x b x u ˆ h = h u h n h y x ˆ h h u h Ch k δ b( x ) u = h CC C C q C C w = = = w CC CC p CC () where w calculated by Eq. (4) s the weght of pont n the target canddate regon usng the usual representaton of target model and target canddate model. Eq. () suggests that w s proportonal to w. Moreover, by combnng mean shft teraton Eq. (5), we have 7
8 y nh nh nh x x x gw gw CCh CCh gw = = = nh nh nh gw wg wg CCh CC = = h = = = = () Eq. () shows that the mean shft teraton formula s nvarant to the scale transformaton of weghts. Therefore, BWH actually does not enhance mean shft trackng by transformng the representaton of target model and target canddate model. Its result s exactly the same as that wthout usng BWH. 3. The Corrected Background-Weghted Hstogram (CBWH) Algorthm Although the dea of BWH s good, we see n Secton 3. that the BWH algorthm does not mprove the target localzaton. To truly acheve what the BWH wants to acheve, here we propose a new transformaton method, namely the corrected BWH (CBWH) algorthm. In CBWH, Eq. (6) s employed to transform only the target model but not the target canddate model. That s to say, we reduce the promnent background features only n the target model but not n the target canddate model. We defne a new weght formula " u u ( ) w = qˆ pˆ y (3) Note that the denomnator n the above equaton s dfferent from that n Eq. (0). Smlar to the prevous dervaton process n Secton 3., we can easly obtan that w = C C v w " u (4) Snce C C s a constant scalng factor, t has no nfluence on the mean shft trackng process. We can omt t and smplfy Eq. (4) as w = v w " u (5) Eq. (5) clearly reflects the relatonshp between the weght calculated by usng the usual target representaton (.e. w ) and the weght calculated by explotng the background 8
9 nformaton (.e. w " ). If the color of pont n the background regon s promnent, the correspondng value of v u s small. Hence n Eq. (5) ths pont s weght s decreased and ts relevance for target localzaton s reduced. Ths wll then speed up mean shft s convergence towards the salent features of the target. Note that f we do not use the background nformaton, v u wll be and w " wll degrade to w wth the usual target representaton. Fg. plots the non-zero weghts of the features n the frst teraton of frame of the benchmark png-pang ball sequence (referrng to Secton 4 please). The weghts w, w and w " are calculated respectvely by usng the three target representaton methods,.e. the orgnal representaton, BWH and CBWH. Fg. clearly shows that w s proportonal to w wth a constant rate ( w / w =0.599). Therefore, the representaton of target model and target canddate model usng BWH s the same as the usual representaton wthout usng background features because the mean shft teraton s nvarant to scale transform. Meanwhle, w " s dfferent from w and w. Some w ", e.g. of bns 7 and 4, are enhanced whle some w ", e.g. of bns 0 and 0, are weakened. In summary, BWH does not ntroduce any new nformaton to mean shft trackng, whle CBWH explots truly the background features and can ntroduce new nformaton for trackng. 3.3 Background Model Updatng n CBWH In BWH and the proposed CBWH, a background color model { o ˆu } u= m s employed and ntalzed at the begnnng of trackng. However, n the trackng process the background wll often change due to the varatons of llumnaton, vewpont, occluson and scene content, etc. If the orgnal background color model s stll used wthout updatng, the trackng accuracy may be reduced because the current background may be very dfferent from the prevous background model. Therefore, t s necessary to dynamcally update the background model for 9
10 a robust CBWH trackng performance. Here we propose a smple background model updatng method. Frst, the background features { o } ˆu u = m and { v u } u = m Bhattacharyya smlarty between { o } computed by n the current frame are calculated. Then the ˆu u m ˆu u m = and the old background model { } o = s m ρ = oo ˆˆ (6) u= u u If ρ s smaller than a threshold, ths mples that there are consderable changes n the background, and then we update { ˆu } u m o by = { o } ˆu u = m and update { v u} by u= m { v u }. The transformed target model q u = m ˆu s then computed by Eq. (7) usng { } v. u u = m Otherwse, we do not update the background model. The proposed CBWH based mean shft trackng algorthm can be summarzed as follows. ) Calculate the target model ˆq by Eq. () and the background-weghted hstogram { o ˆu }, and then compute { } u= m v u u= m by Eq. (6) and the transformed target model ˆq by Eq. (7). Intalze the poston y 0 of the target canddate regon n the prevous frame. ) Let k 0. 3) Calculate the target canddate model ˆp(y 0) usng Eq. () n the current frame. " 4) Calculate the weghts { w } = nh accordng to Eq. (3). 5) Calculate the new poston y of the target canddate regon usng Eq. (5). 6) Let d y y 0, y0 y, k k+. Set the error threshold ε (default value: 0
11 0.), the maxmum teraton number N, and the background model update threshold ε ( default value: 0.5). If d<ε or k N Calculate { oˆu } and u = m { } v u u = m frame. If ρ by Eq. (6) s smaller than based on the trackng result of the current ε, then { oˆ } { ˆ u ou} u= m u= m and { v } { u v u}, and { qˆ } u u= m u= m u= m s updated by Eq. (7). Stop teraton and go to step for next frame. Otherwse Go to step Expermental Results and Dscussons Several representatve vdeo sequences are used to evaluate the proposed method n comparson wth the orgnal BWH based mean shft trackng, whch s actually equvalent to the mean shft trackng wth usual target representaton. The two algorthms were mplemented under the programmng envronment of MATLAB 7.0. In all the experments, the RGB color model was used as the feature space and t was quantzed nto bns. Any elgble kernel functon k(x), such as the commonly used Epanechnkov kernel and Gaussan kernel, can be used. Our experments have shown that the two kernels lead to almost the same trackng results. Here we selected the Epanechnkov kernel as recommended n [] so that g(x) = k ( x) =. To better llustrate the proposed method, n the experments on the frst three sequences we dd not update the background feature model n CBWH because there are no obvous background changes, whle for the last sequence we updated adaptvely the background
12 feature model because there are many background changes such as scene content, llumnaton and vewpont varatons. Table and Table lst respectvely the average numbers of teratons and the target localzaton accuraces by the two methods on the four vdeo sequences. The MATLAB codes and all the expermental results of ths paper can be found n the web-lnk The frst experment s on the benchmark png-pang ball sequence, whch was used n [] to evaluate BWH. Ths sequence has 5 frames of spatal resoluton The target s the ball that moves quckly. Refer to Fgure, n frame we ntalzed the target model wth a regon of sze 7 3 (nner blue rectangle), whch ncludes many background elements n t. The background model was then ntalzed to be a regon of sze 53 6 (external red rectangle excludng the target regon), whch approxmately three tmes that of the target area. The trackng results n Fgure and the statstcs n Table show that the proposed CBWH model (mean error:.94; standard devaton:.44) has a more accurate localzaton accuracy than the orgnal BWH model (mean error:.0; standard devaton: 0.64), because the former truly explots the background nformaton n target localzaton. Fgure 3 llustrates the numbers of teratons by the two methods. The average number of teratons s 3.04 for CBWH and 8.4 for BWH. The CBWH method requres less computaton. The salent features of target model are enhanced whle the background features beng suppressed n CBWH so that the mean shft algorthm can more accurately locate the target. The second vdeo s a soccer sequence. In ths sequence, the color of sport shrt (green) of the target player s very smlar to that of the lawn and thus some target features are presented n the background. Expermental results n Fgure 4 show that the BWH loses the object very quckly, whle the proposed CBWH successfully tracks the player over the whole sequence. The thrd experment s on the benchmark sequence of table tenns player. The target to be To calculate the target localzaton accuracy, we manually labeled the target n each frame as ground-truth.
13 tracked s the head of the player. We use ths sequence to test the robustness of the proposed CBWH to naccurate target ntalzaton. Refer to Fgure 5, n the frst frame the ntal target regon (nner blue rectangle) was delberately set so that t occupes only a small part of the player s head but occupes much background. The ntal target model s severely naccurate and t contans much background nformaton. Fgure 6 compares the Bhattacharyya smlartes between the trackng result and ts surroundng background regon by BWH and CBWH. We see that the Bhattacharyya smlarty of CBWH s smaller than that of BWH, whch mples that CBWH can better separate the target from background. Regard to the target localzaton accuracy, the proposed CBWH based method has a mean error of 3.89 and standard devaton of 4.56, whch are much better than those of the BWH based method whose mean error and standard devaton are s 5.4 and 5.70 respectvely. Because CBWH reduces the mpact of features shared by the target and background and enhances the promnent features n the target model, t decreases sgnfcantly the relevance of background for target localzaton. The experment n Fgure 5 suggests that the proposed CBWH method s a good canddate n many real trackng systems, where the ntal targets are often detected wth about 60% background nformaton nsde them. In Fgure 7, we show the trackng results on ths sequence by another naccurate ntalzaton. The same concluson can be drawn. The last experment s on a face sequence wth obvous changes of background content, llumnaton and vewpont. Usually, the background features { o ˆu } u= m are defned by the frst frame. However, due to the evoluton of vdeo scenes, the background features wll change and thus { o ˆu } u= m should be dynamcally updated for better performance. Fgure 8 shows the trackng results respectvely by BWH, CBWH wthout background update and CBWH wth background update. Obvously, CBWH wth background update locates the target much more accurately than the other two methods, whle BWH performs the worst. 3
14 The complexty of CBWH s bascally the same as that of the orgnal mean shft trackng except for transformng the target model wth background-weghted hstogram. Because the proposed CBWH focuses on trackng the salent features whch are dfferent from background, the average number of teratons of t s much less than that of the orgnal BWH. Meanwhle, Table also shows that the proposed CBWH locates the target more relably and more accurately than BWH. It acheves much smaller mean error and standard devaton than BWH. 5. Conclusons In ths paper, we proved that the background-weghted hstogram (BWH) representaton n [] s equvalent to the usual target representaton so that no new nformaton can be ntroduced to mprove the mean shft trackng performance. We then proposed a corrected BWH (CBWH) method to reduce the relevance of background nformaton and mprove the target localzaton. The proposed CBWH algorthm only transforms the hstogram of target model and decreases the probablty of target model features that are promnent n the background. The CBWH truly acheves what the BWH wants. The expermental results valdated that CBWH can not only reduce the mean shft teraton number but also mprove the trackng accuracy. One of ts mportant advantages s that t reduces the senstvty of mean shft trackng to the target ntalzaton so that CBWH can robustly track the target even t s not well ntalzed. Reference [] Comancu D., Ramesh V., and Meer P.: Real-Tme Trackng of Non-Rgd Objects Usng Mean Shft. Proc. IEEE Conf. Computer Vson and Pattern Recognton, Hlton Head, SC, USA, June, 000, pp [] Comancu D., Ramesh V. and Meer P.: Kernel-Based Object Trackng, IEEE Trans. Pattern 4
15 Anal. Machne Intell., 003, 5, (), pp [3] Comancu D., and Meer P.: Mean Shft: a Robust Approach toward Feature Space Analyss, IEEE Trans Pattern Anal. Machne Intell., 00, 4, (5), pp [4] Bradsk G.: Computer Vson Face Trackng for Use n a Perceptual User Interface, Intel Technology Journal, 998, (Q). [5] Fukunaga F. and Hostetler L. D.: The Estmaton of the Gradent of a Densty Functon, wth Applcatons n Pattern Recognton, IEEE Trans. on Informaton Theory, 975,, (), pp [6] Cheng Y.: Mean Shft, Mode Seekng, and Clusterng, IEEE Trans on Pattern Anal. Machne Intell., 995, 7, (8), pp [7] Nummaro K., Koller-Meer E. and Gool L. V.: An Adaptve Color-Based Partcle Flter, Image and Vson Computng, 003,, (), pp [8] Collns R.: Mean-Shft Blob Trackng through Scale Space. Proc. IEEE Conf. Computer Vson and Pattern Recognton, Wsconsn, USA, June 003, pp [9] Zvkovc Z., and Kröse B.: An EM-lke Algorthm for Color-Hstogram-Based Object Trackng. Proc. IEEE Conf. Computer Vson and Pattern Recognton, Washngton, DC, USA, July 004, volume I, pp [0] Yang C., Raman D., and Davs L.: Effcent Mean-Shft Trackng va a New Smlarty Measure. Proc. IEEE Conf. Computer Vson and Pattern Recognton, San Dego, CA, June 005, Volume I, pp [] Ylmaz A., Javed O., and Shah M.: Object Trackng: a Survey, ACM Computng Surveys, 006, 38, (4), Artcle 3. [] Ylmaz A.: Object Trackng by Asymmetrc Kernel Mean Shft wth Automatc Scale and Orentaton Selecton. Proc. IEEE Conf. Computer Vson and pattern Recognton, Mnnesota, USA, June 007,Volume I, pp.-6,. [3] Wang J., Thesson B., Xu Y. and Cohen M. F.: Image and Vdeo Segmentaton by Ansotropc Kernel Mean Shft. Proc. European Conf. on Computer Vson, Prague, Czech Republc, May 004, vol. 30, pp
16 [4] Hu J., Juan C., and Wang J.: A spatal-color mean-shft object trackng algorthm wth scale and orentaton estmaton, Pattern Recognton Letters, 008, 9, (6), pp [5] Pars S., and Durand F.: A Topologcal Approach to Herarchcal Segmentaton usng Mean Shft. Proc. IEEE Conf. on Computer Vson and Pattern Recognton, Mnnesota, USA, June 007, pp. -8. [6] Collns R. T., Lu Y., and Leordeanu M.: Onlne Selecton of Dscrmnatve Trackng Features, IEEE Trans. Pattern Anal. Machne Intell., 005, 7, (0), pp [7] Tu J., Tao H., and Huang T.: Onlne updatng appearance generatve mxture model for meanshft trackng, Machne Vson and Applcatons, 009, 0, (3), pp [8] Luo Q., and Khoshgoftaar T. M.: Effcent Image Segmentaton by Mean Shft Clusterng and MDL-Guded Regon Mergng. IEEE Proc. Internatonal Conference on Tools wth Artfcal Intellgence, Florda, USA, November 004, pp [9] Park J., Lee G., and Park S.: Color mage segmentaton usng adaptve mean shft and statstcal model-based methods, Computers & Mathematcs wth Applcatons, 009, 57, (6), pp [0] Jeyakar J., Babu R., and Ramakrshnan K. R.: Robust object trackng wth background-weghted local kernels, Computer Vson and Image Understandng, 009,,(3), pp [] L L., and Feng Z.: An effcent object trackng method based on adaptve nonparametrc approach, Opto-Electroncs Revew, 005, 3, (4), pp [] Allen J., Xu R., and Jn J.: Mean Shft Object Trackng for a SIMD Computer. Proc. Internatonal Conference on Informaton Technology and Applcatons. Sydney, Australa, July 005, Volume I, pp
17 Lst of Tables and Fgures Table. The average number of teratons by the two methods on the four sequences. Table. The target localzaton accuraces (mean error and standard devaton). Fg. : Weghts of the features n the frst mean shft teraton of frame (the png-pang ball sequence) usng the orgnal representaton, BWH and CBWH. Fg. : Mean shft trackng results on the png-pang ball sequence. Frames, 0, 5 and 5 are dsplayed. Fg. 3: Number of teratons on the png-pang ball sequence. Fg. 4: Mean shft trackng results on the soccer sequence. Frames, 5, 75 and 5 are dsplayed. Fg. 5: Mean shft trackng results on the table tenns player sequence wth naccurate ntalzaton. Frames, 0, 30, and 58 are dsplayed. Fg. 6: Bhattacharyya coeffcents between the trackng result and ts surroundng background regon for the BWH and CBWH methods on the table tenns player sequence. Fg. 7: Mean shft trackng results on the table tenns player sequence wth another naccurate ntalzaton. Frames, 0, 30, and 58 are dsplayed. Fg. 8: Mean shft trackng results of the face sequence wth the proposed CBWH target representaton methods. Frames 00, 5, 30 and 448 are dsplayed. 7
18 Table. The average number of teratons by the two methods on the four sequences. Methods Png-pang ball Table tenns Soccer sequence sequence player sequence Face sequence BWH CBWH
19 Table. The target localzaton accuraces (mean error and standard devaton). BWH CBWH Sequence Standard Standard Mean error Mean error devaton devaton Png-pang ball Soccer Table tenns player Face
20 8 7 6 Orgnal representaton BWH based representaton CBWH based representaton 5 weghts the member of feature space Fg. : Weghts of the features n the frst mean shft teraton of frame (the png-pang ball sequence) usng the orgnal representaton, BWH and CBWH. 0
21 0 5 5 (a) The BWH based mean shft trackng (b) The proposed CBWH based mean shft trackng Fg. : Mean shft trackng results on the png-pang ball sequence. Frames, 0, 5 and 5 are dsplayed.
22 0 9 BWH based target representaton CBWH based target representaton Number of teratons Frames Fg. 3: Number of teratons on the png-pang ball sequence.
23 (a) The BWH based mean shft trackng (b) The proposed CBWH based mean shft trackng Fg. 4: Mean shft trackng results on the soccer sequence. Frames, 5, 75 and 5 are dsplayed. 3
24 0 (a) The BWH based mean shft trackng (b) The proposed CBWH based mean shft trackng 58 Fg. 5: Mean shft trackng results on the table tenns player sequence wth naccurate ntalzaton. Frames, 0, 30, and 58 are dsplayed. 4
25 0.9 Bhattacharyya smlarty betw een p u and o u for BWH Bhattacharyya smlarty betw een p u and o u for CBWH 0.8 Bhattacharyya smlarty Frame ndex Fg. 6: Bhattacharyya coeffcents between the trackng result and ts surroundng background regon for the BWH and CBWH methods on the table tenns player sequence. 5
26 0 (a) The BWH based mean shft trackng (b) The proposed CBWH based mean shft trackng 58 Fg. 7: Mean shft trackng results on the table tenns player sequence wth another naccurate ntalzaton. Frames, 0, 30, and 58 are dsplayed. 6
27 00 5 (a) The BWH based mean shft trackng (b) The proposed CBWH based mean shft trackng wthout background update (c) The proposed CBWH based mean shft trackng wth background update 448 Fg. 8: Mean shft trackng results of the face sequence wth the proposed CBWH target representaton methods. Frames 00, 5, 30 and 448 are dsplayed. 7
Scale and Orientation Adaptive Mean Shift Tracking
Scale and Orentaton Adaptve Mean Shft Trackng Jfeng Nng, Le Zhang, Davd Zhang and Chengke Wu Abstract A scale and orentaton adaptve mean shft trackng (SOAMST) algorthm s proposed n ths paper to address
More informationSLAM 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 informationLearning 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 informationA 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 informationA 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 informationA 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 informationDetermining 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 informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationImprovement 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 informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationParallelism 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 informationLocal 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 informationContent 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 informationA 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 informationSupport 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 informationObject Contour Tracking Using Multi-feature Fusion based Particle Filter
Object Contour Tracng Usng Mult-feature Fuson based Partcle Flter Xaofeng Lu 1,3, L Song 1,2, Songyu Yu 1, Nam Lng 2 Insttute of Image Communcaton and Informaton Processng 1 Shangha Jao Tong Unversty,
More informationSubspace 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 informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationOBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD
ISSN : 0973-739 Vol. 3, No., Janary-Jne 202, pp. 39-42 OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD Rahl Mshra, Mahesh K. Chohan 2, and Dhraj Ntnawwre 3,2,3 Department of Electroncs,
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationReducing Frame Rate for Object Tracking
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
More informationCluster 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 informationTarget Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c
Advanced Materals Research Onlne: 03-09-8 ISSN: 66-8985, Vols. 760-76, pp 997-00 do:0.408/www.scentfc.net/amr.760-76.997 03 Trans Tech Publcatons, Swtzerland Target Trackng Analyss Based on Corner Regstraton
More informationNonlocal Mumford-Shah Model for Image Segmentation
for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:
More informationRobust visual tracking based on Informative random fern
5th Internatonal Conference on Computer Scences and Automaton Engneerng (ICCSAE 205) Robust vsual trackng based on Informatve random fern Hao Dong, a, Ru Wang, b School of Instrumentaton Scence and Opto-electroncs
More informationFast 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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationCS 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 informationRelated-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 informationCOMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL
COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationEdge 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 informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationFace 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 informationA Novel Fingerprint Matching Method Combining Geometric and Texture Features
A Novel ngerprnt Matchng Method Combnng Geometrc and Texture eatures Me Xe, Chengpu Yu and Jn Q Unversty of Electronc Scence and Technology of Chna. Chengdu,P.R.Chna xeme@ee.uestc.edu.cn Post Code:6154
More informationTsinghua 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 informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationX- 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 information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationEfficient Segmentation and Classification of Remote Sensing Image Using Local Self Similarity
ISSN(Onlne): 2320-9801 ISSN (Prnt): 2320-9798 Internatonal Journal of Innovatve Research n Computer and Communcaton Engneerng (An ISO 3297: 2007 Certfed Organzaton) Vol.2, Specal Issue 1, March 2014 Proceedngs
More informationSkew 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 informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationDetection 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 informationVirtual 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 informationIntegrated Expression-Invariant Face Recognition with Constrained Optical Flow
Integrated Expresson-Invarant Face Recognton wth Constraned Optcal Flow Chao-Kue Hseh, Shang-Hong La 2, and Yung-Chang Chen Department of Electrcal Engneerng, Natonal Tsng Hua Unversty, Tawan 2 Department
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationImproved SIFT-Features Matching for Object Recognition
Improved SIFT-Features Matchng for Obect Recognton Fara Alhwarn, Chao Wang, Danela Rstć-Durrant, Axel Gräser Insttute of Automaton, Unversty of Bremen, FB / NW Otto-Hahn-Allee D-8359 Bremen Emals: {alhwarn,wang,rstc,ag}@at.un-bremen.de
More informationSuppression 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 informationCollaborative Tracking of Objects in EPTZ Cameras
Collaboratve Trackng of Objects n EPTZ Cameras Fasal Bashr and Fath Porkl * Mtsubsh Electrc Research Laboratores, Cambrdge, MA, USA ABSTRACT Ths paper addresses the ssue of mult-source collaboratve object
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationOnline codebook modeling based background subtraction with a moving camera
Onlne codebook modelng based background subtracton wth a movng camera Lyun Gong School of Computer Scence Unversty of Lncoln, UK Emal: lgong@lncoln.ac.uk Mao Yu School of Computer Scence Unversty of Lncoln,
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationMULTISPECTRAL 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 informationEfficient Mean-shift Clustering Using Gaussian KD-Tree
Pacfc Graphcs 2010 P. Allez, K. Bala, and K. Zhou (Guest Edtors) Volume 29 (2010), Number 7 Effcent Mean-shft Clusterng Usng Gaussan KD-Tree Chunxa Xao Meng Lu The School of Computer, Wuhan Unversty, Wuhan,
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationA 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 informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationGender Classification using Interlaced Derivative Patterns
Gender Classfcaton usng Interlaced Dervatve Patterns Author Shobernejad, Ameneh, Gao, Yongsheng Publshed 2 Conference Ttle Proceedngs of the 2th Internatonal Conference on Pattern Recognton (ICPR 2) DOI
More informationA 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 informationFeature-Area Optimization: A Novel SAR Image Registration Method
Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area
More informationDevelopment of an Active Shape Model. Using the Discrete Cosine Transform
Development of an Actve Shape Model Usng the Dscrete Cosne Transform Kotaro Yasuda A Thess n The Department of Electrcal and Computer Engneerng Presented n Partal Fulfllment of the Requrements for the
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationFeature-Preserving Mesh Denoising via Bilateral Normal Filtering
Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract
More informationKeyword-based Document Clustering
Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of
More informationDETECTION OF MOVING OBJECT BY FUSION OF COLOR AND DEPTH INFORMATION
INTERNATIONAL JOURNAL ON SMART SENSING AN INTELLIGENT SYSTEMS VOL. 9, NO., MARCH 206 ETECTION OF MOVING OBJECT BY FUSION OF COLOR AN EPTH INFORMATION T. T. Zhang,G. P. Zhao and L. J. Lu School of Automaton
More informationMulti-View Face Alignment Using 3D Shape Model for View Estimation
Mult-Vew Face Algnment Usng 3D Shape Model for Vew Estmaton Yanchao Su 1, Hazhou A 1, Shhong Lao 1 Computer Scence and Technology Department, Tsnghua Unversty Core Technology Center, Omron Corporaton ahz@mal.tsnghua.edu.cn
More informationSimultaneously Fitting and Segmenting Multiple- Structure Data with Outliers
Smultaneously Fttng and Segmentng Multple- Structure Data wth Outlers Hanz Wang a, b, c, Senor Member, IEEE, Tat-un Chn b, Member, IEEE and Davd Suter b, Senor Member, IEEE Abstract We propose a robust
More informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationRobust Inlier Feature Tracking Method for Multiple Pedestrian Tracking
2011 Internatonal Conference on Informaton and Intellgent Computng IPCSIT vol.18 (2011) (2011) IACSIT Press, Sngapore Robust Inler Feature Trackng Method for Multple Pedestran Trackng Young-Chul Lm a*
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationLearning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris
Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton
More informationLearning a Class-Specific Dictionary for Facial Expression Recognition
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for
More informationFeature-based image registration using the shape context
Feature-based mage regstraton usng the shape context LEI HUANG *, ZHEN LI Center for Earth Observaton and Dgtal Earth, Chnese Academy of Scences, Bejng, 100012, Chna Graduate Unversty of Chnese Academy
More informationVideo Object Tracking Based On Extended Active Shape Models With Color Information
CGIV'2002: he Frst Frst European Conference Colour on Colour n Graphcs, Imagng, and Vson Vdeo Object rackng Based On Extended Actve Shape Models Wth Color Informaton A. Koschan, S.K. Kang, J.K. Pak, B.
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationMatching of 2D Laser Signatures based on Spatial and Spectral Analysis
Matchng of 2D Laser Sgnatures based on Spatal and Spectral Analyss A. Aboshosha, H. Tamm and A. Zell [aboshosha, tamm, zell]@nformatk.un-tuebngen.de http://www-ra.nformatk.un-tuebngen.de/ Rechnerarchtektur
More information