Scale and Orientation Adaptive Mean Shift Tracking

Size: px
Start display at page:

Download "Scale and Orientation Adaptive Mean Shift Tracking"

Transcription

1 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 the problem of how to estmate the scale and orentaton changes of the target under the mean shft trackng framework. In the orgnal mean shft trackng algorthm, the poston of the target can be well estmated, whle the scale and orentaton changes can not be adaptvely estmated. Consderng that the weght mage derved from the target model and the canddate model can represent the possblty that a pxel belongs to the target, we show that the orgnal mean shft trackng algorthm can be derved usng the zero th and the frst order moments of the weght mage. Wth the zero th order moment and the Bhattacharyya coeffcent between the target model and canddate model, a smple and effectve method s proposed to estmate the scale of target. Then an approach, whch utlzes the estmated area and the second order center moment, s proposed to adaptvely estmate the wdth, heght and orentaton changes of the target. Extensve experments are performed to testfy the proposed method and valdate ts robustness to the scale and orentaton changes of the target. Keywords: object trackng, mean shft, moment, scale and orentaton estmaton 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 Natonal Scence Foundaton Councl of Chna under Grants , and 635 and the Chnese Unversty Scentfc Fund under Grant No.QN909. Jfeng Nng s wth the College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Chna, and 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 Real-tme object trackng s a crtcal task n computer vson, and many algorthms have been proposed to overcome the dffcultes arsng from nose, occlusons, clutters, and changes n the foreground object and/or background envronment [4]. Among varous trackng methods, the mean shft trackng algorthm s a popular one due to ts smplcty and effcency. The mean shft algorthm was orgnally developed by Fukunaga and Hostetler [] for data analyss, and later Cheng [3] ntroduced t to the feld of computer vson. Bradsk [6] modfed t and developed the Contnuously Adaptve Mean Shft (CAMSHIFT) algorthm for face trackng. Comancu and Meer successfully appled mean shft algorthm to mage segmentaton [8] and object trackng [7, 9]. Some optmal propertes of mean shft were dscussed n [3, 5]. In the classcal mean shft trackng algorthm [9], the estmaton of scale and orentaton changes of the target s not solved. Although t s not robust, the CAMSHIFT algorthm [6], as the earlest mean shft based trackng scheme, could actually deal wth varous types of movements of the object. In CAMSHIFT, the moment of the weght mage determned by the target model was used to estmate the scale (also called area) and orentaton of the object beng tracked. Based on Comancu et al s work n [9], many trackng schemes [0,, 7, 8, 3] were proposed to solve the problem of target scale and/or orentaton estmaton. Collns [0] adopted Lndeberg et al s scale space theory [9, 0] for kernel scale selecton n mean-shft based blob trackng. However, t cannot handle the rotaton changes of the target. An EM-shft algorthm was proposed by Zvkovc and Kröse n [], whch smultaneously estmates the poston of the local mode and the covarance matrx that can approxmately descrbe the shape of the local mode. In [3], a dstance transform based asymmetrc kernel s used to ft the object shape through a scale adaptaton followed by a segmentaton process. Hu

3 et al [7] developed a scheme to estmate the scale and orentaton changes of the object by usng spatal-color features and a novel smlarty measure functon [, 6]. In ths paper, a scale and orentaton adaptve mean shft trackng (SOAMST) algorthm s presented under the mean shft framework. Unlke CAMSHIFT, whch uses the weght mage determned by the target model, the proposed SOAMST algorthm employs the weght mage derved from the target model and the target canddate model n the target canddate regon to estmate the target scale and orentaton. Such a weght mage can be regarded as the densty dstrbuton functon of the object n the target canddate regon, and the weght value of each pxel represents the possblty that t belongs to the target. Usng ths densty dstrbuton functon, we can compute the moment features and then estmate effectvely the wdth, heght and orentaton of the object based on the zero th order moment, the second order center moment and the Bhattacharyya coeffcent between target model and target canddate model. The expermental results demonstrate that SOAMST can deal wth varous movements of the tracked object flexbly and robustly. The rest of the paper s organzed as follows. Secton ntroduces the classcal mean shft algorthm. Secton 3 analyzes the moment features of the target canddate regon and then descrbes n detal the proposed SOAMST approach. Secton 4 performs extensve experments to test the proposed SOAMST algorthm n comparson wth state-of-the-art schemes. Secton 5 concludes the paper.. Mean Shft Trackng Algorthm. Target Representaton In object trackng, a target s usually defned as a rectangle or an ellpsodal regon n the mage. Currently, a wdely used target representaton s the color hstogram because of ts ndependence of scalng and rotaton and ts robustness to partal occlusons [9, ]. Denote 3

