Combining Multiresolution Shape Descriptors for 3D Model Retrieval

Size: px
Start display at page:

Download "Combining Multiresolution Shape Descriptors for 3D Model Retrieval"

Transcription

1 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, Combnng Multresoluton Shape Descrptors for 3D Model Retreval Ryuatrou Ohbuch Unversty of Yamanash Takeda, Kofu-sh , Yamanash-ken, Japan Yushn Hata Unversty of Yamanash Takeda, Kofu-sh , Yamanash-ken, Japan ABSTRACT In ths paper, we propose and evaluate a systematc approach for mprovng performance of 3D model retreval by combnng multple shape descrptors. We explored two approaches for generatng multple, mutually ndependent, shape descrptors; (1) applcaton of a (sngle-resoluton) shape descrptor on a set of multresoluton shape models generated from a query 3D shape model, and (2) applcaton of multple, heterogeneous shape descrptors on the query 3D shape model. The shape descrptors are ntegrated va the lnear combnaton of the dstance values they produce, usng ether fxed or adaptve weghts. Our experment showed that both multresoluton and heterogeneous sets of shape descrptors are effectve n mprovng retreval performance. For example, by usng the multresoluton approach, the R-precson of the SPRH shape descrptor by Wahl, et al, mproved by 8%, from 29% to 37%. A combnaton of three heterogeneous shape descrptors acheved the R-precson of about 42%; ths fgure s about 5% better than the R-precson of 38% acheved by the Lght Feld Descrptor by Chen, et al., whch s arguably the best sngle shape descrptor reported to date. Keywords 3D model database, content-based retreval, geometrc modelng, multresoluton analyss, feature combnaton. 1. INTRODUCTION 3D shape models are ncreasngly popular n many applcaton domans, rangng from move specal effects, 3D games on cellular phones or on game consoles, to 3D mechancal CAD/CAE systems. The popularty has prompted research nto effectve management and reuse of 3D shape models by means of shape-based retreval of 3D models. An example of such database s the 3D Search engne at the Prnceton Unversty [Funkhouser03]. Typcal steps for shape smlarty based retreval of 3D models starts wth query specfcaton (See Fgure 1.) As queres, texts, 2D sketches, 2D mages, 3D sketches, and 3D shapes have been used n the past. Multple query specfcaton methods may be Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, or republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. Conference proceedngs ISBN WSCG 2006, January 30-February 3, 2006 Plzen, Czech Republc. Copyrght UNION Agency Scence Press combned, as n the work of Funkhouser et al [Funkhouser03]. The next step s to extract feature, or shape descrptor (SD), from the query. Also, as a pre-computng step, SDs for 3D shape models n the database have been computed. The queryng method and the 3D shape representaton used for the database nfluences the shape descrptor and the smlarty (or more often, dstance) computaton method. Durng the dstance computaton, t s often desrable to reflect human judgment. The database retreves and presents the models most smlar to the query based on the dstances computed.... 3D models... Query Response Preprocessng Compute shape descrptor Compute shape descrptor Compute dstance Fgure 1. A typcal 3D model database system. Features vector 3D models database

