SECOND FIDDLE IS IMPORTANT TOO: PITCH TRACKING INDIVIDUAL VOICES IN POLYPHONIC MUSIC

Size: px
Start display at page:

Download "SECOND FIDDLE IS IMPORTANT TOO: PITCH TRACKING INDIVIDUAL VOICES IN POLYPHONIC MUSIC"

Transcription

1 SECOND FIDDLE IS IMPORTANT TOO: PITCH TRACKING INDIVIDUAL VOICES IN POLYPHONIC MUSIC Mert Bay 2, Andreas F. Ehmann 2, James W. Beauchamp 2, Pars Smaragds 1,2 and J. Stephen Downe 3 1 Department of Computer Scence, Unversty of Illnos at Urbana-Champagn 2 Department of Electrcal & Computer Eng., Unversty of Illnos at Urbana-Champagn 3 Graduate School of Lbrary and Informaton Scence, Unversty of Illnos at Urbana-Champagn {mertbay,aehmann,jwbeauch,pars,jdowne}@llnos.edu ABSTRACT Recently, there has been much nterest n automatc ptch estmaton and note trackng of polyphonc musc. To date, however, most technques produce a representaton where ptch estmates are not assocated wth any partcular nstrument or voce. Therefore, the actual tracks for each nstrument are not readly accessble. Access to ndvdual tracks s needed for more complete musc transcrpton and addtonally wll provde a wndow to the analyss of hgher constructs such as counterpont and nstrument theme mtaton durng a composton. In ths paper, we present a method for trackng the ptches (F0s) of ndvdual nstruments n polyphonc musc. The system uses a pre-learned dctonary of spectral bass vectors for each note for a varety of muscal nstruments. The method then formulates the trackng of ptches of ndvdual voces n a probablstc manner by attemptng to explan the nput spectrum as the most lkely combnaton of muscal nstruments and notes drawn from the dctonary. The method has been evaluated on a subset of the MIREX multple-f0 estmaton test dataset, showng promsng results. 1. INTRODUCTION One of the most mportant classes of nformaton to be retreved from musc s ts polyphonc ptch content. Recently, many researchers have attempted multple-f0 estmaton (MFE) [11, 14, 18]. (A revew of state-of-the-art MFE systems can be found n [2].) Many current MFE systems such as [14] restrct themselves to the estmaton of a certan number of F0s for each frame, whle gnorng whch nstrument/tmbre corresponds to each F0. Whle approaches for trackng solo melodc voce/tmbres exst [15], the ptch trackng of addtonal lnes and parts n polyphonc musc opens new possbltes. By exposng the ndvdual lnes produced by each nstrument n polyphonc musc, aspects such as counterpont, the appearance of letmotfs across nstruments n a pece, and hdden thematc Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. c 2012 Internatonal Socety for Musc Informaton Retreval. references across muscal peces can be uncovered. Therefore, nstruments and ther tmbres are very mportant components n musc and should be tracked along wth ther F0s. Moreover, knowng each nstrument s F0 track can be very benefcal for a varety of MIR user applcatons, such as musc transcrpton, score algnment, audo musc smlarty, cover song dentfcaton, actve musc lstenng, melodc smlarty, harmonc analyss, ntellgent equalzaton, and F0-guded source separaton. As stated prevously, most MFE systems produce lowlevel representatons of the polyphonc ptch content present n musc audo whch report only what fundamental frequences are present at each gven tme. However hgher-level representatons can attempt to track and lnk these fundamental frequences over tme to form notes such as descrbed n [3]. It s mportant to note that such trackng can also mprove the accuracy of MFE s based purely on ndvdual frames, as reported reported n [18]. In [12] a classfcaton approach s used to determne sngng voce portons n musc audo so as to buld the ptch-track correspondng to a vocal melody. In [5, 6], a frame level mult- F0 estmaton method s used followed by a constraned clusterng method that uses harmonc ampltude-based features to cluster ptches nto ptch tracks. In these cases, to buld nstrument or tmbre-specfc ptch tracks, bottom-up methods were used that frst produced frame-based ptch estmates and subsequently sometmes attempted to buld note-level representatons, whch may form solo phrases. In the method presented n ths paper, we use an alternatve approach. Instead of buldng tmbre tracks from the ptch content, our proposed approach uses tmbre nformaton to gude the formaton of nstrument-specfc ptch tracks. Ths paper s organzed as follows. Secton 2 detals the proposed method. Secton 3 descrbes the evaluaton datasets, measures, and results. The evaluaton results are dscussed n Secton 4 and conclusons and future work covered n Secton PROPOSED METHOD To make a system that tracks ptches attrbuted to dfferent muscal nstruments, we borrow an dea from the supervsed sound source separaton doman: usng a spectral lbrary [1, 13]. By tranng our system on example sounds