4 by { } x = n the normalzed pxels n the target regon, whch s supposed to be centered at the orgn pont and have n pxels. The probablty of the feature u (u=,,, m) n the target model s computed as [9] { qˆ } q= ˆ u u= m n qˆ ( x ) * ( x * u = C k δ b ) u = where ˆq s the target model, q ˆu s the probablty of the u th () element of ˆq, δ s the x * Kronecker delta functon, ( ) b assocates the pxel * x to the hstogram bn, and k(x) s an sotropc kernel profle. Constant C s a normalzaton functon defned by n = * ( ) C = k x () Smlarly, the probablty of the feature u n the target canddate model from the canddate regon centered at poston y s gven by { } ( ) pˆ ( y) pˆ y = u u= m n h y x pˆ u (y) = Ch k δ b( x) u = h (3) C h n h y x = k (4) = h 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 normalzaton functon whch s ndependent of y [9]. In order to calculate the lkelhood of the target model and the canddate model, a metrc based on the Bhattacharyya coeffcent [] s defned by usng the two normalzed hstograms pˆ (y) and qˆ as follows 4

5 [ pˆ ( y), qˆ ] = ˆ ( y) m ρ p u qˆ u (5) u= The dstance between pˆ (y) and qˆ s then defned as [ pˆ ( y),qˆ ] = ρ[ pˆ ( y),qˆ ] d (6). Mean Shft Mnmzng the dstance d ˆ( ) p y,qˆ Bhattacharyya coeffcent ρ ˆ( ) p y,qˆ n Eq. (6) s equvalent to maxmzng the n Eq. (5). The optmzaton process s an teratve process and s ntalzed wth the target poston, denoted by y 0, n the prevous frame. By usng the Taylor expanson around p ( ) ˆ u y 0, the lnear approxmaton of the Bhattacharyya coeffcent ρ ˆ( ) p y,qˆ n Eq. (5) can be obtaned as: h ρ [ pˆ(y),qˆ ] pˆ u (y 0 ) qˆ u + (7) m n C h y x w k u= u= h where w m = qˆ pˆ u ( y ) u= u 0 [ b( x ) u] δ (8) Snce the frst term n Eq. (7) s ndependent of y, to mnmze the dstance n Eq. (6) s to maxmze the second term n Eq. (7). In the mean shft teraton, the estmated target moves from y to a new poston y, whch s defned as n h y x x w g = = h y (9) n h y x w g = h When we choose the kernel k(x) wth the Epanechnkov profle, there s g(x)=-k(x)=, and Eq. (9) can be reduced to [9] 5

6 nh = x w y = (0) nh w By usng Eq. (0), the mean shft trackng algorthm fnds n the new frame the most smlar regon to the object. From Eq. (0) t can be observed that the key parameters n the mean shft trackng = algorthm are the weghts w. In ths paper we wll focus on the analyss of w, wth whch the scale and orentaton of the tracked target can be well estmated, and then a scale and orentaton adaptve mean shft trackng algorthm can be developed. 3. Scale and Orentaton Adaptve Mean Shft Trackng In ths secton, we frst analyze how to calculate adaptvely the scale and orentaton of the target n sub-sectons 3. ~ 3.5, then n sub-secton 3.6, a scale and orentaton adaptve mean shft trackng (SOAMST) algorthm s presented. The enlargng or shrnkng of the target s usually a gradual process n consecutve frames. Thus we can assume that the scale change of the target s smooth and ths assumpton holds reasonably well n most vdeo sequences. If the scale of the target changes abruptly n adjacent frames, no general trackng algorthm can track t effectvely. Wth ths assumpton, we can make a small modfcaton of the orgnal mean shft trackng algorthm. Suppose that we have estmated the area of the target (the area estmaton wll be dscussed n sub-secton 3.) n the prevous frame, n the current frame we let the wndow sze or the area of the target canddate regon be a lttle bgger than the estmated area of the target. Therefore, no matter how the scale and orentaton of the target change, t should be stll n ths bgger target canddate regon n the current frame. Now the problem turns to how to estmate the real area and orentaton from the target canddate regon. 6