2 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, In ths paper, we explore an approach to boost shape smlarty retreval performance of a 3D model database by extractng more features from shape models. Our method uses two method to try to extract more shape feature from a query 3D model; (1) extracton of a multresoluton set of features by applyng a SD to the models havng multple resoluton levels generated by usng the method by Ohbuch, et al [Ohbuch03], and (2) extracton of a heterogeneous set of features by applyng multple, heterogeneous SDs to the model. Multple SDs are ntegrated va dstance value they produce by usng lnear combnaton, whch allows ntegraton of features that does not explctly produce feature vectors, namely, the Lght Feld Descrptor (LFD) [Chen03] by Chen, et al. Integraton of a set of dstances are done through ether fxed weght lnear combnaton of dstances, or knowledge based adaptve weght lnear combnaton of dstances. The latter s a modfcaton of the purty based method of Bustos, et al. [Bustos04a, Bustos04b]. Our experments showed that the multresoluton approach boosted performances of many, but not all, of the SDs we tested. Combnatons of multresoluton, heterogeneous shape descrptors produced the best performance of the combnatons we tested. For example, one of the combnatons produced R-precson of 42%, whch s about 5% hgher than the 38% acheved by the LFD by Chen, et al., whch s one of the best performng SDs accordng to Tangelder, et al. [Tangelder04]. Ths paper s organzed as follows. In the followng secton, we revew the prevous ntegrate features for 3D model retreval. In Secton 3, we descrbe the method to compute multresoluton SDs, and the method to ntegrate multple SDs by ther dstance values. A set of performance evaluaton experments and ther results are descrbed n Secton 4. We conclude the paper n Secton Prevous Work In the feld of content based search and retreval of 2D mages, t s typcal to extract more than one feature from an mage, and combne these features for an overall smlarty comparson. Thus t s natural to thnk of such an approach for the 3D model retreval. Ths approach has been taken by several groups; Iyer, et al. [Iyer03], Bustos et al [Bustos04a, Bustos04b], and Atmosukarto, et al. [Atmosukarto05]. Iyer et al. weghted and combned multple heterogeneous feature vectors, lettng the user control the weghts explctly through a user nterface or mplctly through a relevance feedback mechansm that employs nteractve learnng. The method by Atmosukarto et al. also weghted and combned heterogeneous feature vectors. Ther experments showed that combnatons of descrptors have better performance than any sngle shape descrptor they evaluated. Unlke the former two, the method by Bustos et al. ntegrated multple, heterogeneous features va dstance. Bustos computed the overall dstance between a par of models as a lnear combnaton of the dstances usng ether fxed or adaptve weghts. In the fxed weght combnaton, weghts are the same regardless of the model (or the model category.) In the adaptve weghts combnaton, weghts are computed by usng purty, whch s an estmate of the performance of the SD determned by usng a pre-classfed tranng database. Bustos et al. reported sgnfcant performance gan usng both fxed weght and adaptve weght lnear combnaton of dstances, although the adaptve one performed better. Integraton of multple shape descrptors can be acheved usng ether (1) feature vectors of the descrptors, f avalable (the approach by Iyer et al. and Atmosukarto, et al.), or (2) dstance values computed usng the descrptors (the approach by Bustos et al.). Integraton usng feature vectors potentally allows fne tunng of dstance computaton, e.g., by weghtng each element of the vectors. However, ths approach can t be used f a shape descrptor produces dstance but not feature vector. For example, one of the most powerful 3D shape descrptors, the LFD by Chen et al. [Chen03] produces dstance only, and s useful only for dstance based ntegraton. Fndngs by Atmosukarto et al. and by Bustos et al. are contradctory regardng whether the shape descrptor should be combned as feature vectors or as dstances. Atmosukarto reported that a combnaton of dstances does not produce any performance mprovement. Bustos et al., on the other hand, reported that combnatons of dstances are benefcal. Our fndng reported n ths paper agrees wth that of Bustos et al. 3. METHOD In ths secton, we descrbe the method to compute multresoluton shape descrptors and the method to combne multple shape descrptors by ther dstance values Computng multple shape descrptors To mprove retreval performance through feature ntegraton, features should capture as dfferent shape feature of the model as possble. Our method uses the

