SELECTION OF THE NUMBER OF NEIGHBOURS OF EACH DATA POINT FOR THE LOCALLY LINEAR EMBEDDING ALGORITHM
|
|
- Angelina Johns
- 5 years ago
- Views:
Transcription
1 ISSN X INFORMATION TECHNOLOGY AND CONTROL, 2007, Vol.36, No.4 SELECTION OF THE NUMBER OF NEIGHBOURS OF EACH DATA POINT FOR THE LOCALLY LINEAR EMBEDDING ALGORITHM Rasa Karbauskatė,2, Olga Kurasova,2, Gntautas Dzemyda,2 Insttute of Mathematcs and Informatcs, Akademjos St. 4, 08663, Vlnus, Lthuana 2 Vlnus Pedagogcal Unversty Studentų St. 39, 0806, Vlnus, Lthuana Abstract. Ths paper deals wth a method, called locally lnear embeddng. It s a nonlnear dmensonalty reducton technque that computes low-dmensonal, neghbourhood preservng embeddngs of hgh dmensonal data and attempts to dscover nonlnear structure n hgh dmensonal data. The mplementaton of the algorthm s farly straghtforward, as the algorthm has only two control parameters: the number of neghbours of each data pont and the regularsaton parameter. The mappng qualty s qute senstve to these parameters. In ths paper, we propose a new way for selectng the number of the nearest neghbours of each data pont. Our approach s expermentally verfed on two data sets: artfcal data and real world pctures. Keywords: locally lnear embeddng; dmensonalty reducton; manfold learnng.. Introducton Data comng from the real world are often dffcult to understand because of ther hgh dmensonalty. A number of dmensonalty reducton technques are proposed, that allow the user to better analyse or vsualze complex data sets. Dmensonalty reducton technques may be dvded nto two classes. In the frst one, there are lnear methods, such as the Prncpal Component Analyss (PCA, [7]), or the classcal scalng ([4, 5]), etc. However, the underlyng structure of real data s often hghly nonlnear and hence cannot be approxmated by lnear manfolds. The second class ncludes nonlnear algorthms, such as nonlnear varants of multdmensonal scalng (MDS) [4, 5], the self-organsng map (SOM) [8], generatve topographc mappng (GTM) [3], prncpal curves and surfaces [6], etc. Several nonlnear manfold learnng methods locally lnear embeddng (LLE) [, 2], Isomap [3], Laplacan Egenmaps [2] have been developed recently. These methods are supposed to overcome the dffcultes experenced wth other classcal nonlnear approaches mentoned above: they are smple to mplement, have a very small number of free parameters, and do not trap local mnma. These algorthms are able to recover the ntrnsc geometrc structure of a broad class of nonlnear data manfolds and come n two flavours: local and global. Local approaches (e.g., LLE, Laplacan Egenmaps) attempt to preserve the local geometry of the data; partcularly, they seek to map nearby ponts on the manfold to nearby ponts n the low-dmensonal representaton. Global approaches (e.g., Isomap) attempt to preserve geometry at all scales, by mappng nearby ponts on the manfold to nearby ponts n a low-dmensonal space, and faraway ponts to faraway ponts. In ths paper, we concentrate on the LLE algorthm. What are the advantages of LLE compared wth PCA and MDS? The dmensonalty reducton by LLE succeeds n dentfyng the underlyng structure of the manfold, whle PCA or MDS methods map faraway data ponts on the manfold to nearby ponts n the plane, falng to dentfy the structure. Unlke MDS, LLE elmnates the need to estmate parwse dstances between wdely separated data ponts. Ths fact s llustrated n Fgure 2, by mappng a nonlnear twodmensonal S-manfold (Fgure ). Fgure. A nonlnear S-manfold consstng of 000 data ponts 359
2 R. Karbauskatė, O. Kurasova, G. Dzemyda a) the result obtaned by LLE b) the result obtaned by PCA c) the result obtaned by MDS Fgure 2. Embeddngs of the S-manfold, obtaned by dfferent methods The man control parameter of the LLE algorthm s the number of neghbours of each data pont. Ths parameter strongly nfluences the results obtaned. We propose here a new way for selectng the number of the nearest neghbours of each data pont and apply LLE to hgh dmensonal data vsualzaton. 2. Locally lnear embeddng method Locally lnear embeddng (LLE) [, 2] s a nonlnear method for dmensonalty reducton and manfold learnng. Gven a set of data ponts dstrbuted on a manfold n a hgh dmensonal space, LLE s able to project the data to a lower space by unfoldng the manfold. LLE works by assumng that the manfold s well sampled,.e., there are enough data, each data pont and ts neghbours le on or close to a locally lnear patch. Therefore, a data pont can be approxmated as a weghted lnear combnaton of ts neghbours. The basc dea of LLE s that such a lnear combnaton s nvarant under lnear transformatons (translaton, rotaton, and scalng) and, therefore, should reman unchanged after the manfold has been unfolded to a low space. The low dmensonal confguraton of data ponts s gven by solvng two constraned least squares optmsaton problems. The nput of the LLE algorthm conssts of m n dmensonal vectors X, =,..., m (X R ). The output conssts of m d dmensonal vectors Y, =,..., m (Y R ). The LLE algorthm has three steps. In the frst step, one dentfes k neghbours of each data pont X. Dfferent crtera for neghbour selecton can be adopted; the smplest possblty s to choose the k -nearest neghbours accordng to the Eucldean dstance. In the second step, one computes the weghts w j d that reconstruct each data pont best from ts neghbours X N (),..., X the followng error functon 2 m k EW ( ) = X wjx N( j), = j= N (k n X ), mnmzng subject to the constrants w j = and w j = 0, f and X j k j= X are not neghbours. Ths s a typcal constraned least squares optmsaton problem, whch can be easly answered by solvng a lnear system of equatons. The thrd step conssts n mappng each data pont X to a low-dmensonal vector Y, whch best preserve hgh-dmensonal neghbourhood geometry represented by the weghts. That s, the weghts are fxed and we need to mnmze the followng functon: 2 m k Φ = Y Y, ( Y) wj N( j) = j= subject to two constrants: = 0 and w j m Y = m T m YY = I, where I s the d d dentty matrx, = those provde a unque soluton. The most straghtforward method for computng the d - dmensonal coordnates ( d < n ) s to fnd the bottom d + egenvectors of the sparse matrx T 2 M = ( I W ) ( I W ), (W = ( wj, w j,..., w m j ), j =,..., k). These egenvectors are assocated wth the d + smallest egenvalues of M. The bottom egenvector, whose egenvalue s closest to zero, s the unt vector wth all equal components and t s dscarded. The remanng d egenvectors form the d embeddng coordnates that are found by LLE. 3. Selecton of the number of the nearest neghbours The most mportant step to success of LLE s the frst step, that s, to defne the number k of the nearest neghbours for each data pont. The mappng qualty s rather senstve to ths parameter. If k s set too small, the contnuous manfold can falsely be dvded nto dsjont sub-manfolds, n ths way, the mappng does not reflect any global propertes (Fgure 3, for example k = 5 ). If k s too hgh, a large 360
3 Selecton of the Number of Neghbours of Each Data Pont for the Locally Lnear Embeddng Algorthm number of the nearest neghbours causes smoothng or elmnaton of small-scale structures n the manfold, the mappng loses ts nonlnear character (Fgure 3, for example k = 00 ) and behaves lke tradtonal PCA (Fgure 2b). k = 5 k = 6 k = 7 k = 8 k = 0 k = 5 k = 20 k = 30 k = 3 k = 40 k = 70 k = 00 Fgure 3. Embeddngs of the 2-dmensonal S-manfold, computed for dfferent choces of the number of the nearest neghbours k by LLE a) m = 000, k = 50 b) m = 2000, k = 50 Fgure 4. Embeddngs of the S-manfolds wth LLE The results of LLE [2] are typcally stable over some range of neghbourhood szes. Fgure 3 shows a range of embeddngs dscovered by the LLE algorthm, all on the same data set, but usng dfferent numbers of the nearest neghbours k. A relable embeddng s obtaned over a wde range of values,.e., k [ 8; 30]. However, as mentoned n [2], the sze of that range depends on varous features of the data, such as the samplng densty and manfold geometry. The dependence of LLE results on samplng densty s shown n Fgure 4. Two 2-dmensonal S-manfolds were nvestgated. One of them conssted of 000 ponts and the other of 2000 ponts. In both cases, embeddngs were computed, as k = 50. LLE faled to unravel the S-manfold of 000 ponts and succeeded n unravelng the manfold of 2000 ponts. If the structure of the manfold s known n advance, we can use a subjectve evaluaton that accompanes a human vsual check. But what can we say about the relablty of the embeddngs computed usng a certan value of the parameter k, when the structure of the manfold s not clear? To estmate the embeddngs, t s necessary to use quanttatve numercal measures. earman s rho or the resdual varance s commonly used for estmatng the topology preservaton wth a vew to reduce dmensonalty. Automatc selecton of the number of the nearest neghbours was proposed n [9]. 36
4 R. Karbauskatė, O. Kurasova, G. Dzemyda 3.. A new way for selectng a proper range of neghbourhood szes As shown n Fgure 3, t s not necessary to fnd the optmal number of the nearest neghbours, but t s enough to estmate a proper range of neghbourhood szes. In ths paper, we propose a new way for solvng ths problem. In order to quanttatvely estmate the topology preservaton, we compute earman s rho. It estmates the correlaton of rank order data,.e., how well the correspondng low-dmensonal projecton preserves the order of the parwse dstances between the hgh-dmensonal data ponts converted to ranks. earman s rho s computed by usng the followng equaton: T ( r () r () ) 6 x y = ρ =, 3 T T where T s the number of dstances to be compared, r x () and r y () are the ranks of the parwse dstances calculated for the orgnal and projected data ponts. ρ. The best value of earman s rho s equal to one. In the calculaton of earman s rho, dstances both on the plane and on a multdmensonal space are used. A queston arses whch dstances should be evaluated when estmatng earman s rho: Eucldean or geodesc? Eucldean dstances are usually used on the plane. On a multdmensonal space, ether the Eucldean or geodesc dstances are appled. Geodesc dstances represent the shortest paths along the curved surface of the manfold. The author n [] states that the Eucldean dstance s not good for fndng the shortest path between ponts wthn the framework of the manfold. The paper [3] states that t s necessary to apply geodesc dstances n order to preserve the global structure of the manfold. It s reasonable to use the Eucldean dstances n case the manfold s flat, therefore n further experments on the plane we wll always evaluate only Eucldean dstances. The S-manfold ( m =000 ) has been nvestgated. The LLE algorthm was run for many tmes gradually ncreasng the number of neghbours k [ 5; 00], each tme calculatng earman s rho (Fgure 5). Two dependences of earman s rho on k have been obtaned: (I) the Eucldean dstances were evaluated n a space, (II) the geodesc dstances were evaluated n a space. Let the number of neghbours be k =00. We see that, when estmatng the Eucldean dstances, the value of earman s rho s near to ( 0.97 ), and when estmatng the geodesc dstances n a space, the value of earman s rho s much lower ( 0.82 ). If k =00, the Eucldean dstances are preserved very well, but the structure of the manfold s destroyed (Fgure 3, k =00 ), and we wshed to preserve t. Ths experment corroborates the fact that t s 2 ndspensable to evaluate geodesc dstances n a space; therefore we wll evaluate only geodesc dstances n our further experments. earman's rho (I) (II) k n LLE Fgure 5. Dependences of earman s rho on k obtaned after vsualzng the S-manfold by LLE: (I) Eucldean dstances were evaluated n a space, (II) geodesc dstances were evaluated n a space Only one parameter s selected n the calculaton algorthm of geodesc dstances the number of the nearest neghbours necessary to draw a graph. Denote t as k. The LLE algorthm also has the same knd geod of parameter, the number of neghbours k. What value of k should t be when calculatng geodesc geod dstances? Should k geod be concdent wth the chosen number of neghbours k n the LLE algorthm? earman's rho (a) (b) k n LLE Fgure 6. Dependences of earman s rho on k obtaned after vsualzng the S-manfold by LLE. Geodesc dstances were evaluated n a space, as (a) k geod = 0, (b) k geod = k In Fgure 6, two dependences of earman s rho on k have been obtaned: (a) when calculatng geodesc dstances n a space, a very small number of neghbours was fxed, e.g., k geod =0, (b) when calculatng geodesc dstances, the number of neghbours was varyng just lke n the LLE algorthm,.e., k geod = k. If k = 00, the value of earman s rho accordng to curve (a) s rather low ( 0.82 ), and the declned curve rses but slghtly. Hence t follows that dstances are badly retaned and the mappng does not 362
5 Selecton of the Number of Neghbours of Each Data Pont for the Locally Lnear Embeddng Algorthm represent the global structure. Curve (b) llustrates that the value of earman s rho approaches ( ). It mples that the LLE result s rather good. However t s obvous that after vsualsng these data by LLE wth k =00, the resultng mappng does not reflect the structure of the manfold (Fgure 3, k =00 ), though the value of earman s rho s close to. The reason why s as follows: f very many neghbours are selected whle calculatng geodesc k geod dstances n a space, then the structure of nonlnear manfold s destroyed,.e., the nearest neghbours to a pont n a space may be the ponts met n the transton across the manfold (Eucldean dstances are calculated when lookng for neghbours). In Fgure, the neghbours of the pont marked by a black crcular dsk fall nto the black crcle. In ths case, the LLE algorthm contans as many neghbours as that for calculatng geodesc dstances: k = k geod (neghbours n the LLE algorthm are found by calculatng Eucldean dstances). Therefore, faraway ponts on the manfold are treated as the close ones both n a space and n a plane. Ths s the reason why the value of earman s rho ncreases wth an ncrease n number of the nearest neghbours. Good embeddngs n Fgure 3 are obtaned when curve (a) n Fgure 6 reaches ts maxmum. Therefore, earman s rho wth fxed rather small k may be used as crteron for geod vsualzaton qualty. 4. Applcaton of LLE n analyss of pcture set One of the applcatons of the LLE method n practce s vsualzaton of the ponts, the coordnates of whch are comprsed of the parameters of pctures. A pcture s dgtsed,.e., a vector conssts of colour parameters of pxels therefore t s of very large dmenson. The partcularty of these data s that, the data are comprsed of pctures of the same object, by turnng the object gradually at a certan angle. In ths way the ponts dffer from one another slghtly, makng up a certan manfold. For an experment uncoloured pctures were used, obtaned by gradually rotatng a ducklng at the 360 angle [0]. The number of pctures (ponts) was m = 72. The mages had grayscale pxels, therefore the dmenson of ponts n a multdmensonal space s n = The LLE algorthm was run for 35 tmes as k 2; 36. Each tme earman s rho was [ ] calculated. Three dependences of earman s rho on k have been shown n Fgure 7: (I), when calculatng geodesc dstances n a space, a very small number of neghbours was fxed, e.g., = 2 ; (II), when k geod calculatng geodesc dstances, the number of neghbours s varyng just lke n the LLE algorthm,.e., k geod = k ; (III) Eucldean dstances were estmated n a space. We see that cases (I) and (II) bear the hghest values of earman s rho,.e., 0.9 ρ 0.97 as k [ 2 ; 8], whle case (III) has much lower values of earman s rho as k [ 2; 8] 0.66 ρ 0.7. For k 9, the values of earman s rho consderably dmnsh ( ρ 0. 54, as k = 9 ) n case (I), n case (II) they decrease a lttle less ( ρ 0.82, as k = 9 ), and n case (III), on the contrary, the values ncrease. Embeddngs, obtaned after vsualsng these data by LLE, are presented n Fgure 8. Snce the object was gradually turned round at the 360 angle, t s lkely that the true representaton s obtaned n Fgure 8a as k [ 2; 8]. Hence t follows that cases (I) and (II) yeld the rght result. Case (I) llustrates an especally explct dfference between these solutons. earman's rho 0,9 0,8 0,7 0,6 0,5 0, k n LLE (I) (II) (III) Fgure 7. Dependences of earman s rho on k obtaned after vsualzng pctures of a rotatng ducklng by LLE: (I) geodesc dstances were evaluated n a space, k geod = 2 ; (II) geodesc dstances were evaluated n a space, k geod = k ; (III) - Eucldean dstances were evaluated n a space a) k = 4 b) k = 9 Fgure 8. 2-dmensonal embeddngs of m = 72 pctures of a rotatng ducklng, obtaned by LLE usng k nearest neghbours. Larger crcles mark representatve samples of pctures : 363
6 R. Karbauskatė, O. Kurasova, G. Dzemyda 5. Conclusons In ths paper, we have explored the LLE algorthm for nonlnear dmensonalty reducton. The man control parameter of LLE s the number of the nearest neghbours of each data pont. Ths parameter greatly nfluences the results obtaned. In ths paper, we propose a new way for selectng the value of ths parameter. In order to quanttatvely estmate the topology preservaton, we compute earman s rho. The experments have shown that the quanttatve measure earman s rho s sutable to estmate the topology preservaton after vsualzng the data by the LLE algorthm. In order that earman s rho properly reflected the projectons obtaned, t s necessary to evaluate the geodesc but not Eucldean dstances when calculatng ts value n an n-dmensonal space by selectng rather a small number of neghbours n the geodesc dstance algorthm. Acknowledgment The authors are very grateful to Dr. Olga Kayo and Dr. Oleg Okun from the Oulu Unversty for ther valuable remarks that allowed us to mprove the qualty of ths paper. The research s partally supported by the Lthuanan State Scence and Studes Foundaton project Informaton technology tools of clncal decson support and ctzens wellness for e.health system (No. B- 0709). References [] C.C. Aggarwal, A. Hnneburg, D.A. Kem. On the surprsng behavor of dstance metrcs n hgh dmensonal space. Lecture Notes n Computer Scence, 973, 200. [2] M. Belkn, P. Nyog. Laplacan egenmaps and spectral technques for embeddng and clusterng. In T.G. Detterch, S. Becker and Z. Ghahraman (eds.), Advances n Neural Informaton Processng Systems 4. MIT Press, 2002 [3] C.M. Bshop, M. Svensén, C.K.I. Wllams. GTM: The generatve topographc mappng. Neural Computaton, 0(): , 998. [4] I. Borg, P. Groenen. Modern multdmensonal scalng. rnger-verlag, Berln, 997. [5] T. Cox, M. Cox. Multdmensonal Scalng. Chapman & Hall, London, 994. [6] T. Haste and W. Stuetzle. Prncpal curves. Journal of the Amercan Statstcal Assocaton, 84: , 989. [7] I.T. Jollffe. Prncpal Component Analyss. rnger- Verlag, New York, 989. [8] T. Kohonen. Self-organzng maps. rnger Seres n Informaton Scences. rnger-verlag, Berln, 995. [9] O. Kouropteva, O. Okun, M. Petkanen. Selecton of the optmal parameter value for the locally lnear embeddng algorthm. Proc. of 2002 Internatonal Conference on Fuzzy Systems and Knowledge Dscovery, 2002, [0] S. A. Nene, S. K. Nayar and H. Murase Columba Object Image Lbrary (COIL-20). Techncal Report CUCS , 996. [] S.T. Rowes and L.K. Saul. Nonlnear dmensonalty reducton by locally lnear embeddng. Scence, 290, 2000, [2] L.K. Saul, S.T. Rowes. Thnk globally, ft locally: Unsupervsed learnng of low dmensonal manfolds. J. Machne Learnng Research, 4, June 2003, [3] J.B. Tenenbaum, V. de Slva, J.C. Langford. A global geometrc framework for nonlnear dmensonalty reducton. Scence, 290, 2000, Receved September
LECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationFeature 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 informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationLaplacian Eigenmap for Image Retrieval
Laplacan Egenmap for Image Retreval Xaofe He Partha Nyog Department of Computer Scence The Unversty of Chcago, 1100 E 58 th Street, Chcago, IL 60637 ABSTRACT Dmensonalty reducton has been receved much
More informationFace 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 informationS1 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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationOut-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering
Out-of-Sample Extensons for LLE, Isomap, MDS, Egenmaps, and Spectral Clusterng Yoshua Bengo, Jean-Franços Paement, Pascal Vncent Olver Delalleau, Ncolas Le Roux and Mare Oumet Département d Informatque
More informationThe Discriminate Analysis and Dimension Reduction Methods of High Dimension
Open Journal of Socal Scences, 015, 3, 7-13 Publshed Onlne March 015 n ScRes. http://www.scrp.org/journal/jss http://dx.do.org/10.436/jss.015.3300 The Dscrmnate Analyss and Dmenson Reducton Methods of
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationRecognizing 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 informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationLearning an Image Manifold for Retrieval
Learnng an Image Manfold for Retreval Xaofe He*, We-Yng Ma, and Hong-Jang Zhang Mcrosoft Research Asa Bejng, Chna, 100080 {wyma,hjzhang}@mcrosoft.com *Department of Computer Scence, The Unversty of Chcago
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationProper 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationSupport 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 informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA Workflow for Spatial Uncertainty Quantification using Distances and Kernels
A Workflow for Spatal Uncertanty Quantfcaton usng Dstances and Kernels Célne Schedt and Jef Caers Stanford Center for Reservor Forecastng Stanford Unversty Abstract Assessng uncertanty n reservor performance
More informationRange 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 informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationSemi-Supervised Discriminant Analysis Based On Data Structure
IOSR Journal of Computer Engneerng (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 3, Ver. VII (May Jun. 2015), PP 39-46 www.osrournals.org Sem-Supervsed Dscrmnant Analyss Based On Data
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationClassifier 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 informationSupervised Nonlinear Dimensionality Reduction for Visualization and Classification
IEEE Transactons on Systems, Man, and Cybernetcs Part B: Cybernetcs 1 Supervsed Nonlnear Dmensonalty Reducton for Vsualzaton and Classfcaton Xn Geng, De-Chuan Zhan, and Zh-Hua Zhou, Member, IEEE Abstract
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationHelsinki 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 informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationFitting & 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 informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More information3D 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 informationLearning-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 informationInfrared face recognition using texture descriptors
Infrared face recognton usng texture descrptors Moulay A. Akhlouf*, Abdelhakm Bendada Computer Vson and Systems Laboratory, Laval Unversty, Quebec, QC, Canada G1V0A6 ABSTRACT Face recognton s an area of
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationComputer 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 informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationUsing 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 informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationAn 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 informationEXTENDED BIC CRITERION FOR MODEL SELECTION
IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7
More informationSimplification of 3D Meshes
Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationThe 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 informationEvaluation of Space Partitioning Data Structures for Nonlinear Mapping
WSCG 2015 Conference on Computer Graphcs, Vsualzaton and Computer Vson Evaluaton of Space Parttonng Data Structures for Nonlnear Mappng Myasnov E.V. Samara State Aerospace Unversty, Image Processng Systems
More informationCorrelative features for the classification of textural images
Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
More informationRECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE
Journal of Theoretcal and Appled Informaton Technology 30 th June 06. Vol.88. No.3 005-06 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 RECOGNIZING GENDER THROUGH FACIAL IMAGE
More informationImage 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 informationWhy visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information
Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationAccounting 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 informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationAPPLIED MACHINE LEARNING
Methods for Clusterng K-means, Soft K-means DBSCAN 1 Objectves Learn basc technques for data clusterng K-means and soft K-means, GMM (next lecture) DBSCAN Understand the ssues and major challenges n clusterng
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationLearning a Locality Preserving Subspace for Visual Recognition
Learnng a Localty Preservng Subspace for Vsual Recognton Xaofe He *, Shucheng Yan #, Yuxao Hu, and Hong-Jang Zhang Mcrosoft Research Asa, Bejng 100080, Chna * Department of Computer Scence, Unversty of
More informationAn 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 informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationHuman Action Recognition Using Dynamic Time Warping Algorithm and Reproducing Kernel Hilbert Space for Matrix Manifold
IJCTA, 10(07), 2017, pp 79-85 Internatonal Scence Press Closed Loop Control of Soft Swtched Forward Converter Usng Intellgent Controller 79 Human Acton Recognton Usng Dynamc Tme Warpng Algorthm and Reproducng
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationData-dependent Hashing Based on p-stable Distribution
Data-depent Hashng Based on p-stable Dstrbuton Author Ba, Xao, Yang, Hachuan, Zhou, Jun, Ren, Peng, Cheng, Jan Publshed 24 Journal Ttle IEEE Transactons on Image Processng DOI https://do.org/.9/tip.24.2352458
More information