7 3. The Weght Images n Target Scale Changng (a) (b) (c) (d) (e) (f) (g) (h) () (j) (k) Fg. : Weght mages n CAMSHIF [6] and mean shft trackng [9] algorthms when the object scale changes. (a) A syntheszed target wth three gray levels. (b) A target canddate wndow that s bgger than the target. (c), (f) and () are the target canddate regons enclosed by the target canddate wndow (dashed box) when the scale of the target decreases, keeps nvarant and ncreases, respectvely. (d), (g) and (j) are respectvely the weght mages of the target canddate regons n (c), (f) and () calculated by CAMSHIFT. (e), (h) and (k) are respectvely the weght mages of the target canddate regons n (c), (f) and () calculated by mean shft trackng. In the CAMSHIFT and the mean shft trackng algorthms, the estmaton of the target locaton s actually obtaned by usng a weght mage [0, 4]. In CAMSHIFT, the weght mage s determned usng a hue-based object hstogram where the weght of a pxel s the probablty of ts hue n the object model. Whle n the mean shft trackng algorthm, the weght mage s defned by Eq. (8) where the weght of a pxel s the square root of the rato of ts color probablty n the target model to ts color probablty n the target canddate model. Moreover, t s not accurate to use the weght mage by CAMSHIFT to estmate the locaton 7

8 of the target, and the mean shft trackng algorthm can have better estmaton results. That s to say, the weght mage n the mean shft trackng algorthm s more relable than that n the CAMSHIFT algorthm. As n the CAMSHIFT algorthm, n the SOAMST scheme to be developed, the scale and orentaton of the target wll be estmated by usng the moment features [4-6] of the weght mage. Snce those moment features depend only on the weght mage, a properly calculated weght mage could lead to accurate moment features and consequently good estmates of the target changes. Therefore, let s analyze the weght mages n the CAMSHIFT and mean shft trackng methods n order for the development of the SOAMST algorthm. As mentoned at the begnnng of Secton 3, we wll track the target n a larger canddate regon than ts sze to ensure that the target wll be wthn ths canddate regon when the trackng process ends. Wth ths strategy, let s compare the weght mages n CAMSHIFT and mean shft trackng under dfferent scale changes by usng the followng experments. Fgure -(a) shows a syntheszed target that has three gray levels. Fgure -(b) shows the canddate regon that s a lttle bgger than the target. Fgures -(c), (f) and () are the trackng results when the scale of the syntheszed target decreases, keeps nvarant and ncreases, respectvely. Fgures -(d), (g) and (j) llustrate the weght mages calculated by the CAMSHIFT algorthm n the three cases, whle Fgures -(e), (h) and (k) llustrate the weght mages calculated by the mean shft trackng algorthm n the three cases. From Fgure, we can see clearly the dfference of the weght mages between CAMSHIFT and mean shft trackng. Frst, the weght mage n the CAMSHIFT algorthm s constant and t only depends on the target model, whle the weght mage n the mean shft trackng algorthms wll change dynamcally wth the scale changes of the target. Second, the weght mage s closely related to the target scale change n mean shft trackng. The closer the real scale of the target s to the canddate regon, the better the weght mage approaches to 8

9 . That s to say, the weght mage n mean shft trackng can be a good ndcator of the scale change of the target. However, the weght mage n CAMSHIFT does not reflect ths. Based on the above observaton and analyss, we could consder the weght mage n the mean shft trackng algorthm as a densty dstrbuton functon of the target, where the weght value of a pxel reflects the possblty that t belongs to the target. In the followng sectons, we can see that the scale and orentaton of the target can be well estmated by usng ths densty dstrbuton functon together wth the moment features of the weght mage. 3. Estmatng the Target Area Snce the weght value of a pxel n the target canddate regon represents the probablty that t belongs to the target, the sum of the weghts of all pxels,.e., the zero th order moment, can be consdered as the weghted area of the target n the target canddate regon: M n = ( x ) = w () In mean shft trackng, the target s usually n the bg target canddate regon. Due to the exstence of the background features n the target canddate regon, the probablty of the target features s less than that n the target model. So Eq. (8) wll enlarge the weghts of target pxels and suppress the weght of background pxels. Thus, the pxels from the target wll contrbute more to target area estmaton, whle the pxels from the background wll contrbute less. Ths can be clearly seen n Fgures -(e), -(h) and -(k). On the other hand, the Bhattacharyya coeffcent (referrng to Eq. (5)) s an ndcator of the smlarty between the target model ˆq and the target canddate model ˆp ( y ). A smaller Bhattacharyya coeffcent means that there are more features from the background and fewer features from the target n the target canddate regon, vce versa. If we take M as the In the remanng of the paper, for the convenence of expresson we wll only use Bhattacharyya coeffcent to represent the Bhattacharyya coeffcent between the target model and the target canddate model. 9