3 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, followng two dfferent approaches to extract mutually ndependent shape descrptors. 1. Multresoluton approach: Generate a set of multresoluton (MR) shape models from a model to be compared. A (sngle-resoluton) shape descrptor s appled to the MR shape models to produce multple SDs. 2. Heterogeneous shape descrptor approach: Apply multple shape descrptors to the model to be compared. A combnaton of the two approaches above s also possble. For example, an MR representaton havng m levels may be combned wth n heterogeneous shape descrptors to produce m n shape descrptors Multresoluton shape descrptors The method by Ohbuch, et al. [Ohbuch03] compares 3D models at multple scales followng the steps below: 1. Compute a multresoluton representaton: The surface-based nput model s converted nto a pont-based model by Monte-Carlo samplng of the surfaces of the model. A set of L-1 scale values α ι, =1 L-1 s computed based on the sze of the model. The set of scale values are used to normalze sze among shape models. Then, compute L-1 3D alpha shapes from the pont set model by usng the L-1 scale values α. ι Of L shape features, those of the coarser (L-1) levels are computed by usng the 3D alpha shapes [Edelsbrunner94]. For the fnest resoluton level L, however, the orgnal, polygon soup model s used. Ohbuch et al calls ths set of multresoluton models Alpha- Multresoluton Representaton (AMR). 2. Compute multresoluton shape descrptors: Apply a shape descrptor x to a model at each resoluton level of the AMR, creatng a set of multresoluton shape descrptors AMR-x. 3. Compute dstance between a par of features: Compute a dstance between AMR-x shape descrptors of a par of models to be compared, usng a statcally weghted lnear combnaton of L dstances. An advantage of the AMR above s that t can be computed for polygon soup models or even for pont set models (wthout the step 1 above.) Fgure 3 shows an example of AMR representaton for a surface-based 3D model of rabbt. The AMR s remnscent of morphologcal multresoluton representatons for 2D mages. Orgnal model (surface-based) Generate pont-set Pot set model Compute α-shapes α values α ι at level computed based on the dameter of the model. Level 6 model = orgnal AMR Level = Compute feature x AMR-x shape-descrptor Level = Fgure 2. Computng the AMR-x multresoluton shape feature. A surface based model and ts pont set representaton usng 2,048ponts. Level 1(α 1 ) Level 2(α 2 ) Level 3(α 3 ) Level 4(α 4 ) Level 5(α 5 ) Level 6( org.) Fgure 3. An example of AMR representaton for the surface-based model of a rabbt Heterogeneous shape descrptors As the heterogeneous shape descrptors, we used the D2 by Osada, et al.[osada02], the AAD by Ohbuch et al. [Ohbuch05], the SPRH by Wahl, et al. [Wahl03], and the LFD by Chen, et al. [Chen03]. The D2 s a 1-dmensonal (1D) hstogram of dstances between every par of ponts generated on surfaces of a model. The AAD and the SPRH are both extensons to the D2 above. In addton to the

