Feature Mining for GMM-Based Speech Quality Measurement

Size: px
Start display at page:

Download "Feature Mining for GMM-Based Speech Quality Measurement"

Transcription

1 Feature Mnng for GMM-Based Speech Qualty Measurement Tago H. Falk and Wa-Yp Chan Department of Electrcal and Computer Engneerng Queen s Unversty, Kngston, Ontaro, Canada Emal: {falkt, chan}@ee.queensu.ca Abstract We propose a novel approach to objectve speech qualty measurement usng feature mnng and Gaussan mxture models (GMMs). A large pool of perceptual dstorton features s extracted from the speech sgnal and data mnng technques are used to sft out the most relevant feature varables from the pool. We examne usng multvarate adaptve regresson splnes (MARS), classfcaton and regresson trees (CART), a hybrd CART-MARS scheme, and the sequental forward selecton (SFS) algorthm for data mnng. For our speech databases, the SFS algorthm provdes best performance wth a fve-feature, threecomponent GMM. A reducton of 21.7% n root-mean-squared mean opnon score estmaton error s obtaned n comparson wth ITU-T P.862 PESQ. I. INTRODUCTION The telecommuncatons ndustry s gong through a phase of rapd development. New servces and technologes emerge contnuously. Customers now have the freedom of selectng from as array of telecommuncatons servces at affordable cost. Faced wth offerng voce servces over ncreasngly heterogenous network connectons, the evaluaton of speech qualty s becomng crtcally mportant for the servce provder, servng as an nstrument for montorng and mprovement of qualty of servce and network capacty. Tradtonally, the most relable way to measure the qualty of a speech sgnal was through the use of subjectve speech qualty assessment tests such as MOS (mean opnon score) tests [1]. These tests are hghly unsutable for onlne qualty measurement and are also very expensve and tme consumng. The research descrbed below s motvated by the fact that objectve methods have replaced subjectve testng, allowng computer programs to automate speech qualty measurement n real tme, makng them sutable for feld applcatons. The Internatonal Telecommuncatons Unon ITU-T P.862 standard, also known as Perceptual Evaluaton of Speech Qualty (PESQ) [2] s the latest objectve qualty measurement standard algorthm. Nevertheless, the algorthm stll falls short of the accuracy that can be obtaned from subjectve lstenng tests wth szable lstener panels. In [3] and [4], an approach s ntroduced that uses data mnng technques to mprove the accuracy of audtory-model based qualty measurement; sgnfcant performance mprovement over PESQ was reported. Here we extend the work of [3] and [4] by proposng a novel, smple yet robust, method of speech qualty estmaton based on Gaussan mxture models (GMMs). TABLE I SUBJECTIVE RATING SCALE FOR THE MEAN OPINION SCORE - MOS Ratng Speech Qualty Level of Dstorton Excellent Imperceptble 4 Good Just perceptble but not annoyng 3 Far Perceptble and slghtly annoyng 2 Poor Annoyng but not objectonable 1 Unsatsfactory Very annoyng and objectonable A large pool of feature measurements s created from the dstorton surface between the orgnal speech sgnal and the degraded speech sgnal. Frst, we use four statstcal data mnng methods, multvarate adaptve regresson splnes (MARS) [], classfcaton and regresson trees (CART) [6], a hybrd CART-MARS technque, and the sequental forward selecton (SFS) algorthm [7] to sft out good features. We then model the jont densty of these features (x) wth the subjectve MOS (y) as a Gaussan mxture. We use ths model to derve the mnmum mean squared error (MMSE) estmate, E[y x], of the subjectve MOS value. Smulatons show that our approach outperforms PESQ by as much as 21.7% n root-mean-squared MOS estmaton error. II. OBJECTIVE SPEECH QUALITY ESTIMATION Tradtonally, the only way to measure the perceved qualty of a speech sgnal was through the use of subjectve testng,.e, a group of qualfed lsteners are asked to rate the speech they had just heard accordng to the scale gven n Table I. The average of the lstener scores s the subjectve MOS. Ths s the most relable method of speech qualty assessment but t s very expensve and tme consumng, makng t unsutable for frequent or rapd applcatons. Hence, models have been developed to dentfy audble dstortons through an objectve process based on human percepton. Ths objectve method can be mplemented by computer programs and can be used n real tme measurement of speech qualty. Several perceptual models for comparng the orgnal and the coded speech sgnal have been proposed [8] [11]. The qualty of classcal codng algorthms s estmated by waveform matchng usng sgnal-to-nose rato (SNR) and the segmental SNR. These are easy to mplement, have straghtforward nterpretatons and can estmate the qualty of speech n waveform-preservng systems. But newer generaton speech

