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

Size: px
Start display at page:

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

Transcription

1 AN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION Gerald T. Beauregard Xngle Zhu Lonce Wyse muvee Technologes Insttute for Infocomm Research, Sngapore Insttute for Inforcomm Research, Sngapore ABSTRACT We present a computatonally effcent real-tme algorthm for constructng audo sgnals from spectrograms. Spectrograms consst of a tme sequence of short tme Fourer transform magntude (STFTM) spectra. Durng the audo sgnal constructon process, phases are derved for the ndvdual frequency components so that the spectrogram of the constructed sgnal s as close as possble to the target spectrogram gven real-tme constrants. The algorthm s a varaton of the classc Grffn and Lm [] technque modfed to be computable n real-tme. We dscuss the applcaton of the algorthm to tme-scale modfcaton of audo sgnals such as speech and musc, and performance s compared wth [three] other methods. The new algorthm generates comparable or better results wth sgnfcantly less computaton. The phase consstency between adjacent frames produces excellent subjectve sound qualty wth mnmal fame transton artfacts.. INTRODUCTION Magntude and power spectra, and ther tme sequences n the form of spectrograms, are wdely used to represent the tmefrequency structure of audo sgnals such as speech and musc. By combnng the real and magnary part of each spectral frequency component nto a sngle number, they provde a valuable vsualzaton tool wth a strong correspondence to how sgnals are heard n terms of frequency content. However, they do so at the expense of nformaton whch must be provded n order to convert the representaton back nto an audo sgnal. Frequency magntude representatons are also used computatonally n a number of applcatons (such as nose reducton, sgnal enhancement, sgnal source separaton etc.), where the frequency doman representaton of a sgnal s modfed before beng transformed back nto a tme-doman sgnal. In general however, a modfed (or arbtrary) magntude spectrum s not a vald representaton of an audo sgnal n the sense that there may be only a complex, but no real sgnal whose STFTM exactly matches the modfed one. In such cases, we would lke to fnd a sgnal wth an STFTM as close as possble to the modfed or target STFTM. Grffn and Lm [][] developed an teratve least squares error method for estmatng a real audo sgnal from a modfed STFTM (that we abbrevate G&L ). Ther algorthm monotoncally reduces the dfference between the target magntude spectrum (MS) and the MS of the reconstructed sgnal. The error measure reaches a plateau for most sounds after between 0 and 00 teratons. Though computaton s becomng less of an ssue as computers get faster, G&L s nherently not real-tme snce each teraton must loop over all tme frames n the sgnal before the next teraton s computed. As t was orgnally formulated, the method s unusable for applcatons wth real-tme requrements such as nose reducton n real speech transmsson, or any applcaton requrng nteractve manpulaton of the analyss and synthess parameters. Slaney [] also developed technques to reconstruct tme-doman audo sgnals from cochleagrams and correlograms explotng the G&L technque. Tme-scale modfcaton (TSM) s a process for modfyng the rate of sgnals such as speech or musc whle keepng other characterstcs such as ptch or formants unchanged. TSM s useful n a varety of applcatons such as musc playback. In meda producton for example, TSM s frequently used to synchronze the audo sgnal wth the vdeo sgnal. TSM s typcally mplemented n the tme-doman for computatonal effcency, but we wll demonstrate some advantages to usng a frequency doman method. The rest of the paper s organzed as follows. In Secton we revew the G&L algorthm and show the detals of our Real-Tme Iteratve Spectrogram Inverson algorthm (RTISI) to reconstruct the tme-doman sgnal from a gven spectrogram. In Secton 3 we brefly ntroduce the synchronzed overlap and add (SOLA) method and apply the RTISI algorthm to the tme-scale modfcaton of audo sgnal. In Secton 4 we evaluate our method and compare the results wth three other methods. In Secton 5 we make conclusons.. RECONSTRUCTION OF TIME-DOMAIN SIGNALS FROM THE MSTFTM A dscrete sgnal x(n) can be represented as a sequence of STFT s as follows: X jϖ n ( ms, ϖ ) = x( n) w( n ms ) e () n = where w s the analyss wndow, S s the analyss step sze and m s the ndex of the frames of STFT s. The STFT can be consdered to be generated by sldng a wndow w across the tme doman sgnal wth step sze S. From X(mS,ω) we can exactly reconstruct the tme-doman sgnal x(n). However n many applcatons we need to recover the tme-doman from the magntude spectrum X(mS,ω), or a modfed verson X (ms,ω). In Secton. we take a bref look at the G&L method and n Secton. we present the detals of our algorthm. DAFX-