10 estmaton of the target area, then accordng to Eq. (), when the weghts from the target become bgger, the estmaton error by takng M as the area of the target wll be bgger, vce versa. Therefore, the Bhattacharyya coeffcent s a good ndcator of how relable t s by takng M as the target area. Table lsts the real area of the target n Fgure and the estmaton error by takng M as the target area. We can see that wth the ncrease of the Bhattacharyya coeffcent, the estmaton accuracy by takng M as the target area wll also ncrease (e.g., the estmaton error wll decrease). Based on the above analyss, we see that the Bhattacharyya coeffcent can be used to adjust M n estmatng the target area, denoted by A. We propose the followng equaton to estmate t: A= c( ρ) M () where c(ρ) s a monotoncally ncreasng functon wth respect to the Bhattacharyya coeffcent ρ ( 0 ρ ). As can be seen n Fgures -(e), -(h) and -(k) and Table, M s always greater than the real target area and t wll monotoncally approach to the real target area wth ρ ncreasng. Thus we requre that c(ρ) should be monotoncally ncrease and reach maxmum when ρ s. Such a correcton functon c(ρ) s possble to shrnk M back to the real target scale. There can be alternatve canddate functons of c(ρ), such as lnear functon c(ρ)=ρ, Gaussan functon, etc. Here we choose the exponental functon as c(ρ) based on our expermental experence 3 : ρ c( ρ) = exp σ (3) From Eqs. () and (3) we can see that when ρ approaches to the upper bound,.e., when the target canddate model approaches to the target model, c(ρ) approaches to and n 3 By our expermental experence, both exponental and Gaussan functons can acheve satsfyng results, and we choose the former here for smplcty. 0

11 ths case t s more relable to use M as the estmaton of target area. When ρ decreases,.e., the canddate model s not dentcal to the target model, M wll be much bgger than the target area but c(ρ) s less than so that A can avod beng based too much from the real target area. When ρ approaches to 0,.e., the tracked target gets lost, c(ρ) wll be very small so that A s close to zero. Table. The area estmaton (pxels) of the target under dfferent scale changes by the proposed method. Trackng result Fg. (e) Fg. (h) Fg. (k) Real area of target Background area Bhattacharyya coeffcent Estmated area A under dfferent σ and the relatve estmaton error (%) n comparson wth M. M % % 40 0% σ = % % 40 0% σ = % % 40 0% σ = % % 40 0% σ = % % 40 0% Table lsts the area estmaton results of the target by usng Eq. () under dfferent scale changes n Fgures -(e), -(h) and -(k). Though an optmal value of σ should be adaptve to the vdeo content, by our expermental experences t was found that when the target model s approprately defned (contanng not too many background features), settng σ between and can acheve very robust trackng results for most of the testng vdeo sequences. 3.3 The Moment Features n Mean Shft Trackng In ths sub-secton, we analyze the moment features n mean shft trackng and then combne them wth the estmated target area to further estmate the wdth, heght and orentaton of the target n the next sub-secton. Lke n CAMSHIFT, we can easly calculate the moments of the weght mage as follows: nh nh (4) M = wx M = wx 0, 0, =

12 nh nh nh 0 = x,, 0 = x,, = x, x, = = = (5) M w M w M w where par (x,, x, ) s the coordnate of pxel n the canddate regon. Comparng Eq. (0) wth Eqs. () and (4), we can fnd that y s actually the rato of the frst order moment to the zero th order moment: ( ) y = x,x = ( M / M, M / M ) (6) 0 0 where ( x, x ) represents the centrod of the target canddate regon. The second order center moment could descrbe the shape and orentaton of an object. By usng Eqs. (0), (), (5) and (6), we can convert Eq. (9) to the second order center moment as follows μ = M / M x μ = M / M x x μ = M / M x (7) Eq. (7) can be rewrtten as the followng covarance matrx n order to estmate the wdth, heght and orentaton of the target: Cov μ μ 0 = μ μ 0 (8) 3.4 Estmatng the Wdth, Heght and Orentaton of the Target By usng the estmated area (sub-secton 3.) and the moment features (sub-secton 3.3), the wdth, heght and orentaton of the target can be well estmated. The covarance matrx n Eq. (8) can be decomposed by usng the sngular value decomposton (SVD) [] as follows 0 T u u λ u u Cov = U S U = u u 0 λ u u T (9) where U u u = u u and λ 0 S =. 0 λ λ and λ are the egenvalues of Cov. The vectors (u, u ) T and (u, u ) T represent, respectvely, the orentaton of the two man axes of the real target n the target canddate regon.