2 coders do not preserve the waveform so these measures are of lttle relevance. Researchers have employed models of human audtory percepton n ther estmaton of perceved speech qualty. It s known that the perpheral audtory system of human preprocesses nformaton and compact feature extracton s done n hgher-level bran functons. The human decson s based on ths compacted data. An adequate model should emulate ths bologcal preprocessng and hgher-level functons, and delver ratngs that have hgh correlatons wth the subjectve results. The preprocessng part s relatvely well understood but the hgher-level bran functons are dffcult to model. A. GMMs for Speech Qualty Estmaton Gaussan mxture models have been used extensvely n speech processng, especally n speech recognton. The reasons behnd ths wdespread use are not concdental: (1) unvarate Gaussan denstes have a smple and concse representaton, dependng unquely on two parameters, mean and varance, and (2) the Gaussan mxture dstrbuton s unversally studed and ts behavors are wdely-known [12]. At a cost of extra parameters, GMMs mprove on Gaussans by allowng asymmetry and multmodalty. In prncple, GMM can approxmate any probablty densty functon to an arbtrary accuracy. Let u be an K-dmensonal vector, a Gaussan mxture densty s a weghted sum of M component denstes p(u µ, Σ, α) = α.b (u) (1) where α 0, = 1,..., M are the mxture weghts, wth M α = 1, and b (u), = 1,..., M are the K-varate Gaussan denstes wth mean vector µ and covarance matrx Σ. GMMs can assume several dfferent forms, dependng on the type of covarance matrces. The two most wdely used are full and dagonal covarance matrces. If K s the dmenson of the feature vector and M the number of Gaussan components, then the number of parameters that have to be estmated durng tranng s gven by M 2 (K2 + 3K + 2) for full matrces and M(2K + 1) for dagonal matrces. The effect of usng M full covarance matrces can be equvalently obtaned by usng a larger set of dagonal covarance Gaussans [13]. The GMM for speech qualty estmaton s bult on perceptual feature varables. The varables are obtaned from mnng a large pool of canddate feature varables. These canddate features are obtaned by classfyng perceptual dstortons nto a varety of contexts, as proposed n [3]. Frst, the clean and degraded sgnals are splt nto 7 frequency bands. The spectral power dstorton between the clean and degraded speech sgnals s then found. Tme segmentaton labels the speech frames as actve or nactve. Actve frames are further classfed nto voced or unvoced. The total dstorton of each frame s gven severty classfcatons of low, medum, or hgh by smple thresholdng. Dstorton samples n tme-frequency bns are thus labelled accordng to ts frequency band, tme-segmentaton type, and severty level. Addtonal contexts are created where each subband s further labelled wth the rank order obtaned by rankng the 7 dstortons n a frame n the order of decreasng magntude. Weghted mean and root-mean dstortons, probablty of each frame type and the lowest-frequency band and hghestfrequency band energy of the clean speech frames are also used to form a pool of 209 canddate features. Statstcal data mnng s used to sft out the most relevant varables from the pool of varables. The top- most mportant feature varables as ranked by MARS, CART, a CART-MARS hybrd confguraton, or the SFS algorthm wll be used here. We model the jont densty of the top- most mportant feature varables (x) wth the subjectve MOS (y) as a Gaussan mxture gven by (1) wth u = [y, x] T. We then predct the value of the subjectve MOS, y, gven the observed values of the -dmensonal feature vector, x. The MMSE estmate of y gven x, namely E[y x], s [14] E[y x] = h (x)[µ y + Σyx (Σ xx ) 1 (x µ x j )] (2) where h (x) denotes the probablty that the th Gaussan component of the margnal predctor densty p(x) generated the vector x and s gven by h (x) = α Σ xx k=1 1/2 e α k Σ xx k 1/2 e ) ( 2 1 (x µx )T (Σ xx ) 1 (x µ x ) ( 1 2 (x µx k )T (Σ xx k ) 1 (x µ x k ) ). (3) The covarance matrx of the th GMM component s ( Σ yy Σ = Σ yx ). Σ xy Σ xx If the covarance matrces are restrcted to be dagonal, the least squares estmate smplfes to E[y x] = h (x)µ y. (4) Ths restrcton has to be used wth care, as t can result n large estmaton errors when there exsts a sgnfcant amount of correlaton between the predctor and the response varables,.e. Σ yx are far from zero. III. EXPERIMENTAL RESULTS We compare our algorthm to PESQ usng MOS labelled speech databases. The performance of the algorthms s assessed by the correlaton between subjectve MOS w and objectve MOS y, usng Pearson s formula N R = (w w)(y ȳ) N (w w) () 2 N (y ȳ) 2 where w s the average of w, and ȳ s the average of y. MOS measurement accuracy s assessed usng the root-mean-square MOS error (RMSE) RMSE = N (w y ) 2. (6) N

3 Subjectve MOS score TABLE II PERFORMANCE COMPARISON FOR CART SELECTED VARIABLES - FULL GMM GMM TABLE III PERFORMANCE COMPARISON FOR MARS SELECTED VARIABLES - FULL Objectve MOS score GMM GMM Fg. 1. Subjectve MOS versus Objectve MOS for CART selected features usng fve dagonal Gaussan components. In [3], RMSE s shown to be the sum of unexplaned varance n the regresson model and the bas error between subjectve MOS and objectve MOS. The calculaton of R does not take nto consderaton ths bas error; therefore, unless the estmates are unbased or all suffer from the same bas, RMSE s a more realstc measure of estmator performance. The speech databases nclude seven multlngual databases n ITU-T P-seres Supplement 23, two wreless databases and a mxed wrelne-wreless database. We combne these ten databases nto a global database and then use 10-fold cross valdaton to measure performance. The global database s randomly dvded nto 10 data sets of almost equal sze. Tranng and testng s performed n 10 trals, where, n each tral, one of the data sets serves as a test set and the remanng 9 are combned to serve as a tranng set. Each data set serves as a test set only once. The ten resultng R s and RMSE s are averaged to obtan the cross-valdaton R and RMSE. The parameters of the GMM are estmated va the EM algorthm [1]. The algorthm teratons produce a sequence of models wth monotoncally nondecreasng (log-)lkelhood values. Though the EM algorthm converges to a maxmum lkelhood t has a few drawbacks: t s a greedy algorthm and may converge to a local maxmum and not the global maxmum. GMMs produced by the EM algorthm are, consequently, senstve to ntalzaton. We use the k-means algorthm [16] to ntalze the GMM parameters. Intal tests show that by usng dagonal covarance matrces only a modest mprovement over PESQ s acheved. We attrbute ths to the fact that the features selected by CART and/or MARS have sgnfcant correlaton amongst them and the use of a small number of dagonal Gaussan components does not compensate for ths. When lookng at the graph of the subjectve MOS versus objectve MOS for one of the cross-valdaton trals, we see the penalty of usng dagonal matrces (vde Fg. 1). The promnent vertcal algnment of ponts suggests poor predcton performance. The algnment dsappears and better predcton performance s obtaned when full covarance matrx s used, as we show below. Wth full covarance matrces the number of parameters that need to be estmated scales quadratcally wth the feature space dmenson. When dealng wth lmted data, as n our case, severe problems arse due to sngulartes and local maxma n the log-lkelhood functon. Many regularzaton schemes have been proposed to mprove the smoothness and generalzaton propertes of the estmated densty functon. Here we avert ll-condtonng by addng a small dagonal matrx, namely ɛi n n, to each covarance matrx n each M-step teraton of the EM algorthm. Typcally, the optmal value for ɛ s not known a pror. A smple procedure used here s to vary ɛ over a range of values and choose the value that leads to the best performance on the valdaton data set. We vared ɛ from to 1 and the value that led to best performance was ɛ = The performance results for the feature varables selected by CART and MARS are shown n Tables II and III, respectvely. GMM- stands for a Gaussan mxture model wth components and % ndcates percentage ncrease n R or percentage reducton of RMSE relatve to PESQ. The result for PESQ s based on usng a 3rd order regresson polynomal traned on the global database. On our data, ths method outperformed the PESQ-LQ mappng proposed n [17]. The most salent feature varables are lsted n Table IV for all four data mnng technques. The varables are defned n the Appendx. Wth the correlaton between features properly modelled, an average mprovement of 4.9% and 1.74% n R and RMSE, respectvely, s acheved for CART selected features. Further mprovement can be seen for MARS selected features; an average mprovement of 6.23% and 17.7% n R and RMSE s acheved. As can be seen, only voced frames are captured by the features selected usng CART. In whspered speech, all normally voced phonemes are not vocalzed,.e. they become unvoced. Such stuaton, though rare, would cause problems for these features. It can be nferred that the estmator s not senstve to degradaton n the unvoced regons and the non-

4 TABLE IV FEATURE VARIABLES TABLE VI SUBSET OF THE VALIDATION SET Rank MARS CART CART-MARS SFS 1 I P VUV V WM I P VUV V O 1 2 V B V O 2 REF 1 I P VUV 3 V B 2 V O 1 V WM 2 REF 1 4 V B 2 2 V RM V B V B 2 U P VUV V O 0 U P V O TABLE V PERFORMANCE COMPARISON FOR CART-MARS SELECTED VARIABLES - FULL Full GMM Full GMM speech regons. The CART-MARS hybrd scheme uses CART to pre-screen features from the feature canddate pool. The features selected by CART are then used as a smaller feature canddate pool for MARS to sort through. By dong ths, features can be drawn from voced and unvoced frames. An average mprovement of 6.27% and 18.6% n R and RMSE s acheved. The performance results for the feature varables selected by ths hybrd scheme are shown n Table V. Careful analyss of the features selected by the three aforementoned data mnng schemes led us to beleve that further mprovement s possble. A certan trend was noted wthn the feature varables as shown n Table VI. The table s composed of the subjectve MOS, fve MARS-selected features (x1 to x), and objectve MOS ( MˆOS) estmated usng three Gaussan components for sx dstnct test speech sgnals. Note that all sx test sgnals have the same subjectve MOS,.e., they have been rated as havng, on average, the same objectonable level of dstorton. It can be nferred that these sx speech sgnals belong to the same dstorton class and ther feature values should not vary consderably. Table VI shows that the features selected by MARS, on the contrary, vary consderably and ths varaton s reflected on the estmates. For test vector 2 we obtan an estmate of 3.98,.e. an error of 2.8%, but for test vector 6 we obtan an estmate of 2.308, an error of 34%! We conjecture that n order to obtan further mprovement better features would have to be used, preferably features that do not vary consderably wthn the same dstorton class. To ths end, we use the SFS algorthm. The algorthm starts wth the varable that s most correlated wth the target varable, and at each step adds a new varable that, together wth the prevous ones, most accurately predcts the target. A partal F-test s ncorporated n the algorthm such that the varables chosen have small varances wthn each dstorton class. An mprovement of 8% and 21.7% n R and RMSE s provded by the SFS algorthm. The performance results of ths scheme are shown n Table VII. Table IV shows that the features selected by the SFS algorthm are gleaned from the # MOS ˆ MOS x1 x2 x3 x4 x TABLE VII PERFORMANCE COMPARISON FOR SFS SELECTED VARIABLES - FULL Full GMM Full GMM top three features selected by MARS, CART, and the CART- MARS hybrd scheme. Fgure 2 depcts a scatter plot of the subjectve MOS versus objectve MOS for CART-MARS selected features, usng a GMM wth three Gaussan components and full covarance matrces. The data shown are for one of the cross-valdaton trals. We see that the ponts are no longer algned wth the vertcal axs as n the case of dagonal covarance matrces. A further method for measurng model performance s to plot the dstrbuton of absolute resdual errors between objectve and subjectve MOS [18]. Fgure 3 plots the dstrbuton of errors for SFS selected features for one of the trals. As can be seen, almost 78% of the GMM estmates are wthn 0.0 unt of the subjectve MOS. Subjectve MOS score Objectve MOS score Fg. 2. Subjectve MOS versus Objectve MOS for CART-MARS selected features usng three full Gaussan components.

5 Fg. 3. % of absolute errors n gven range Absolute error magntude Resdual error dstrbuton for SFS selected features IV. CONCLUSION AND FURTHER INVESTIGATION A novel objectve speech qualty estmaton algorthm s proposed based on Gaussan mxture modelng. We have nvestgated the usefulness of features selected by CART, MARS, a CART-MARS hybrd scheme, and the SFS algorthm. The SFS algorthm provded the best performance. The CART-MARS hybrd scheme mproved on CART by ncludng features from unvoced frames. When usng dagonal Gaussan components we observed that our approach provded only modest mprovement over PESQ. Ths was attrbuted to the fact that the fve most salent feature varables selected by the data mnng technques were correlated and the use of only fve dagonal components was not suffcent to compensate for ths. Wth full Gaussan components we have obtaned an mprovement over PESQ of 8% and 21.7% n R and RMSE, respectvely. Whle our results show that feature mnng n conjuncton wth GMM modellng can produce smple estmators that outperform PESQ, the robustness of the estmators s also an mportant ssue. Our use of cross-valdaton to measure performance offers some robustness. We are currently pursung other avenues ncludng the choce of feature varables. Ongong research examnes feature selecton that drectly optmzes GMM estmaton performance. Currently, CART/MARS selected features could be suboptmal for GMM estmaton. Deeper nsghts would shed lght on why the approach works well or not so well, and whether there s a gap relatve to best possble performance. V. APPENDIX Here we descrbe the feature varables shown n Table IV. The seven subbands are ordered from 0 to 6 and the three dstorton severty classes from 0 to 2. I P VUV: Rato of the number of nactve frames to the total number of actve speech frames; U P VUV: Rato of the number of unvoced frames to the total number of actve speech frames; U P: Percentage of unvoced frames n the speech fles; REF 1: Hgh-frequency spectral energy of reference sgnal; V B : Dstorton for subband of voced frames, wthout dstorton severty classfcaton; V B j: Dstorton for severty class j of subband of voced frames; V O : Dstorton for ordered subband of voced frames, wthout dstorton severty classfcaton; V WM : Weghted mean dstorton for severty class of voced speech frames; V WM: Weghted mean dstorton of voced speech frames; V RM: Root-mean dstorton of voced speech frames. REFERENCES [1] ITU-T Rec. P.830, Subjectve performance assessment of telephoneband and wdeband dgtal codecs, Internatonal Telecommuncaton Unon, Geneva, Swtzerland, Feb [2] ITU-T Rec. P.862, Perceptual evaluaton of speech qualty (PESQ): An objectve method for end-to-end speech qualty assessment of narrowband telephone networks and speech codecs, Internatonal Telecommuncaton Unon, Geneva, Swtzerland, Feb [3] W. Zha and W.-Y. Chan, A data mnng approach to objectve speech qualty measurement, n Proc. of the Internatonal Conference on Acoustcs, Speech, and Sgnal Processng 2004, vol. 1, May 2004, pp [4], Voce qualty assessment usng classfcaton trees, n Proc. of the 37 th Aslomar Conference on Sgnals, Systems and Computers, vol. 1, November 2003, pp [] J. H. Fredman, Multvarate adaptve regresson splnes, The Annals of Statstcs, vol. 19, no. 1, pp , March [6] L. Breman, J. Fredman, R. Olshen, and C. Stone, Classfcaton and Regresson Trees. Monterey, CA: Wadsworth & Brooks, [7] A. Jan and D. Jongker, Feature selecton: evaluaton, applcaton, and small sample performance, n IEEE Transactons on Pattern Analyss and Machne Intellgence, vol. 19, no. 2, February 1997, pp [8] S. Wang, A. Sekey, and A. Gersho, An objectve measure for predctng subjectve qualty of speech coders, IEEE Journal on Selected Areas n Communcatons, vol. 10, no., pp , June [9] R. Kubchek, E. Quncy, and K. Kser, Speech qualty assessment usng expert pattern recognton technques, n Proceedngs of the IEEE Conference on Communcatons, Computers and Sgnal Processng, June 1989, pp [10] S. Voran, Objectve estmaton of perceved speech qualty - part I: Development of the measurng normalzng block technque, IEEE Transactons on Speech and Audo Processng, vol. 7, no. 4, pp , July [11], Objectve estmaton of perceved speech qualty - part II: Evaluaton of the measurng normalzng block technque, IEEE Transactons on Speech and Audo Processng, vol. 7, no. 4, pp , July [12] X. Zhuang, Y. Huang, K. Palanappan, and Y. Zhao, Gaussan mxture densty modelng, decomposton and applcatons, IEEE Transactons on Image Processng, vol., no. 9, pp , September [13] D. Reynolds and R. Rose, Robust text-ndependent speaker dentfcaton usng Gaussan mxture speaker models, IEEE Transactons on Speech and Audo Processng, vol. 3, no. 1, pp , January 199. [14] Z. Ghahraman and M. I. Jordan, Supervsed learnng from ncomplete data va an EM approach, n Advances n Neural Informaton Processng Systems, vol. 6. Morgan Kaufmann Publshers, Inc. [1] A. Dempster, N. Lar, and D. Rubn, Maxmum lkelhood from ncomplete data va the EM algorthm, J. Royal Statstcal Socety, vol. 39, pp. 1 38, [16] A. Gersho and R. Gray, Vector Quantzaton and Sgnal Compresson. Kluwer Academc Publshers, [17] A. W. Rx, A new PESQ scale to assst comparson between P.862 PESQ score and subjectve MOS, ITU-T SG12 COM12-D86, May [18] A. Rx, J. Beerends, M. Holler, and A. Hekstra, PESQ - the new ITU standard for end-to-end speech qualty assessment, n 109 th AES Conventon, no. pre-prnt 260, September, pp

Smoothing Spline ANOVA for variable screening

Smoothing 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 information

Feature Reduction and Selection

Feature 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 information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. 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 information

Cluster Analysis of Electrical Behavior

Cluster 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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 information

Data Mining: Model Evaluation

Data 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 information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term 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 information

Unsupervised Learning

Unsupervised 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 information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING 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 information

Support Vector Machines

Support 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 information

Fuzzy Logic Based RS Image Classification Using Maximum Likelihood and Mahalanobis Distance Classifiers

Fuzzy 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 information

S1 Note. Basis functions.

S1 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying 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 information

Lecture 4: Principal components

Lecture 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 information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

The Research of Support Vector Machine in Agricultural Data Classification

The 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 information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

CS 534: Computer Vision Model Fitting

CS 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 information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face 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 information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Adjustment methods for differential measurement errors in multimode surveys

Adjustment methods for differential measurement errors in multimode surveys Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 4-5 September 2014 Outlne Introducton Stablsng

More information

Programming in Fortran 90 : 2017/2018

Programming 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 information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew 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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid 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 information

Performance Analysis of Data Hiding in MPEG-4 AAC Audio *

Performance Analysis of Data Hiding in MPEG-4 AAC Audio * TSINGHUA SCIENCE AND TECHNOLOGY ISSNll1007-0214ll07/21llpp55-61 Volume 14, Number 1, February 2009 Performance Analyss of Data Hdng n MPEG-4 AAC Audo * XU Shuzheng ( ) **, ZHANG Peng ( ), WANG Pengjun

More information

Modeling Inter-cluster and Intra-cluster Discrimination Among Triphones

Modeling 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 information

Applying EM Algorithm for Segmentation of Textured Images

Applying EM Algorithm for Segmentation of Textured Images Proceedngs of the World Congress on Engneerng 2007 Vol I Applyng EM Algorthm for Segmentaton of Textured Images Dr. K Revathy, Dept. of Computer Scence, Unversty of Kerala, Inda Roshn V. S., ER&DCI Insttute

More information

Feature Extraction and Test Algorithm for Speaker Verification

Feature Extraction and Test Algorithm for Speaker Verification Feature Extracton and Test Algorthm for Speaker Verfcaton Wu Guo, Renhua Wang and Lrong Da Unversty of Scence and Technology of Chna, Hefe guowu@mal.ustc.edu.cn,{rhw, lrda}@ustc,edu.cn Abstract. In ths

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy 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 information

Enhanced AMBTC for Image Compression using Block Classification and Interpolation

Enhanced AMBTC for Image Compression using Block Classification and Interpolation Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION

CHAPTER 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 information

An Image Compression Algorithm based on Wavelet Transform and LZW

An Image Compression Algorithm based on Wavelet Transform and LZW An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining 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 information

An Image Fusion Approach Based on Segmentation Region

An 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 information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image 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 information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

X- Chart Using ANOM Approach

X- 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 information

VoIP Traffic Modelling using Gaussian Mixture Models, Gaussian Processes and Interactive Particle Algorithms

VoIP Traffic Modelling using Gaussian Mixture Models, Gaussian Processes and Interactive Particle Algorithms VoIP Traffc lng usng s, Gaussan Processes and Algorthms Ana-Mara Smonovc 1, Alexandru Adran Tantar 1, Pascal Bouvry 1, Andre Tchernykh 2, Jorge M. Cortés-Mendoza 2 and Loc Ddelot 3 1 Faculty of Scence,

More information

A Robust Method for Estimating the Fundamental Matrix

A 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 information

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty

More information

Recognizing Faces. Outline

Recognizing 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-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 information

Object-Based Techniques for Image Retrieval

Object-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 information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks

GA-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 information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Face Recognition Based on SVM and 2DPCA

Face 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 information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

Comparison Study of Textural Descriptors for Training Neural Network Classifiers

Comparison 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 information

TN348: Openlab Module - Colocalization

TN348: 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

Efficient Video Coding with R-D Constrained Quadtree Segmentation

Efficient Video Coding with R-D Constrained Quadtree Segmentation Publshed on Pcture Codng Symposum 1999, March 1999 Effcent Vdeo Codng wth R-D Constraned Quadtree Segmentaton Cha-Wen Ln Computer and Communcaton Research Labs Industral Technology Research Insttute Hsnchu,

More information

Classification / Regression Support Vector Machines

Classification / 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 information

Support Vector Machines

Support 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 information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Video Content Representation using Optimal Extraction of Frames and Scenes

Video Content Representation using Optimal Extraction of Frames and Scenes Vdeo Content Representaton usng Optmal Etracton of rames and Scenes Nkolaos D. Doulam Anastasos D. Doulam Yanns S. Avrths and Stefanos D. ollas Natonal Techncal Unversty of Athens Department of Electrcal

More information

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-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 information

Research and Application of Fingerprint Recognition Based on MATLAB

Research 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

Lecture 5: Multilayer Perceptrons

Lecture 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 information

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton

More information

Mixed Linear System Estimation and Identification

Mixed Linear System Estimation and Identification 48th IEEE Conference on Decson and Control, Shangha, Chna, December 2009 Mxed Lnear System Estmaton and Identfcaton A. Zymns S. Boyd D. Gornevsky Abstract We consder a mxed lnear system model, wth both

More information

A Multivariate Analysis of Static Code Attributes for Defect Prediction

A Multivariate Analysis of Static Code Attributes for Defect Prediction Research Paper) A Multvarate Analyss of Statc Code Attrbutes for Defect Predcton Burak Turhan, Ayşe Bener Department of Computer Engneerng, Bogazc Unversty 3434, Bebek, Istanbul, Turkey {turhanb, bener}@boun.edu.tr