4 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, dstance used n the D2, the AAD and the SPRH extract such features as the mutual orentaton of the par of ponts, resultng n a 2D hstogram for the AAD and a 4D hstogram for the SPRH. The LFD by Chen, et al. s dfferent from all of the above. It compares smlartes of a set of mages generated from multple vewponts about the 3D model. Accordng to the survey paper by Tangelder et al. [Tangelder04], the LFD s by far the most powerful shape descrptor. 3.2 Integratng multple shape descrptors In combnng dstances produced by shape descrptors, our method normalzes the dstances frst, and then computes a weghted lnear combnaton of the dstances Normalzaton Pror to ntegratng dstances, the dstances are normalzed by ther standard devatons. Let U be the set of 3D models n the database, and o U be the model from the database, and SD, 1 N be the shape descrptors. For the shape descrptor SD, rhe average μ ( d ) and the standard devaton σ ( d ) are computed for the databaseu. Let d ( q, o ) be the dstance pror to normalzaton computed usng the SD for the model par q and o. Then the normalzed dstance dˆ ( q, o ) for the SD s computed as below. ˆ 1 d( q, o) μ ( d ) d ( q, o) = σ ( d ) (1) Fgure 4 shows examples of hstograms of dstances for the four SDs we have used. The dstance axs s normalzed to ts maxmum dstance value (=100%). It can be seen that the normalzaton usng standard devaton would perform better than the normalzaton usng maxmum dstance. Frequency D2 AAD SPRH LFD Normalzed dstance [%] (max.=100%) Fgure 4. Dstrbuton of dstances for the SDs. Integratng shape descrptors usng normalzed dstance usng the formula (1) above should perform better than our prevous method descrbed n [Ohbuch03], whch employed no dstance normalzaton at all n ntegratng SDs generated by usng the AMR. Also, we expect our normalzaton method usng standard devaton of dstances to be more robust aganst outlers than the normalzaton method usng maxmum dstance employed by Bustos, et al. [Bustos04a] Weghted Lnear Combnaton Our method computes the overall dstance dqo (, ) as the lnear combnaton of N normalzed dstances d ˆ ( q, o ) usng the followng formula. N (, ) ˆ (, ) d q o = wd q o (2) = 1 We compared two dfferent methods to determne the weghts w. fx. 1. Fxed weghtng: weghts w are predetermned and fxed across the query. 2. Adaptve weghtng: weghts w are adaptvely vared accordng to the query and ts (estmated) category. Usng fxed weghts has two drawbacks. One s that the fxed weghts won t produce the best performance across all the classes. Assumng a precategorzed database, the performance of a SD vares dependng on the class the query model (s supposed to) belongs to. That s, for example, one SD s good at queryng human fgures whle another SD s good at queryng arplanes. The other s that expermentally fndng a best set of weghts for a gven set of SDs and a database can be computatonally expensve for a nontrval number of SDs and models. An adaptve weghtng method that adapts to the query model and/or to the class n whch the query model s lkely to belong s qute mportant. For the adaptve weghtng, we adopted Bustos s purty based weghtng scheme [Bustos04a, Bustos04b] wth a few mnor modfcatons. The purty s an estmate of goodness of a SD n characterzng a category n a gven database. The dea behnd the purty s the maxmum nformaton gan crtera for selectng an attrbute n splttng a set n the decson tree learnng algorthm. The purty assumes that the database of the 3D models s preclassfed nto M classes. Let S be the number of k models retreved from a class C k, 1 k M, usng the shape descrptor SD. The purty purty( SD, q, t ) s computed as below for a shape descrptor SD, query q, and a postve nteger constant t.

5 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, k (,, ) max( S ) purty SD q t = (3) 1 k M In other words, the purty for the SD s hgher f the SD returned more model from the category C k n the top t retrevals, regardless of the class. Usng the purty( SD, q, t ), the adaptve weght w between the query q and the 3D model o U s computed as follows. n w = purty( SD, q, t) (4) Bustos, et al. used a slghtly dfferent w. Our verson could have a larger dfference n weghts, dependng on the selecton of the purty power parameter n. w = purty( SD, q, t) 1 (5) In the followng, we call our weghtng method purty* and Bustos s orgnal adaptve weghtng method purty. 4. EXPERIMENTS AND RESULTS We mplemented our own versons of the D2 [Osada02] and the SPRH [Wahl03] shape descrptors. We used our orgnal mplementaton of the AAD [Ohbuch05] shape descrptor. For the LFD [Chan03], we used the executable provded by the orgnal authors of the LFD paper [Chan03] found at ther web ste. In our prevous work [Ohbuch03], we combned the AMR only wth the AAD shape descrptor. In ths work, we combne the AMR approach wth all the four shape descrptors lsted above. For the performance evaluaton experments, we used the Prnceton Shape Benchmark (PSB) [Funkhouser03] database. It contans the total of 1914 models, dvded nto the 907 model tranng set and the 907 model test set. Each set s classfed nto 90+ base classes. We used the most detaled base classfcatons for the experment. As quanttatve measures of performance, we used the R-precson (1R), the 2R-precson (2R), the 11 pont average precson (11P) fgures, and the precson-recall plot [Baeza-Yates99]. The R- precson s the rato, n percentle, of the models retreved from the desred class C k (.e., the same class as the query) n the top R retrevals, n whch R s the sze of the class C k. The 2R-precson s smlar to the R-precson, except that the fgure s computed usng the top 2R retrevals. In computng the R- and 2R-precson values, the query q s not counted as the retreved model. That s, the q s drawn from the database U, the 1R and 2R values are computed by usng Ck 1. The 11-pont average 11P s the average of precson values taken at 11 equally spaced recall values {0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1.0}. A 11P average precson value can be consdered as a summary of the recallprecson plot, whch emphaszes overall performance. The 1R and the 2R values favor methods havng hgher precson for the near the top retrevals Multresoluton shape descrptors In ths experment, we evaluated the effectveness of ntegratng multresoluton shape descrptors. We frst compared the retreval performances of the shape descrptors at dfferent resoluton levels. Interestngly enough, as shown n Table 1, the most detaled models (the orgnal models) may not acheve the hghest retreval scores. In the cases of the D2 (not shown), the AAD, and the SPRH, retreval usng coarser scales (the level 5, and to a lesser degree, the level 4), produced better 1R score than usng level 6 (.e., most detaled) models. For the LFD, however, retreval usng the most detaled models produced the hghest 1R score. A possble explanaton for ths s that the LFD favors shape detals of the models and that the corners and edges of the convex hull models nterfere wth the performance of the shape descrptor. Note also that retreval usng the coarsest level (.e., convex hull) models performed surprsngly well. As shown n Table2 and n Fgure 5, for some of the SDs, combnatons of multresoluton (MR) shape descrptors usng ether the fxed or the adaptve weghts sgnfcantly outperformed ther sngleresoluton (SR) counterparts. In the case of the AAD, 1R fgure mproved by 10% from 24.4% for the SR verson to 34.9% for the MR verson usng the purty* weghtng. The performance of the SPRH ncreased from 28.6% (SR) to 36.6% (MR), approachng the 38.0% of the LFD. The performance of the LFD, however, dd not mprove due to the MR combnaton. Also, adaptve weghtng usng the purty* showed small but consstent advantage over ther fxed weghtng counterparts for all of the four SDs tested. Table 1. R-Precson vares across resoluton levels. As the numbers show, the most detaled model may not be the best choce for retreval. Resoluton R-precson [%] levels D2 AAD SPRH LFD Org=