2 .. The Grffn and Lm (G&L) Algorthm Startng wth an ntal estmate x 0 (n) of the orgnal tme-doman sgnal x(n), the G&L algorthm teratvely renews the estmate x (n) at the th teraton so that the STFTM of the new estmate s monotoncally closer to the STFTM of the orgnal sgnal x(n) n terms of the dstance measure functon D. The M [ x( n), x ( n)] dstance measure s defned as π DM [ x( n), x ( n)] = [ X ( ms, ϖ ) X ( ms, ϖ ) ] dϖ π ϖ π m () = = where X(mS,ω) s the STFTM of orgnal sgnal x(n) and X (ms,ω) s the STFTM of the th estmate x (n). G&L uses the followng functon to update the estmate n each teraton, x jϖ n w( n ms ) X ( ms, ϖ ) e dϖ π + m = ϖ = π ( n) = m = π w ( n ms ) where X (ms,ω) s the STFT of x (n) wth the magntude constrant: X( ms, ϖ ) (4) X ( ms, ϖ) = X ( ms, ϖ) X ( ms, ϖ ) By the magntude constrant, X (ms,ω) has the same phase as X (ms,ω) and the same magntude as X(mS,ω). A Hammng wndow wth L=4S s used, wth scalng such that the sum of the squares of the overlappng wndows s always. Ths smplfes the update functon n Equaton (3), as the denomnator wll be for all n. By the normalzaton of the wndow functon, the update functon of x (n) n Equaton (3) can be smplfed, because the denomnator s equal to for all n. Although Grffn and Lm [] showed that the dstance measure functon monotoncally decreases wth the ncreasng number of teratons, t was not proven that the algorthm converges to a soluton wth the globally mnmum possble error. Convergence to a local mnmum s possble dependng on the ntal estmate x 0 (n). The ntal estmate also determnes the number of teratons requred. In practce, however, wthn 00 teratons ths algorthm generally gves a hgh qualty reconstructon [4]... The Real-Tme Iteratve Spectrogram Inverson (RTISI) Algorthm In order to enable the use of magntude spectra n nteractve and real-tme applcatons, the G&L algorthm needs to be modfed so that a gven frame s dependent only upon the current and prevous frames of the target spectrogram. G&L could also be sped up sgnfcantly by fndng a better ntal estmate of phases for each frame. We accomplsh both of these goals by employng a G&L teraton strategy on the current frame alone, usng nformaton from the audo frames already reconstructed that overlap wth the current frame to construct an ntal current frame phase estmate. Suppose we already have reconstructed the frst m- frames of the synthess sgnal, whch we denote as y m- (n), let us consder the problem of generatng frame m. The sgnal frames already generated at ths pont are llustrated n Fgure. (3) S s S s S s S s Frame m Fgure. An llustraton of the partally reconstructed frames of sgnal y(n). Before frame m s estmated, there exsts an overlap-added result of the frames m-, m-, m- 3 n the range of the frame m wndow. The sold lne shows the magntude contour of the prevously syntheszed sgnal and the dashed lnes ndcates the ndvdual frames. As shown n Fgure, for m> before we estmate the frame m, the overlap nterval s partally flled by the former frames. We use a fxed 75% synthess wndow overlap (.e. S = L/4) n our system so that the m th partal frame comes from the overlap-added results of the estmaton of the frames m-, m-, m-3 of y(n), whle the 4 th quarter of frame m s all zero. The partal frame wll be used to estmate the ntal phase n our system as dscussed below. To dstngush the partally flled frame from the fully constructed frame m, we notate the former as y m- (n)w(n-ms),where w(n) s the wndow functon. Now we estmate frame m and overlap-add t wth the partal frame y m- (n)w(n-ms) to generate y m (n). To generate an ntal estmate for the phases of frame m, we compute the phase of the partally reconstructed sgnal usng an analyss wndow postoned at the partally constructed frame m. Ths ensures that even the ntal phase estmate for frame m wll provde good phase contnuty wth the partally-reconstructed sgnal. The Fourer transform of ths partal frame s calculated wth the same normalzed Hammng wndow as n Secton.. We then apply the magntude constrant of Equaton (4) to ths Fourer transform keepng the phase unchanged. Next we calculate the nverse Fourer transform of ths new frequency doman sgnal to get a new estmate of frame m. If the maxmum teraton number s not reached, we add frame m to the partal frame y m- (n)w(nms), apply the wndow, and calculate the Fourer transform of the wndowed summaton to get a new estmate of the phase. We thus use the update Equaton (3) from the G&L algorthm n our teratve process but nstead of updatng the estmate of the whole sgnal x(n), n each step we update the estmate of the current frame only. The teratve process s llustrated n Fgure. There s a specal case at the begnnng of the sgnal, where we do not have a partal frame to be added to our estmate. Any ntal phase can be used as the ntal phase estmaton for the frst frame. In our experments we smply use a zero ntal phase estmate wth the target magntude spectrum and follow the above teratve process to generate the frst frame of y(n). When the teratve process ends, frame m s combned wth the partal frame y m- (n)w(n-ms) and the process contnues wth advancng frames untl the spectrogram frames are exhausted. We wll refer to ths method as the Real-Tme Iteratve Spectrogram Inverson (RTISI) algorthm. DAFX-