2 from dfferent nstruments, we can track them n complex sound mxtures. The proposed method s based on probablstc latent component analyss (PLCA) [17]. PLCA s a varant of non-negatve matrx factorzaton (NMF) and has been used wdely to model sounds n the spectral doman. Its probablstc nterpretaton makes t extensble to usng prors and statstcal technques. We use regular PLCA to buld dctonares of spectra ndexed by F0 and nstrument where the spectra are analyzed from recordngs of ndvdual notes of dfferent muscal nstruments. We extend the model of [16] to represent each source/nstrument not by only one spectral dctonary, but rather wth a collecton of dctonares, each of whch s an ensemble of spectral bass vectors that have the same F0. We model the nput musc sgnal s spectrum as a sum of bass vectors from F0-specfc spectrum dctonares for dfferent nstruments. Update rules are desgnated to calculate the model parameters, whch are estmated probabltes for the occurrence of each spectral bass vector, F0- spectrum dctonary, and nstrument n the nput mxture at a gven tme. Fnally, we perform the Vterb algorthm [8] to track the most lkely ptch sequence for each nstrument. A snusodal model s used for the tme-frequency representaton because of ts compactness and also for representng each note ndependent of the ntonaton errors or tunng dfferences between tranng and test set performers. We begn by performng a short-tme Fourer transform on the audo sgnal. Peaks n the spectrum are then determned usng a frequency-dependent threshold as descrbed n [7]. We then refne each peak s ampltude and frequency usng a sgnal dervatve method proposed by [4]. 2.1 Model We model the audo nput mxture s spectrum for each frame as a sum of nstrument tones where each tone s represented by a dctonary of spectral bass vectors that are learned n advance. It s assumed that all nstrument tones have harmoncally related frequences whch are nteger multples of an F0 frequency. It turns out that n a mxture of such tones there s a hgh probablty that harmoncs wll overlap. The nput spectrum can be modeled as a dstrbuton/hstogram over a range of frequences. E.g., each component s vewed as the probablty of occurrence of that partcular frequency. The magntude at any partcular frequency can be thought as an accumulaton of magntudes from varous nstruments due to component overlappng. The scaled verson of the nput mxture spectrum s modeled as a dscrete dstrbuton. The generatve process s modeled as follows: X t (f) = P t (f) = I P t () N K P t (p ) P t (z p)p p (f z) (1) n p z z p where X t (f j ) s the spectral magntude of the peak j at frequency f j for the observed nput mxture spectrum at tme t; P t (f) s an approxmaton of the nput spectrum; P t () s the estmated probablty of occurrence of nstrument at tme t, whereas P t (p ) s the estmated probablty that ptch p s produced by nstrument ; P (f z) s the learned spectral bass vector for the ptch p of nstrument ; and P t (z p) s the probablty (weght) of that bass vector. The above model explans the mxture magntude spectrum herarchcally as the sum of N ndvdual ptches from I dfferent nstruments where the dctonary correspondng to each ptch/nstrument has K elements. The ndependence relatonshps of the model can be represented by the graph I P Z F. The process that generates the frequency components n the observed magntude spectrum s as follows: Frst, an ndvdual nstrument lbrary s selected from a group of nstrument lbrares. Second, a spectrum dctonary s drawn for each ptch from the nstrument lbrary. Thrd, a spectral bass vector s drawn from a partcular F0-spectrum dctonary for the nstrument. Fourth, a spectral component at a partcular frequency s drawn from the spectral bass vector. Although t s possble that ths spectral component wll be generated by only a sngle nstrument, most often t only contrbutes a fracton to the magntude of the observed spectrum at that frequency. 2.2 Parameter Estmaton Parameters for the model θ = {P t (z p), P t (p ), P t ()} can be estmated usng an expectaton-maxmzaton (EM) algorthm. In the E-step, current parameter values θ old are used to calculate the posteror dstrbuton. P t (, p, z f, θ old ) = P t(f, p, z)p t (, p, z) P t (f) Because of the structure of the model, P t (f, p, z) = P t (f z) and P t (, p, z) = P t ()P t (p )P t (z p). We can wrte the posteror as P t (, p, z f, θ old ) = (2) P (f z)p t(z p)p t(p )P t() P t() P t(p ) P t(z p)p p (f z) (3) n p z zp The posteror s used to calculate the expectaton of the complete data log lkelhood Q Q(θ, θ old ) = X f P (, p, z f, θ old )log(p (, p, z, f θ) (4) f z zp n p In the M-step, new parameters are estmated by maxmzng the above functon accordng to θ, resultng n the followng update rules: P t (z p) new P t (p ) new P t () new f z z p f z z p f p p z z p f p p z z p f p p z z p f (5) (6) (7)

3 We then use the new estmates to calculate the posteror n an teratve manner and repeat untl convergence s acheved. 2.3 Sparsty Pror At any gven tme, we expect each nstrument actve to be playng a sngle ptch. Even though the parameter estmaton method would allow multple ptches per frame for each nstrument, n ths project our goal s to track a monophonc ptch contour for each nstrument. We also expect that not all nstruments are actve at the same tme. Enforcng sparsty constrants on note and nstrument probabltes P t (p ) s and P t() s renforce ths behavor. We use the followng pror (the normalzng constant s dropped for convenence) ( ) β P (φ) = (P (φ)) α (8) φ Addng the above pror to the expectaton of the complete data log-lkelhood and maxmzng t wth respect to P () and P (p ), we arrve at the followng update rules P (p ) new P (, p, z f)x f + βp(pt(p ))α (9) (P t(p )) α z z p f p p P t () new p p z z p f + βp(pt())α (10) (P t()) α p (We have to rescale explctly so that t sums up to one.) new P (p ) new P (p )new P () and P new ()new P () new (11) p p 2.4 Enforcng Contnuty P () Our goal s to track each nstrument s F0 through tme. We expect the ptch contour to be smooth, not changng drastcally from frame to frame except at note transtons. Usng the Vterb algorthm, we treat the ptches as hdden states and pose the nstrument trackng problem as one of nferrng the most lkely ptch state sequence for each nstrument. Above estmated ptch dstrbutons (whch maxmze the mxture lkelhood P (X t (f), p, z)) for each nstrument are consdered to be the emsson probablty of the hdden state n a hdden Markov model (HMM). Transton probabltes are modeled as normal dstrbutons gven by P (p t p t 1) = 1 2πσ e ( f 0t f ) 2 0t 1 2σ 2 (12) where p t denotes the hdden ptch state for nstrument at tme t. f 0t denotes the F0 assocated wth the hdden ptch state for nstrument at tme t. Transtons are calculated wthn the same nstrument. We emprcally choose σ = 7 + f/100hz. The above dstrbuton enforces the contnuty of the actve notes from frame to frame. 3. EVALUATION ON REAL WORLD DATA We traned a dctonary for each ptch of each nstrument usng the RWC muscal nstrument database [9] usng nonnegatve matrx factorzaton wth Kullback-Lebler dvergence whch s numercally equal to the regular PLCA method n 2 dmensons [17]. For each ptch from the RWC dataset, 20 representatve spectra were derved from 27 dfferent tones correspondng to 3 players, 3 dynamcs (pano, mezzo, forte), and 3 artculatons (normal, staccato, vbrato). In the ptch trackng stage, we lmt the number of nstrument lbrares to choose from by desgnatng the nstruments expected to be n the nput mxture as nput to the algorthm. We also lmt the search range for F0 (whch F0-spectrum dctonares to use) of each nstrument by only usng the peaks estmated by the snusodal model that are between 50 Hz to 2500 Hz as ptch canddates. Evaluatons are performed at frame level. Mult-F0 trackng problem s smlar to melody extracton problem extended to multple melodes as opposed mult-f0 estmaton problem where the estmated number of F0s for each frame can be dfferent than the ground-truth F0s, whch s not the case n the trackng problem, where the number of estmated F0s and the reference F0s are smply equal to total number of frames. We extended the evaluaton metrcs from MIREX melody extracton task to our problem. Comparng the voced (nonzero F0) and unvoced (zero F0) values for each frame of the estmated and ground-truth F0 tracks, the counts for true postves (TP), true negatves (TN), false postves (FP) and false negatves (FN) are calculated accordng to Table 1 Estmated voced unvoced Ground voced TP FN truth unvoced FP TN Table 1. Evaluaton TP s further break down nto ones wth correct F0 and the ones wth ncorrect F0 as T P = T P C + T P I. Estmated voced F0 s correct f t s wthn a quarter tone (+-2.93%) range of a postve ground-truth F0 for that frame. The precson, recall, F-measure, and accuracy for each nput test fle s then calculated over all frames and all nstruments as: T P C,t t Precson = (13) T P,t + F P,t t T P C,t t Recall = (14) T P,t + F N,t F-measure = Acc. = t t 2 precson recall precson + recall T P C,t+T N,t t (15) T P,t+F P,t+T N,t+F N,t (16)

4 where t s the frame ndex and s the nstrument ndex. We tested the proposed method on dfferent datasets. The ground-truths for these datasets were estmated usng monophonc ptch estmators (Wavesurfer, Praat and YIN) on the sngle-nstrument recordngs pror to mxng. The results of the monophonc ptch estmators are manually corrected where necessary. For prelmnary testng and development, we appled the method on a 11 second excerpt taken from a real world performance by bassoon, clarnet and oboe whch was taken from a MIREX multtrack dataset (standard woodwnd quntet transcrbed from L. van Beethoven Varatons for Strng Quartet, Op.18, N.5). The three separate tracks were mxed to monaural. The results can be seen n Table 2. The proposed method scored 0.83 accuracy on average. Fgure 1 shows the multple-f0 tracks for each nstrument. Wthout trackng, the F0 s would not be connected from frame to frame. Bassoon Clarnet Oboe Ave. Accuracy Precson Recall F-measure Table 2. Evaluaton performances for a 11-s woodwnd tro excerpt (bassoon, clarnet, oboe). non-overlappng 30-second sectons were chosen from the recordng. Isolated nstruments were mxed from solo tracks to polyphones rangng from 2 (duo) to 5 (quntet), resultng n a total of 20 tracks (4 dfferent polyphones tmes fve sectons). The average ptch-trackng results over all tracks for polyphony 2 to 5 are shown n Table 3. Accuracy Precson Recall F-measure Table 3. Average performance on the MIREX woodwnd quntet dataset. Fgure 2 shows a bar graph of the performance of the method for dfferent polyphones. Fgure 3 shows the average accuraces for dfferent nstruments n varous polyphones Accuracy Precson Recall F measure 0.1 Md note number Ground truth oboe Estmated oboe Ground truth clarnet Estmated clarnet Ground truth Bassoon Estmated Bassoon Fgure 2. Performance vs. polyphony for the MIREX woodwnd quntet dataset (Fve 30-s segments per polyphony) Bassoon Clarnet Horn Oboe Flute Tme (sec) Fgure 1. Ptch (n md note numbers) vs. tme usng the proposed system on the 11-s woodwnd tro excerpt (bassoon (lower), clarnet (mddle), oboe (upper)). Thn lnes represent the ground-truth. We then tested the proposed method on two datasets used n the MIREX multple-f0 task test set [2]. The frst one s a multtrack recordng of the woodwnd quntet mentoned above [2]. The pece s hghly contrapuntal as opposed to consstng of a lone melodc voce plus accompanment. The predomnant melodes alternate between nstruments. The F0 tracks often cross each other. Fve Ave. Accuracy Fgure 3. Ave. accuracy of ndvdual nstruments for dfferent polyphones for the MIREX woodwnd quntet dataset. (Fve 30-s segments) The second dataset we tested our method on s a recordng of a four-part J.S. Bach chorales created by [5] consst-

5 ng of bassoon, clarnet, saxophone, and vola. Four 30 seconds sectons were mxed from duo to quartet, resultng n 12 tracks (2 dfferent polyphones tmes 4 sectons). The average results over all tracks n ths dataset can be seen n Table 4. Accuracy Precson Recall F-measure Table 4. Average performance for the MIREX Bach chorales dataset Fgure 4 shows a bar graph of the performance of the method for dfferent polyphones. Fgure 5 shows the average accuraces of dfferent nstruments n varous polyphones. The RWC dataset of the MIREX multple-f0 task was not evaluated because RWC samples were used for tranng. Also the pano dataset was not used because our project s goal s to track dstnct tmbres Accuracy Precson Recall F measure Fgure 4. Ave. Performance vs. polyphony for the MIREX Bach chorales dataset. (Four 30-s segments) Ave. Accuracy 0.8 Bassoon Clarnet Saxophone Voln Fgure 5. Ave. accuracy of nstruments n dfferent polyphones for the MIREX Bach chorales quntet dataset.(four 30-s segments) 4. DISCUSSION The proposed method on average performed wth 83% accuracy on dentfyng the nstrument tracks for the tro case (Fgure 1) whch was used for the development of the algorthm. Accuraces were 52% and 59% for the MIREX woodwnd quntet and Bach chorales quartet datasets. By examnng the MIREX dataset results, we see that most problems are caused by an nactve nstrument followng the domnant nstrument s F0 track. Some nstruments n ths dataset are nactve durng 70-80% of the entre duraton of the nput. Accuracy-vs.-nstrument results for the MIREX woodwnd quntet (Fgure 3), ndcate that nstruments horn and clarnet have lower performance n the 4 and 5 polyphony cases, due to ther F0 tracks beng hghly sparse. In addton to remanng slent much of the tme, they often play soft notes when they are actve. The trackng system reports note probabltes for every non-slent frame, whch are then used n an HMM to estmate the F0 tracks. Vocng decsons are based strctly on the rms ampltude of the mxture nput sgnal to decde whether the sgnal s slent. Ths results n a hgh number of false postves when an ndvdual nstrument s slent n parts of a track, a condton whch happens often n the MIREX dataset. Ths behavor also results n a very low number of true and false negatves (snce the system reports very few negatves) resultng n a hgher recall than lower precson whch can be seen n Fgures 2 and 4. In the future, we would lke to explore methods to nfer whether nstruments are actve or not at any gven pont n tme. Another knd of error that frequently occurs s when a less domnant nstrument tracks a more domnant one that has a smlar tmbre. Ths s probably caused by the nstrument spectra havng sgnfcant correlaton wth each other. Lookng at the performance-vs.-polyphony results for each nstrument n Fgure 5, we see that nstruments lke voln, whch have a unque tmbre, have better average accuracy. Possble solutons nclude tranng the nstrument spectrum dctonares not n solaton but n combnaton wth other nstrument spectra, whch may assst the bass vectors behavng n a more dscrmnant way. Methods for dscrmnant non-negatve tensor factorzatons are explored n [19]. Ths ssue can also be addressed n the testng part. Ptch probabltes n EM teratons can be estmated to be as maxmally dfferent as possble, whle stll explanng the overall mxture by approprate use of prors. Another method that mght mprove ths ssue would be to use a factoral HMM to jontly estmate the ptch tracks. On average, the proposed method scored 0.53 for Accuracy on the MIREX dataset, whch s an mprovement over the only past result (0.21) for the multple-f0 trackng task evaluated at MIREX [10]. However, we note that the MIREX multple-f0 task dd not offer the opportunty to utlze nstrument names for the mxture nput test fles. One reason the proposed method works comparatvely well for the tro and the Bach chorales case (see Table 1 and Fgure 1) s that most nstruments were actve most of the tme. The encouragng results from ths case lead us to

6 beleve that the ptch trackng problems can be mproved effectvely by addressng the ssues dscussed above. Fnally, we note that the restrcton that sounds must consst soley of harmonc partals can be relaxed. E.g., ptch estmates for nstruments lke xylophone, whch do not have strct harmonc structures but do have predctable nharmonc structures, can be determned. 5. CONCLUSION A new method for ptch and nstrument trackng of ndvdual nstruments n polyphonc musc has been desgned and evaluated on an establshed dataset that has prevously been used for multple-f0 estmaton under MIREX. Current results are encouragng, but several problems need to be resolved (as descrbed n the Dscusson secton) for the method to be an effectve tool. As mentoned n the Introducton, knowng the F0 tracks can be very benefcal for a varety of MIR tasks. In the future, we would lke to explore the use of vocng detecton to determne whch nstruments are actve. We would also lke to perform nstrument dentfcaton n the front-end so the method does not requre pror knowledge of the nstrumentaton. We also plan to experment wth dfferent dscrmnant learnng methods and to re-nfer the dctonares based on the nput mxture. Fnally, we propose to explore usng an automatc key detecton algorthm and a more muscologcally nformed ptch transton matrx for the hdden Markov model. 6. REFERENCES [1] M. Bay and J. Beauchamp. Harmonc source separaton usng prestored spectra. Proc. Independent Component Analyss and Blnd Sgnal Separaton, pages , [2] M. Bay, A.F. Ehmann, and J.S. Downe. Evaluaton of multple-f0 estmaton and trackng systems. In Proc. 10th Int. Conf. for Musc Informaton Retreval (ISMIR 2009), pages , [3] W.C. Chang, A.W.Y. Su, C. Yeh, A. Roebel, and X. Rodet. Multple-f0 trackng based on a hgh-order hmm model. In Proc. 11th Int. Conf. Dgtal Audo Effects (DAFx-08), pages , [4] M. Desante-Catherne and S. Marchand. Hghprecson Fourer analyss of sounds usng sgnal dervatves. J. Audo Eng. Soc, 48(7/8): , [5] Z. Duan, J. Han, and B. Pardo. Harmoncally nformed mult-ptch trackng. In Proc. 10th Int. Conf. on Musc Informaton Retreval (ISMIR 2009), pages , [6] Z. Duan, J. Han, and B. Pardo. Song-level mult-ptch trackng by heavly constraned clusterng. In Proc. IEEE Int. Conf. on Acoustcs, Speech, and Sgnal Processng (ICASSP 2010), pages 57 60, [7] M.R. Every and J.E. Szymansk. Separaton of synchronous ptched notes by spectral flterng of harmoncs. IEEE Trans. Audo, Speech and Language Processng, 14(5): , [8] G.D. Forney Jr. The Vterb algorthm. Proceedngs of the IEEE, 61(3): , [9] M. Goto. Development of the RWC musc database. In Proc. 18th Int. Congress on Acoustcs (ICA 2004), volume 1, pages , [10] IMIRSEL. Multple fundamental frequency estmaton and trackng results wk. http: // Multple_Fundamental_Frequency_ Estmaton_%26_Trackng_Results, [11] A. Klapur. Multptch analyss of polyphonc musc and speech sgnals usng an audtory model. IEEE Trans. on Audo, Speech, and Language Processng, 16(2): , [12] R. Marxer, J. Janer, and J. Bonada. Low-latency nstrument separaton n polyphonc audo usng tmbre models. Proc. 10th Int. Conf. on Latent Varable Analyss and Sgnal Separaton, pages , [13] G. Mysore, P. Smaragds, and B. Raj. Non-negatve hdden markov modelng of audo wth applcaton to source separaton. Proc. 8th Int. Conf. on Latent Varable Analyss and Sgnal Separaton, pages , [14] A. Pertusa and J.M. Inesta. Multple fundamental frequency estmaton usng gaussan smoothness. In Proc. IEEE Int. Conf. on Acoustcs, Speech and Sgnal Processng,(ICASSP 2008), pages , [15] G.E. Polner, D.P.W. Ells, A.F. Ehmann, E. Gómez, S. Strech, and B. Ong. Melody transcrpton from musc audo: Approaches and evaluaton. IEEE Trans. on Audo, Speech, and Language Processng, 15(4): , [16] B. Raj and P. Smaragds. Latent varable decomposton of spectrograms for sngle channel speaker separaton. In Proc. IEEE Workshop on Applcatons of Sgnal Processng to Audo and Acoustcs, (WASPAA 2005), pages 17 20, [17] P. Smaragds, B. Raj, and M. Shashanka. A probablstc latent varable model for acoustc modelng. Proc. 20th Conf. on Neural Informaton Processng Systems (NIPS 2006), 148, [18] C. Yeh, A. Roebel, and X. Rodet. Multple fundamental frequency estmaton and polyphony nference of polyphonc musc sgnals. IEEE Trans. on Audo, Speech, and Language Processng, 18(6): , [19] S. Zaferou. Dscrmnant nonnegatve tensor factorzaton algorthms. IEEE Trans. on Neural Networks, 20(2): , 2009.

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

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

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More 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

Music/Voice Separation using the Similarity Matrix. Zafar Rafii & Bryan Pardo

Music/Voice Separation using the Similarity Matrix. Zafar Rafii & Bryan Pardo Musc/Voce Separaton usng the Smlarty Matrx Zafar Raf & Bryan Pardo Introducton Muscal peces are often characterzed by an underlyng repeatng structure over whch varyng elements are supermposed Propellerheads

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

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

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

What s Next for POS Tagging. Statistical NLP Spring Feature Templates. Maxent Taggers. HMM Trellis. Decoding. Lecture 8: Word Classes

What s Next for POS Tagging. Statistical NLP Spring Feature Templates. Maxent Taggers. HMM Trellis. Decoding. Lecture 8: Word Classes Statstcal NLP Sprng 2008 Lecture 8: Word Classes Dan Klen UC Berkeley What s Next for POS Taggng Better features! RB PRP VBD IN RB IN PRP VBD. They left as soon as he arrved. We could fx ths wth a feature

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

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

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

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

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

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

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

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

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

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Modeling Waveform Shapes with Random Effects Segmental Hidden Markov Models

Modeling Waveform Shapes with Random Effects Segmental Hidden Markov Models Modelng Waveform Shapes wth Random Effects Segmental Hdden Markov Models Seyoung Km, Padhrac Smyth Department of Computer Scence Unversty of Calforna, Irvne CA 9697-345 {sykm,smyth}@cs.uc.edu Abstract

More information

AN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION. Gerald T. Beauregard Xinglei Zhu Lonce Wyse. Research, Singapore

AN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION. Gerald T. Beauregard Xinglei Zhu Lonce Wyse. Research, Singapore AN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION Gerald T. Beauregard Xngle Zhu Lonce Wyse muvee Technologes g.beauregard@eee.org Insttute for Infocomm Research, Sngapore xzhu@r.astar.edu.sg

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

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

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Structural Analysis of Musical Signals for Indexing and Thumbnailing

Structural Analysis of Musical Signals for Indexing and Thumbnailing Structural Analyss of Muscal Sgnals for Indexng and Thumbnalng We Cha Barry Vercoe MIT Meda Laboratory {chawe, bv}@meda.mt.edu Abstract A muscal pece typcally has a repettve structure. Analyss of ths structure

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

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More 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

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

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

Machine Learning 9. week

Machine 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 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

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

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

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

A Bilinear Model for Sparse Coding

A Bilinear Model for Sparse Coding A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines (IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak

More information

Automatic Control of a Digital Reverberation Effect using Hybrid Models

Automatic Control of a Digital Reverberation Effect using Hybrid Models Automatc Control of a Dgtal Reverberaton Effect usng Hybrd Models Emmanoul Theofans Chourdaks 1 and Joshua D. Ress 1 1 Queen Mary Unversty of London, Mle End Road, London E14NS, Unted Kngdom Correspondence

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

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

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

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

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

Application of Maximum Entropy Markov Models on the Protein Secondary Structure Predictions

Application of Maximum Entropy Markov Models on the Protein Secondary Structure Predictions Applcaton of Maxmum Entropy Markov Models on the Proten Secondary Structure Predctons Yohan Km Department of Chemstry and Bochemstry Unversty of Calforna, San Dego La Jolla, CA 92093 ykm@ucsd.edu Abstract

More information

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton

More information

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

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

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

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

MULTIVARIATE AUTOREGRESSIVE MIXTURE MODELS FOR MUSIC AUTO-TAGGING

MULTIVARIATE AUTOREGRESSIVE MIXTURE MODELS FOR MUSIC AUTO-TAGGING MULTIVARIATE AUTOREGRESSIVE MIXTURE MODELS FOR MUSIC AUTO-TAGGING Emanuele Covello Unversty of Calforna, San Dego Yonatan Vazman Unversty of Calforna, San Dego Anton B. Chan Cty Unversty of Hong Kong Gert

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

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN 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 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

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

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

Machine Learning: Algorithms and Applications

Machine 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 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

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

Universität Augsburg. Institut für Informatik. PLSA on Large Scale Image Databases. Rainer Lienhart and Malcolm Slaney.

Universität Augsburg. Institut für Informatik. PLSA on Large Scale Image Databases. Rainer Lienhart and Malcolm Slaney. Unverstät Augsburg à ÊÇÅÍÆ ËÀǼ PLSA on Large Scale Image Databases Raner Lenhart and Malcolm Slaney Report 2006-31 Dezember 2006 Insttut für Informat D-86135 Augsburg Copyrght c Raner Lenhart and Malcolm

More information

Discriminative Dictionary Learning with Pairwise Constraints

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

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,

More information

Investigating the Performance of Naïve- Bayes Classifiers and K- Nearest Neighbor Classifiers

Investigating the Performance of Naïve- Bayes Classifiers and K- Nearest Neighbor Classifiers Journal of Convergence Informaton Technology Volume 5, Number 2, Aprl 2010 Investgatng the Performance of Naïve- Bayes Classfers and K- Nearest Neghbor Classfers Mohammed J. Islam *, Q. M. Jonathan Wu,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Novel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition

Novel 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

Face Detection with Deep Learning

Face Detection with Deep Learning Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here

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

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

More 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

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,

More information

Journal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article

Journal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng

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

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

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

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

Online Detection and Classification of Moving Objects Using Progressively Improving Detectors

Online Detection and Classification of Moving Objects Using Progressively Improving Detectors Onlne Detecton and Classfcaton of Movng Objects Usng Progressvely Improvng Detectors Omar Javed Saad Al Mubarak Shah Computer Vson Lab School of Computer Scence Unversty of Central Florda Orlando, FL 32816

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Federated Search of Text-Based Digital Libraries in Hierarchical Peer-to-Peer Networks

Federated Search of Text-Based Digital Libraries in Hierarchical Peer-to-Peer Networks Federated Search of Text-Based Dgtal Lbrares n Herarchcal Peer-to-Peer Networks Je Lu School of Computer Scence Carnege Mellon Unversty Pttsburgh, PA 15213 jelu@cs.cmu.edu Jame Callan School of Computer

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

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

Intelligent Information Acquisition for Improved Clustering

Intelligent Information Acquisition for Improved Clustering Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center

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

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

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

CSCI 5417 Information Retrieval Systems Jim Martin!

CSCI 5417 Information Retrieval Systems Jim Martin! CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne

More information

Fast Sparse Gaussian Processes Learning for Man-Made Structure Classification

Fast Sparse Gaussian Processes Learning for Man-Made Structure Classification Fast Sparse Gaussan Processes Learnng for Man-Made Structure Classfcaton Hang Zhou Insttute for Vson Systems Engneerng, Dept Elec. & Comp. Syst. Eng. PO Box 35, Monash Unversty, Clayton, VIC 3800, Australa

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

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

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information