6 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, Table 2. The multresoluton (MR) versons of D2, AAD, and SPRH outperform ther sngle resoluton (SR) counterparts. Such s not the case for the LFD. SDs Weghts 1R 2R 11P D Fxed, MRD2 Fxed, Adaptve, purty* AAD Fxed, MRAAD Fxed, Adaptve, purty* SPRH Fxed, MRSPRH Fxed, Adaptve, purty* LFD Fxed, MRLFD Fxed, Adaptve, purty* Weghtng methods We compared the performance of the purty* based weghtng for dfferent values of the parameter purty power n n the equaton (2). We also compared the performance of our purty* and the orgnal purty by Bustos, et al. [Bustos04a]. Table 3 shows the performance of the MRLFD- MRAAD-MRSPRH combnaton usng dfferent values of purty power n. In terms of 1R scores, n = 3.0 produced the best 1R performance, and n = 9 produced the best 11P performance. Table 4 compares the Bustos s purty wth our purty* for ther retreval performance. In all the combnatons tested, our purty* usng the selected parameter n performed better than the orgnal purty of Bustos et al. Our purty* performed better probably because the weght can have a larger dynamc range. As a dsadvantage, our scheme requres a search for the bester value n, although the search should be relatvely easy for t s a 1D search space. Table 3. Effects of purty power n on the retreval performance for the MRLFD-MRAAD-MRSPRH combnaton. N 1R 2R 11A Bustos s purty Purty* Purty* Purty* Purty* Purty* Table 4. Comparson of retreval performance between Bustos s purty v.s. our purty*. Descrptors Weghts 1R 2R 11P MRAAD purty purty* n= MRSPRH purty purty* n= SPRH-AAD purty purty* n= LFD-AAD purty purty* n= LFD-SPRH purty purty* n= LFD-SPRH- purty AAD purty* n= Combnaton of heterogeneous shape descrptors In ths experment, we compared the performance of ntegrated SDs usng both multresoluton and heterogeneous combnatons of varous SDs. Table 5 summarzes the experment. In all the results lsted, we used the purty* adaptve weghtngs. In each combnaton, a best performng parameter n s chosen out of the 10 canddates values of n={1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0}. The Fgure 6 shows the recall-precson plot of fve combnatons selected from the Table 5. Table 5 and Fgure 6 clearly show that combnng multple, heterogeneous shape descrptors va dstances could produce sgnfcant performance gan compared to any one of the sngle resoluton SDs. As a reference, the LFD has the 1R precson of 38%. The combnaton of LFD, AAD, and SPRH produced nearly 5% performance gan over that of the LFD, resultng n the 1R precson of 42.5%. Table 5. Performance comparson of some of the combnatons tested usng both heterogeneous and multresoluton shape descrptors. All the combnatons used the purty* adaptve weghtng. Shape descrptors 1R 2R 11P LFD SPRH MRSPRH SPRH+AAD MRSPRH+MRAAD LFD+AAD LFD+MRAAD LFD+SPRH LFD+MRSPRH LFD+AAD+SPRH LFD+MRAAD+MRSPRH MRLFD+MRAAD+MRSPRH