3 FFT wndow + y m- (n) w s (n-ms) N th phase estmaton phase IFFT wndow th estmaton of frame m maxmum teraton number reached? Y overlap-add magntude spectrum magntude chronzed overlap and add algorthm (SOLA) [4] and ts varous modfcatons such as WSOLA[5]/SAOLA[6] /PSOLA[7], the phase vocoder algorthm [8] and some methods for buldng specfc models of speech processes such as the vocal tract model[9] and a probablstc nference model[3]. To acheve tme-scale modfcaton, for polyphonc sgnals the phase vocoder method [8] s a common choce. For monophonc sgnals, a tme-doman process of overlap and add (OLA) s often used as follows. The orgnal sgnal s frst wndowed at length L wth an analyss step sze S a. Then for each wndowed frame a reconstructon sgnal of the same length s generated and all the regenerated sgnal segments are overlap-added wth approprate weghts for the synthess step sze S s. However a smple tmedoman OLA method does not generally work well because the sgnal segments beng overlap-added may not be consstent when the audo modfcaton rate (S s /S a ) s other than. Dfferent OLA varants modfy the basc process to mprove qualty. For example n the SOLA method, the reconstructed frame vares wthn a small range to maxmze a correlaton functon to mprove the consstency of the scaled result. Fgure. Frame-by-frame teratve phase estmaton process Where G&L uses partally reconstructed audo nformaton from frames m-3 through m+3 to reconstruct frame m, the RTISI method uses nformaton from prevous frames only. Also, the partal nformaton used to construct frame m wth G&L changes wth each teraton, whereas n the RTISI method, each frame s estmated strctly n tme order. The frame-by-frame method admts an obvous source of error n that the computaton of frame m s based only on part of the sgnal that the target frame m s based upon. For ths reason, RTISI cannot be expected to match the spectral error measure acheved by G&L. The overlap-add procedure adds audo to frame m from future frames m+, m+ and m+3 after frame m has already been estmated. Ths wll change both the magntudes and the phases of the gven frame when t s analyzed followng the complete constructon of the sgnal. Ths can cause the addton of spectral energy where the magntude has already been closely matched. However, the future frames overlappng wth frame m can also compensate for the error resultng from any nablty to approach the target magntude spectrum due to frequency content not present n the partal sgnal used n the estmaton of frame m. Thus, the error n the resultng spectrogram s n practce not great, and n any case, nter-frame phase consstency s mantaned durng future frame overlap, whch prevents a common source of perceptual degradaton. Furthermore, n the trade-off we gan n speed of convergence gven the greater nformaton for the ntal phase estmate avalable usng RTISI. 3. TIME-SCALE MODIFICATION OF AUDIO SIGNALS Tme-scale modfcaton (TSM) of sgnals has long been a subject of nterest n the audo and speech processng doman. A key challenge n TSM s to change the audo rate, whle preservng other characterstcs such as ptch and tmbre. There have been several approaches reported to modfy the tme-scale of an audo sgnal. Such approaches nclude the G&L method [], the syn- The reconstructon of the wndowed sgnal can be mplemented n ether the tme-doman wth a method such as SOLA, or n frequency doman wth a method such as the phase vocoder or the RTISI algorthm do. Because tradtonal magntude-spectraonly reconstructon methods n [][] requre a large number of teratons of the analyss-synthess cycle to acheve good performance, the tme-doman methods are consdered to be economcal n computaton and have been appled n many commercal mplementatons. The tme-doman TSM methods work well when the modfcaton factor s close to and when the sgnal source s monophonc, but the performance s often degraded when they are appled to polyphonc sounds or when the modfcaton factor s large [0]. The RTISI method s applcable to both monophonc samples and polyphonc samples. The relatvely small amount of calculaton requred by RTISI and the consstency between the adjacent regenerated frames make t applcable to real-tme applcatons. In Secton 3. we descrbe the use of synchronzed overlap and add (SOLA) for TSM. In Secton 3., we dscuss the mplementaton of TSM usng the RTISI approach, and then compare the methods n the evaluaton secton. 3.. Synchronzed Overlap and Add Method SOLA s a modfcaton of the smple OLA method and t provdes more consstency between the reconstructed adjacent frames. Consder a pulse tran across two adjacent wndowed frames n the source sgnal. If the TSM rate s other than, the pulses n neghbourng frames do not lne up for the overlap and add. Ths creates artfacts such as addtonal clcks, false frequences, and reverberaton effects. The addtonal synchronzaton step n SOLA provdes a more a more consstent soluton across frames. SOLA algns the adjacent frames n a way that they are of hghest smlarty where the wndows overlap durng reconstructon n order to mantan the orgnal character of audo sgnal such as ptch nformaton. It s acheved by sldng the new analyss frame along the sgnal reconstructed as so far, whch s noted as DAFX-3

