On Supporting Identification in a Hand-Based Biometric Framework
|
|
- Gavin Copeland
- 5 years ago
- Views:
Transcription
1 On Supportng Identfcaton n a Hand-Based Bometrc Framework Pe-Fang Guo 1, Prabr Bhattacharya 2, and Nawwaf Kharma 1 1 Electrcal & Computer Engneerng, Concorda Unversty, 1455 de Masonneuve Blvd., Montreal, QC H3G 1M8, Canada {pf_guo,kharma}ece.concorda.ca 2 Computer Scence Department, Unversty of Cncnnat, 814 Rhodes Hall, Cncnnat, OH , USA bhattapr@ucmal.uc.edu Abstract. Research on hand features has drawn consderable attenton to the bometrc-based dentfcaton feld n past decades. In ths paper, the technque of the feature generaton s carred out by ntegratng genetc programmng and the expectaton maxmzaton algorthm wth the ftness of the mean square error measure (GP-EM-MSE) n order to mprove the overall performance of a hand-based bometrc system. The GP program trees of the approach are utlzed to fnd optmal generated feature representatons n a nonlnear fashon; derved from EM, the learnng task results n the smple k- means problem that reveals better convergence propertes. As a subsequent refnement of the dentfcaton, GP-EM-MSE exhbts an mproved capablty whch acheves a recognton rate of 96% accuracy by usng the generated features, better than the performance obtaned by the selected prmtve features. Keywords: Feature generaton, bometrc dentfcaton, genetc programmng, the expectaton maxmzaton algorthm, mean square error, classfcaton. 1 Introducton Bometrcs-based dentfcaton s a verfcaton approach usng bologcal features n each ndvdual. Hand features have been wdely used n desgnng a bometrc dentfcaton system and the challenge has been establshed [1], [2]. In pattern recognton, the analytcal selecton of features and the automatc generaton of features provde two dstnct approaches, because they rely on dfferent sources of nformaton [3]. It may be useful to explore new bometrc dentfcaton systems that combne both methods of the feature selecton and generaton. In ths study, buldng upon our prevous work of the feature selecton on hand mages, we present an automatc method of the feature generaton, usng genetc programmng and the expectaton maxmzaton algorthms wth the mean square error measure (GP-EM-MSE) for a hand-based bometrc dentfcaton system. The benefts from the combned system of the feature selecton and generaton are as follows: A. Elmoataz et al. (Eds.): ICISP 2010, LNCS 6134, pp , Sprnger-Verlag Berln Hedelberg 2010
2 On Supportng Identfcaton n a Hand-Based Bometrc Framework 211 to ncrease the probablty that the errors of the ndvdual feature selecton may be compensated for by the correct results of automatc feature generaton. to rase the contrbuton that the overall performance of the classfcaton would make toward a hgher recognton rate by the mprovement of the qualty of feature representatons. The organzaton of the paper s as follows: Secton 2 descrbes brefly our prevous work on the feature selecton for hand mages. In Secton 3, GP and the k-means problem va EM are descrbed as the bass of the platform, ncludng the evaluaton phase. Secton 4 presents dentfcaton results, and concluson and future work are gven n Secton 5. 2 Prevous Work on the Feature Selecton for Hand Images Prevous work on hand mages can be categorzed as the unsupervsed feature selecton for clusterng hand mages. The man tool for accomplshng ths was a genetc algorthm (GA). The method, named cooperatve coevolutonary clusterng algorthm (CCCA), was desgned to search for a proper number (wthout pror knowledge of t) of clusters of hand mages, and smultaneously to acheve the feature selecton. CCCA was mplemented usng 100 hand mages as the test set; see a sample of a hand mage n Fg.1. The results showed that the dmensonalty of the clusterng space was reduced from 84 orgnal features to 41 selected features (11 geometrc and 30 statstcal features), wth 4 clusters produced. At the end, the output clusters were labeled wth the number of nput mage patterns per class, assgned to each cluster. The detals of the CCCA method appear n our prevous work [4], [5]. Fg. 1. A sample of a hand mage 3 The GP-EM-MSE Bometrc Identfcaton System The pre-requste for the technque of the feature generaton s the preparaton of prmtve feature sets. Usng our prevous method n [4] on a dataset of 200 hand mages, we succeeded n clusterng the 200 mages nto 4 categores, wth a total
3 212 P.-F. Guo, P. Bhattacharya, and N. Kharma number of 41 features selected as the prmtve feature set for the current study of the feature generaton. Fg.2 presents the method of the feature generaton by ntegratng GP and EM wth the MSE ftness ndcator (GP-EM-MSE). In the approach, GP program trees can be vewed as sequences of applcatons of functons (replaced wth mathematc operators) to arguments (replaced wth 41 prmtve features), whch satsfy requrements for ratonal expressons of the generated features n a straghtforward way; va EM, the learnng task results n a smple hypothess of the k-means problem. In the next subsectons, we provde descrptons of each component of the bometrcbased GP-EM-MSE system, ncludng the steps of the computaton. Fg. 2. The GP-EM-MSE hand-based bometrc dentfcaton system 3.1 The GP Applcaton GP mantans a populaton of ndvduals by program trees. In each teraton, t produces a new generaton of ndvduals usng reproducton, crossover, and mutaton. The ftness of a gven ndvdual program n the populaton s typcally determned by executng the program on a set of the tranng data. The teraton of GP s llustrated n Fg. 3; the detals of the GP process can be found n [6]. Fg. 3. The dagram of the evolutonary GP teraton The GP program trees n the approach The choces of termnal arguments and functons provde partcular representatons for descrbng GP program trees n the problem doman. In ths study, we choose the followng mathematcal operators:
4 On Supportng Identfcaton n a Hand-Based Bometrc Framework 213 {+, -,,, square root, sne, cosne, tan, exponental, absolute, square, negatve}, whch consttute the GP functon set; termnal arguments receve 41 prmtve features selected by the method [4]. As shown n Fg.4, an example of the ratonal expresson, h2 X h5 tg(h5 + h8), can be expressed as the GP program tree, On the tree, the sgn of tg s a mathematcal operator that takes one termnal argument, and the sgns of +, - and X are operators that need two arguments. The argument, hd, d = 2, 5, 8, s replaced wth the (d+1)th prmtve feature. - X tg h2 h5 + h5 h8 Fg. 4. A GP program tree for the ratonal expresson of h2 X h5 tg(h5 + h8) The ftness functon, MSE The MSE measure s well known n the functon approxmaton and learnng system theores when the number of classes s assumed to be a pror known. In ths supervsed problem of the feature generaton, we employ the MSE measure as the ftness whch s gven by [7]: the MSE ftness = D( c k m j= 1 = 1 j, r j ), (1) where D s the Eucldean dstance between the nstance r and ts mean center c j. 3.2 Dervatve of the k-means Problem va EM Gven the observed data R = { r }, dvded nto the k known classes; the hdden varables Z = {< z 1,, z j,, z k >} n ths case ndcate the ndex of the jth mxture component that generates r. Wth the approxmaton, the data R can be descrbed n the mxture of the k Gaussans. The purpose s to ft the Gaussan densty mxture to the data R by optmzng the Gaussans mxture parameters, whch nclude the mxng proporton, the mean values, and the covarance matrx. In practce, the most common use s to assume the equal mxng proporton (1/k) wth a unvarate case for all the k categores [8], from whch t smplfes the task to a hypothess of the k-means problem [9]. Applyng the maxmum lkelhood estmator, the k-means problem s broken down nto two separate steps: E step E z j r n k r (2)
5 214 P.-F. Guo, P. Bhattacharya, and N. Kharma M step m m z j z j (3) where μ j s the mean value of the jth Gaussan, and E[z j ] s the probablty that r s generated by the jth Gaussan dstrbuton. Further detals can be found n [9], [10], regardng the dervatve of the k-means problem va EM. In the mplementaton, the data R are replaced wth the generated data produced by GP-EM-MSE. The EM steps, expressed n Eqs. (2) and (3), are executed on the data R, and consttute a jont loop wth the GP teraton. 3.2 The GP-EM-MSE Recursve Computaton The steps of the GP-EM-MSE computaton are summarzed n Table 1. Table 1. The GP-EM-MSE recursve computaton Note: begn from each populaton of the generated features, P_feature p. FOR ndex p = 1 TO 32 populatons DO FOR ndex = 1 TO 100 mages DO Perform the data transformaton based on the varaton of the GP program trees. END Implement the E-step, expressed n Eq. (2), to estmate the expected values, E[z j ]. Implement the M-step, expressed n Eq. (3), to revse the values of the k-means. Replace wth the new revsed values of the k-means. Evaluate each of the pupulatons by the MSE ftness, expressed n Eq. (1). Vary and generated new populatons by applyng the reproducaton, crossover and mutaton. END Save the best generated features. 3.3 The Evaluaton Phase Usng the Classfers MDC and KNN The task of the dentfcaton s to classfy samples nto categores so that samples n the same categores are as smlar as possble and samples n dfferent categores are as dssmlar as possble. Mathematcally, the problem of classfcaton can be formulated n terms of a predetermned measure [11]. For the mnmum dstance classfer (MDC), the dstance s defned as an ndex of smlarty so that the mnmum dstance s dentcal to the maxmum smlarty; for the K nearest neghbors (KNN), each mage pattern s classfed to the frequent class among ts neghbors based on a smlarty measure. In ths study, the Eucldean dstance measure s employed for both MDC and KNN n the evaluaton. 4 Identfcaton Experments In the mplementaton, we dvded the 200 mages nto the tranng and testng sets, each wth 100 mages. Usng the 41 prmtve features as the nput, the GP-EM-MSE tranng s evolved wth the maxmum tree depth of 5 and the populaton sze of 32.
6 On Supportng Identfcaton n a Hand-Based Bometrc Framework Feature Generated Results We ended the GP-EM-MSE tranng after runnng 400 teratons. The total tme for computaton was about three mnutes on a Pentum 4 at 1.60 GHz. The results for the two features, P_feature 1 and P_feature 2, produced by GP-EM-MSE are as follows: P _ feature 1 = cos{sn[ h0 h39 tg( h22 h21)] tg[ h32 h0 + h39 h27] + sn[( h30 h7) 2 e h2 h19 2 ] ( h12 h31 + h14 h26) } and P _ feature 2 = cos cos[ ( h 32 + h25) ( h9 + h28)], h25 h9 h8 h10 + cos( ) + + cos( h35 h20) h23 h8 h22 sn( h25 + h32) h8 where hd s the (d+1)th feature of 41 prmtve features, and the convergence results are presented n Fg. 5; n the sequel, the resultng generated features wll be employed to dentfy hand mages. 1 ftness C_feature 1 C_feature teratons Fg. 5. Convergence results for the features produced by GP-EM-MSE 4.2 Identfcaton Results The goal of the dentfcaton s to classfy hand mages nto a known number of 4 categores or classes accordng to the decson space of the generated features. Wth the classfer MDC, Table 2 shows the confuson matrx of the dentfcaton performance for four classes on the test set, usng two features, P_feature 1 and P_feature 2, produced by GP-EM-MSE. Each row of the table represents the dentfcaton performance for a gven category, whle each column represents a percentage of the number of samples n an actual class. It can be observed, from Table 2, that the dfference of the related dentfcaton accuracy among the classes s small, rangng from % to %.
7 216 P.-F. Guo, P. Bhattacharya, and N. Kharma Table 2. Identfcaton accuracy (%) usng two features, P_feature 1 and P_feature 2, produced by GP-EM-MSE wth MDC categores class I class II class III class IV class I (33 samples) class II (25 samples) class III (22 samples) class IV (20 samples) Comparson Results The classfers MDC and KNN are utlzed n order to assess the capablty of dfferent feature sets over dfferent classfcaton systems. In terms of the dentfcaton accuracy, Table 3 shows the comparson results between the features produced by GP-EM-MSE wth MDC and 41 prmtve features selected by the method [4] wth KNN n whch the value of K s tested by the nput of 41 prmtve features (K = 41). Table 3. The comparson between the features produced by GP-EM-MSE / MDC and 41 prmtve features selected by [4] / KNN, n terms of the dentfcaton accuracy (%) feature types / classfer no. of features dentfcaton accuracy (%) the prmtve features selected by [4] / KNN P_feature 1 / MDC P_feature 1, P_feature 2 / MDC It can be seen from Table 3 that the dentfcaton accuracy usng one feature, P_feature 1, s slghtly lower than when usng 41 prmtve features. However, the combnaton of two features, P_feature 1 and P_feature 2, produced by GP-EM-MSE acheves the best dentfcaton performance wth an accuracy rate at 96.0%. 5 Concluson and Future Work As an extenson of the method of CCCA for the feature selecton n [4], the purpose of GP-EM-MSE n ths study s to fnd the mproved feature representatons n an optmal control envronment n order to further mnmze dentfcaton errors for the hand-based bometrc system. GP-EM-MSE has succeeded n producng correct features to dentfy hand mages wth the mproved performance. The prevous work of the CCCA method was evolved wthout supervson n such a way that the selected feature sets operated globally to cluster hand mages. Consequently, the current study of GP-EM-MSE for the feature generaton s a supervsed learnng algorthm, va the results of CCCA. In the case of some not-sosmple problems, the GP-EM-MSE method offers a customzed general purpose research platform by jontly optmzng feature representatons, whch demonstrates that such a combnaton of methods of the feature selecton and generaton leads to a hgher recognton rate.
8 On Supportng Identfcaton n a Hand-Based Bometrc Framework 217 Our future work wll be dedcated to examnng the robustness of the system n dffcult pattern dentfcaton problems and large databases of samples. Acknowledgments. Ths work s supported by grants from the NSERC. References 1. Zheng, G., Wang, C.-J., Boult, T.E.: Applcaton of projectve nvarants n hand geometry bometrcs. IEEE Trans. Informaton Forenscs and Securty 2, (2007) 2. Zhang, D., Kong, W., You, J.: Onlne palmprnt dentfcaton. IEEE Trans. Pattern Anal. Mach. Intell. 25, (2003) 3. Rzk, M.M., Zmuda, M.A., Tamburno, L.A.: Evolvng pattern recognton systems. IEEE Trans. Evol. Comput. 6, (2002) 4. Kharma, N., Suen, C.Y., Guo, P.-F.: Palmprnts: a cooperatve co-evolutonary algorthm for clusterng hand mages. Int. J. Image and Graphcs 5, (2005) 5. Guo, P.-F.: Palmprnts: a cooperatve co-evolutonary clusterng algorthm for hand-based bometrc dentfcaton. M.A.Sc. thess, Concorda Unversty, Montreal, Canada (2003) 6. Koza, J.R.: Genetc Programmng II: Automatc Dscovery of Reusable Programs. MIT Pr., Cambrdge (1994) 7. Lee, C.-Y.: Effcent automatc engneerng desgn synthess va evolutonary exploraton. Ph.D thess, Calforna Insttute of Technology, Pasadena, Calforna (2002) 8. Raymer, M.L., Doom, T.E., Kuhn, L.A., Punch, W.F.: Knowledge dscovery n medcal and bologcal datasets usng a hybrd Bayes classfer/evolutonary algorthm. IEEE Trans. Syst., Man, Cybern., Part B 33, (2003) 9. Bshop, C.M.: Pattern Recognton and Machne Learnng. Sprnger, New York (2006) 10. Mtchell, T.M.: Machne Learnng. McGraw-Hll, New York (1997) 11. Fukunaga, K.: Introducton to Statstcal Pattern Recognton, 2nd edn. Academc, Boston (1990)
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 informationAn Efficient Image Pattern Recognition System Using an Evolutionary Search Strategy
Proceedngs of the 009 IEEE Internatonal Conference on Systems, Man, and Cybernetcs San Antono, X, USA - October 009 An Effcent Image Pattern Recognton System Usng an Evolutonary Search Strategy Pe-Fang
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 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 informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationA 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 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 informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More 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 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 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 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 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 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 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 informationInvestigating the Performance of Naïve- Bayes Classifiers and K- Nearest Neighbor Classifiers
Journal of Convergence Informaton Technology Volume 5, Number 2, Aprl 2010 Investgatng the Performance of Naïve- Bayes Classfers and K- Nearest Neghbor Classfers Mohammed J. Islam *, Q. M. Jonathan Wu,
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 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 informationHybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton
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 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 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 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 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 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 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 informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA fast 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 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 informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
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 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 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 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 informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationA Genetic Programming-PCA Hybrid Face Recognition Algorithm
Journal of Sgnal and Informaton Processng, 20, 2, 70-74 do:0.4236/jsp.20.23022 Publshed Onlne August 20 (http://www.scrp.org/journal/jsp) A Genetc Programmng-PCA Hybrd Face Recognton Algorthm Behzad Bozorgtabar,
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 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 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 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 informationFeature Selection as an Improving Step for Decision Tree Construction
2009 Internatonal Conference on Machne Learnng and Computng IPCSIT vol.3 (2011) (2011) IACSIT Press, Sngapore Feature Selecton as an Improvng Step for Decson Tree Constructon Mahd Esmael 1, Fazekas Gabor
More informationResearch of Neural Network Classifier Based on FCM and PSO for Breast Cancer Classification
Research of Neural Network Classfer Based on FCM and PSO for Breast Cancer Classfcaton Le Zhang 1, Ln Wang 1, Xujewen Wang 2, Keke Lu 2, and Ajth Abraham 3 1 Shandong Provncal Key Laboratory of Network
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 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 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 informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More 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 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 informationImplementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status
Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status
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 informationAn Evolvable Clustering Based Algorithm to Learn Distance Function for Supervised Environment
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 7, Issue 5, September 2010 ISSN (Onlne): 1694-0814 www.ijcsi.org 374 An Evolvable Clusterng Based Algorthm to Learn Dstance Functon for Supervsed
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 informationHistogram based Evolutionary Dynamic Image Segmentation
Hstogram based Evolutonary Dynamc Image Segmentaton Amya Halder Computer Scence & Engneerng Department St. Thomas College of Engneerng & Technology Kolkata, Inda amya_halder@ndatmes.com Arndam Kar 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 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 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 informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
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 informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More 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 informationKeywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak
More 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 informationImage Classification Using Feature Subset Selection
Proceedngs of the 5th WSEAS Int. Conf. on COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS and CYBERNETICS, Vence, Italy, November 20-22, 2006 1 Image Classfcaton Usng Feature Subset Selecton SANG-SUNG
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 informationSixth Indian Conference on Computer Vision, Graphics & Image Processing
Sxth Indan Conference on Computer Vson, Graphcs & Image Processng Incorporatng Cohort Informaton for Relable Palmprnt Authentcaton Ajay Kumar Bometrcs Research Laboratory, Department of Electrcal Engneerng
More informationAssociative Based Classification Algorithm For Diabetes Disease Prediction
Internatonal Journal of Engneerng Trends and Technology (IJETT) Volume-41 Number-3 - November 016 Assocatve Based Classfcaton Algorthm For Dabetes Dsease Predcton 1 N. Gnana Deepka, Y.surekha, 3 G.Laltha
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 informationFeature Selection for Target Detection in SAR Images
Feature Selecton for Detecton n SAR Images Br Bhanu, Yngqang Ln and Shqn Wang Center for Research n Intellgent Systems Unversty of Calforna, Rversde, CA 95, USA Abstract A genetc algorthm (GA) approach
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 informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More 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 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 informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More 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 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 informationMulticlass Object Recognition based on Texture Linear Genetic Programming
Multclass Object Recognton based on Texture Lnear Genetc Programmng Gustavo Olague 1, Eva Romero 1 Leonardo Trujllo 1, and Br Bhanu 2 1 CICESE, Km. 107 carretera Tjuana-Ensenada, Mexco, olague@ccese.mx,
More informationAn Improved Neural Network Algorithm for Classifying the Transmission Line Faults
1 An Improved Neural Network Algorthm for Classfyng the Transmsson Lne Faults S. Vaslc, Student Member, IEEE, M. Kezunovc, Fellow, IEEE Abstract--Ths study ntroduces a new concept of artfcal ntellgence
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
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 informationMULTISPECTRAL REMOTE SENSING IMAGE CLASSIFICATION WITH MULTIPLE FEATURES
MULISPECRAL REMOE SESIG IMAGE CLASSIFICAIO WIH MULIPLE FEAURES QIA YI, PIG GUO, Image Processng and Pattern Recognton Laboratory, Bejng ormal Unversty, Bejng 00875, Chna School of Computer Scence and echnology,
More informationPCA Based Gait Segmentation
Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton PCA Based Gat Segmentaton Honggu L, Cupng Sh, and Xngguo L 2 Electronc Department, Physcs College, Yangzhou Unversty, 225002 Yangzhou, Chna 2 Department
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationGender Classification using Interlaced Derivative Patterns
Gender Classfcaton usng Interlaced Dervatve Patterns Author Shobernejad, Ameneh, Gao, Yongsheng Publshed 2 Conference Ttle Proceedngs of the 2th Internatonal Conference on Pattern Recognton (ICPR 2) DOI
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationA new Unsupervised Clustering-based Feature Extraction Method
A new Unsupervsed Clusterng-based Feature Extracton Method Sabra El Ferchch ACS Natonal School of Engneerng at Tuns, Tunsa Salah Zd AGIS lle Unversty of Scence and Technology, France Kaouther aabd ACS
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 informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
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 informationComparison Study of Textural Descriptors for Training Neural Network Classifiers
Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84
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 informationFace Recognition Method Based on Within-class Clustering SVM
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
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 information