More information

An Improved Neural Network Algorithm for Classifying the Transmission Line Faults

An Improved Neural Network Algorithm for Classifying the Transmission Line Faults 1 An Improved Neural Network Algorthm for Classfyng the Transmsson Lne Faults S. Vaslc, Student Member, IEEE, M. Kezunovc, Fellow, IEEE Abstract--Ths study ntroduces a new concept of artfcal ntellgence

More information

A NEW AUDIO WATERMARKING METHOD BASED

A NEW AUDIO WATERMARKING METHOD BASED A NEW AUDIO WATERMARKING METHOD BASED ON DISCRETE COSINE TRANSFORM WITH A GRAY IMAGE Mohammad Ibrahm Khan 1, Md. Iqbal Hasan Sarker 2, Kaushk Deb 3 and Md. Hasan Furhad 4 1,2,3 Department of Computer Scence

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

A DCVS Reconstruction Algorithm for Mine Video Monitoring Image Based on Block Classification

A DCVS Reconstruction Algorithm for Mine Video Monitoring Image Based on Block Classification 1 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 0 1 Artcle A DCVS Reconstructon Algorthm for Mne Vdeo Montorng Image Based on Block Classfcaton Xaohu Zhao 1,, Xueru Shen 1,, *, Kuan Wang 1, and Wanme L 1,

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-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 information