4 y(n), by an algnment offset k p n a range of [k mn, k max ] that maxmzes the followng normalzed cross-correlaton functon: R [ k] = m L q= 0 yms ( + k+ qxms ) ( + q) s L L ( s ) ( q= 0 q= 0 yms + k+ q x ms + q) where L s the length of analyss wndow, S s s the synthess step sze, S a s the analyss step sze, m s the ndex of current frame, and y(n) s the reconstructed sgnal as so far. After the best synchronzaton poston k p s found, the wndowed frame m s overlap-added to the synthess sgnal wth offset k p and the process s repeated for the next frames untl the whole sgnal s exhausted. 3.. The RTISI Method for Tme-Scale Modfcaton The way we apply RTISI to tme-scale modfcaton follows the tradtonal frequency doman method: for a modfcaton rate α, we use an analyss step sze S a to obtan the STFTM and use a synthesze step sze S s such that S a = S s /α. The frame lengths n the analyss and synthess process are both L. Here we use a fxed synthess step sze S s = L/4, whch keeps computatonal requrements consstent for varous modfcaton rates. Gven α, we use an analyss step sze of S s /α to acheve the modfcaton rate. The process s shown n Fgure 3. a a (5) 4. EVALUATION The evaluaton secton s dvded nto two parts: the evaluaton of the phase reconstructon performance and the evaluaton of the TSM applcaton. 4.. Phase Reconstructon Performance We evaluate the phase reconstructon result usng an SNR functon smlar to the one n [3] comparng the spectrogram of the reconstructed sgnal to that of the target: SNR = 0log E ( w f w s ( f ) s ( f ) ) E w f w w E s ( f ) where S w (f) s the STFTM of the orgnal sgnal, S w(f) s the STFTM of the reconstructed sgnal, E s the total energy n the reconstructed sgnal, summatons over w and f are over all wndows and frequences respectvely. We appled the frame-by-frame tme-doman sgnal reconstructon algorthm on a set of 4 test audo samples ncludng chrp samples, frequency modulaton samples, pulse tran samples, male speech samples, female speech samples and musc samples. The average SNR computed by Equaton (6) s shown n Table for dfferent numbers of teratons. (6) Sa Sa Sa L orgnal sgnal Iteraton number Average SNR(dB) Table. Average SNR measures for RTISI spectra Table shows a comparson of RTISI wth G&L on the same test set. We run G&L wth 5, 0 and 50 teratons, and we run RTISI wth 5 and 0 teratons. Fgure 4 llustrates the error n the frequency magntude doman for a typcal data (taken from a vowel sound n male speech). S s S s S s L tme-scale modfed sgnal SNR (db) G&L (5 teratons) 0.37 G&L (0 teratons).6 G&L (50 teratons) 5.50 RTISI (5 teratons) 7.7 RTISI (0 teratons) 8.4 Fgure 3. Tme-scale modfcaton n RTISI. Table. Average SNR results for G&L and RTISI on a test set of 4 sgnals for dfferent levels of teraton. RTISI can effcently acheve excellent nter-frame consstency thereby removng the prmary obstacle to applyng a frequencydoman method to TSM. DAFX-4