13 Because the weght mage s a relable densty dstrbuton functon, the orentaton estmaton of the target provded by matrx U s more relable than that by CAMSHIFT. Moreover, n the CAMSHIFT algorthm, λ and λ were drectly used as the wdth and heght of the target, whch s actually mproper [4, pp. -4]. Next, we present a new scheme to more accurately estmate the wdth and heght of the target. Suppose that the target s represented by an ellpse, for whch the lengths of the sem-major axs and sem-mnor axs are denoted by a and b, respectvely. Instead of usng λ and λ drectly as the wdth a and heght b, t has been shown [4, pp. -4] that the rato of λ to λ can well approxmate the rato of a to b,.e., λ λ ab. Thus we can set a = kλ and b= kλ, where k s a scale factor. Snce we have estmated the target area A, there s π π ( λ )( λ ) ab = k k = A. Then t can be easly derved that Now the covarance matrx becomes ( ) k = A/ πλλ (0) ( ) ( ) a = λ A/ πλ b= λ A/ πλ () u u a 0 u u Cov = u u 0 b u u T () The adjustment of covarance matrx Cov n Eq. () s a key step of the proposed algorthm. It should be noted that the EM-lke algorthm by Zvkovc and Kröse [] estmates teratvely the covarance matrx for each frame based on the mean shft trackng algorthm. Unlke the EM-lke algorthm, our algorthm combnes the area of target,.e., A, wth the covarance matrx to estmate the wdth, heght and orentaton of the target. In Secton 4., we lsted the estmated wdth, heght and orentaton of the synthetc ellpse sequence n Fgure together wth the relatve estmaton error by usng the proposed SOAMST algorthm. It can be seen that the estmaton accuracy s very satsfyng. 3

14 3.5 Determnng the Canddate Regon n Next Frame Once the locaton, scale and orentaton of the target are estmated n the current frame, we need to determne the locaton of the target canddate regon n the next frame. Wth Eq. (), we defne the followng covarance matrx to represent the sze of the target canddate regon n the next frame ( a+δd) 0 Cov = U U 0 ( b+δd) T (3) where Δ d s the ncrement of the target canddate regon n the next frame. The poston of the ntal target canddate regon s defned by the followng ellpse regon (x y ) Cov (x y ) (4) T 3.6 Implementaton of the SOAMST Algorthm Based on the above analyses n sub-sectons 3. ~ 3.5, the scale and orentaton of the target can be estmated and then a scale and orentaton adaptve mean shft trackng algorthm,.e. the SOAMST algorthm, can be developed. The mplementaton of the whole algorthm s summarzed as follows. Algorthm of Scale and Orentaton Adaptve Mean Shft Trackng (SOAMST) ) Intalzaton: calculate the target model ˆq and ntalze the poston y 0 of the target canddate model n the prevous frame. ) Intalze the teraton number k 0. 3) Calculate the target canddate model ˆp(y 0) n the current frame. 4) Calculate the weght vector { w } = usng Eq. (8). n 5) Calculate the new poston y of the target canddate model usng Eq. (0). 6) Let d y y 0, y0 y. Set the error threshold ε (default 0.) and the maxmum Iteraton number N (default 5). 4

15 If ( d<ε or k N) Stop and go to step 7; Otherwse k k+ and go to step 3. 7) Estmate the wdth, heght and orentaton from the target canddate model usng Eq. (). 8) Estmate the ntal target canddate model for next frame usng Eq. (4). 4. Expermental Results Ths secton evaluates the proposed SOAMST algorthm n comparson wth the orgnal mean shft algorthm,.e., mean shft trackng wth a fxed scale, the adaptve scale algorthm [9] and the EM-shft algorthm 4 [, 5]. The adaptve scale algorthm and the EM-shft algorthm are two representatve schemes to address the scale and orentaton changes of the targets under the mean shft framework. Because the weght mage estmated by CAMSHIFT s not relable, t s prone to errors n estmatng the scale and orentaton of the object. So CAMSHIFT s not used n the experments. We selected RGB color space as the feature space and t was quantzed nto bns for a far comparson between dfferent algorthms. It should be noted that other color space such as the HSV color space can also be used n SOAMST. One synthetc vdeo sequence and three real vdeo sequences are used n the experments. The MATLAB source codes and all the expermental results of ths paper can be downloaded n the webste 4. Experments on a Synthetc Sequence We frst use a synthetc ellpse sequence to verfy the effcency of the proposed SOAMST algorthm. As shown n Fgure -(d), the wndow sze of the ntal target (blue ellpse) s 4 We thank Dr. Zvkovc for sharng the code n [5]. 5

16 We select Δ k =0 n the proposed SOAMST algorthm so that the wndow sze of the ntal target canddate regon (red ellpse n Fgure -(b)) s n frame. For other frames n the SOAMST results, the external ellpses represent the target canddate regons, whch are used to estmate the real targets,.e., the nner ellpses. The expermental results show that the proposed SOAMST algorthm could relably track the ellpse wth scale and orentaton changes. Meanwhle, the expermental results by the fxed-scale mean shft s not good because of sgnfcant scale and orentaton changes of the object. The adaptve scale algorthm does not estmate the target orentaton change and has bad trackng results. The EM-shft algorthm fals to correctly estmate the scale and orentaton of the synthetc ellpse, although the target n ths sequence s very smple. (a) The fxed-scale mean shft trackng algorthm (b) Adaptve scale algorthm (c) The EM-shft algorthm (d) The proposed SOAMST algorthm Fg. : Trackng results of the synthetc ellpse sequence by dfferent trackng algorthms. The red ellpses represent the target canddate regon whle the blue ellpse represents the estmated target regon. The frames, 0, 30, 40, 50, 70 are dsplayed. Table lsts the estmated wdth, heght and orentaton of the ellpse n ths sequence by 6