7 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, On the other hand, combnatons of the LFD wth the MR shape descrptors dd not produce consstent and sgnfcant performance gan. The reason for ths may be attrbuted to the AMR model, the purty* adaptve weghtng scheme, or both. Further study s needed to determne the exact cause. 5. CONCLUSION AND FUTURE WORK In ths paper, we explored a systematc approach for mprovng shape-based retreval performance of 3D shape models. Our approach s to (1) extract as many (mutually ndependent) shape features as possble, and (2) combne the dstances computed usng these features by usng an adaptve weghtng scheme. To extract dfferent shape features, the method employed a combnaton of multresoluton shape descrptors and heterogeneous shape descrptors. We used the 3D alpha-shape [Edelsbrunner94] based method we have proposed prevously [Ohbuch03] to capture multresoluton shape features. To combne dstances computed usng these shape descrptors, we adopted Bustos s purty weghtng scheme wth slght modfcaton. Experments showed that the proposed method of ntegratng multresoluton and heterogeneous shape descrptors s effectve n mprovng retreval performance. Many combnatons of the shape descrptors we tested surpassed the performance of the arguably the best (sngle) shape descrptor, the Lght Feld Descrptor by Chen, et al. [Chen03]. We ntend to explore better adaptve weghtng schemes and better multresoluton shape feature extracton approaches. 6. ACKNOWLEDGMENTS Ths research s funded, n part, by the Grants-n-Ad for Scentfc Research from the Japan Socety for the Promoton of Scence (No ). 7. REFERENCES [Atmosukarto05] I. Atmosukarto, W.K. Leow, Z. Huang, Feature Combnaton and Relevance Feedback for 3D Model Retreval, Proc. MMM 2005, pp , (2005). [Bustos04a] B. Bustos, D. Kem, D. Saupe, T. Schreck, D. Vranć, Automatc Selecton and Combnaton of Descrptors for Effectve 3D Smlarty Search, Proc. IEEE MCBAR'04, pp , (2004). [Bustos04b] B. Bustos, D. Kem, D. Saupe, T. Schreck, D. Vranć, Usng Entropy Impurty for Improved 3D Object Smlarty Search, Proc. IEEE ICME 2004 (2004). [Chen03] D.-Y. Chen, X.-P. Tan, Y.-T. Shen, M. Ouhyoung, On Vsual Smlarty Based 3D Model Retreval, Computer Graphcs Forum, 22(3), pp , (2003). [Edelsbrunner94] H. Edelsbrunner, E. P. Mücke, Three-dmensonal Alpha Shapes, ACM TOG, 13(1), pp , (1994). [Funkhouser03] T. Funkhouser, P. Mn, M. Kazhdan, J. Chen, A. Halderman, D. Dobkn, D. Jacobs, A search engne for 3D models, ACM TOG, 22(1), pp , (2003). [Funkhouser04] Thomas Funkhouser, Mchael Kazhdan, Phlp Shlane, Patrck Mn, Wllam Kefer, Ayellet Tal, Szymon Rusnkewcz, Davd Dobkn, Modelng by ex-ample, ACM TOG, 23(3), pp (2004). [Iyer03] Iyer, N., Kalyanaraman, Y., Lou, K., Jayant, S., Raman, K., A Reconfgurable, Intellgent 3D Engneerng Shape Search System Part I: Shape Representaton, Proc. ASME DETC '03, 23rd CIE Conf. (2003). [Iyer05] M. Iyer, S. Jayant, K. Lou, Y. Kalyanaraman, K. Raman, Three Dmensonal Shape Searchng: State-of-the-art Revew and Future Trends, Computer Aded Desgn, 5(15), pp , [Lefman03] G. Lefman, S. Katz, A. Tal, R. Mer., Sgnatures of 3D Models for Retreval, The 4th Israel-Korea B-Natonal Conf. on Geom. Modelng and Comp. Graph., February 2003, (2003). [Ohbuch05] Ryutarou Ohbuch, Takahro Mnamtan, Tsuyosh Take, Shape-smlarty search of 3D models by usng enhanced shape functons, Internatonal Journal of Computer Applcatons n Technology (IJCAT), 23(3/4/5), pp , (2005). [Ohbuch03] R. Ohbuch, T. Take, Shape- Smlarty Comparson of 3D Shapes Usng Alpha Shapes, Proc. PG 2003, pp , IEEE Press, (2003). [Osada02] R. Osada, T. Funkhouser, B. Chazelle, D. Dobkn, Shape Dstrbutons, ACM TOG, 21(4), pp , (2002). [Shlane04] P. Shlane, P. Mn, M. Kazhdan, T. Funkhouser, The Prnceton Shape Benchmark, Proc. SMI 04, pp , (2004). [Tangelder04] J. Tangelder, R. C. Veltkamp, A Survey of Content Based 3D Shape Retreval Methods, Proc. SMI '04, pp [Wahl03] E. Wahl, U. Hllenbrand, G. Hrznger, Surflet-Par-Relaton Hstograms: A Statstcal 3D-Shape Representaton for Rapd Classfcaton, Proc. 3DIM 2003, pp , IEEE Press, (2003).

