Non-Negative Matrix Factorization and Support Vector Data Description Based One Class Classification
|
|
- Mervin Nicholson
- 5 years ago
- Views:
Transcription
1 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): Non-Negatve Matrx Factorzaton and Support Vector Data Descrpton Based One Class Classfcaton Lyong Ma 1, Nazhang Feng and Q Wang 3 1 School of Informaton & Electrcal Engneerng, Harbn Insttute of Technology at Weha Weha, 6409, Chna School of Informaton & Electrcal Engneerng, Harbn Insttute of Technology at Weha Weha, 6409, Chna 3 Department of Automatc Measurement and Control, Harbn Insttute of Technology Harbn, , Chna Abstract One class classfcaton s wdely used n many applcatons. Only one target class s well characterzed by nstances n the tranng data n one class classfcaton, and no nstance s avalable for other non-target classes, or few nstances are present and they cannot form statstcally representatve samples for the negatve concept. A two-step paradgm employng nonnegatve matrx factorzaton (NMF) and support vector data descrpton (SVDD) for one class classfcaton tranng of nonnegatve data s developed. Frstly, a proected gradent based NMF method s used to fnd the hdng structure from the tranng nstances and the tranng nstances are proected nto a new feature space. Secondly, SVDD s employed to perform one class classfcaton tranng wth the proected feature data. Classfcaton examples demonstrate that the proposed method s superor to prncpal component analyss (PCA) based SVDD method and other standard one class classfers. Keywords: Non-Negatve Matrx Factorzaton, Support Vector Data Descrpton, One Class Classfcaton. 1. Introducton In recent years, there has been consderable nterest n one class classfers. One class classfcaton was orgnally proposed n obect recognton applcaton [1]. Only one target class s well characterzed by nstances n the tranng data n one class classfcaton problems, and no nstance s avalable for other non-target classes, or few nstances are present and they cannot form statstcally representatve samples for the negatve concept [-4]. Ths s true n many classfcaton applcatons, such as fault dagnoss and obect dentfcaton [1, 4]. In fault dagnoss, t s easy to obtan the normal operaton nstances, but we have few nstances or no nstance to model the fault class. In obect dentfcaton, t s very challengng to collect non-obect samples when we tran the machne to learn an obect, because too many samples are avalable and t s hard to represent the negatve concept unformly. One class classfers are more dffcult to buld than conventonal mult-class classfer or bnary classfer, for only the target classfcaton boundary or densty can be obtaned when negatve sample data s ether absent or lmted n ts dstrbuton. One class classfers are generally classfed nto three man types, whch are densty estmaton, reconstructon and boundary estmaton approaches. Two classcal methods for one class classfcaton are the densty estmaton method and the reconstructon method []. Gaussan data descrpton, mxture of Gaussan data descrpton and Parzen data descrpton are well-known densty estmaton approaches. Some reconstructon approaches have also been developed, such as prncpal component analyss (PCA) data descrpton and autoencoded neural network data descrpton. Another mportant method for one class classfcaton s to obtan the boundary around the target nstances. Recently support vector data descrpton (SVDD) approach has been developed to dstngush the target class from others n the pattern space [, 5]. SVDD computes the hypersphere n the pattern space around the target class data wth the mnmum radus to encompass almost all the target nstances and exclude the non-target ones. There s an extensve lterature on the mplementaton and applcaton of SVDD. However, few researches nvestgate the data preprocessng method for SVDD. As we know, one class classfcaton requres a large number of nstances for obect tranng [6]. In addton, t s Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
2 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): dffcult to decde the feature set used to fnd the best separaton between target class and non-target class. Dmenson reducton and feature selecton s mportant for one class classfcaton [7]. PCA preprocessng has been reported for one class classfcaton to mprove the classfer performance [8]. In fact, the feature data s often non-negatve n many real lfe applcatons. Non-negatve matrx factorzaton (NMF) s superor to PCA for nonnegatve data as t employs non-negatve constran whch s accordng to the practcal meanng of the real lfe data [9, 10]. NMF has the ablty to fnd the hdng data structure and has been successfully used for feature extracton n some applcatons. In ths paper a NMF and SVDD based one class classfer s developed. Expermental results demonstrate that the performance of the proposed classfer s superor to PCA based SVDD classfer and other one class classfers.. NMF & SVDD Based One Class Classfer We wll ntroduce support vector data descrpton frstly n ths secton. L D Gven an nstance set X = [ x ld ] R, where L s the number of samples, and D s the number of features. The -sample s denoted as x. The SVDD dentfes a hypersphere wth mnmum volume contanng all or most of the nstance samples. The hypersphere volume s characterzed wth ts center c and radus R n the new feature space. The obectve of mnmum volume s acheved by mnmzng R, ths constraned optmzaton problem can be formulated as mn F ( c) = R s. t. ϕ ( x ) c R, = 1,..., L (1) where ϕ ( ) maps the feature data nto a new feature space, and s the L -norm. To allow the possblty of outlers n the tranng data set, slack varables are ntroduced as L mn F( c, ξ ) = R + C ξ s. t. = 1 ( x ) c R + ξ, ξ 0, = 1,..., L ϕ () where C s the penalty coeffcent for outlers, and ξ s the dstance between the -th nstance sample and hypersphere. It s also possble to use a kernel K ( u, v) to represent the nner product. The Gaussan kernel K( x, z) = exp( x z / s ) s known as an effcent kernel for SVDD [5], and we always use t n ths paper. The above problem can be solved by optmzng the followng dual problem after ntroducng Lagrange multplers L L L max α = K( x, x ) = α = α K( x, x ) L s. t. = α = 1, α [0, C], = 1,..., L (3) 1 A quadratc programmng algorthm can be employed to solve the above problem. There are three types of tranng nstances dependng on whether α = 0, 0 < α = 0 < C or α = C. When α = 0, the nstances are wthn the hypersphere. When 0 < α = 0 < C, the nstances are on the hypersphere boundary. When α = C, the nstances are outsde the hypersphere and have nonzero ξ. The nstances are also called support vectors (SV) when α 0. The hypersphere center can be obtaned by c = x SV α ϕ( x ) (4) The square radus R can be calculated wth the dstance between c and any support vector x on the ball boundary. R = K( x, x) α x SV K( x, x) (5) + α α K( x, x ) x SV x SV The above SVDD hypersphere result can be used for one class classfcaton after tranng. Durng the classfcaton, the sgn of the followng functon s used to udge whether an nstance s nsde the SVDD hypersphere D( x) = sgn( R ϕ( x) c (6) = sgn( z + α K( x, x) K( x, x)) where x SV x SV z = R α α K( x, x ) (7) x SV A postve sgn mples that the tested nstance s wthn the SVDD hypersphere. Next we wll gve a summary to non-negatve matrx factorzaton, and we wll descrbe our one class classfcaton method. Non-negatve matrx factorzaton was orgnally proposed by Paatero and Tapper [9]. Gven the observaton matrx Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
3 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): X = ] L D [ x ld R, and the lower-rank J, NMF fnds such non-negatve factors T = ] J D [ x d R that A = ] L J [ a l R and X AT (8) Non-negatve constrans are appled to A and T durng the decomposton, that means a 0 and t 0. NMF became popular after the smple multplcatve update rule provded by Lee and Seung [10]. Some other algorthms have been developed after ther algorthm [11, 1]. NMF has been successfully used n a varety of real world applcatons, such as pattern recognton and data mnng. NMF can be solved by mnmzng the dfference between X and AT n terms of the squared Eucldean dstance f ( A, T ) = X AT / (9) where F denotes the Frobenus norm. Alternatng nonnegatve least squares s an effcent algorthm to solve the above problem usng a block coordnate descent method n bound-constraned optmzaton. After ntalzng non-negatve A 0 and 0 T, the followng update rule s employed k A k k arg mn f(a,t ) k T 1 k+ 1 k arg mn f(a,t ) (10) where k=0,1,,... We can use a proected gradent method called alternatng non-negatve least squares [1] to keep all the elements non-negatve. Ths method shows very fast convergence and t s used n ths paper. Only non-negatve data have practcal physcal meanng n many real world applcatons, and the underlyng components of data wth non-negatve decompostons are able to provde physcal nterpretaton. For example, the sensor measurement results of dstance and volume, the housng prce n the market. Non-negatve decomposton provdes an effcent tool to extract the relevant parts from the data. In ths paper, we employ NMF n one class classfer to fnd the local patterns hdden n the tranng data, and we expect the non-negatve constrans to gve the natural representaton of the tranng data wth decomposed components. It s also mportant that NMF s an addtve model whch does not allow subtracton. Therefore NMF s able to descrbe the entre entty wth the decomposed parts, that s to say NMF s a part-based representaton. A zero-value represents the absence and a postve number represents the presence of the decomposed components n our one class classfcaton applcaton. Ths addtve nature of NMF s expected to result n a new base of the data features. l F d Ths vew of NMF leads to a two-stage one class classfcaton method. Frstly, proected gradent method s used to perform NMF on the tranng data X. We can obtan the base A and the proecton T wth NMF X=AT. A s the new base whch ncludes the structure and components nformaton hdden n the tranng data X. T s the proecton result of the tranng data X onto the base A. T can provde more feature nformaton for one class classfcaton. Secondly, SVDD s employed to perform one class classfcaton tranng wth T and correspondng labels. The traned SVDD can be used for one class classfcaton after tranng. When we perform one class classfcaton wth test data Q, the test data features P can be obtaned after the test data Q s proected on the base A wth Q=AP. And the fnal classfcaton results can be obtaned when the traned SVDD s employed to the test data features P. 3. Experments and Dscusson We wll ntroduce support vector data descrpton frstly n ths secton. False postve rate (FPR) and false negatve rate (FNR) are usually employed as error measurement for classfcaton. FPR s the rato of the number of non-target nstances whch are mstakenly classfed as target to the total number of non-target nstances. Smlarly, FNR s the rato of the number of target nstances those are mstakenly classfed as non-target to the total number of target nstances. A good one class classfer wll have both a small FPR and a small FNR. Recall (RC) s also wdely used for classfcaton accuracy measurement. Recall s defned as the rato of the number of target nstances those are correctly predcted to the total number of target nstances. A good one class classfcaton wll have a bg recall value. Recever-operatng characterstc (ROC) curve that s a functon of the true postve rato to the false postve s usually used to compare the performance of classfers, but the curve comparson of dfferent classfers s not easy. The area under the ROC curve (AUC) measure s employed to compare the performance n our experments [13]. AUC s calculated from the ROC curve values. Wth ths defnton, the larger the AUC value s, the better s the performance of a one-class classfer. In our experments, data descrpton toolbox (DDTools 1.7.5) [14] s used. And default parameters for ths toolbox are employed. The tolerance for NMF s 10, and the maxmum teraton number s percent of the whole nstances s selected as the tranng data, and the other Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
4 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): nstances data s used to evaluate the classfcaton performance after the tranng. 3.1 Compare wth Other One Class Classfers Footnotes should be typed n sngled-lne spacng at the bottom of the page and column where t s cted. Footnotes should be rare. Databases wth non-negatve data used wdely for classfcaton test n other lterature [16, 17] were employed to test the performance of the proposed algorthm n ths paper. Results on the wne recognton database and the Boston housng database from Unversty of Calforna Irvne machne learnng repostory [15] are reported here. The wne recognton database s used to determne the orgn of wnes usng chemcal analyss. The class 1 s regarded as target class n ths wne recognton database. There are 59 target nstances and 119 outler nstances wth 13 features n the wne recognton database. The Boston Housng database s used to predct the housng prce n suburbs of Boston. The class whose medan prce s less than dollar s regarded as target class. There are 458 target nstances and 48 outler nstances wth 13 features n the Boston Housng database. 70 percent target nstances and outler nstances are randomly selected from the whole nstances data for classfer tranng, and the other 30 percent for testng and evaluaton n our experments. Dfferent one class classfers were evaluated on the wne database and the housng database. These classfers ncluded Gauss, mxture Gauss (MxGauss), PCA, SVDD, Parzen, auto-encoded neural network (AENN), and the proposed one class classfer. Expermental results of the wne database and the housng database are lsted n Table 1 and Table, respectvely. The factor sze of J n equaton (8) of NMF for the wne database and the housng database s selected as 6 and 5, respectvely. Both SVDD method and Parzen method can accurately classfy all the target nstances for the wne database n Table 1, but they all have bad FPR value. Ths means these two methods classfed most outler nstances as target. The wrong result s caused by the nsuffcent nformaton n the tranng set to correctly estmate the parameters for the classfer. The error classfcaton rates for target and outler of Gauss, mxture Gauss, PCA, and auto-encoded neural network are hgher than 11 percent. All the error classfcaton rates of the proposed method are less than 6 percent. The proposed method obtaned the less total error classfcaton rate and the greater recall value. The AUC value gves the overall performance evaluaton. The proposed method obtaned the greatest AUC value, t has the superor performance. Smlar results can also be found n Table for the housng database. The proposed method obtaned the best performance compared wth other methods n our experments. Table 1: Comparson of one class classfers for wne database Gauss MxGauss PCA SVDD Parzen AENN Proposed Table : Comparson of one class classfers for housng database Gauss MxGauss PCA SVDD Parzen AENN Proposed Compare wth PCA Based SVDD Classfer PCA s often used for feature extracton before classfcaton. It can capture the data varance n the squared error sense and map data nto orthonormal subspace. Egenvalue decomposton s used to obtan the egenvectors of the target covarance matrx n the practcal calculaton. The egenvectors correspondng to the largest egenvalues are consdered as the prncpal components, they are the prncpal axs n the drecton of the largest varance. These egenvectors are used to form an orthonormal bass for data mappng. The number of the Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
5 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): orthonormal bass vectors s optmzed to represent the data varance. The one class classfers that combne PCA feature extracton and SVDD are also compared wth the proposed method n our experments. Classcal PCA and kernel PCA (KPCA) [8] based feature selecton methods are used for test. The feature number was automatcally optmzed n the experment whle the total varance was selected as 90 percent. 1(a), 1(b) and 1(c), respectvely. Some outler nstances of source data are n the hgh densty area of the target nstances as showed n Fg.1(a). Ths s smlar for PCA processed data as showed n Fg.1(b). And most outler nstances are dstrbuted n the low densty area of the target nstances area for NMF processed data as showed n Expermental results of the wne database and the housng database are lsted n Table 3 and Table 4, respectvely. The overall performance evaluaton provded by AUC value shows that PCA and kernel PCA based SVDD classfers can mprove the classfcaton performance. However, the performance mprovements of these methods are small compared wth the proposed method. Databases wth non-negatve data used wdely for classfcaton test n other lterature [16, 17] were employed to test the performance of the proposed algorthm n ths paper. Results on the wne recognton database and the Boston housng database from Unversty of Calforna Irvne machne learnng repostory [15] are reported here. The wne recognton database s used to determne the orgn of wnes usng chemcal analyss. The class 1 s regarded as target class n ths wne recognton database. There are 59 target nstances and 119 outler nstances wth 13 features n the wne recognton database. (a) Source data Table 3: Compare wth PCA based SVDD for wne database SVDD PCA+SVDD KPCA+SVDD Proposed (b) Data after PCA processng Table 4: Compare wth PCA based SVDD for housng database SVDD PCA+SVDD KPCA+SVDD Proposed The data feature dstrbuton of the housng database s plotted n Fg.1. The two prncpal features those are obtaned wth PCA analyss method of the source data, PCA processed data and NMF processed data s plotted n (c) Data after NMF processng Fg. 1 Data feature plot of housng database Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
6 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): Fg.1(c). Ths showed that the new feature space obtaned wth NMF based processng method s more sutable for one class classfcaton. PCA decomposton satsfes wth orthogonal constran, and cannot assure the decomposton results are non-negatve. NMF satsfes wth the nonnegatve constran, and t s more sutable for non-negatve data applcaton to fnd the hdden structure. Ths s the reason that NMF s superor to PCA n one class classfcaton for non-negatve data. 3.3 Comparson of dfferent factorzaton szes Decdng the factorzed matrx sze J n equaton (8) s mportant for NMF. It s known that when the sze of X s L D, J needs to satsfy J ( L D) /( L + D). Dfferent J n the proposed method s employed to the wne database and the housng database, and the results are lsted n Table 5 and Table 6, respectvely. Compared wth the AUC value of SVDD method n Table 1 for the wne database, all the AUC value of dfferent J n Table 5 are greater. Ths means our proposed NMF based method s effcent to mprove the performance of SVDD for one class classfcaton. Ths can also be verfed n Table 6 for the housng database, where all the AUC value of dfferent J s also greater than orgnal SVDD method. But the best choce of J s applcaton dependent, parameter optmzaton can be employed for selecton of J. Table 5: Comparson of dfferent factorzed sze for wne database Sze of J FPR FNR RC AUC J= J= J= J= J= J= Table 6: Comparson of dfferent factorzed sze for housng database Sze of J FPR FNR RC AUC J= J= J= J= J= J= Conclusons A two stage method for one class classfcaton employng NMF and SVDD for non-negatve data s proposed. NMF s used to proect sample nstances to a new feature space before SVDD s employed for classfcaton. There are several advantages n ths hybrd method. Frst, NMF s more effcent than PCA to fnd the hdden structure for non-negatve data, and the feature space produced wth NMF s approprate for SVDD. Second, the proposed method s superor to other classcal one class classfers. Acknowledgments Ths work s partally supported by Chna Postdoctoral Scence Foundaton ( ), Shandong Provncal Natural Scence Foundaton (ZR011FM005), Promotve Research Fund for Excellent Young and Mddle-Aged Scentsts of Shandong Provnce (BS010DX001), Scence and Technque Development Proect of Weha ( ) and Key Lab Open Fund of Harbn Insttute of Technology (HIT.KLOF ). References [1] M. Moya, M. Koch and L. Hostetler, "One-class classfer network for target recognton applcatons", n Proc. World Congress on Neural Networks, 1993, pp [] D.M.J. Tax, "One class classfcaton", Ph.D. thess, Delft Unversty of Technology, Delft, Netherlands, 001. [3] P. Juszczak, D.M.J. Tax, E. Pekalska and R.P.W. Dun, "Mnmum spannng tree based one-class classfer ", Neurocomputng, 009, Vol. 7, pp [4] L. Jamal, M. Bazmara, and S. Jarar, "Feature selecton n mbalanced data sets", Internatonal Journal of Computer Scence Issues, 01, Vol. 9, No. 3, pp [5] D.M.J. Tax and R.P.W. DunP. "Support vector doman descrpton", Pattern Recognton Letters, 1999, Vol. 0, No. 11-1, pp [6] H. Yu, "Sngle-class classfcaton wth mappng convergence", Machne Learnng, 005, Vol. 61, No.1-3, pp [7] S. D. Vllalba and P. Cunnngham, "An evaluaton of dmenson reducton technques for one-class classfcaton", Artfcal Intellgence Revew, 007, Vol. 7, No. 4, pp [8] D.M.J. Tax and P. JuszczakA. "Kernel whtenng for oneclass classfcaton", Internatonal Journal of Pattern Recognton and Artfcal Intellgence, 003, Vol. 17, pp [9] U. Paatero and A. Tapper, "Postve matrx factorzaton: a nonnegatve factor model wth optmal utlzaton of error estmates of data values", Envrometrcs, 1994, Vol. 5, No., pp [10] D.D. Lee and H.S. Seung, "Learnng the parts of obects by nonnegatve matrx factorzaton", Nature, 1999, Vol.401, pp Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
7 IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): [11] C.-J. Ln, "Proected gradent methods for nonnegatve matrx factorzaton", Neural Computaton, 007, Vol.19, No.10, pp [1] A. Cchock, R. Zdunek, A. Phan and S. Amar, Nonnegatve matrx and tensor factorzatons, John Wley, Sngapore, 009. [13] A.P. Bradley, "The use of the area under the ROC curve n the evaluaton of machne learnng apgorthms", Pattern Recognton, 1997, Vol.30, No.7, pp [14] D.M.J. Tax, DDTools, The data descrpton toolbox for Matlab, tools.html, 010. [15] A. Frank and A. Asuncon, UCI Machne Learnng Repostory, Unversty of Calforna, 010. [16] M. Breaban and H. Luchan, "A unfyng crteron for unsupervsed clusterng and feature selecton, Pattern Recognton", 011, Vol.44, No.4, pp [17] M. Kalakech, P. Bela, L. Macare and D. Hamad, "Constrant scores for sem-supervsed feature selecton: A comparatve study", Pattern Recognton Letters, 011, Vol.3, No.5, pp Lyong Ma. receved the B.Sc degree from Harbn Insttute of Technology, Harbn, Chna, n 1993, the M.Sc. degree from Harbn Unversty of Scence and Technology, Harbn, Chna, n 1996, and Ph.D degree from Harbn Insttute of Technology n 007, respectvely. He s currently an Assocate Professor at Harbn Insttute of Technology at Weha, Weha, Chna. Hs man research areas nclude ntellgent testng and nformaton processng, bomedcal magng and mage processng. Nazhang Feng receved the B.Sc. and Ph.D. degree n control engneerng from Harbn Insttute of Technology, Harbn, Chna, n 1998 and 005, respectvely. From 005 to 007, he was a postdoctor n Fudan Unversty, Shangha, Chna. He s currently a Professor n Harbn Insttute of Technology at Weha. Hs research nterests nclude sgnal detecton and nformaton processng and medcal ultrasound magng. Q Wang receved the B.Sc. and M.Sc. degree n electromagnetc measurement from Harbn Insttute of Technology, Harbn, Chna, n 1967 and 1980, respectvely. From 1985 to 1987 and 1993 to 1995, he vsted the Unversty of Tsukuba and the Chba Insttute of Technology, Japan, as a Researcher. He s currently a Professor at the Harbn Insttute of Technology. So far, he has more than 10 papers publshed. Hs research nterests nclude the ntellgent testng nstrumentaton, nformaton processng, sensor fault dagnoss, and sensor fuson. Copyrght (c) 01 Internatonal Journal of Computer Scence Issues. All Rghts Reserved.
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More 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 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 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 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 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 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 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 informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
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 Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More 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 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 informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
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 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 informationImpact of a New Attribute Extraction Algorithm on Web Page Classification
Impact of a New Attrbute Extracton Algorthm on Web Page Classfcaton Gösel Brc, Banu Dr, Yldz Techncal Unversty, Computer Engneerng Department Abstract Ths paper ntroduces a new algorthm for dmensonalty
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 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 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 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 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 informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
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 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 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 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 informationModeling Inter-cluster and Intra-cluster Discrimination Among Triphones
Modelng Inter-cluster and Intra-cluster Dscrmnaton Among Trphones Tom Ko, Bran Mak and Dongpeng Chen Department of Computer Scence and Engneerng The Hong Kong Unversty of Scence and Technology Clear Water
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 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 informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More 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 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 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 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 informationFeature Extractions for Iris Recognition
Feature Extractons for Irs Recognton Jnwook Go, Jan Jang, Yllbyung Lee, and Chulhee Lee Department of Electrcal and Electronc Engneerng, Yonse Unversty 134 Shnchon-Dong, Seodaemoon-Gu, Seoul, KOREA Emal:
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 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 informationClassifier Ensemble Design using Artificial Bee Colony based Feature Selection
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 522 Classfer Ensemble Desgn usng Artfcal Bee Colony based Feature Selecton Shunmugaprya
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 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 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 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 informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationA MODIFIED K-NEAREST NEIGHBOR CLASSIFIER TO DEAL WITH UNBALANCED CLASSES
A MODIFIED K-NEAREST NEIGHBOR CLASSIFIER TO DEAL WITH UNBALANCED CLASSES Aram AlSuer, Ahmed Al-An and Amr Atya 2 Faculty of Engneerng and Informaton Technology, Unversty of Technology, Sydney, Australa
More informationA Study on Clustering for Clustering Based Image De-Noising
Journal of Informaton Systems and Telecommuncaton, Vol. 2, No. 4, October-December 2014 196 A Study on Clusterng for Clusterng Based Image De-Nosng Hossen Bakhsh Golestan* Department of Electrcal Engneerng,
More informationShape-adaptive DCT and Its Application in Region-based Image Coding
Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,
More informationNovel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition
Mathematcal Methods for Informaton Scence and Economcs Novel Pattern-based Fngerprnt Recognton Technque Usng D Wavelet Decomposton TUDOR BARBU Insttute of Computer Scence of the Romanan Academy T. Codrescu,,
More information