5 qute slow, and reasonable stoppng crtera can be chosen to lmt computatonal cost. Fgure 4. Magntude spectra at a partcular frame of a male speech vowel. Shown are comparsons between the orgnal magntude spectra and (a) RTISI at 5 teratons, (b) G&L at 5 teratons, and (c)g&l at 00 teratons. Fgure 5. Dstance from target magntude spectra for dfferent numbers of teratons. Achan[3] recently ntroduced a method of probablstc nference for computng an estmate of reconstructed sgnals gven a spectrogram. To compare RTISI wth ther method, we downloaded the female speech example publshed by the authors on the webste Both the orgnal sgnal and the reconstructon result of the method descrbed n that paper were provded. A comparson of the two methods s shown n Table 3. The SNR fgures show some mprovement usng RTISI, however, there are clck artfacts apparent n the result of the Achan method, the perceptual salence of whch s not adequately reflected n the SNR numbers. SNR (db) Achan s method 7.05 Achan wth AR model 7.04 RTISI (5 teratons) 0.68 RTISI (0 teratons).86 Table 3. SNR from dfferent methods for a specfc sample The RTISI algorthm converges quckly compared wth G&L. Fgure 5 shows the change of the dstance calculated by the Equaton () for dfferent numbers of teratons for the RTISI algorthm. It can be seen that the dstance decreases fast when we ncrease the teraton number from to 5 before stablzng. Fgure 6 shows the dstance between the orgnal sgnal and the reconstructed sgnal usng the measure n Equaton () for both the RTISI method and for G&L. The ntal error of the G&L algorthm s large because of the zero phase ntalzaton n every frame. Because we use the partally constructed frame as our startng pont, we get a much smaller ntal error. Usng only a few teratons, the dstance measure for RTISI decreases to a stable value. The error for G&L decreases monotoncally and t typcally becomes smaller than that of RTISI after about 5 teratons. After the pont at whch the error functons of the two methods cross, the reducton n error for further teraton of G&L s Fgure 6. Change of dstance between the orgnal sgnal and the reconstructed sgnal. The trangle lne s from G&L and the cross lne s from the RTISI algorthm. An obvous extenson to the standard G&L algorthm for nonreal-tme applcatons s to run RTISI for one or two teratons to produce ntal sgnal and phase estmates, and then proceed wth G&L thereafter f a further reducton n error s stll requred. Comparng the tradeoffs n detal s part of our current research. 4.. Tme-Scale Modfcaton Performance For TSM applcatons, we appled the SOLA and RTISI to a varety of audo sgnal types ncludng speech, musc and generated sgnals such as chrp and pulse tran. For a pulse tran, whch s the knd of sgnal SOLA was specfcally desgned to address, SOLA generates better results than RTISI. But for almost all other sound samples, SOLA performs worse than RTISI and the computaton tme of SOLA s much longer because t calculates several dozens cross correlaton functons for each ndvdual frame n the orgnal sgnal. DAFX-5

