Face Recognition Method Based on Within-class Clustering SVM
|
|
- Mark Parrish
- 5 years ago
- Views:
Transcription
1 Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class Clusterng SVM (CCSVM) s presented n ths paper n order to decrease the negatve effect caused by nosy tranng samples n the recognton process. Based on the dscontnuty of fnte samples dstrbuton n the hgh dmenson space and the exstence of nosy samples, frst, we re-cluster samples wthn the class, fnd out the cluster centres to form the vrtual classes, and then dvde vrtual classes of all the classes by SVM. Experment results show that ths method follows the dstrbuton law of ponts n hgh-dmensonal space and can acheve better performance than some tradtonal methods. Keywords - face recognton, wthn-class cluster, support vector machne (SVM) I. INTRODUCTION Face recognton s an mportant research topc n Bometrcs and has already become very hot n the feld of pattern recognton. Many scholars at home and abroad are devoted nto researches n ths feld. Maor statstcal pattern recognton methods nowadays nclude dscrmnant functon method, K-nearest neghbor classfcaton method, non-lnear mappng method and feature analyss method, etc. Support Vector Machne (SVM) [] s the statstcal learnng theory put forward by Vapnk based on structural rsk mnmzaton prncple and t has been appled n classfcaton and regresson problems. SVM method has been pad more and more attenton to because of ts outstandng characterstcs and promsng expermental performance. However, the face samples of the same class present great randomness because of a varety of noses n realty, such as sunlght, postures, etc. Many nosy samples (drty samples) n hgh-dmensonal space dffer greatly from other samples of the same class, so these samples can not be clustered together and show great clusterng dstnctveness. Recent research results show that samples of the same knd n hgh-dmensonal space are located n a non-lnear manfold [-3], however, the lmted number of sample ponts determnes ts dscontnuty, ths s, there are several cluster areas wthn the class n space. Therefore, the key s to determne the cluster center. Up to now, many clusterng methods have been proposed, such as Separaton- Based K-Means [4] algorthm, Densty-Based Spatal Clusterng of Applcaton wth Nose (DBSCAN) [5] algorthm, Bottom-up Clusterng usng Representatve (CURE) [6] algorthm and Grddng-and-Densty-based Clusterng In QUEst(CLIQUE)[7] algorthm. Each method has ts own mert and also has some lmtatons. In ths paper a face recognton method based on wthnclass cluster and SVM s proposed. Ths method s along wth the thnkng of CURE algorthm and the merts of SVM algorthm. Conductng cluster analyss wthn each class, several cluster areas can be found as vrtual classes accordng to ts spatal dstrbuton law and all vrtual classes can be classfed wth SVM classfer. Experments show that ths algorthm acheves satsfactory recognton effect. II. CLUSTER ANALYSIS BASED ON THE COVERAGE AND MERGING Defnton Vrtual center pont: In hgh-dmensonal space, for a pont p and a threshold R, wthn a cluster area determned by p (center) and R (radus) the average of all the ponts s x 0 card( R) card ( R) x l l, where s the lth sample pont, s the dstance between a sample pont and pont p, card ( R) s the pont set satsfyng condton R. Defnton Representatve areas: Each vrtual center pont represents the hyper ball area wth ths pont as the center and R as the radus, so ths area s called representatve area. Defnton 3 Adacent center: Gven radus R, f the dstance of two vrtual ponts p and q satsfes dst ( p, q), then p and q are the adacent centers, where s the merger threshold. The key to cluster analyss s to fnd the cluster center and t can be dvded to three steps: Step, determne coverage radus and merger threshold; Step, search for the canddate cluster centers and elmnate the ones that don t meet the densty requrements; Step 3, merge the adacent canddate centers and decde the fnal cluster center. The threshold radus for the coverage represents the dstrbuton law for the sample ponts n hgh-dmensonal space and can be determned by the analyss for the samples of the same knd. The tranng sample set S wth n tranng x l /08 /$ IEEE CIS 008
2 samples can be dvded nto vrtual tranng set and vrtual testng set S and for each x S,,... n, calculates mn x x, x S,,... m () Radus R for coverage s determned as the average dstance between the vrtual tranng set and all the ponts from the vrtual testng set, so t s shown as: card S R card S () Merger threshold s determned by average dstance between couples of vrtual center ponts and the formula s: { max,..., t, t... t} Where,... t are the dstances between vrtual center ponts and t s the mean vector of all the current vrtual center ponts. After R s determned, cluster centers can be searched out by the followng steps: n () Intalzaton:, ntalze canddate center set as candcenter, set the number of teraton as terate ; () Get sample ponts x, x S from the sample queue of current class; (3) Calculate the Eucldean dstances from x to each present vrtual center ponts center. If R, then x (4). belongs to center t t S (3) s representatve area, else swtch to (4) x becomes the new vrtual center pont and add candcenter nto set. (5) If the sample queue for the current class s not empty, then repeat () to (4), else swtch to (6); (6) Obtan the number num of the sample ponts n the representatve area of every canddate center. If num, then ths vrtual center should be elmnated from candcenter to be an unclassfed sample pont. n n and f n terate, then update vrtual center vector and swtch to (), else swtch to (7); (7) Every unclassfed pont becomes a new vrtual center. If two vrtual center ponts are adacent, then the correspondng representatve areas should be merged, that s to say that all ponts n two representatve areas should be x merged, and then the updated vrtual center ponts wll become fnal cluster centers. III. RECOGNITION METHOD CASED ON WITHIN- CLASS CLUSTERING SVM (CCSVM) The basc prncple of SVM s to map the nput space to hgh-dmensonal space through non-lnear transformaton and get the optmal lnear classfcaton plane accordng to mnmal structure crteron n the new space and ths nonlnear transformaton s completed by defnng proper nnerproduct functon. Suppose the Lnear separable sample set n x, y,... n ( x R, y {, }, and y are class labels), the general form for lnear dscrmnant functon s gx w x b and classfcaton plane equaton s w x b 0. Normalze the dscrmnant functon and for, so the nearest all the samples n two classes make g x sample to the classfcaton plane can x classfcaton margn be g to make the / w, therefore, the maxmum margn means the mnmum w ; Requrng that all samples should be correctly classfed by classfer, ths s: w x b 0,, n y... (4) So the classfcaton plane, whch meets the above mentoned condtons and make w mnmum, s the optmal classfcaton plane. The optmal classfcaton plane problem can be consdered as solvng the constraned optmzaton problem that s restrcted by (4), the mnmum value for the functon s: w w w w (5) Ths can be resolved by Lagrange Multpler Method. For non-lnear problem, all the ponts should be consdered to be mapped nto the hgh-dmensonal space n order to be lnear separable n ths space and only conduct nner-product operaton for lnear dscrmnaton n hgh-dmensonal space. There s no need to know the non-lnear transformaton form, so avodng complcated calculaton n hgh-dmensonal transformaton, the problem s greatly smplfed. Accordng to Hlbert-Schmdt prncple, t can be used as nner-product functon only f one operaton can satsfy Mercer condton. SVM s two-class classfer and for multple-class pattern recognton problem, a combnaton scheme for multple SVM classfers can be appled, such as -a-r multple-class classfcaton [8]. Each class n sample set can be clustered based on the coverage and mergence method proposed n secton II. Correspondng to the multple cluster centers, the samples of the same knd can be dvded to several vrtual
3 classes and all of them can be classfed by SVM. Because of the ncrease of the class numbers, after re-clusterng wthn class, f -a-r method [9] proposed by Knerr s appled, then KK / classfers should be constructed and the decson-makng effcency wll decrease. In order to solve ths problem, for the tranng samples n K vrtual classes, let the sample n the frst class postve and the samples n nd, 3rd,, Kth classes negatve to tran the frst SVM. The th SVM(SVM ) s traned by the samples whch take the th class as postve and the th, th, K th classes as negatve. Fnally takng the sample of K th class as postve and the K th class negatve the K th SVM can be traned to be SVMK. Therefore, for a K -classfcaton problem, effcency for classfcaton can be greatly mproved because only K two-class classfers have to be traned. IV. EXPERIMENTS AND ANALYSIS ORL, Yale and YaleB face database have been appled n the experments so as to prove the valdaton of the algorthm. In order to assure the same dmenson for dfferent tranng samples of each face pattern, face mages for each person are pre-processed and the feature dmenson can be reduced through Prncple Component Analyss (PCA). A. Experment results n ORL database ORL database ncludes mages of 40 dfferent persons and 0 x9 gray mages for each person. Ths database s manly nfluenced by posture and expresson. For ORL database, 40 face patterns are appled and k mages for each person are randomly chosen as tranng samples and the rest for each are tranng samples. 0 k The tradtonal K-nearest neghbor (NN) method, SVM method and CCSVM method put forward n ths paper are appled n the experments, n whch the polynomal kernel Kx, x x x s chosen for kernel functon, and multple-class classfcaton mentoned n Secton III s chosen for SVM and CCSVM methods. We conduct several experments wth dfferent k values and calculate the mean of the testng results under the same k value. The results are shown n Fg.. We can see that wth nsuffcent samples mult-cluster areas are not easy to generate n the same-class-sample because dfferent face samples of the same knd only have tny expresson and pose changes.therefore all the methods used n experment dffer a lttle from each other. Fg. recognton rate n ORL database Experment n ORL database for SVM and CCSVM methods wth dfferent kernel functons when k 0 and k 7 are compared n Table I, n whch polynomal kernel wth d, radus kernel functon and Sgmod kernel x x functon: K( x, x ) exp and 56 bx x K( x, x ) tan c are adopted n the 56 experment, and, b and c are set to 0.3, and respectvely. We can see that CCSVM dsplays better recognton effect on the bass of these kernel functons when compared wth SVM n the ORL database through relatvely small abnormal samples. Tme complexty n the recognton process s also compared and we fnd that t s not sgnfcantly ncreased wth the ncrease of total class numbers and ths proves the feasblty of ths algorthm. TABLE I. COMPARISON FOR RECOGNITION RATE WITH DIFFERENT KERNEL FUNCTION (ORL DATABASE) recognton SVM Runnng tme recognton CCSVM Runnng tme Polynomal Radus bass Sgmod B. Experment results n YALE database In order to test the effectveness of the method, Yale database s used n the experment. YALE face database ncludes mages of 7 dfferent persons and 33 mages for each person. We construct the experment wth 7 face patterns n YALE database and use k mages for tranng and the remanng 33-k mages for testng. Compared wth other databases, face mages n YALE database are nfluenced much more by dfferent llumnaton and expressons. Same experment as n ORL database s conducted and the result s shown n Fg..
4 database. We can see that CCSVM dsplays more advantages n recognton rate compared wth SVM because of the ncrease of abnormal samples (such as the llumnaton samples n Fg. 3). If mages (c) and (d) n Fg. 3 are testng samples, SVM wll msclassfy them nto the class represented by sample (a) and (d), but wth CCSVM method they wll be correctly classfed. TABLE II. COMPARISON FOR RECOGNITION RATE WITH DIFFERENT KERNEL FUNCTION (YALE DATABASE) Fg. recognton rate n YALE database We can see from Fg. that some sample ponts nfluenced much by nose (such as the sample ponts wth more llumnaton angle) wll partcpate n the tranng process n YALE database wth the ncrease of k. These samples may be much far way from the samples of the same knd and samples under the same llumnaton condton n space may be often clustered together (such as the face samples n Fg. 3) so as to generate new cluster area. If these abnormal samples are traned together wth other normal samples, msclassfcaton wll be generated wth samples under the same llumnaton condton. However, CCSVM method can separate these abnormal samples from samples of the same knd by clusterng to generate two vrtual classes and tran them respectvely. Ths method better follows the dstrbuton law of the samples n hgh-dmenson space and greatly mproves the recognton effect. recognton SVM Runnng tme recognton CCSVM Runnng tme Polynomal Radus bass Sgmod C. Experment results n YaleB database YaleB database s composed of llumnaton mages wth llumnatons from dfferent drectons, such as vertcal, horzontal and mxed polarzed lghts. In order to compare the robustness of NN, SVM and CCSVM nfluenced by llumnaton, we use 5 face mages of each person affected by llumnaton from all drectons to be a sample set and then dvde t nto 4 subsets randomly. One of them s used as tranng sample set and the others are used as testng sample sets, and then we get the average recognton rates whch are shown n Table III. We can see that the samples of the same person can not be clustered together n hgh-dmensonal space because mages n ths database are greatly nfluenced by llumnaton, however, mult-cluster area are generated accordng to dfferent polarzed angle (for example, samples of the same knd wth the polarzed angle rangng from 0 to 30 degrees may be clustered together, and they keep a relatvely far dstance from samples wth the polarzed angle less than 0 degrees). CCSVM dsplays much more advantages compared wth SVM and recognton rate have been ncreased sgnfcantly (for example, recognton can be ncreased to 7.8% when Subset 3 s used as tranng set). CCSVM based on vrtual class n dfferent cluster area wll obtan relatvely satsfactory recognton effect even wthout the denosng feature extracton process. (a) (b) TABLE III. AVERAGE CORRECT RECOGNITION RATE WITH DIFFERENT SUBSETS AS TRAINING SAMPLE SET (YALEB DATABASE) Subset Subset Subset 3 Subset 4 NN SVM CCSVM (c) (d) Fg. 3 Sample mages under the same llumnaton condton SVM and CCSVM wth dfferent kernel functon are compared n Table II when k 0 and k 7 n YALE database. Parameter selectons are the same as those n ORL V. CONCLUSIONS A face Recognton method based on Wthn-class Cluster and SVM s proposed n ths paper. Based on the dstrbuton dscontnuty of the samples n space and the exstence of nosy samples, ths method forms many cluster areas and searches out the correspondng cluster centers by cluster analyss, dvdng each class nto several vrtual classes, all vrtue class can be classfed by SVM. Many experments show that CCSVM follows the dstrbuton law of feature
5 ponts n hgh-dmensonal space and acheves better recognton effect. REFERENCES [] [] O. Edgar, F. Robert, G. Federco. Tranng support vector machnes: an applcaton to face detecton. IEEE Conference on Computer Vson and Pattern Recognton, San Juan, Puerto Rco.997. [] [] J. B. Tenenbaum, V. DE Slva, J. C. Langford. A global geometrc framework for nonlnear dmensonalty reducton. Scence,000,90(5500): [3] [3] S. Rowes, ll. K. Saul. An ntroducton to locally lnear embeddng. [4] [4] L. Kanfan, PJ. Rousseeuw. Fndng Groups n Data: an Introducton to Cluster Analyss. New York: John Wley& Sons [5] [5] M. Ester, H. Kregel, J. Sander, X. Xu. A densty based algorthm for dscoverng clusters n large spatal databases wth nose. In: Smouds E, Han JW, Fayyad UM. eds. Proceedngs of the nd Internatonal Conference on Knowledge Dscovery and Data Mnng. Portland: AAAI Press, 996, 6-3. [6] [6] G. Sudpto, R. Raeevand R. Kyuseok. Cure: an effcent clusterng algorthm for large databases. Informaton Systems, 00, 6(3):8-37 [7] [7] R. Agrawal, J. Gehrke, D. Gunopolos, P. Raghavan. Automatc subspace clusterng of hgh dmensonal data for data mnng applcaton. In : Haas LM. Twary A, eds. Proceedngs of the ACM SIGM OD Internatonal Conference on Management of Data. Seattle: ACM Press [8] [8] C. W. Hsu, C. J. Ln. A comparson of methods for multclass support vector machnes. IEEE Transactons on Neural Networks,00,3() : [9] [9] U. KreBel. Parwse classfcaton and support vector machnes.advances n Kernel Methods-Support Vector Learnng. Cambrdge, MA;MIT Press,
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 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 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 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 informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More 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 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 informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
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 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 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 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 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 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 informationThe Study of Remote Sensing Image Classification Based on Support Vector Machine
Sensors & Transducers 03 by IFSA http://www.sensorsportal.com The Study of Remote Sensng Image Classfcaton Based on Support Vector Machne, ZHANG Jan-Hua Key Research Insttute of Yellow Rver Cvlzaton and
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 informationBOOSTING 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 informationAnnouncements. Supervised Learning
Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples
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 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 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 informationJapanese Dependency Analysis Based on Improved SVM and KNN
Proceedngs of the 7th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Bejng, Chna, September 15-17, 2007 140 Japanese Dependency Analyss Based on Improved SVM and KNN ZHOU HUIWEI and
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 informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
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 informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More 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 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 informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More 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 informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
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 informationPERFORMANCE EVALUATION FOR SCENE MATCHING ALGORITHMS BY SVM
PERFORMACE EVALUAIO FOR SCEE MACHIG ALGORIHMS BY SVM Zhaohu Yang a, b, *, Yngyng Chen a, Shaomng Zhang a a he Research Center of Remote Sensng and Geomatc, ongj Unversty, Shangha 200092, Chna - yzhac@63.com
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
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 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 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 informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationPersimmon Recognition Machine Learning and K-Means Clustering Algorithm
Persmmon Recognton Machne Learnng and K-Means Clusterng Algorthm Fuxang Xe School of Mechancal-electrnc and Vehcle Engneerng Wefang Unversty Wefang, Shandong, Chna Ka Wang College of Mechancal Engneerng
More informationTraining of Kernel Fuzzy Classifiers by Dynamic Cluster Generation
Tranng of Kernel Fuzzy Classfers by Dynamc Cluster Generaton Shgeo Abe Graduate School of Scence and Technology Kobe Unversty Nada, Kobe, Japan abe@eedept.kobe-u.ac.jp Abstract We dscuss kernel fuzzy classfers
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationUsing Neural Networks and Support Vector Machines in Data Mining
Usng eural etworks and Support Vector Machnes n Data Mnng RICHARD A. WASIOWSKI Computer Scence Department Calforna State Unversty Domnguez Hlls Carson, CA 90747 USA Abstract: - Multvarate data analyss
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 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 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 informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More informationCompetitive Sparse Representation Classification for Face Recognition
Vol. 6, No. 8, 05 Compettve Sparse Representaton Classfcaton for Face Recognton Yng Lu Chongqng Key Laboratory of Computatonal Intellgence Chongqng Unversty of Posts and elecommuncatons Chongqng, Chna
More informationThe Research of the Facial Expression Recognition Method for Human-Computer Interaction Based on the Gabor Features of the Key Regions
Sensors & Transducers, Vol. 77, Issue 8, August 04, pp. 56-6 Sensors & Transducers 04 by IFSA Publshng, S. L. http://www.sensorsportal.com The Research of the Facal Expresson Recognton Method for Human-Computer
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 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 informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationFeature Extraction Based on Maximum Nearest Subspace Margin Criterion
Neural Process Lett DOI 10.7/s11063-012-9252-y Feature Extracton Based on Maxmum Nearest Subspace Margn Crteron Y Chen Zhenzhen L Zhong Jn Sprnger Scence+Busness Meda New York 2012 Abstract Based on the
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 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 informationFuzzy Modeling of the Complexity vs. Accuracy Trade-off in a Sequential Two-Stage Multi-Classifier System
Fuzzy Modelng of the Complexty vs. Accuracy Trade-off n a Sequental Two-Stage Mult-Classfer System MARK LAST 1 Department of Informaton Systems Engneerng Ben-Guron Unversty of the Negev Beer-Sheva 84105
More informationAn Anti-Noise Text Categorization Method based on Support Vector Machines *
An Ant-Nose Text ategorzaton Method based on Support Vector Machnes * hen Ln, Huang Je and Gong Zheng-Hu School of omputer Scence, Natonal Unversty of Defense Technology, hangsha, 410073, hna chenln@nudt.edu.cn,
More informationClassifying 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 informationTerm 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 informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
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 fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationCLASSIFICATION OF ULTRASONIC SIGNALS
The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION
More informationEfficient Text Classification by Weighted Proximal SVM *
Effcent ext Classfcaton by Weghted Proxmal SVM * Dong Zhuang 1, Benyu Zhang, Qang Yang 3, Jun Yan 4, Zheng Chen, Yng Chen 1 1 Computer Scence and Engneerng, Bejng Insttute of echnology, Bejng 100081, Chna
More informationAn AAM-based Face Shape Classification Method Used for Facial Expression Recognition
Internatonal Journal of Research n Engneerng and Technology (IJRET) Vol. 2, No. 4, 23 ISSN 2277 4378 An AAM-based Face Shape Classfcaton Method Used for Facal Expresson Recognton Lunng. L, Jaehyun So,
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 informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationLECTURE : 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 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 informationData Preprocessing Based on Partially Supervised Learning Na Liu1,2, a, Guanglai Gao1,b, Guiping Liu2,c
6th Internatonal Conference on Informaton Engneerng for Mechancs and Materals (ICIMM 2016) Data Preprocessng Based on Partally Supervsed Learnng Na Lu1,2, a, Guangla Gao1,b, Gupng Lu2,c 1 College of Computer
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationCollaboratively 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 informationA Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
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 informationClassification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM
Classfcaton of Face Images Based on Gender usng Dmensonalty Reducton Technques and SVM Fahm Mannan 260 266 294 School of Computer Scence McGll Unversty Abstract Ths report presents gender classfcaton based
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 informationDetection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature
Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationResearch of Image Recognition Algorithm Based on Depth Learning
208 4th World Conference on Control, Electroncs and Computer Engneerng (WCCECE 208) Research of Image Recognton Algorthm Based on Depth Learnng Zhang Jan, J Xnhao Zhejang Busness College, Hangzhou, Chna,
More informationLearning a Class-Specific Dictionary for Facial Expression Recognition
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for
More 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 informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
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 informationSCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS
SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,
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 using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
More informationQuadratic Program Optimization using Support Vector Machine for CT Brain Image Classification
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 4, o, July ISS (Onlne): 694-84 www.ijcsi.org 35 Quadratc Program Optmzaton usng Support Vector Machne for CT Bran Image Classfcaton J
More informationA Similarity Measure Method for Symbolization Time Series
Research Journal of Appled Scences, Engneerng and Technology 5(5): 1726-1730, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scentfc Organzaton, 2013 Submtted: July 27, 2012 Accepted: September 03, 2012
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
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 informationFingerprint matching based on weighting method and SVM
Fngerprnt matchng based on weghtng method and SVM Ja Ja, Lanhong Ca, Pnyan Lu, Xuhu Lu Key Laboratory of Pervasve Computng (Tsnghua Unversty), Mnstry of Educaton Bejng 100084, P.R.Chna {jaja}@mals.tsnghua.edu.cn
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 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 information