COMPARATIVE STUDY OF LPCC AND FUSED MEL FEATURE SETS FOR SPEAKER IDENTIFICATION USING GMM- UBM
|
|
- Gordon Ross
- 5 years ago
- Views:
Transcription
1 Internatonal Journal of Electroncs and Communcaton Engneerng & Technology (IJECET) Volume 6, Issue 9, Sep 015, pp. 8-96, Artcle ID: IJECET_06_09_010 Avalable onlne at ISSN Prnt: and ISSN Onlne: IAEME Publcaton COMPARATIVE STUDY OF LPCC AND FUSED MEL FEATURE SETS FOR SPEAKER IDENTIFICATION USING GMM- UBM Anagha S. Bawasar Dept. of Electroncs & Telecommuncaton, M. E. S. College of Engneerng, Pune, Inda Prabhaar N. Kota Dept. of Electroncs & Telecommuncaton, M. E. S. College of Engneerng, Pune, Inda ABSTRACT Bometrcs dentfers are typcally measurable characterstcs used to label and descrbe the ndvdual respectvely. Bometrc dentfers are the combnaton of both physologcal and behavoral characterstcs. The physologcal characterstcs nclude the characterstcs related to the shape of the body. There are varous examples for physologcal characterstcs but not lmted. Examples nclude fngerprnt, palm, hand geometry, rs recognton, and retna. Behavoral characterstcs are related to the pattern behavor of a person ncludng but not lmted to typng rhythm and voce. Bometrc system technology s now a day s a well-furnshed technology, t analyzes human body characterstcs. It s also nown as one of the actve bometrc tass. There s much speech related actvtes such as language recognton, speech recognton, and speaer recognton respectvely. Speaer recognton superfcally defnes as to dentfy the accurate speaer from the group of varous people. It s a very broad term and s further classfed as speaer dentfcaton and speaer verfcaton. The paper s concentratng on the term speaer dentfcaton. The man am s to dentfy the accurate speaer from the gven speech samples. These samples are obtaned by extractng features and are used for modelng purpose. Standard database TIMIT s beng used for dentfcaton. The paper comprses of varous algorthms for feature extracton, they are Mel Frequency Cepstral Coeffcents (MFCC), Inverse Mel Frequency Cepstral Coeffcent (IMFCC) and lnear predctve Cepstral Coeffcents (LPCC). The term Fuson came from the combnaton of the two algorthms namely MFCC and IMFCC. The 8 edtor@aeme.com
2 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM comparson s made among the results of Fuson and LPCC respectvely. From the result, t s seen on an average Fuson s better than LPCC. Index Terms: Gaussan Mxture Models (GMM), Inverted Mel Frequency Cepstral Coeffcents (IMFCC), Lnear Predctve Cepstral Coeffcents (LPCC), Mel Frequency Cepstral Coeffcents (MFCC), Unversal Bacground Model (UBM) Cte ths Artcle: Anagha S. Bawasar and Prabhaar N. Kota. Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM, Internatonal Journal of Electroncs and Communcaton Engneerng & Technology, 6(9), 015, pp INTRODUCTION Nowadays varous bometrcs systems are there. In last decades, an ncreasng nterest n securty system has rsen. For the securty purpose, t ncludes varous bometrc schemes. Bometrcs refers to technologes that measure and analyzes human body characterstcs. There are many bometrc methods exstng n the world, they are face recognton, eye retna and rs recognton, fngerprnt, DNA, hand measurements etc. for authentcaton purpose. These are the one of the well-nown bometrc method, addng to ths lst one of the well-nown method s Speech sgnal processng. Speech s one of the natural forms used n communcaton. Speech recognton has applcaton n voce dentfcaton n ordnary personal computers to bometrc and forensc applcatons. Recently the development has been seen n a securty system. There are two man technques n speech processng, one s speaer recognton and the other s speech recognton, n ths paper the man focus s gven on speaer recognton. The speaer recognton s further dvded only speaer dentfcaton and speaer verfcaton. Speaer dentfcaton s the technque n whch not regstered speaer s beng dentfed and Speaer verfcaton a clamed speaer s beng dentfed. The speaer dentfcaton s n a rato of 1: N whle speaer verfcaton s n 1:1 rato respectvely. In ths paper text- ndependent, speaer dentfcaton system s used. In speaer dentfcaton, the specfc characterstcs of voce are beng extracted from the gven sample of voce of speaer nown as feature extracton. After ths, the speaer model s traned and stored nto the system database. The extracton of the voce of speaer yelds us the specfc nformaton of the speaers voce called feature vectors. The speaer vectors represent the specfc nformaton of the speaer whch s based on the sngle or many thngs from the followng: vocal tract, exctaton source, and behavoral trats. All speaer recognton systems use the set of scores to enhance the probablty and relablty of the recognzer. Before feature extracton, the system goes through the pre-processng stage. An mportant role s played by Preprocessng n speaer dentfcaton and helps to reduce the amount of varaton n the database whch does not contan the mportant nformaton about speech; t s consdered to be a good practce. The preprocessng removes the rrelevant nformaton respectvely. The varous algorthms used for feature extracton are Mel-frequency Cepstral Coeffcents (MFCC), Inverse Mel Frequency Cepstral Coeffcents (IMFCC), and Lnear Predctve Cepstral Coeffcents (LPCC). In ths paper, feature extracton s 83 edtor@aeme.com
3 Anagha S. Bawasar and Prabhaar N. Kota done by usng all these above-mentoned algorthms. Investgatons by the researchers fnd out speaer specfc complementary nformaton relatve to MFCC that are called as Inverse Mel Frequency Cepstral Coeffcents (IMFCC) respectvely. Complementary nformaton s used for combnng the score models and for combnng the score models along wth the MFCC and s named as Fused Mel Feature Set. Such models are nothng but the mathematcal representaton of the partcular system [1].The nverse flter ban method s beng used for capturng ths complementary nformaton from hgh-frequency part of the energy spectrum. IMFCC captures the nformaton whch s neglected by MFCC. The respectve features are modeled by usng Gaussan Mxture Model and Unversal Bacground Model (GMM- UBM). All algorthms used n ths paper are based on Gaussan flters only. The results are verfed n standard database TIMIT. The fnal results are the comparson between LPCC results and Fused Mel Feature Set results and accurate results are noted down. The next secton of ths paper s followed by Fused Mel Feature set usng Gaussan Flters and Lnear predctve Cepstral coeffcent usng Gaussan flters. It s followed by comparatve results of both Fused Mel feature Set and Lnear Predctve Cepstral Coeffcent.. FEATURE EXTRACTION AND FILTER DESIGN To represent any speech sgnal n a fnte number of measures s the goal of feature extracton. Features are nothng but the representaton of the spectrum of a speech sgnal n each wndow frame. The Cepstral vectors are derved from a flter ban that has been desgned accordng to some model of the audtory system []. Most of the feature extracton methods use a standard trangular flter. The trangular flters are used for flterng the spectrum of the speech sgnal whch smulates the characterstcs of a human ear. But ths also has some dsadvantages. These are, they gve sharper or crsp partton n an energy spectrum, due to ths some nformaton s lost. In ths paper, Gaussan flters are used. The crsp and sharp transton n an energy spectrum s avoded f we use Gaussan flters nstead of trangular flters. Ths gves results n a smoother adaptaton from one sub band to other. Because of ths adaptve property, there s always one type of correlaton beng mantaned. These correlatons are mantaned from the md ponts of the trangular flters at the base of t as well as from the end ponts of trangular flters. Mathematcal calculatons n Gaussan flters are smple. Hence because of such advantages over trangular flters we use Gaussan Flters. The motvaton for usng Mel-Frequency Cepstrum Coeffcents was due to the fact that the audtory response of the human ear resolves frequences nonlnearly. The mappng from lnear frequency to Mel Frequency s defned as [3]. f 595log (1 f mel ) (1) Where; The subjectve ptch n Mel correspondng to f s f mel, ths frequency n actual measured n Hz. MFCCs are one of the more popular parameterzaton methods used by researchers n the speech technology feld. It has the beneft that t s capable of capturng the phonetcally mportant characterstcs of speech. MFCC are bandlmtng n nature and can easly be employed to mae t sutable for applcatons le a telephone edtor@aeme.com
4 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM Generally, the feature extracton usng MFCC uses a trangular flter. The trangular flter has some characterstcs le, asymmetrcally taperng whch also do not provde the correlaton between the sub-bands and the nearby spectral components. Because of all ths, nformaton loss occurred there. By usng Gaussan flters, one proft s that t avods drawbacs and losses seen n a trangular flter. Gaussan flters are taperng towards both the end and provde correlaton between sub-bands and ts nearby spectral components [4]. The IMFCC s one of the feature extracton technques. It captures the complementary nformaton present n the hgh-frequency part of the spectrum. The fgure below shows the steps nvolved n feature extracton of both Gaussan MFCC and IMFCC features. Let the nput speech sgnal be y (n), where n=1, M. t represent the preprocessed frame of the sgnal. Frstly the sgnal y (n) s converted to the frequency doman by a DFT whch leads to the energy spectrum. Ths s followed by Gaussan flter ban bloc. Speech Sgnal Pre- FFT Processng MFCC Flter Ban Gaussan IMFCC Flter Ban Gaussan Log 10 () Log 10 () DCT DCT MFCC IMFCC Fgure 1 Steps nvolved n extracton of Gaussan MFCC and IMFCC [5] Mathematcally the equaton for Gaussan flter s wrtten as; g MFCC e ( b) () Where, s coeffcent ndex n the N-pont DFT, b s a pont between the th th trangular flters boundary located at ts base and consdered as mean of Gaussan flter whle the s the standard devaton or square root of varance and can be wrtten as, b 1 b (3) Where; s the parameter where varance s beng controlled. Fgure Flterban desgn [5] 85 edtor@aeme.com
5 Weght Weght Anagha S. Bawasar and Prabhaar N. Kota Two plots n a sngle fgure are shown n above fgure. One s for trangular flter and the other s for the Gaussan flter. Ths plot s made by consderng a sngle value of sgma. Here n ths case by consderng dfferent values for sgma plot can be drawn respectvely. Fg 4 and Fg 5 shows the ndvdual response for Gaussan flter ban of MFCC and IMFCC Frequency (Hz) Fgure 3 Mel scale Gaussan flter ban [6] Frequency (Hz) Fgure 4 Inverted Mel scale Gaussan flter ban [6] Mathematcally, the Gaussan MFCC can be wrtten as, b M s Fs f 1 mel f mel ( f low f ) mel f f f hgh Q 1 mel low M s s a number of ponts n DFT, Fs s the samplng frequency, f low and fhghare low and hgh-frequency boundares of a flterban, Q s the number of flters n the ban and 1 f mel s an nverse of the transformaton. 1 f mel ( f mel ) 700(10 fmel / 595 1) (5) The nverted Mel Scale Flterban structure can be obtaned by just flppng orgnal flterban around the mdpont of frequency range that s beng consdered. ' ( ) q 1 Where, ' ( ) M s 1...(6) s the orgnal MFCC flter ban response. (4) 86 edtor@aeme.com
6 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM These flter bans are beng forced on the energy spectrum obtaned by tang Fast Fourer transform of the preprocessed sgnal as follow: e gmfcc ( ) Ms 1 Y( ) gmfcc. ( ) Where, () s respectve flter response and Ampltude (7) Y() s the energy spectrum. DFT coeffcent ndex b 1 b b 1 Fgure 5 Response () of a typcal Mel scale flter [5] Q Fnally, DCT s taen on the log flter ban energes {{log[ e( )]} } and the fnal MFCC coeffcents can be wrtten as- C gmfcc m Q l 1 ( 1)] cos[ m( ) ]...(8) Q 1 gmfcc log[ e l0 Q Where; 0 m R1, R s the desred number of Cepstral features. The same procedure for extractng the IMFCC features as well [4] and are denoted as; gimfcc m C Q 1 Q log[ e gimfcc l l ( 1)] cos[ m ( ) ]...(9) l0 Q 3. LINEAR PREDICTIVE CEPSTRAL COEFFICIENTS (LPCC) The predctve coeffcent can be determned by mnmzng the squared dfferences between actual speech samples and lnearly predcted values. Ths set s a unque set of parameters. In practce, the actual predctor coeffcents are never used as t s because of ther hgh varance. These predctor coeffcents are transformed to a more robust set of parameters nown as Cepstral coeffcents. The procedure for extractng the LPCC s same as that of MFCC and IMFCC respectvely. In ths also we are gong to use Gaussan flter ban. Speech Sequence Pre-emphass and hammng wndow Lnear Predctve Analyss Cepstral Analyss LPCC Fgure 6 Bloc dagram of LPCC algorthm [7] 87 edtor@aeme.com
7 Anagha S. Bawasar and Prabhaar N. Kota Pre-emphass and Hammng Wndow The frst bloc s a pre-emphass bloc; the nput sgnal s gven to, the frst step of the algorthm s pre-emphass. The dea of pre-emphass s to spectrally flatten the speech sgnal and equalze the nherent spectral tlt n a speech [8]. Pre-emphass s mplemented by a frst order FIR dgtal flter. The followng equaton shows the transfer functon of the pre-emphass dgtal flter, 1 H p ( Z) 1z (10) Where, alpha s constant, whch has a typcal value of After pre-emphass, the speech sgnal s subdvded nto frames. Ths process s the same as multplyng the entre speech sequence by a wndowng functon, s m [ n] s[ n] w[ n m] (11) Where s[n] s the entre speech sequence, s [n] s a wndowed speech frame at tme m m and w[n] s the wndowng functon. The typcal length of a frame s about 0-30 mllseconds. In the above equaton, m s the tme shft or the step sze of the wndowng functon. A new frame s obtaned by shftng the wndowng functon to a subsequent tme. The amount of shftng s typcally 10 mllseconds. The shape of the wndowng functon s mportant. Rectangular wndow s not recommended snce t causes severe spectral dstorton (leaage) to the speech frames [9]. Other types of wndowng functon, whch mnmze the spectral dstorton, should be used. One of the most commonly used wndows s the Hammng wndow. w[ n] cos N 1 (1) In the above equaton, N s the length of the wndowng functon. After Hammng wndowng, the speech frame s passed to the next stage for further processng. Lnear predctve analyss In human speech producton, the shape of the vocal tract governs the nature of the sound beng produced. The man dea s based on basc speech producton model; t says that vocal tract can be modeled by an all-pole flter. These are nothng but the smple coeffcent of all-pole flter. They are same as smooth envelope of log spectrum of speech. The man dea behnd LPC s that a gven speech sample can have approxmated as a lnear combnaton of the past speech samples. LPC models sgnal s (n) as a lnear combnaton of ts past values and present nput (vocal cords exctaton). If the sgnal wll be represented only n terms of the lnear combnaton of the past values then the dfference between real and predcted output s called predcton error. LPC mnmzes the predcton error to fnd out the coeffcents. The cepstrum s the nverse transform of the log of the magntude of the spectrum. Useful for separatng convolved sgnals (le the source and flter n the speech producton model). Log operaton separates the vocal tract transfer functon and the voce source. Vocal Tract flter has slow spectral varatons and exctaton sgnal has hgh spectral varatons. Generally provdes more effcent and robust codng of speech nformaton than LPC coeffcents edtor@aeme.com
8 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM Fgure 7 LPCC [10] The predctor coeffcents are rarely used as features, but they are transformed nto the more robust Lnear Predctve Cepstral Coeffcents (LPCC) features. The LPC are obtaned usng Levnson-Durbn recursve algorthm. Ths s nown as LPC analyss. The dfference between the actual and the predcted sample value s termed as the predcton error or resdual [11] and s gven by, s( n) e( n) s( n) s( n) p e( n) as( n ), a0 0 p 1 a s( n ) (13) 1...(14) Optmal predctor coeffcents wll mnmze ths mean square error. At mnmum value of E, E 0, 1,,... p...(15) a Dfferentatng and equatng to zero we get, = (16) a [ a a... a 1 p r ]...(17) r Where, r [ r(1) r()... r( p)]...(18) Where R s the Toepltz symmetrc autocorrelaton matrx gven by, r(0) r(1) R.. r( p 1) r(1) r(0) a r( p 1) r( p ).. r(0) Equaton can be solved for predctor coeffcents by usng Levnson s and Durbn algorthm as follows: (0) E r[0]...(19) L1 1 r[ ] a. [ ] j1 j r j...(0) ( 1) E 89 edtor@aeme.com
9 Anagha S. Bawasar and Prabhaar N. Kota Where, 1 p a j a a j ( 1) j. a 1 j (1) () E (1 ). E 1 (3) The above set of equatons s solved recursvely for =1, p. the fnal soluton s gven by ( p) am a m Where;, where, 1 m p (4) a m ' s are lnear predctve coeffcents (LPC) Cepstral Analyss. In realty, the actual predctor coeffcents are never used n recognton, snce they typcal show hgh varance. The predctor coeffcents are more effcently transformed to a robust set of parameters nown as Cepstral coeffcents Before gong to the defnton of Cepstral coeffcents, let us go through the defnton of the Cepstrum. A cepstrum s nothng but the result of tang the Fourer transform of the logarthm of the estmated spectrum of a sgnal. The three dfferent types of cepstrum are the power cepstrum, complex cepstrum and the other one s real cepstrum. Among them, the power cepstrum, n partcular, fnds applcaton n the analyss of human speech. The name cepstrum was derved from the word spectrum by reversng the frst four letters. The steps through whch the nput speech sgnal goes through are preprocessng then feature extracton and after that modelng. After preprocessng, the sgnal reduces complex complexty whle operatng on speech sgnal. In ths one partcular reduces the number of samples of operatons. It s very dffcult to wor on huge set of samples; therefore nstead of worng on such a large set of samples, we restrct our operatons to a frame of suffcently reduced length. After the sgnal condtonng or after pre-processng the speech sgnal goes through the feature extracton stage. Here the features are extracted by usng DCT. That s calculatng the coeffcents usng DCT. Mathematcally; Ceps dct log( abs( FFT( y ))) (5) wndow The prncpal advantage of Cepstral coeffcents s that they are generally decorrelated and ths allows dagonal covarances. However, one mnor problem wth them s that the hgher order Cepstral are numercally qute small and ths results n a very wde range of varances when gong from the low to hgh Cepstral coeffcents. Cepstral coeffcent can be used to separate the exctaton sgnal (whch contans the words and the ptch) and the transfer functon (whch contans the voce qualty). The cepstrum can be seen as nformaton about rate of change n the dfferent spectrum bands. The recursve relaton between the predctor coeffcents and 90 edtor@aeme.com
10 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM Cepstral coeffcents s used to convert the LP coeffcents (LPC) nto LP Cepstral coeffcents c c ln...(6) 0 c m a m m1 1 m c a m 1 m p (7) c m m m1 c 1 a m...(8) Where the gan term n the LP analyss and d s s the number of LP Cepstral coeffcents. 4. GAUSSIAN MIXTURE MODEL (GMM) AND UNIVERSAL BACKGROUND MODEL The text ndependent speaer recognton system used n ths paper uses GMM-UBM approach for modelng purpose. Generally; two models are beng developed here, one s target speaer model and other s mpostor model (UBM). It has generalzaton ablty to handle unseen acoustc pattern [1]. In a bometrc system, GMM s commonly used as a parametrc model of probablty dstrbuton contnuous measurements or features. The features used are generally vocal tract features n any speaer dentfcaton system. As we all now that GMM are more lely used for text-ndependent speaer dentfcaton as the pror nowledge about what speaer wll say. Hence modelng s generally done n GMM.A Gaussan mxture model s a weghted sum of M component Gaussan denstes as gven by the equaton [13]. p( x ) M 1 w g( x, )...(9) Where; x s a D-dmensonal contnuous-valued data vector or features), (.e. measurement g, ( x, ) = 1.. M are the mxture weghts, and w, = 1 M s the component Gaussan denstes. Each component densty s a D-varate Gaussan functon of the form; g( x, ) exp{ ( x )' ( )}...(30) / 1/ x D ( ) Wth mean vector and covarance matrx the mxture weghts satsfy the constrant that M 1 1 The complete Gaussan mxture model s parameterzed by the mean vectors, covarance matrces and mxture weghts from all component denstes. These parameters are collectvely represented by the notaton, {,, } =1 M. (31) 91 edtor@aeme.com
11 Anagha S. Bawasar and Prabhaar N. Kota For a sequence of T tranng vectors X { x 1,... x T }.The GMM lelhood, assumng ndependence between the vectors, can be wrtten as p( X ) p( x t ) (3) t1 For utterances wth T frames, the log-lelhood of speaer models s; L ( X) log p( X ) s T s T t1 log p( x t )...(33) s For speaer dentfcaton, the value of L s (X ) s computed for all speaer models s enrolled n the system and the owner of the model that generates the hghest value s the returned as the dentfed speaer. Durng tranng phase, Feature vectors are beng traned usng Expectaton and Maxmzaton (E&M) algorthm. An teratve update of each of the parameters n, wth a consecutve ncrease n the log lelhood at each step. GMM are generally used for text-ndependent speaer dentfcaton. The drawbac of the prevous systems s beng overcome by usng GMM-UBM. It overcomes on the cost of the mode; t s not as expensve that of the GMM. There s no need for the vocabulary database or bg phoneme. GMM s more advantageous than HMM. Capturng the general characterstcs of a populaton and accordngly adaptng t to ndvdual speaer s the basc dea of UBM. In other words more brefly UBM s defned as the model whch s used n many applcaton areas but one of them s bometrc system whch s used to compare the person s ndependent feature characterstcs aganst person specfc feature model durng decson of acceptance or rejecton. UBM s also sad as GMM only wth large set of speaers. The UBM s traned wth the EM algorthm on ts tranng data. For the speaer recognton process, t fulflls two man roles: It s the apror model for all target speaers when applyng Bayesan adaptaton to derve speaer models and t helps to compute log-lelhood rato much faster by selectng the best Gaussan for each frame on whch lelhood s relevant. Ths wor proposes to use the UBM as a gude to dscrmnatve tranng of speaers [14]. 5. COMPARATIVE RESULTS OF FUSED MEL FEATURE SETS AND LINEAR PREDICTIVE CEPSTRAL COEFFICIENTS The man method focus n ths paper s fuson of the both algorthms that are used both MFCC and IMFCC respectvely. The man am s to compare the fused results to the results obtaned from LPCC. That s here the accuracy obtaned from the fused Mel feature set s compared wth the Lnear predctve Cepstral coeffcent. The better results among them wll gve us the accurately dentfed speaer respectvely among the database used for t. The system performs better f the two or more combnaton of them were suppled wth nformaton that s complementary n nature. For obtanng the dentfcaton accuracy MFCC and IMFCC features whch are complementary to each other can be fused together. There are many possble ways for combnng such as; product, sum, mnmum, maxmum, medan, average etc, can be used. The sum rule outperforms as compared to the other combnatons and s most reslent to estmaton errors. Let us go through the bloc dagram of Fused Mel feature set along wth LPCC wth GMM-UBM modelng technque. 9 edtor@aeme.com
12 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM From fgure 7 and 8 we can say that system ncludes tranng and testng for fused Mel feature Set and LPCC feature set. The mplementaton s done on TIMIT database. TIMIT corpus s one of the standard databases used by the many researchers for the purpose of speaer dentfcaton. Ths paper also concentrates on the TIMIT database. It comprses of the 16 speaers. Fgure 8 Steps nvolved n speaer dentfcaton system (fused Mel features sets) [5] Fgure 9 Speaer dentfcaton system (LPCC) [6] The recordngs are from 8 dalect regons. Each speaer has 10 utterances respectvely Total 160 sentences recordngs (10 recordngs per speaer). The audo format s.wav format, sngle channel, 16 Hz samplng, 16-bt sample, PCM encodng. The features are beng extracted by usng Gaussan Mel scale flter ban. The feature vectors are traned by usng Expectaton Maxmum algorthm. From the dagram, we can say that separate model s beng created for each speaer [5]. Features are extracted from the ncomng test sgnal and then the lelhood of these features wth each of the speaer model s determned. These are ncluded n the testng step. The lelhood for MFCC and IMFCC as well as for LPCC s determned. We have drawn two separate bloc dagrams for fused Mel feature sets and LPCC. In frst dagram a unform weghted sum rule s adopted to fuse the scores from the two classfers. S com ws MFCC ( 1 w) S IMFCC (34) 93 edtor@aeme.com
13 s No. of Mxtures Anagha S. Bawasar and Prabhaar N. Kota com s combned score of MFCC and IMFCC, and SMFCC, S are scores generated by the MFCC model and scores generated by IMFCC Model and w IMFCC s fuson coeffcent. On smlar Lne, we calculated the values for LPCC and are denoted by S. LPCC The accuracy for Fuson and LPCC are calculated and are compared. The usage of weghts and number of mxtures can be changed to dfferent values to test the system for optmum result. Table I shows the performance level of proposed system for dfferent weghts and mxtures. As stated we are usng standard database TIMIT of 16 speaers, we need to dvde these nto two for tranng and testng purpose. For ths purpose, the UBM consst of 5 speaers and GMM 11 speaers respectvely. The bacground model s generated by UBM. The value of alpha that s flterng constant s ept as 0.97 respectvely. The accuracy s beng calculated on the bass of False postve and False negatve. In false postve a false speaer s accepted as true one. Whle n False Negatve, a true speaer s rejected as an mpostor. The formula for accuracy calculaton s: Accuracy n percentage=100-((fp+fn)*100/ (M*N)) Where, M*N= sze of the confuson matrx. Table I. Comparatve Results for dfferent number of Mxtures and weghts for gven proposed system Score threshold=0.6 Fuson (%) LPCC (%) Score threshold=0.77 Fuson LPCC (%) (%) Score threshold=0.8 Fuson LPCC (%) (%) Score threshold=0.97 Fuson (%) LPCC (%) Fgure 10 Graphcal Representaton of table 1 From above table, we can see that the varous accuracy percentages we got for the dfferent values of the mxtures and the dfferent values of score threshold. The value of threshold ncreases the accuracy s ncreasng accordngly. But n all the accuracy for the Fuson s good as compared to the LPCC. The performance of the fused system exceeds the performance of LPCC. The percentage of maxmum performance s 95.04% and hence lewse we have found out good dentfcaton wth lmted errors edtor@aeme.com
14 Comparatve Study of LPCC and Fused Mel Feature Sets For Speaer Identfcaton Usng GMM-UBM 6. CONCLUSION Many methods were used earler for feature extracton. They nclude MFCC, IMFCC, etc. These two algorthms wored ndvdually well and gve good accuracy. Though the IMFCC help MFCC to mprove ts accuracy further, these two algorthms are combned together and s called as fused Mel Feature set. In ths, the Gaussan Mxture Model s beng evaluated for speaer dentfcaton. The performance s ncreased by fusng the complementary nformaton. As shown n table, the accuracy has been calculated for LPCC and Fuson and s seen 95.04% at weght 0.77 and 0.8 respectvely for Fuson whch s better than and at weght 0.77 and 0.8 for LPCC. The more enhancements may be done by changng the modelng technque and by changng varous combnatons of weghts. The future scope may nclude an applcaton of same database approach try to develop a real-tme applcaton and also the system can be developed by usng artfcal neural networ based approach. REFERENCES [1] J. Kttler, M. Hatef, R. Dun, J. Mataz, On Combnng Classfer, IEEE Transacton, Pattern Analyss and Machne Intellgence, 0(3), pp.6-39,march [] Rana, Muesh, and Salon Mglan, Performance analyss of MFCC and LPCC Technques n Automatc speech Recognton, Internatonal Journal of Engneerng and Computer Scence, 3(8), pp , August, 014 [3] Srdharan, Srdha & Wong, Edde, Comparson of Lnear Predcton Cepstrum Coeffcents and Mel-Frequency Cepstrum Coeffcents for language dentfcaton, Proceedngs of Internatonal Symposum on Intellgent Multmeda, Vdeo and Speech Processng, pp , -4 May 001 [4] Charoborty Sandpan, and Goutam Saha, Improved text-ndependent speaer dentfcaton usng fused MFCC & IMFCC feature sets based on Gaussan flter, Internatonal Journal of Sgnal Processng, 5(1), pp , 009 [5] R. Shantha Selva Kumar, S. selva Ndhyananthan, Anand, Fused Mel Feature sets based Text-Independent Speaer Identfcaton usng Gaussan Mxture Model, Internatonal Conference on Communcaton Technology and System Desgn, Proceda Engneerng, 30, pp , 01 [6] Anagha S. Bawasar, Prabhaar N. Kota, Speaer Identfcaton Based on MFCC and IMFCC Usng GMM-UBM, Internatonal Organzaton of Scentfc Research (IOSR Journals), 5(), pp , March-Aprl 015 [7] Cheng, Octavan, Waleed Abdulla, and Zoran Salcc, Performance evaluaton of front-end processng for speech recognton systems, School of Engneerng Report. The Unversty of Aucland, Electrcal and Computer Engneerng, 005 [8] Rabner, L. and Juang, B, Fundamentals of speech recognton, Prentce Hall, Inc., Upper Saddle Rver, New Jersey, Aprl 1993 [9] Rabner, L.R., Schafer, R.W., Dgtal Processng of Speech Sgnals, Prentce Hall, [10] Pallav P. Ingale and Dr. S.L. Nalbalwar, Novel Approach To Text Independent Speaer Identfcaton, Internatonal Journal of Electroncs and Communcaton Engneerng & Technology, 3(), 01, pp [11] Chang, Wen-Wen, Tme Frequency Analyss and Wavelet Transform Tutoral Tme-Frequency Analyss for Voceprnt (Speaer) Recognton, Natonal Tawan Unversty edtor@aeme.com
15 Anagha S. Bawasar and Prabhaar N. Kota [1] Pazhanrajan, S., and P. Dhanalashm, EEG Sgnal Classfcaton usng Lnear Predctve Cepstral Coeffcent Features, Internatonal Journal of Computer Applcatons, 73(1), pp., 013 [13] Chao, Y-Hsang; Tsa, W.-H.; Hsn-Mn Wang, Dscrmnatve Feedbac Adaptaton for GMM-UBM Speaer Verfcaton, Chnese Spoen language Processng( ISCSL) 6th Internatonal Symposum on, pp.1,4, Dec. 008 [14] Manan Vyas, A Gaussan Mxture Model Based Speech Recognton System Usng Matlab, Sgnal & Image Processng: An Internatonal Journal (SIPIJ), 4(4), August 013 [15] Amr Rashed, Fast Algorthm For Nosy Speaer Recognton Usng Ann, Internatonal journal of Computer Engneerng & Technology, 5(), 014, pp [16] Vplav Gautam, Saurabh Sharma,Swapnl Gautam and Gaurav Sharma, Identfcaton and Verfcaton of Speaer Usng Mel Frequency Cepstral Coeffcent, Internatonal Journal of Electroncs and Communcaton Engneerng & Technology, 3(), 01, pp [17] Scheffer N, Bonastre. J.F, UBM-GMM Drven Dscrmnatve Approach for Speaer verfcaton, Speaer and Language Recognton worshop, IEEE Odyssey, pp.1-7, 8-30 June edtor@aeme.com
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 informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More information[33]. As we have seen there are different algorithms for compressing the speech. The
49 5. LD-CELP SPEECH CODER 5.1 INTRODUCTION Speech compresson s one of the mportant doman n dgtal communcaton [33]. As we have seen there are dfferent algorthms for compressng the speech. The mportant
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationFeature 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 informationSpectral 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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationSimulation: 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationFEATURE 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationModeling Inter-cluster and Intra-cluster Discrimination Among Triphones
Modelng Inter-cluster and Intra-cluster Dscrmnaton Among Trphones Tom Ko, Bran Mak and Dongpeng Chen Department of Computer Scence and Engneerng The Hong Kong Unversty of Scence and Technology Clear Water
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
More informationFeature Extractions for Iris Recognition
Feature Extractons for Irs Recognton Jnwook Go, Jan Jang, Yllbyung Lee, and Chulhee Lee Department of Electrcal and Electronc Engneerng, Yonse Unversty 134 Shnchon-Dong, Seodaemoon-Gu, Seoul, KOREA Emal:
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationHelsinki 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationNovel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition
Mathematcal Methods for Informaton Scence and Economcs Novel Pattern-based Fngerprnt Recognton Technque Usng D Wavelet Decomposton TUDOR BARBU Insttute of Computer Scence of the Romanan Academy T. Codrescu,,
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationAudio Content Classification Method Research Based on Two-step Strategy
(IJACSA) Internatonal Journal of Advanced Computer Scence and Applcatons, Audo Content Classfcaton Method Research Based on Two-step Strategy Sume Lang Department of Computer Scence and Technology Chongqng
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationAssignment # 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 informationApplying 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationSPEAKER VERIFICATION USING GMM MODELLING
U.P.B. Sc. Bull., Seres C, Vol. 76, Iss. 2, 2014 ISSN 2286 3540 SPEAKER VERIFICATION USING GMM MODELLING Svetlana SEGĂRCEANU 1, Tberus ZAHARIA 2, Anamara RĂDOI 3 Authentcaton based on voceprnt s a smple
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationNAG 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 informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationSome 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 informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationSignature and Lexicon Pruning Techniques
Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word
More informationIMAGE FUSION TECHNIQUES
Int. J. Chem. Sc.: 14(S3), 2016, 812-816 ISSN 0972-768X www.sadgurupublcatons.com IMAGE FUSION TECHNIQUES A Short Note P. SUBRAMANIAN *, M. SOWNDARIYA, S. SWATHI and SAINTA MONICA ECE Department, Aarupada
More informationWishing 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 informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationAn 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 informationAn 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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationRecognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features
Recognton of Handwrtten Numerals Usng a Combned Classfer wth Hybrd Features Kyoung Mn Km 1,4, Joong Jo Park 2, Young G Song 3, In Cheol Km 1, and Chng Y. Suen 1 1 Centre for Pattern Recognton and Machne
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationSimulation 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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationLecture 13: High-dimensional Images
Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.
More informationA 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 informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationCLASSIFICATION OF ULTRASONIC SIGNALS
The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationGSLM 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 informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationAppearance-based Statistical Methods for Face Recognition
47th Internatonal Symposum ELMAR-2005, 08-10 June 2005, Zadar, Croata Appearance-based Statstcal Methods for Face Recognton Kresmr Delac 1, Mslav Grgc 2, Panos Latss 3 1 Croatan elecom, Savsa 32, Zagreb,
More information