8 Ryutarou Ohbuch, Yushn Hata, Combnng Multresoluton Shape Descrptors for 3D Model Retreval, Accepted, Proc. WSCG 2006, Plzen, Czech Republc, Jan. 30~Feb. 3, D2 MRD2 AAD MRAAD SPRH MRSPRH LFD 0.6 Precson Recall Fgure 5. Performance gan due to the multresoluton approach. The multresoluton shape descrptors usng AMR ncreased performance of many but not all of the SDs LFD MRSPRH MRAAD-MRSPRH LFD-MRSPRH LFD-AAD-SPRH 0.6 Precson Recall Fgure 6. Precson-recall plots of some of the combnatons of descrptors. Some of the combnatons sgnfcantly outperform the LFD [Chen03], arguably the best sngle shape descrptor to date.

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

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

More information

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

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

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

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

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

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

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

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

More information

A 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

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

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

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

Optimizing Document Scoring for Query Retrieval

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

More information

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

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

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

Machine Learning: Algorithms and Applications

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

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

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

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

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

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

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

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

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

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

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

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

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

More information

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

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

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

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

Description of NTU Approach to NTCIR3 Multilingual Information Retrieval

Description of NTU Approach to NTCIR3 Multilingual Information Retrieval Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval Wen-Cheng Ln and Hsn-Hs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan

More information

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract

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

The Codesign Challenge

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

More information

Support Vector Machines

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

More information

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

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

Modular PCA Face Recognition Based on Weighted Average

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

Virtual Machine Migration based on Trust Measurement of Computer Node

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

More information

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

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

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

More information

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

