Correlative features for the classification of textural images
|
|
- Ethelbert Dean
- 5 years ago
- Views:
Transcription
1 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, Image Processng Systems Insttute - Branch of the Federal Scentfc Research Centre Crystallography and Photoncs of Russan Academy of Scences, Molodogvardeyskaya str. 151, Samara, Russa, Abstract. The work s amed to study varous correlatve mage features n order to solve the classfcaton problem of textural mages, wth further selecton of the most nformatve features for ncreasng the relablty of classfcaton. In the present paper seres of experments are performed on a set of 4480 real dgtal mages from the open Kylberg Texture Dataset v A set of programs necessary for computatons was developed. The autocorrelatve mage features are calculated, and the approxmatng coeffcents from the regresson equaton are obtaned. Due to the removal of the least nformatve features, the share of correctly recognzed mages ncreased n 1.04 tmes and amounted to 90.11% for 8 mage classes. 1. Introducton At present, the task of computer vson and, consequently mage recognton, cause a partcular nterest n many areas of scence and technology. Identfyng a number of characterstc features whch help to classfy a texture s essental for the textural mages recognton. A varety of parameters can act as the mage features. Optmal and unversal descrptors development contnues. Among the most common classfcaton sgns for textural mages are morphologcal features, fractal dmenson, Markov s parameters, samples of the autocorrelaton functon and others [1]. At the begnnng of the classfcaton process each mage can be characterzed by a large number of parameters. Snce the classfer for solvng the classfcaton problem s not deal, the error t ntroduces essentally depends on the qualty of the feature space. Thus, for proper classfcaton, t s necessary to reduce the subset of features by removng unnformatve and redundant features, thereby reducng the dmensonalty of the feature set. Usage of the optmal feature subset wll ncrease the relablty, at the same tme reducng the computatonal complexty and tme for classfcaton. Despte the urgency of the data processng problem, an optmal method for dentfyng and selectng features has not been found yet. In paper [] a novel feature selecton strategy resstant to problems wth asymmetrc data and based on Genetc Programmng s proposed. It works well wth both balanced and unbalanced data. The results of the experments made possble reducng the sze of the feature space up to 83%, whch allow one to ncrease the effectveness of the learnng process. More detals about the process of selectng features and usng the samples of the correlaton functon as characterstcs are descrbed n [3]. A two-stage feature selecton approach whch makes full use of nteractons s proposed n [4]. On the frst stage, the problem of feature selecton s decomposed nto the sum of nformaton nteracton. Then, hgher-order nteractons are used to select nteracton-preservng feature subset. On the second stage, the desgn of experments s employed to dentfy sgnfcant nteractons from the subset of
2 features. A flexble algorthm for selectng a subset of features under user control based on clusterng was developed n work [5]. Ths s a two-step hybrd process whch reduces the computatonal complexty of the feature selecton, especally for large sets of features. In [6] the feature selecton s carred out n two stages: n the frst step, the correspondence of each objectve functon feature s evaluated. If the attrbute s rrelevant, then t s dscarded. In the second step, the number of features s mnmzed by removng duplcate or low-performance functons. In [7] the process of selectng features s carred out usng a heurstc evolutonary algorthm, whch s the example of competton n a trbe. The man dea of the method s that only the most sgnfcant sgns wn and partcpate n the classfcaton. In ths paper, there s a data set consstng of dfferent classes of textural mages. A number of features s formed for each mage, based on the readngs of the correlaton functon and the coeffcents from the regresson equatons. A flterng method wth a marked set of tranng data s used for the feature selecton. A measure of the Eucldean dstance s chosen as a search strategy.. Texture descrptors.1. Autocorrelaton functon as a characterstc of a texture mage To form a set of texture mage features we use the often applcable texture descrptor the autocorrelaton functon, as n [8]: 1 ρ(x, y) = I(, j)i( + x, j + y) ( 1 I(, j) ) 1 (1) (N x )(N j y ) N N j j N Nj =1 j=1 where I(, j) pxel value, N N j sze of mage, ρ(0,0) 1 [1]. It was shown n [9] that lnear combnatons of autocorrelaton functon counts are the best sgns n the class of quadratc features. The coeffcents of the autocorrelaton functon determne the relatonshp of the pxels n the mage. As the dstance between ponts ncreases, the correlaton weakens and the value of the coeffcents does not make a sgnfcant contrbuton to the calculatons. Before the study begns, t s necessary to normalze the autocorrelaton functon to get rd of the hgh-frequency nose nfluence. Thus, we obtan an expresson for the coeffcents of the autocorrelaton functon... Regresson equaton coeffcents as a characterstc of the texture mage The autocorrelaton functon ρ(x, y) obtaned n the prevous secton can be unnecessarly complcated for descrbng the texture. However, f the exstng functon s approxmated by a parametrc functon, then ts parameters can be used as a more relable texture descrptor. Suppose that the autocorrelaton functon at a pont (x, y ) s known and s equal to ρ. Let us approxmate a functon by the followng regresson equatons: ρ 1 (x, y) = exp(a 1 x + a y + a 3 ), () ρ (x, y) = exp (b 1 x + y + b ), (3) where a 1, a, a 3, b 1, b the coeffcents to be found. We take the logarthm of () and (3) and obtan: ln(ρ 1 (x, y)) = a 1 x + a y + a 3, (4) ln (ρ (x, y)) = b 1 x + y + b. (5) The total error for (4) and (5), respectvely, s: E 1 = (ln(ρ 1 (x, y )) ρ ) = (a 1 x + a y + a 3 ρ ), E = (ln(ρ 1 (x, y )) ρ ) = (b 1 x + y + b ρ ). It s necessary to select the parameters a 1, a, a 3, b 1, b n such a way for the error to be mnmal. To do ths we take the partal dervatve wth respect to each parameter and equate t to zero, obtanng a system of lnear equatons wth respect to unknown parameters: 15
3 E 1 a 1 = 0 (a 1 x + a y + a 3 ρ )x = 0, E 1 a = 0 (a 1 x + a y + a 3 ρ )y = 0, E 1 { Solvng the resultng system of lnear equatons: a 3 = 0 (a 1 x + a y + a 3 ρ ) = 0. 4 a 1 x + a x y + a 3 x = ρ x, a 1 x y 4 + a y + a 3 y = ρ y, x + a y + a 3 1 = ρ, { we obtan expressons for the coeffcents a 1, a, a 3 that are used n the regresson equaton (). Smlarly, we obtan values for the coeffcents b 1, b from equaton (3) [1]. 3. Expermental studes 3.1. Input data As the nput data set 8 classes of textural mages from the open mage database Kylberg Texture Dataset v. 1.0 are used [10]. Each class contans 160 unque monochrome photographs wthout rotatons measurng pxels. All mages are normalzed wth a mean value of 17 and a standard devaton of 40 (Fgures 1a and 1b). a) b) Fgure 1. Examples of mages on whch experments were performed: seat (a), pearl sugar (b). For each mage a vector of 30 features s constructed. The frst 5 features are formed as the samples of the correlaton functon ρ(x, y) (1), x = 0,, 4 y = 0,, 4 but nstead of the value ρ(0, 0) 1 the count ρ( 1, 1) s used. Features 5-7 are the coeffcents a 1, a, a 3 from the regresson equaton (), 8 and 9 are the coeffcents b 1, b from equaton (3). The form of the regresson equatons () and (3) for the specfc values obtaned durng the computatonal experment s shown n Fgures a-b and 3a-b, respectvely. The values of the coeffcents from the regresson equatons () and (3) are presented n table 1. Table 1. The values of the coeffcents of the regresson equatons for the graphs presented n Fgures 1a and 1b. Coeffcents a 1 a a 3 b 1 b Seat Pearl sugar
4 a) b) Fgure. The graph of the regresson equatons (): for Fgure 1a (a), for Fgure 1b (b) a) b) Fgure 3. The graph of the regresson equatons (3): for Fgure 1a (a), for Fgure 1b (b) Also, the "Class" feld s added to the characterstcs vector, whch has a range of values from 1 to 8 and wll be used for the model tranng. 3.. The scheme of the computatonal experment Before the begnnng of the research t s necessary to scale out the feature set, snce the numercal values are presented n dfferent scales, accordng to the followng formulas. To normalze the sample t s necessary to dvde each feature x nto the sample rate: K x = x ( x k k=1 ) 1/, = 1,, K where K s the total number of features. For standardzaton, we use the formula: x = (x M())R(, ) 1/, = 1,, K where M() s the mean value and R(, ) s the standard devaton. To classfy mages, t s necessary to form a tranng sample. In ths paper we form t accordng to the prncple of leave-one-out cross-valdaton:at each teraton step of the tranng there s a sample of K 1 elements, where K s the total sample sze. Due to ths, we ncrease the accuracy of classfcaton (t s defned as the rato of the number of correctly defned classes to ther total number), although we ncrease the computatonal complexty of the algorthm. We dstrbute an mage wth an unknown class to a partcular group based on the nearest neghbour, fndng the vector closest to the desred vector by the set of characterstcs. Durng the frst computatonal experment we form the tranng sample consstng of the object by the cross-valdaton method. We successvely determne the class of each mage not ncluded n the tranng sample. As a feature set, we use all the 30 features n the frst case, n the second only features wth numbers 0-4, n the thrd 5-9. Durng the second computatonal experment, the tranng sample s formed n a smlar way, but the attrbute space s formed by the full search method 17
5 as a subset of the cardnaltes one and three, as well as the random search method wth capactes of four and fve. To compare the results of computatonal experments we wll classfy the vectors for each mage and evaluate the qualty crteron J, assgned as the proporton of correctly recognzed objects to ther total number. Object classfcaton should be carred out n ts characterstc space, obtaned accordng to the requrements of the computatonal experments descrbed above Results of experments The obtaned results for the classfcaton of texture mages n accordance wth the task of the frst computatonal experment are presented n table. Table. Results of the frst computatonal experment. Number of features Cardnalty Relablty, % Tme, s 0, 1,, , 1,, , 6, 7, 8, Table shows that the hghest proporton of correctly classfed objects s acheved usng a full set of features. However, n ths case, the presence of non-nformatve features s possble, whch wll reduce the relablty of the classfcaton. Also, a large subset of characterstcs sgnfcantly ncreases the computatonal complexty of the algorthm and, as a consequence, ncreases the calculaton tme. Therefore, t s necessary to select features, whch wll reduce re-tranng, ncrease relablty and shorten the classfcaton tme. The most nformatve features for the classfcaton problem were sgns under numbers 4, 0 and 5. The ndvdual qualtes of the fve best attrbutes are gven n table 3. Table 3. Indvdual qualtes of features. Number of features Relablty, % We form feature subsets of cardnalty three by the method of complete enumeraton. The average tme necessary for classfyng the mages usng the generated subsets was 7.36 seconds. Table 4 shows that the frst two best subsets of the features consst of only the samples of the correlaton functon, the thrd one also ncludes a sgn derved from the coeffcent of the regresson equaton. The relablty of the classfcaton usng the most effectve feature subset of cardnalty three s 1.13 tmes lower than the classfcaton usng the full feature set. However, the tme spent on classfcaton s tmes lower. Table 4. The feature selecton result usng a subset of cardnalty three. Number of features Relablty, % 4, 14, , 4, , 19, We use the method of random search to construct subsets of cardnaltes four and fve. The classfcaton usng a feature subset of cardnalty four s 1.05 tmes as low as the classfcaton proposed n the frst computatonal experment. However, when usng a subset of cardnalty fve relablty of classfcaton s 1.04 tmes hgher. 18
6 Table 5 shows that n the formaton of a characterstc subset the most nformatve features also partcpate: n the subset of cardnalty four are the sgn at number four, n the subset of cardnalty of fve, the sgn wth the number zero and four. The average classfcaton tme was and seconds when usng subsets of cardnaltes four and fve, whch gves a gan n tme of and tmes, respectvely. Table 5. The feature selecton results usng subsets of cardnaltes four and fve. Number of features Relablty, % 4, 14, 8, , 14, 19, , 19, 6, ,, 3, 5, ,, 3, 5, ,, 3, 4, Thus, after carryng out seres of experments, the usage of the feature subset of cardnalty fve was the most effectve, wth the help of whch t was possble to acheve a qualty classfcaton of more than 90%. Also the need to reduce feature set by removng the least nformatve ones was confrmed expermentally. 4. Concluson In the recent work, the objects were classfed on the base of the calculated features. A number of features were formed usng the samples of the correlaton functon and the coeffcents from the regresson equatons. The selecton of features was carred out wth the methods of complete and random search. The features that are the most nformatve and necessary n the constructon of the classfer were revealed, they turned out to be the readngs of the correlaton functon ρ(1, 0), ρ(0, 1), ρ(1, 1). Ther ncluson n a varety of attrbutes for further classfcaton wll ncrease ts relablty, allowng one to remove less nformatve features. The features, whch are coeffcents from the regresson equatons, were not among the top ten, whch ndcates ther lttle nformaton n the task of classfyng mages. Among the features that have the least mpact on the classfcaton process, are the coeffcents a 3 and a from the regresson equatons ρ 1 (x, y) = exp (a 1 x + a y + a 3 ) and ρ (x, y) = exp (b 1 x + y + b ), as well as the correlaton functon ρ(0,). The hghest relablty of the mage classfcaton, whch amounted to 90.11% was acheved wth the use of a feature subset of cardnalty fve, whch ncluded the samples of the correlaton functon ρ(0,1), ρ(0,3), ρ(0,4) and the coeffcents a 1 and b from the regresson equatons. In ths way, the hypothess about the need to exclude the least nformatve features from the set was expermentally confrmed. When usng the full set of attrbutes for mage classfcaton, the acheved relablty was 86.83%, whch s 1.04 tmes as low as the maxmum relablty obtaned n the course of the computatonal experment. Also, the tme spent on classfcaton decreased by tmes by reducng the cardnalty of feature set. 5. References [1] Petrou M 006 Image processng: Dealng wth texture (John Wley & Sons, Ltd) [] Vegas F, Rocha L, Goncalves M, Mourao F, Salles T, Andrade G and Sandn I 018 A Genetc Programmng approach for feature selecton n hghly dmensonal skewed Neurocomputng [3] Gadel A V, Zelter P M, Kapshnkov A V and Khramov A G 014 Computed tomography texture analyss capabltes n dagnosng a chronc obstructve pulmonary dsease Computer Optcs 38(4) [4] Tang X, Da Y, Sun P and Meng S 018 Interacton-based feature selecton usng Factoral Desgn Neurocomputng
7 [5] Goswam S, Das A K, Chakrabart A and Chakraborty B 017 A feature cluster taxonomy based feature selecton technque Expert System wth Applcatons [6] Rahmanna M and Morad P 017 OSFSMI: Onlne Stream Feature Selecton Method based on Mutual Informaton Appl. Soft Comput [7] Maa B and Xa Y 017 A trbe competton-based genetc algorthm for feature selecton npattern classfcaton Appl. Soft Comput [8] Gadel A V 015 A method for adjustng drected texture features n bomedcal mage analyss problems Computer Optcs 39() DOI: / [9] Gadel A V 016 Matched polynomal features for the analyss of grayscale bomedcal mages Computer Optcs 40() 3-39 DOI: / [10] Kylberg G 011 The Kylberg Texture Dataset v. 1.0: External report (Blue seres) Centre for Image Analyss, Swedsh Unversty of Agrcultural Scences and Uppsala Unversty 35 Acknowledgments The work was partally funded by the Russan Foundaton of Basc Research grant р_а, by the Federal Agency for Scentfc Organzatons under agreement No. 007-GZ/Ch3363/6 and by the Russan Federaton Mnstry of Educaton and Scence. 0
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 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 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 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 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 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 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 informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
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 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 informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article. A selective ensemble classification method on microarray data
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2860-2866 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A selectve ensemble classfcaton method on mcroarray
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 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 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 informationA Multi-step Strategy for Shape Similarity Search In Kamon Image Database
A Mult-step Strategy for Shape Smlarty Search In Kamon Image Database Paul W.H. Kwan, Kazuo Torach 2, Kesuke Kameyama 2, Junbn Gao 3, Nobuyuk Otsu 4 School of Mathematcs, Statstcs and Computer Scence,
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More 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 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 informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More 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 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 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 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 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 informationRecognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features
Recognton of Handwrtten Numerals Usng a Combned Classfer wth Hybrd Features Kyoung Mn Km 1,4, Joong Jo Park 2, Young G Song 3, In Cheol Km 1, and Chng Y. Suen 1 1 Centre for Pattern Recognton and Machne
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 informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
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 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 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 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 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 informationExperiments in Text Categorization Using Term Selection by Distance to Transition Point
Experments n Text Categorzaton Usng Term Selecton by Dstance to Transton Pont Edgar Moyotl-Hernández, Héctor Jménez-Salazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur
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 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 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 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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
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 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 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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More 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 informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
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 informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
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 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 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 informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationA Computer Vision System for Automated Container Code Recognition
A Computer Vson System for Automated Contaner Code Recognton Hsn-Chen Chen, Chh-Ka Chen, Fu-Yu Hsu, Yu-San Ln, Yu-Te Wu, Yung-Nen Sun * Abstract Contaner code examnaton s an essental step n the contaner
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 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 informationAnt Colony Optimization to Discover the Concealed Pattern in the Recruitment Process of an Industry
N. Svaram et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Ant Colony Optmzaton to Dscover the Concealed Pattern n the Recrutment Process of an Industry N. Svaram Research Scholar,
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
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 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 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 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 informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationFuzzy Logic Based RS Image Classification Using Maximum Likelihood and Mahalanobis Distance Classifiers
Research Artcle Internatonal Journal of Current Engneerng and Technology ISSN 77-46 3 INPRESSCO. All Rghts Reserved. Avalable at http://npressco.com/category/jcet Fuzzy Logc Based RS Image Usng Maxmum
More informationInvariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm
Proceedngs of the 5th WSEAS Int. Conf. on Sgnal Processng, Robotcs and Automaton, Madrd, Span, February 5-7, 6 (pp4-45) Invarant Shape Obect Recognton Usng B-Splne, Cardnal Splne, and Genetc Algorthm PISIT
More informationExtraction of Fuzzy Rules from Trained Neural Network Using Evolutionary Algorithm *
Extracton of Fuzzy Rules from Traned Neural Network Usng Evolutonary Algorthm * Urszula Markowska-Kaczmar, Wojcech Trelak Wrocław Unversty of Technology, Poland kaczmar@c.pwr.wroc.pl, trelak@c.pwr.wroc.pl
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationRelevance Assignment and Fusion of Multiple Learning Methods Applied to Remote Sensing Image Analysis
Assgnment and Fuson of Multple Learnng Methods Appled to Remote Sensng Image Analyss Peter Bajcsy, We-Wen Feng and Praveen Kumar Natonal Center for Supercomputng Applcaton (NCSA), Unversty of Illnos at
More informationSpam Filtering Based on Support Vector Machines with Taguchi Method for Parameter Selection
E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton We-Chh Hsu, Tsan-Yng Yu E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton
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 informationFeature Kernel Functions: Improving SVMs Using High-level Knowledge
Feature Kernel Functons: Improvng SVMs Usng Hgh-level Knowledge Qang Sun, Gerald DeJong Department of Computer Scence, Unversty of Illnos at Urbana-Champagn qangsun@uuc.edu, dejong@cs.uuc.edu Abstract
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More 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 informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More 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 informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More information