6 When appled to polyphonc sgnals such as pop musc, there are perceptually obvous artfacts wth SOLA, even wth a modfcaton rate close to. Such artfacts nclude warblng, transent doublng and skppng and tempo modulaton. Informal lstenng tests show that RTISI works well for speech as well as for polyphonc sgnals such as musc, even at modfcaton rates far from. For TSM, there are no reference magntude spectra to compare wth the modfed sgnal so we do not provde an objectve evaluaton functon here, but the artfacts and dstortons from RTISI are far less audble than those from SOLA. There s slght phasness that can be perceved for smple nonstatonary sgnals such as a chrp, but for complex real audo sgnals t s not obvous. Another advantage of RTISI over many tme-doman TSM methods s that there s no need to estmate ptch or make perodc-versus-nose decsons. The straght-forward overlap-and-add process of RTISI generates hgh qualty results and the consstency between successve frames remans even at modfcaton rates far from one. The most salent artfact produced by RTISI audo constructons s a smearng of transent nformaton. The sub-frame sample-rate temporal nformaton from the orgnal sgnal s not used n the method, and the phase choces are made to enforce nterframe consstency rather than any knd of transent pattern. Thus, there are less dstractng artfacts lke clcks and reverberaton n RTISI than SOLA, but musc loses some ts punch and speech loses a small degree of artculaton. The effect s most notceable n hghly transent sgnals such as clck trans or the sound of a cracklng fre. Many examples are avalable for lstenng at 5. CONCLUSIONS The Real-Tme Iteratve Spectrogram Inverson (RTISI) algorthm for constructng real audo sgnals from a sequence of magntude spectra was presented. The method s based a strategy presented by Grffn and Lm [], but s modfed to estmate audo frames n sequence rather than n parallel. In addton to makng the method applcable to real-tme audo sgnal constructon, the modfcaton allows for better ntal phase estmates whch sgnfcantly speed up the convergence toward target spectra. The RTISI method can approach, but not match the performance of G&L run at 00 teratons n terms of magntude spectrum error, however, the perceptual qualty of RTISI after 5 teratons s qute good. If a magntude spectrum error better than that whch RTISI can delver s necessary, the RTISI approach wth one or two teratons can be used to produce an ntal phase estmate for the G&L provdng a sgnfcant speed mprovement. When appled to tme-scale modfcaton, RTISI compares favourably wth the SOLA tme-doman method of sgnal modfcaton n terms of computatonal complexty, and favourably n terms of perceptual results on all but a few specally constructed sgnals. RTISI provdes consderable mprovement at both small and large scalng factors n terms of the absence of the clckness, ptch and reverberaton artfacts that plague tme-doman methods of TSM. Future work s necessary to quantfy the frame transton artfacts that are not reflected n spectral SNR measures. The RTISI method wll also be explored further n the context of other sgnal modfcaton applcatons, and for mprovng the ablty to capture and ncorporate transent behavor from source sgnals n applcatons where such nformaton s avalable. 6. REFERENCES [] D.W. Grffn, J.S. Lm, Sgnal Estmaton from Modfed Short-Tme Fourer Transform, IEEE Transactons on Acoustcs, Speech, and Sgnal Processng, vol.3, no., Apr, 984. [] S.H. Nawab, T.F. Quater, J.S. Lm, Sgnal Reconstructon from Short-Tme Fourer Transform Magntude, IEEE Transactons on Acoustcs, Speech, and Sgnal Processng, vol.3, no. 4, Aug 983. [3] K. Achan, S.T. Rowes, B.J. Frey, Probablstc Inference of Speech Sgnals from Phaseless Sepctrograms, Neural Informaton Processng Systems 6, pp , 003. [4] S. Roucos, A. M. Wlgus, Hgh Qualty Tme-Scale Modfcaton for Speech, IEEE Internatonal Conference on Acoustcs, Speech, and Sgnal Processng, vol.0, pp , Apr 985. [5] W. Verhelst, M. Roelands, An Overlap-Add Technque Based on Waveform Smlarty(WSOLA) for Hgh Qualty Tme-Scale Modfcaton of Speech, IEEE Internatonal Conference on Acoustcs, Speech, and Sgnal Processng, vol., pp Apr 993. [6] D. Dorran, R. Lawlor, E. Coyle, Hgh Qualty Tme-Scale Modfcaton of Speech Usng a Peak Algnment Overlap- Add Algorthm(PAOLA), IEEE Internatonal Conference on Acoustcs, Speech, and Sgnal Processng, vol., pp. 6-0, Apr 003. [7] E. Moulnes, F. Charpenter, Ptch Synchronzed Waveform Processng Technques for Text-To-Speech Synthess Usng Dphones, Speech Communcaton, vol. 9, pp , 990. [8] J. Laroche, M. Dolson, Improved Phase Vocoder Tme- Scale Modfcaton of Audo, IEEE Transactons on Speech, and Audo Processng, vol. 7, No.3, May 999. [9] T.F. Quater, R.J. McAulay, Shape Invarant Tme-Scale and Ptch Modfcaton of Speech, IEEE Transactons on Sgnal Processng, vol. 4, no. 3, Mar 99. [0] E. Moulnes, J. Laroche, Non parametrc technques for ptch-scale and tme-scale modfcaton of speech, Speech Communcaton, vol. 6, pp , Feb 995. [] M. Slaney, D.Naar, R.F. Lyon, Audtory Model Inverson for Sound Separaton, IEEE Internatonal Conference on Acoustcs, Speech, and Sgnal Processng, vol., pp , Apr 994. DAFX-6

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

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

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

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

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

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

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

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

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

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

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

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

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

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

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

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

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

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

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

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

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