17 usng the SOAMST scheme. The orentaton s calculated as the angle between the major axs and x-axs. The frst frame of the sequence was used to defne the target model and the rest frames were used for testng. It can be seen that the proposed SOAMST method acheves good estmaton accuracy of the scale and orentaton of the target. Table. The estmaton result and accuracy of the wdth, heght and orentaton of the ellpse by the proposed SOAMST method. Sem-major length a Sem-mnor length b Orentaton Frame Real Estmated Error Real Estmated Error Real Estmated Error no. length length (%) length length (%) angle angle (%) Average error over 7 frames Experments on Real Vdeo Sequences The proposed SOAMST algorthm s then tested by usng three real vdeo sequences. The frst vdeo s a palm sequence (Fgure 3) where the object has clearly scale and orentaton changes. Nether the fxed-scale mean shft algorthm nor the adaptve scale algorthm acheves good trackng results. On the other hand, we see that both EM-shft and SOAMST track the palm well n the sequence. However, when the palm s movng fast, such as n frames 7 and 94, the estmated target scale and orentaton by EM-shft are not as accurate as those by the SOAMST algorthm. The second vdeo s a car sequence where the scale of the object (a whte car) ncreases gradually as shown n Fgure 4. The expermental results show that the proposed SOAMST algorthm estmates more accurately the scale changes than the adaptve scale and the EM-shft algorthms. 7

18 (a) The fxed-scale mean shft trackng algorthm (b) Adaptve scale algorthm (a) The EM-Shft algorthm (b) The proposed SOAMST algorthm Fg. 3: Trackng results of the palm sequence by dfferent trackng algorthms. The frames 0, 7, 94, and 40 are dsplayed. (a) Adaptve scale algorthm (b) The EM-Shft algorthm (c) The proposed SOAMST algorthm Fg. 4: Trackng results of the car sequence by dfferent trackng algorthms. The frames 5, 40, 60 and 75 are dsplayed. 8

19 The last experment s on a more complex sequence of walkng man. The object exhbts large scale changes wth partal occluson. To save space we only show the results by EM-shft and SOAMST here. As can be seen n Fgure 5, both EM-shft and SOAMST algorthm can track the target over the whole sequence. However, the SOAMST scheme works much better n estmatng the scale and orentaton of the target, especally when occluson occurs. (a) The EM-shft algorthm (b) The proposed SOAMST algorthm Fg. 5: Trackng results of the walkng man sequence wth occluson by the EM-shft and SOAMST algorthms. The frames 0, 60, 0 and 50 are dsplayed. Table 3. The average number of teratons by dfferent methods on the four sequences. Methods Fxed-scale Adaptve mean shft scale EM-shft SOAMST Synthetc ellpse Palm sequence Car sequence Walkng-man sequence Table 3 lsts the average numbers of teratons by dfferent schemes on the four vdeo sequences. The average number of teratons of the proposed SOAMST s approxmately equal to that of the orgnal mean shft algorthm wth fxed scale. The teraton number of the adaptve scale algorthm s the hghest because t runs mean shft algorthm three tmes. The man factors whch affect the convergence speed of the EM-shft and the SOAMST algorthms are the computaton of the covarance matrx. EM-shft estmates t n each teraton whle 9

20 SOAMST only estmates t once for each frame. So SOAMST s faster than EM-shft. To better evaluate the competng methods, n Table 4 we lst the mean localzaton errors (MLE) and the true area ratos (TAR) by the three trackers on the three real vdeo sequences, palm, car and walkng man. The TAR s defned as the rato of the overlapped area between the trackng result and ground truth to the area of ground truth. The MLE and TAR are closely related to scale and orentaton estmaton of the target beng tracked. Table 4 shows that the proposed SOAMST method acheves the best performance among the three trackng methods. Table 4. The MLE and TAR values by the competng trackng methods. Method Adaptve scale EM-shft SOAMST MLE TAR MLE TAR MLE TAR Palm % % % Car % % % Walkng man % % % In general, the proposed SOAMST algorthm, whch s motvated by the CAMSHIFT algorthm [6], extends the mean shft algorthm when the target has large scale and orentaton varatons. It nherts the smplcty and effectveness of the orgnal mean shft algorthm whle beng adaptve to the scale and orentaton changes of the target. 5. Conclusons By analyzng the moment features of the weght mage of the target canddate regon and the Bhattacharyya coeffcents, we developed a scale and orentaton adaptve mean shft trackng (SOAMST) algorthm. It can well solve the problem of how to estmate robustly the scale and orentaton changes of the target under the mean shft trackng framework. The weght of a pxel n the canddate regon represents ts probablty of belongng to the target, whle the zero th order moment of the weghts mage can represent the weghted area of the canddate 0