CLASSIFICATION OF ULTRASONIC SIGNALS

CLASSIFICATION 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 information

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE

SHAPE 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 information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Journal of Process Control

Journal of Process Control Journal of Process Control (0) 738 750 Contents lsts avalable at ScVerse ScenceDrect Journal of Process Control j ourna l ho me pag e: wwwelsevercom/locate/jprocont Decentralzed fault detecton and dagnoss

More information

Spectral Subband Centroids for Robust Speaker Identification using Marginalization-based Missing Feature Theory

Spectral Subband Centroids for Robust Speaker Identification using Marginalization-based Missing Feature Theory Spectral Subband Centrods for Robust Speaer Identfcaton usng Margnalzaton-based Mssng Feature Theory Aaron Ncolson, Jac Hanson, James Lyons, Kuldp Palwal Sgnal Processng Laboratory Grffth Unversty, Brsbane,

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A 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 information

Modular PCA Face Recognition Based on Weighted Average

Modular 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 information

Detection of an Object by using Principal Component Analysis

Detection 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 information

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an Scalable Vdeo Codng wth Robust Mode Selecton Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna Santa Barbara, CA 906 Abstract We propose

More information

Adaptive Transfer Learning

Adaptive Transfer Learning Adaptve Transfer Learnng Bn Cao, Snno Jaln Pan, Yu Zhang, Dt-Yan Yeung, Qang Yang Hong Kong Unversty of Scence and Technology Clear Water Bay, Kowloon, Hong Kong {caobn,snnopan,zhangyu,dyyeung,qyang}@cse.ust.hk

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. 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 information

SVM-based Learning for Multiple Model Estimation

SVM-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 information

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features A Probablstc Approach to Detect Urban Regons from Remotely Sensed Images Based on Combnaton of Local Features Berl Sırmaçek German Aerospace Center (DLR) Remote Sensng Technology Insttute Weßlng, 82234,

More information