Object-Based Techniques for Image Retrieval

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

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines (IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak

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

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

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

More information

Query Clustering Using a Hybrid Query Similarity Measure

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

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

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

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

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

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

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

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

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Relevance Feedback for Image Retrieval

Relevance Feedback for Image Retrieval Vashal D Dhale et al, / (IJCSIT Internatonal Journal of Computer Scence and Informaton Technologes, Vol 4 (2, 203, 39-323 Relevance Feedback for Image Retreval Vashal D Dhale, Dr A R Mahaan, Prof Uma Thakur

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty

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

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

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

Gender Classification using Interlaced Derivative Patterns

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

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

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

More information

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

Dynamic Integration of Regression Models

Dynamic Integration of Regression Models Dynamc Integraton of Regresson Models Nall Rooney 1, Davd Patterson 1, Sarab Anand 1, Alexey Tsymbal 2 1 NIKEL, Faculty of Engneerng,16J27 Unversty Of Ulster at Jordanstown Newtonabbey, BT37 OQB, Unted

More information

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal

More information

Detection of an Object by using Principal Component Analysis

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

More information

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1

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

Sixth Indian Conference on Computer Vision, Graphics & Image Processing

Sixth Indian Conference on Computer Vision, Graphics & Image Processing Sxth Indan Conference on Computer Vson, Graphcs & Image Processng Incorporatng Cohort Informaton for Relable Palmprnt Authentcaton Ajay Kumar Bometrcs Research Laboratory, Department of Electrcal Engneerng

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

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

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

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

Pruning Training Corpus to Speedup Text Classification 1

Pruning Training Corpus to Speedup Text Classification 1 Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan

More information

Efficient Segmentation and Classification of Remote Sensing Image Using Local Self Similarity

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

KIDS Lab at ImageCLEF 2012 Personal Photo Retrieval

KIDS Lab at ImageCLEF 2012 Personal Photo Retrieval KD Lab at mageclef 2012 Personal Photo Retreval Cha-We Ku, Been-Chan Chen, Guan-Bn Chen, L-J Gaou, Rong-ng Huang, and ao-en Wang Knowledge, nformaton, and Database ystem Laboratory Department of Computer

More information

Improving Web Image Search using Meta Re-rankers

Improving Web Image Search using Meta Re-rankers VOLUME-1, ISSUE-V (Aug-Sep 2013) IS NOW AVAILABLE AT: www.dcst.com Improvng Web Image Search usng Meta Re-rankers B.Kavtha 1, N. Suata 2 1 Department of Computer Scence and Engneerng, Chtanya Bharath Insttute

More information

Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques

Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques Enhancement of Infrequent Purchased Product Recommendaton Usng Data Mnng Technques Noraswalza Abdullah, Yue Xu, Shlomo Geva, and Mark Loo Dscplne of Computer Scence Faculty of Scence and Technology Queensland

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

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

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

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

A Novel Similarity Measure using a Normalized Hausdorff Distance for Trademarks Retrieval Based on Genetic Algorithm

A Novel Similarity Measure using a Normalized Hausdorff Distance for Trademarks Retrieval Based on Genetic Algorithm Internatonal Journal of Computer Informaton Systems and Industral Management Applcatons (IJCISIM) ISSN: 50-7988 Vol. (009), pp.3-30 http://www.mrlabs.org/jcsm A Novel Smlarty Measure usng a Normalzed Hausdorff

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

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

From Comparing Clusterings to Combining Clusterings

From Comparing Clusterings to Combining Clusterings Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,

More information

Generalized Team Draft Interleaving

Generalized Team Draft Interleaving Generalzed Team Draft Interleavng Eugene Khartonov,2, Crag Macdonald 2, Pavel Serdyukov, Iadh Ouns 2 Yandex, Russa 2 Unversty of Glasgow, UK {khartonov, pavser}@yandex-team.ru 2 {crag.macdonald, adh.ouns}@glasgow.ac.uk

More information

Supervised Learning in Parallel Universes Using Neighborgrams

Supervised Learning in Parallel Universes Using Neighborgrams Supervsed Learnng n Parallel Unverses Usng Neghborgrams Bernd Wswedel and Mchael R. Berthold Department of Computer and Informaton Scence, Unversty of Konstanz, Germany Abstract. We present a supervsed

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

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,

More information