21 regon. By usng the zero th order moment and the Bhattacharyya coeffcent between the target model and the canddate model, a smple and effectve method to estmate the target area was proposed. Then a new approach, whch s based on the area of the target and the corrected second order center moments, was proposed to adaptvely estmate the wdth, heght and orentaton changes of the target. The proposed SOAMST method nherts the merts of mean shft trackng, such as smplcty, effcency and robustness. Extensve experments were performed and the results showed that SOAMST can relably track the objects wth scale and orentaton changes, whch s dffcult to acheve by other state-of-the-art schemes. In the future research, we wll focus on how to detect and use the true shape of the target, nstead of an ellpse or a rectangle model, for a more robust trackng. References [] Kalath T.: The Dvergence and Bhattacharyya Dstance Measures n Sgnal Selecton, IEEE Trans. Communcaton Technology, 967, 5, (), pp [] Fukunaga F., Hostetler L. D.: The Estmaton of the Gradent of a Densty Functon, wth Applcatons n Pattern Recognton, IEEE Trans. on Informaton Theory, 975,, (), pp [3] Cheng Y.: Mean Shft, Mode Seekng, and Clusterng, IEEE Trans on Pattern Anal. Machne Intell., 995, 7, (8), pp [4] Mukundan R., Ramakrshnan K. R.: Moment Functons n Image Analyss: Theory and Applcatons, World Scentfc, Sngapore, 996. [5] Wren C., Azarbayejan A., Darrell T., Pentland A.: Pfnder: Real-Tme Trackng of the Human Body,IEEE Trans. Pattern Anal. Machne Intell., 997, 9, (7), pp [6] Bradsk G.: Computer Vson Face Trackng for Use n a Perceptual User Interface, Intel Technology Journal, 998, (Q), pp. -5. [7] Comancu D., Ramesh V., Meer P.: Real-Tme Trackng of Non-Rgd Objects Usng Mean

22 Shft. Proc. IEEE Conf. on Computer Vson and Pattern Recognton, Hlton Head, SC, June, 0, vol., pp [8] Comancu D., Meer P.: Mean Shft: a Robust Approach toward Feature Space Analyss, IEEE Trans Pattern Anal. Machne Intell.,, 4, (5), pp [9] Comancu D., Ramesh V., Meer P.: Kernel-Based Object Trackng, IEEE Trans. Pattern Anal. Machne Intell., 3, 5, (), pp [0] Collns R.: Mean-Shft Blob Trackng through Scale Space, Proc. IEEE Conf. Computer Vson and Pattern Recognton, Wsconsn, USA, 3, pp [] Zvkovc Z., Kröse B.: An EM-lke Algorthm for Color-Hstogram-Based Object Trackng, Proc. IEEE Conf. Computer Vson and Pattern Recognton, Washngton, DC, USA, 4, vol., pp [] Yang C., Raman D., Davs L.: Effcent Mean-Shft Trackng va a New Smlarty Measure, Proc. IEEE Conf. Computer Vson and Pattern Recognton, San Dego, CA, 5, vol., pp [3] Fashng M., Tomas C.: Mean Shft s a Bound Optmzaton, IEEE Trans. Pattern Anal. Machne Intell., 5, 7, (3), pp [4] Ylmaz A., Javed O., Shah M.: Object Trackng: a Survey, ACM Computng Surveys, 6, 38, (4), Artcle 3. [5] Carrera-Perpnan M. A. Gaussan Mean-Shft s an EM Algorthm, IEEE Trans. Pattern Anal. Machne Intell., 7, 9, (5), pp [6] Brchfeld S., Rangarajan S.: Spatograms versus hstograms for regon-based trackng, Proc. IEEE Conf. on Computer Vson and Pattern Recognton, 5, vol., pp , 5. [7] Hu J., Juan C., Wang J.: A spatal-color mean-shft object trackng algorthm wth scale and orentaton estmaton, Pattern Recognton Letters, 8, 9, (6), pp [8] Srkrshnan V., Nagaraj T., Chaudhur S.: Fragment Based Trackng for Scale and Orentaton Adapton, Proc. Indan Conf. on In Computer Vson, Graphcs & Image Processng, 8, pp [9] Lnderberg T.: Feature Detecton wth Automatc Scale Selecton, Internatonal Journal of