More information

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

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

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

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

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

Key-Selective Patchwork Method for Audio Watermarking

Key-Selective Patchwork Method for Audio Watermarking Internatonal Journal of Dgtal Content Technology and ts Applcatons Volume 4, Number 4, July 2010 Key-Selectve Patchwork Method for Audo Watermarkng 1 Ch-Man Pun, 2 Jng-Jng Jang 1, Frst and Correspondng

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

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

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

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Mathematics 256 a course in differential equations for engineering students

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

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More 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

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

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More 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

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

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

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

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

An 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

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

[33]. As we have seen there are different algorithms for compressing the speech. The

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

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

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

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

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

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Lecture #15 Lecture Notes

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

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

EFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION

EFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION EFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION Chrstelle Yemdj, Moctar Moss Idrssa and Ncholas W. D. Evans EURECOM Insttute 656 Sopha-Antpols, France {yemdj, moss, evans}@eurecom.fr web: www.eurecom.fr

More information

Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a. Clustering Method

Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a. Clustering Method 1 Extracton of Uncorrelated Sparse Sources from Sgnal Mxtures usng a Malcolm Woolfson Clusterng Method Department of Electrcal and Electronc Engneerng, Faculty of Engneerng, Unversty of Nottngham, Nottngham.

More information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More 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

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

Automatic selection of reference velocities for recursive depth migration

Automatic selection of reference velocities for recursive depth migration Automatc selecton of mgraton veloctes Automatc selecton of reference veloctes for recursve depth mgraton Hugh D. Geger and Gary F. Margrave ABSTRACT Wave equaton depth mgraton methods such as phase-shft

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Comparative Study of Techniques to minimize packet loss in VoIP Shveni P Mehta

Comparative Study of Techniques to minimize packet loss in VoIP Shveni P Mehta Comparatve Study of Technques to mnmze packet loss n VoIP Shven P Mehta ABSTRACT Voce over IP s an upcomng technology that enables voce communcaton through the Internet. Packet-based network lnks are shared

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

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

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

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

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

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

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

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

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

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

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

Convolutional interleaver for unequal error protection of turbo codes

Convolutional interleaver for unequal error protection of turbo codes Convolutonal nterleaver for unequal error protecton of turbo codes Sna Vaf, Tadeusz Wysock, Ian Burnett Unversty of Wollongong, SW 2522, Australa E-mal:{sv39,wysock,an_burnett}@uow.edu.au Abstract: Ths

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

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

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

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

More information

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

Private Information Retrieval (PIR)

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

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

IMAGE FUSION TECHNIQUES

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

Enhanced AMBTC for Image Compression using Block Classification and Interpolation

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

More information

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

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15 CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Random Kernel Perceptron on ATTiny2313 Microcontroller

Random Kernel Perceptron on ATTiny2313 Microcontroller Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

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

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

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

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More 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

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

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