23 Computer Vson. 998, 30, (), pp [0] Bretzner L., Lndeberg T.: Qualtatve Mult-Scale Feature Herarches for Object Trackng, Journal of Vsual Communcaton and Image Representaton, 0,, (), pp.5-9. [] Nummaro K., Koller-Meer E., Gool L. V.: An Adaptve Color-Based Partcle Flter, Image and Vson Computng, 3,, (), pp [] Horn R. A., Johnson C. R., Topcs n Matrx Analyss, Cambrdge Unversty Press, U.K., 99. [3] Quast K., Kaup A.: Scale and Shape adaptve Mean Shft Object Trackng n Vdeo Sequences, Proc. European Sgnal Processng Conference, Glasgow, Scotland, 9, pp [4] Collns R.: Lecture on Mean Shft, [5] Zvkovc Z.: EM-shft code, 3

Robust Mean Shift Tracking with Corrected Background-Weighted Histogram

Robust Mean Shift Tracking with Corrected Background-Weighted Histogram 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

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

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

Reducing Frame Rate for Object Tracking

Reducing 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 information

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 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

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

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

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

An Image Fusion Approach Based on Segmentation Region

An 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 information

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD

OBJECT 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 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

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-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 information

Object Contour Tracking Using Multi-feature Fusion based Particle Filter

Object 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 information

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping. SIGGRAPH 004 Interactve Image Cutout Lazy Snappng Yn L Jan Sun Ch-Keung Tang Heung-Yeung Shum Mcrosoft Research Asa Hong Kong Unversty Separate an object from ts background Compose the object on another

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

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

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

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

Target Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c

Target 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 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

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

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-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 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

A Robust Method for Estimating the Fundamental Matrix

A 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 information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. 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 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

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: 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 information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive 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 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

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. 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 information

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-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 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

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

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

Robust visual tracking based on Informative random fern

Robust 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 information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

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

PCA Based Gait Segmentation

PCA Based Gait Segmentation Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton PCA Based Gat Segmentaton Honggu L, Cupng Sh, and Xngguo L 2 Electronc Department, Physcs College, Yangzhou Unversty, 225002 Yangzhou, Chna 2 Department

More information

A Deflected Grid-based Algorithm for Clustering Analysis

A 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 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

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

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

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-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 information

Unsupervised Learning

Unsupervised 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 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

A fast algorithm for color image segmentation

A 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 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

Multi-View Face Alignment Using 3D Shape Model for View Estimation

Multi-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 information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS

EYE 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 information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum 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 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

A Study on the Application of Spatial-Knowledge-Tags using Human Motion in Intelligent Space

A Study on the Application of Spatial-Knowledge-Tags using Human Motion in Intelligent Space A Study on the Applcaton of Spatal-Knowledge-Tags usng Human Moton n Intellgent Space Tae-Seok Jn*, Kazuyuk Moroka**, Mhoko Ntsuma*, Takesh Sasak*, and Hdek Hashmoto * * Insttute of Industral Scence, the

More information

Improved SIFT-Features Matching for Object Recognition

Improved 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 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

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

Image Alignment CSC 767

Image 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 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

CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES

CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES Marco A. Chavarra, Gerald Sommer Cogntve Systems Group. Chrstan-Albrechts-Unversty of Kel, D-2498 Kel, Germany {mc,gs}@ks.nformatk.un-kel.de

More information

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Learning a Class-Specific Dictionary for Facial Expression Recognition

Learning 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 information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

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

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Recognizing Faces. Outline

Recognizing Faces. Outline Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &

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

Integrated Expression-Invariant Face Recognition with Constrained Optical Flow

Integrated 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 information

Fitting: Deformable contours April 26 th, 2018

Fitting: 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 information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

Straight Line Detection Based on Particle Swarm Optimization

Straight 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 information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An 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 information

Calibration of an Articulated Camera System with Scale Factor Estimation

Calibration of an Articulated Camera System with Scale Factor Estimation Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and

More information

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Shape 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 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

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval

Fuzzy 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 information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A 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 information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

Simultaneously Fitting and Segmenting Multiple- Structure Data with Outliers

Simultaneously 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 information

Clustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b

Clustering 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 information

Wireless Sensor Network Localization Research

Wireless Sensor Network Localization Research Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,

More information

Brushlet Features for Texture Image Retrieval

Brushlet Features for Texture Image Retrieval DICTA00: Dgtal Image Computng Technques and Applcatons, 1 January 00, Melbourne, Australa 1 Brushlet Features for Texture Image Retreval Chbao Chen and Kap Luk Chan Informaton System Research Lab, School

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/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 information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A 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 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

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

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

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

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