ADAPTIVE TRAVEL TIME TOMOGRAPHY WITH LOCAL SPARSITY. Michael Bianco and Peter Gerstoft

Size: px
Start display at page:

Download "ADAPTIVE TRAVEL TIME TOMOGRAPHY WITH LOCAL SPARSITY. Michael Bianco and Peter Gerstoft"

Transcription

1 ADAPTIVE TRAVEL TIME TOMOGRAPHY WITH LOCAL SPARSITY Mchael Banco and Peter Gerstoft UCSD Scrpps Insttuton of Oceanography La Jolla, CA ABSTRACT We develop a 2D travel tme tomography method whch regularzes the nverson by modelng sparsely patches of slowness pxels from dscrete slowness map, and adapts sparse dctonares to the slowness data. Ths locally-sparse travel tme tomography LST approach consders global and local behavor of slowness, whereas conventonal regularzaton methods consder only global covarance of pxels. We develop a maxmum a posteror formulaton of LST, and further explot the sparsty of patches usng dctonary learnng. We demonstrate the LST method on densely, but rregularly sampled synthetc slowness maps. Index Terms Sparse modelng, machne learnng, dctonary learnng, geophyscs, sesmcs. INTRODUCTION Travel tme tomography methods attempt to estmate complex Earth structure, whch contans smooth and dscontnuous features at multple spatal scales, usng sesmc and acoustc wave travel tmes between recordng statons [, 2]. The nverson of the travel tmes for a slowness model nverse of speed s ll-posed, wth often dense but rregular ray coverage of envronments. Conventonal tomography technques regularze the nverson by restrctng the models to be only smooth or dscontnuous, whch nclude st and 2nd order Tkhonov regularzaton [, 2]. Other regularzaton methods have been proposed whch employ of wavelet functons [3 6], total varaton TV [7, 8], or adaptve dscretzatons of slowness [9]. Recent works n acoustcs have utlzed sparse modelng and compressve sensng CS [0 2] to mprove performance n beamformng [3,4] and nverson for ocean acoustc propertes [5 8]. Smlarly, the more recent waveletbased methods n sesmc tomography, e.g. [4, 6, 9], assume sparse wavelet coeffcents. In sparse modelng and CS, nverse problems are regularzed by modelng sgnals as sparse combnatons of vectors or atoms from set or dctonary of atoms, whch can be prescrbed or learned [, 2, ]. Ths Ths work s supported by the Offce of Naval Research, Grant No. N paradgm s ubqutous n sgnal processng for mage denosng and npantng [, 2], and medcal magng [2, 22], to name a few examples. Learned dctonares can mprove reconstructon performance over prescrbed dctonares and recently, nverson methods wth dctonary learnng have been developed n the geoscences. Applcatons nclude denosng sesmc traces [23] and ocean acoustc recordngs [24], full waveform nverson [25], and estmaton of ocean sound speed profles [5, 6]. In ths paper, we develop a sparse and adaptve approach to 2D travel tme tomography, whch we refer to as locallysparse travel tme tomography LST. The LST sparsely models local behavors of overlappng groups of pxels from a dscrete slowness map, called patches. Large scale features n the slowness map are constraned usng least squares. Ths approach s smlar to works n mage denosng [26] and CS magnetc resonance magng MRI [22]. We develop a maxmum a posteror MAP formulaton to the problem and use the teratve thresholdng and sgned K-means ITKM dctonary learnng algorthm to mprove the slowness models over prescrbed dctonares. We demonstrate the performance of LST consderng 2D surface wave tomography wth synthetc slowness maps and travel tme data. The results are compared wth conventonal tomography. More detals of the approach and further expermental results are avalable n a forthcomng paper [27]. 2. OVERVIEW OF LST Gven travel tme perturbatons t R M from M ray paths through a dscrete slowness map see Fg. a, and tomography matrx A R M N, LST estmates the sparse slowness s s. We frst estmate the global slowness s g, and then obtan the patch slowness Dx for patch of s g. Here D R n Q s a dctonary of Q atoms, and x R n s the sparse coeffcents wth n the number of pxels n a patch. Fnally slownesses {D x } are averaged wth s g to obtan s s. 2.. Global slowness and travel tme We dscretze a 2D slowness map as a W W 2 pxel mage, shown n Fg. a, where each pxel has constant slowness. The slowness pxels are represented by the vector /8/$ IEEE 63 ICASSP 8

2 necessary to adequately approxmate R s s. Atoms can be prescrbed functons, e.g. wavelets or the dscrete cosne transform DCT, or learned from the data see Sec DERIVATION OF LST MAP OBJECTIVE Startng wth Bayes rule, we derve the LST MAP objectve for s s, ncorporatng both local sparse pror and global constrants. For the dervaton, we assume the dctonary D and sensng matrx A known. In Sec. 3.2, dctonary learnng s ncluded n the algorthm. The posteror densty s formulated as p s g, s s, X t p t s g, s s, X p s g s s, Xp s s Xp X, 2 Fg. : a 2D slowness patches and slowness map parameters, wth b example patch dstrbuton. Synthetc slowness s for c checkerboard map and d smooth-dscontnuous map W = W 2 = 00 pxels km. e 6 straght ray paths surface wave from 64 sesmc statons red X s. s = s g + s 0 R N, where s 0 s reference slownesses and s g s perturbatons from the reference, wth N = W W 2. We assume travel tme observatons t = t + t 0 from M straght ray paths, where t 0 and t are the reference travel tme and perturbatons. Snce s 0 and t 0 = As 0 are known, we estmate the perturbatons t = As g + ɛ, where ɛ R M s Gaussan nose N 0, σ 2 ɛ I, wth mean 0 and covarance σ 2 ɛ I, n the travel tme observatons. We call the global model, as t captures the large-scale features that span the dscrete map and generates t. We assume dense ray coverage, and do not explctly account for varyng ray densty see Sec Local sparse model Each patch s a n n group of pxels from s s, see Fg. a. The patches are selected from s s by the bnary matrx R {0, } n N. Hence the slownesses n patch are R s s. Each patch s ndexed by the row w and column w 2 of ts top-left pxel n the 2D mage as w,, w 2,. We consder all overlappng patches, wth w, and w 2, dfferng from ther neghbor by ± strde of one. Thus, for a W W 2 pxel mage, the number of patches s I = W n + W 2 n +. R s s s approxmated by sparse combnatons atoms from D. The coeffcents x are estmated usng the l 0 pseudonorm see 7, whch penalzes the number of non-zero coeffcents [2]. We call 7 the local model, as t captures the smaller scale, localzed features contaned by patches. The atoms n D are consdered elemental patches, where only a small number of atoms from Q I are where X = [x,..., x I ] R Q I are the coeffcents descrbng all patches. If s g s s s known, so s t s g, whereby p s g, s s, X t p t sg p sg ss p s s Xp X. 3 We assume p t s g, p sg s s, and p ss X are Gaussan, whch results n a smple LST objectve. Hence, for the global model, p t sg = N Asg, Σ ɛ and p s g ss = N ss, Σ g where Σ ɛ R K K s the covarance of ɛ and Σ g R N N s the covarance of s g. For the local model, the patch slownesses {R s s } are consdered ndependent, gvng the local lkelhood p s s X p s s X = p R s x s = N Dx, Σ p, where Σ p, R n n s the covarance of the patch slownesses for each patch. Assumng the coeffcents x ndependent and sparse, ln p X = ln p x, wth ln p x x 0. We further assume the number of non-zero coeffcents T s the same for every patch for whch the l 0 -norm penalty s well suted, and errors d wth Σ ɛ = σɛ 2 I, Σ g = σgi, 2 and Σ p, = σp, 2 I, where I s the dentty matrx. Hence the MAP estmate { ŝ g, ŝ s, X } s from 3 {ŝg, ŝ s, X} = arg mn s g, s s, X + σp, 2 Dx R s s Solvng for the MAP estmate 4 { σɛ 2 t As g σs 2 s g s s 2 2 } 5 subject to x 0 = T. We fnd the MAP estmates { ŝ g, ŝ s, X } solvng 5 va blockcoordnate mnmzaton, smlar to [22, 26]. The global objectve s wrtten from 5 ŝ g = arg mn s g t As g λ s g s s 2 2, 6 where λ = σ ɛ /σ g 2 s a regularzaton parameter. The local objectve from 5 for each patch s solved wth s s = ŝ g decouplng the local and global objectves, gvng x = arg mn Dx R ŝ g 2 2 subject to x 0 = T. 7 x 64

3 Gven: t R M, A R M N, s 0 s = 0 R N, D 0 = Haar, DCT or nose N 0, R n Q, λ, λ 2, T, and j = Repeat untl convergence:. Global estmate: solve 6 usng LSQR [28], ŝ j g = arg mn s j g As j g t λ s j g s j s Local estmate a: Settng s j s = ŝ j g, center patches {R ŝ j g } and. Dctonary learnng Fnd D j usng ITKM [].. Prescrbed dctonary Set D j = D 0.. Solve 7 usng OMP, x j = arg mn D j x j R ŝ j g 2 2 subject to x j 0 = T. x j b: Obtan ŝ j s by 0 as j = j + ŝ j s,n = λ 2ŝ j g,n+b n s j p,n λ 2 +b n Table : Sparse travel tme tomography LST algorthm wth fxed or adaptve dctonares Wth X = [ x,..., x I ] from 7 and ŝ g from 6, we fnd ŝ s from 5, assumng σ 2 p, = σ2 p ŝ s = arg mn λ 2 ŝ g s s s s D x R s s 2 2, 8 where λ 2 = σ p /σ g 2 s a regularzaton parameter. The estmate ŝ s s obtaned analytcally from 8 by ŝ s = λ 2 I + R T R λ 2 ŝ g + R T D x, 9 whch averages the pxels from the patch estmates {D x }, wth weght gven to ŝ g by λ 2. From 9, the average patch slowness s s p = RT R RT D x, wth b = dag RT R Z N the number of patches per pxel. Hence, 9 s expressed as an operaton at pxel n by ŝ s,n = λ 2ŝ g,n + b n s p,n λ 2 + b n LST algorthm wth dctonary learnng The results 6, 7, and 9 gve the LST algorthm for estmatng s s, shown n Table, as a MAP estmate wth local sparse prors usng a prescrbed dctonary D. Dctonary learnng va the ITKM [] s added to the LST n the soluton to the local objectve 7. The global objectve 6 s solved usng the sparse least squares program LSQR [28]. The local objectve 7 s solved usng OMP after the slowness patches {R ŝ g } are centered []. The complexty of each LST teraton s determned prmarly by LSQR computaton n the global estmate, O2MN, and by ITKM OknQI and OMP OT nqi n the local estmate, where k s the ITKM teratons see Table. For large slowness maps, we expect the LST complexty to be domnated by LSQR. In our smulatons we obtan reasonable run tmes see Sec Conventonal tomography We llustrate conventonal tomography wth a Bayesan approach [29], whch enforces smoothness regularzaton wth a global non-dagonal covarance. Consderng the measurements, the MAP estmate of the slowness s ŝ g = A T A + ησ A T L t, where η = σ ɛ /σ c 2 s a regularzaton parameter, σ c s the conventonal slowness varance, and smoothness Σ L, j = exp D,j /L. Here, D,j s the dstance between cells and j, and L s the length scale [29, 30]. 4. SIMULATION We demonstrate the performance of LST Sec. 3, Table relatve to a conventonal tomography Sec Experments are conducted usng smulated travel tmes from two synthetc 2D slowness maps Fg. c,d wth dmensons W = W 2 = 00 pxels km. The checkerboard pattern Fg. c contans only dscontnuous slowness whereas the smooth-dscontnuous map Fg. d contans a fault-lke dscontnuty n a smooth map. The slowness estmates from LST are plotted as ŝ s = ŝ s + s 0 R N, and for conventonal ŝ g = ŝ g + s 0 R N. The slownesses are sampled by M = 6 straght-rays between 64 sesmc statons see Fg. e. The travel tme vector t s found by ntegratng along these ray paths. We consder only straght ray propagaton, to focus on our proposed nverson approach. The reference slowness s calculated from the mean travel tme usng the the tomography matrx A. The LST nverson vald-regon s obtaned wth a dlaton operaton wth a patch template along the outermost ray paths. The conventonal vald regon s the outermost pxels along the ray paths. The conventonal vald regon s used for error calculatons for both methods. We consder the nose-free case σ ɛ = 0. The results of the LST and conventonal tomography are shown n Fgs. 2 and 3. RMSE s/km of the estmates ŝ s and ŝ s relatve to the true slowness s s prnted on the 2D estmates. We nvert usng LST wth and wthout dctonary learnng. We consder two prescrbed dctonares D, overcomplete Haar wavelet and DCT dctonares both Q = 69, n = 64, snce Haar wavelet dmensons power of Inverson parameters and results The regularzaton parameter values for LST and conventonal tomography were selected to mnmze RMSE s/km. For LST, the best parameters were: for both prescrbed dctonary 65

4 Range km a 00 Slowness s/km e b True Estmated f c g d h Range km 00 Slowness s/km a d 0.02 Slowness s/km b e True Estmated Range km 00 c f Range km Slowness s/km 0.02 Fg. 2: LST and conventonal tomography for checkerboard map Fg. c. 2D and D from black lne n 2D slowness estmates aganst true slowness for: a,b conventonal ŝ g; LST ŝ s wth c,d Haar dctonary and e,f wth DCT dctonary D; and g,h wth dctonary learnng. RMSE s/km s prnted on each 2D mage. g j h k l and dctonary learnng, λ = 0 km 2 n 6 and λ 2 = 0 n 8; for prescrbed dctonares T = 2 non-zero coeffcents n 7; for dctonary learnng, T =, n = 00, and for the checkerboard smooth-dscontnuous Q = 66 Q = 268 atoms. Snce for the nose free case σ ɛ = 0, we expect λ = σ ɛ /σ g 2 = 0 km 2 to be best. We assume the slowness patches are well approxmated by the sparse model 7, and expect σ p σ g. Hence, we expect the best value of λ 2 = σ p /σ g 2 n 8 to be small. For conventonal tomography Sec. 3.3, the best parameters were L = 0 km and η = 0. km 2 n for the both the checkerboard and smooth-dscontnuous maps, whch devates from the expected value of η = σ ɛ /σ c 2 = 0. Whle the dscontnuous shapes n the Haar dctonary are smlar to the dscontnuous content of the checkerboard mage, the local features n the hgher order Haar wavelets overft the ray samplng where samplng s poor near the edges of the nverson, Fg. 2c,d. The performance of the Haar wavelets s better for the smooth-dscontnuous slowness map Fg. 3d f than for the checkerboard. As shown n Fg. 3d f, the Haar wavelets add false hgh frequency structure to the slowness reconstructon but the trends n the smoothdscontnuous features are well preserved. The nverson performance of the DCT transform Fg. 2e,f and Fg. 3g,j s better than the Haar wavelets for both cases, but matches less closely the dscontnuous slowness features, as the DCT atoms are smooth. The smoothness of the DCT atoms better preserve the smooth slowness structure. The LST wth dctonary learnng Fg. 2g,h and Fg. 3j l acheves the best RMSE relatve to the true slowness s. As n the other cases, the performance degrades near the edges of the ray samplng, where the ray coverage s poor, but hgh resoluton s mantaned across a large part of the samplng regon. The RMSE of the Haar wavelet nverson for the checkerboard s greater than for the conventonal method, Range km 00 Range km Slowness s/km Fg. 3: LST and conventonal tomography for smooth-dscontnuous map Fg. d. 2D and D horzontal and vertcal, from black lnes n 2D slowness estmates aganst true slowness for: a c conventonal ŝ g; LST ŝ s wth d f Haar dctonary and g wth DCT dctonary D; and j l wth dctonary learnng. RMSE s/km s prnted on each 2D mage. although resoluton s lost n the conventonal MAP nverson near the more densely sampled regon of the wave speed maps. The RMSE for the DCT s less than the that of the Haar wavelets and also the conventonal MAP nverson. A better qualtatve ft to the true slowness s also observed. The LST algorthm Table used 00 teratons for all cases and the ITKM used 50 teratons. In Matlab, the nverson wth dctonary learnng took 5 mn on a Macbook Pro 2.5 GHz Intel Core CONCLUSIONS We derved a travel tme tomography method whch ncorporates a sparse pror on patches of the slowness mage, whch we refer to as the LST algorthm. The LST uses prescrbed or learned dctonares, though the learned dctonares mprove performance. The local sparse pror and dctonary learnng provde an mproved slowness model, whch s capable of modelng smultaneously smooth dscontnuous features. We consdered 2D surface wave tomography, and for densely sampled slowness maps obtaned superor results from the LST over conventonal tomography. The LST s relevant to other tomography scenaros where slowness structure s rregularly sampled, n for nstance ocean [6] and terrestral [3] acoustcs. 66

5 6. REFERENCES [] R.C. Aster, B. Borchers, and C.H. Thurber, Parameter estmaton and nverse problems, Elsever, San Dego, 2nd edton, 3. [2] N. Rawlnson, S. Pozgay, and S. Fshwck, Sesmc tomography: a wndow nto deep earth, Phys. Earth and Planetary Interors, vol. 78, no. 3, pp. 0 35, 0. [3] L.Y. Chao and B.Y. Kuo, Multscale sesmc tomography, Geophys. J. Int., vol. 45, no. 2, pp , 0. [4] I. Lors, G. Nolet, I. Daubeches, and F.A. Dahlen, Tomographc nverson usng l norm regularzaton of wavelet coeffcents, Geophys. J. Int., vol. 70, no., pp , 07. [5] R. Hawkns and M. Sambrdge, Geophyscal magng usng trans-dmensonal trees, Geophys. J. Int., vol. 3, no. 2, pp , 5. [6] H. Fang and H. Zhang, Wavelet-based double-dfference sesmc tomography wth sparsty regularzaton, Geophys. J. Int., vol. 99, no. 2, pp , 4. [7] Y. Ln and L. Huang, Quantfyng subsurface geophyscal propertes changes usng double-dfference sesmcwaveform nverson wth a modfed total-varaton regularzaton scheme, Geophys. J. Int., vol. 3, no. 3, pp , 5. [8] X. Zhang and J. Zhang, Model regularzaton for sesmc traveltme tomography wth an edge-preservng smoothng operator, J. Appl. Geophys., vol. 38, pp , 7. [9] T. Bodn, M. Sambrdge, and K. Gallagher, A selfparametrzng partton model approach to tomographc nverse problems, Inverse Problems, vol. 25, no. 5, 09. [0] E. Candés, Compressve samplng, Proc. Int. Congr. Math., vol. 3, pp , 06. [] J. Maral, F. Bach, and J. Ponce, Sparse modelng for mage and vson processng, Found. Trends Comput. Graph. Vs., vol. 8, no. 2 3, pp , 4. [2] M. Elad, Sparse and Redundant Representatons, Sprnger, New York, 0. [3] A. Xenak, P. Gerstoft, and K. Mosegaard, Compressve beamformng, J. Acoust. Soc. Am., vol. 36, no., pp. 2 27, 06. [4] P. Gerstoft, C.F. Mecklenbräuker, A. Xenak, and S. Nannuru, Multsnapshot sparse Bayesan learnng for DOA, IEEE Sgnal Process. Lett., vol. 23, no. 0, pp , 6. [5] T. Wang and W. Xu, Sparsty-based approach for ocean acoustc tomography usng learned dctonares, OCEANS 6 Shangha IEEE, pp. 6, 6. [6] M. Banco and P. Gerstoft, Compressve acoustc sound speed profle estmaton, J. Acoust. Soc. Am., vol. 39, no. 3, pp. EL90 EL94, 6. [7] M. Banco and P. Gerstoft, Dctonary learnng of sound speed profles, J. Acoust. Soc. Am., vol. 4, no. 3, pp , 7. [8] M. Banco and P. Gerstoft, Regularzaton of geophyscal nverson usng dctonary learnng, IEEE Int. Conf. Acoust., Speech, and Sgnal Process. ICASSP, 7. [9] J. Charléty, S. Voronn, G. Nolet, I. Lors, F.J. Smons, K. Sgloch, and I.C. Daubeches, Global sesmc tomography wth sparsty constrants: comparson wth smoothng and dampng regularzaton, J. Geophys. Research: Sold Earth, vol. 8, no. 9, pp , 3. [] K. Schnass, Local dentfcaton of overcomplete dctonares, J. Mach. Learnng Research, vol. 6, pp , 5. [2] M. Lustg, D. Donoho, and J.M. Pauly, Sparse MRI: the applcaton of compressed sensng for rapd MR magng, Magn. Reson. Med., vol. 58, no. 6, pp , 07. [22] S. Ravshankar and Y. Bresler, MR mage reconstructon from hghly undersampled k-space data by dctonary learnng, IEEE Trans. Med. Imag., vol. 30, no. 5, pp ,. [23] Y. Chen, Fast dctonary learnng for nose attenuaton of multdmensonal sesmc data, Geophys. J. Int., vol. 9, no., pp. 2 3, 7. [24] M. Taroudaks and C. Smaragdaks, De-nosng procedures for nvertng underwater acoustc sgnals n applcatons of acoustcal oceanography, EuroNose 5 Maastrcht, pp , 5. [25] L. Zhu, E. Lu, and J.H. McClellan, Sparse-promotng full waveform nverson based on onlne orthonormal dctonary learnng, Geophys., vol. 82, no. 2, pp. R87 R07, 7. [26] M. Elad and M. Aharon, Image denosng va sparse and redundant representatons over learned dctonares, IEEE Trans. Image Process., vol. 5, no. 2, pp , 06. [27] M. Banco and P. Gerstoft, Sparse travel tme tomography wth adaptve dctonares, ArXv e-prnts, Jan. 8, [28] C.C. Page and M.A. Saunders, LSQR: an algorthm for sparse lnear equatons and sparse least squares, ACM Trans. Math. Software, vol. 8, no., pp. 43 7, 982. [29] C.D. Rodgers, Inverse methods for atmospherc soundng: theory and practce, World Sc. Pub. Co., 00. [30] A. Tarantola, Inverse problem theory, Elsever Sc. Pub. Co., Inc., 987. [3] R. Rabensten and P. Annbale, Acoustc source localzaton under varable speed of sound condtons, Wreless Commun. Mob. Comp., 7. 67

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

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

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Super-resolution with Nonlocal Regularized Sparse Representation

Super-resolution with Nonlocal Regularized Sparse Representation Super-resoluton wth Nonlocal Regularzed Sparse Representaton Wesheng Dong a, Guangmng Sh a, Le Zhang b, and Xaoln Wu c a Key Laboratory of Intellgent Percepton and Image Understandng (Chnese Mnstry of

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

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

Discriminative Dictionary Learning with Pairwise Constraints

Discriminative Dictionary Learning with Pairwise Constraints Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse

More information

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

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

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

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

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

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

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

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

Learning a Class-Specific Dictionary for Facial Expression Recognition

Learning a Class-Specific Dictionary for Facial Expression Recognition BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for

More 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

Lecture 13: High-dimensional Images

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

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

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

Positive Semi-definite Programming Localization in Wireless Sensor Networks

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

Image Deblurring and Super-resolution by Adaptive Sparse Domain Selection and Adaptive Regularization

Image Deblurring and Super-resolution by Adaptive Sparse Domain Selection and Adaptive Regularization Image Deblurrng and Super-resoluton by Adaptve Sparse Doman Selecton and Adaptve Regularzaton Wesheng Dong a,b, Le Zhang b,1, Member, IEEE, Guangmng Sh a, Senor Member, IEEE, and Xaoln Wu c, Senor Member,

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Nonlocally Centralized Sparse Representation for Image Restoration

Nonlocally Centralized Sparse Representation for Image Restoration Nonlocally Centralzed Sparse Representaton for Image Restoraton Wesheng Dong a, Le Zhang b,1, Member, IEEE, Guangmng Sh a, Senor Member, IEEE, and Xn L c, Senor Member, IEEE a Key Laboratory of Intellgent

More information

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

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

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

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Robust Dictionary Learning with Capped l 1 -Norm

Robust Dictionary Learning with Capped l 1 -Norm Proceedngs of the Twenty-Fourth Internatonal Jont Conference on Artfcal Intellgence (IJCAI 205) Robust Dctonary Learnng wth Capped l -Norm Wenhao Jang, Fepng Ne, Heng Huang Unversty of Texas at Arlngton

More information

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty

More information

Comparison of traveltime inversions on a limestone structure

Comparison of traveltime inversions on a limestone structure Comparson of traveltme nversons on a lmestone structure Comparson of traveltme nversons on a lmestone structure Matthew D. Allen and Robert R. Stewart ABSRAC Four traveltme nverson technques were appled

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

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

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Comparison Study of Textural Descriptors for Training Neural Network Classifiers

Comparison Study of Textural Descriptors for Training Neural Network Classifiers Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84

More information

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

AS a classical problem in low level vision, image denoising. Group Sparsity Residual Constraint for Image Denoising

AS a classical problem in low level vision, image denoising. Group Sparsity Residual Constraint for Image Denoising 1 Group Sparsty Resdual Constrant for Image Denosng Zhyuan Zha, Xnggan Zhang, Qong Wang, Lan Tang and Xn Lu arxv:1703.00297v6 [cs.cv] 31 Jul 2017 Abstract Group-based sparse representaton has shown great

More information

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,

More information

A Study on Clustering for Clustering Based Image De-Noising

A Study on Clustering for Clustering Based Image De-Noising Journal of Informaton Systems and Telecommuncaton, Vol. 2, No. 4, October-December 2014 196 A Study on Clusterng for Clusterng Based Image De-Nosng Hossen Bakhsh Golestan* Department of Electrcal Engneerng,

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

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

Unsupervised Learning and Clustering

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

More information

Mixed Linear System Estimation and Identification

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

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Hermite Splines in Lie Groups as Products of Geodesics

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

Comparison between post-smoothed maximum-likelihood and penalized-likelihood for image reconstruction with uniform spatial resolution

Comparison between post-smoothed maximum-likelihood and penalized-likelihood for image reconstruction with uniform spatial resolution Comparson between post-smoothed maxmum-lkelhood and penalzed-lkelhood for mage reconstructon wth unform spatal resoluton Johan Nuyts, Jeffrey A. Fessler Abstract Regularzaton s desrable for mage reconstructon

More information

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye

More information

A Model-Based Iterative Algorithm for Dual-Energy X-Ray CT Reconstruction

A Model-Based Iterative Algorithm for Dual-Energy X-Ray CT Reconstruction A Model-Based Iteratve Algorthm for Dual-Energy X-Ray CT Reconstructon Ruoqao Zhang, Jean-Baptste Thbault, Member, IEEE, Charles A. Bouman, Fellow, IEEE, Ken D. Sauer, Member, IEEE, and Jang Hseh, Senor

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

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

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

Machine Learning. K-means Algorithm

Machine Learning. K-means Algorithm Macne Learnng CS 6375 --- Sprng 2015 Gaussan Mture Model GMM pectaton Mamzaton M Acknowledgement: some sldes adopted from Crstoper Bsop Vncent Ng. 1 K-means Algortm Specal case of M Goal: represent a data

More information

Distance Calculation from Single Optical Image

Distance Calculation from Single Optical Image 17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*

More information

LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS. Matthew R. O Shaughnessy and Mark A. Davenport

LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS. Matthew R. O Shaughnessy and Mark A. Davenport 2016 IEEE INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING, SEPT. 13 16, 2016, SALERNO, ITALY LOCALIZING USERS AND ITEMS FROM PAIRED COMPARISONS Matthew R. O Shaughnessy and Mark A. Davenport

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

An optimized workflow for coherent noise attenuation in time-lapse processing

An optimized workflow for coherent noise attenuation in time-lapse processing An optmzed workflow for coherent nose attenuaton n tme-lapse processng Adel Khall 1, Hennng Hoeber 1, Steve Campbell 2, Mark Ibram 2 and Dan Daves 2. 1 CGGVertas, 2 BP 75 th EAGE Conference & Exhbton ncorporatng

More information

A novel Adaptive Sub-Band Filter design with BD-VSS using Particle Swarm Optimization

A novel Adaptive Sub-Band Filter design with BD-VSS using Particle Swarm Optimization Internatonal Research Journal of Engneerng and echnology (IRJE) e-iss: 2395-56 Volume: 5 Issue: Oct 28 www.rjet.net p-iss: 2395-72 A novel Adaptve Sub-Band Flter desgn wth B-VSS usng Partcle Swarm Optmzaton

More information

Video Denoising Algorithm in Sliding 3D DCT domain

Video Denoising Algorithm in Sliding 3D DCT domain Dmytro Rusanovskyy and Karen Egazaran, ACIVS 2005, Antwerp, Belgum Vdeo Denosng Algorthm n Sldng 3D DCT doman Dmytro Rusanovskyy and Karen Egazaran Insttute of Sgnal Processng Tampere Unversty of Technology,

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

Separation of Image Sources Using AMMCA Algorithm

Separation of Image Sources Using AMMCA Algorithm Separaton of Image Sources Usng AMMCA Algorthm Nmmy Nce.A 1, V.Vno Ruban Sngh PG student, Appled Electroncs, Loyola Insttute of echnology and Scence,Nagercol, Inda 1 nce4.nmmy@gmal.com 1 Assstant professor,

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

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

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

Biostatistics 615/815

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

More information

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

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

Three supervised learning methods on pen digits character recognition dataset

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

More information

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, Dictionary Pair Learning on Grassmann Manifolds for Image Denoising

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, Dictionary Pair Learning on Grassmann Manifolds for Image Denoising IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, 2015 1 Dctonary Par Learnng on Grassmann Manfolds for Image Denosng Xanhua Zeng, We Ban, We Lu, Jale Shen, Dacheng Tao, Fellow, IEEE Abstract Image

More information

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping. SIGGRAPH 004 Interactve Image Cutout Lazy Snappng Yn L Jan Sun Ch-Keung Tang Heung-Yeung Shum Mcrosoft Research Asa Hong Kong Unversty Separate an object from ts background Compose the object on another

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

Robust Visual Tracking via Structured Multi-Task Sparse Learning

Robust Visual Tracking via Structured Multi-Task Sparse Learning Int J Comput Vs (203) 0:367 383 DOI 0.007/s263-02-0582-z Robust Vsual Trackng va Structured Mult-Task Sparse Learnng Tanzhu Zhang Bernard Ghanem S Lu Narendra Ahuja Receved: 2 Aprl 202 / Accepted: 30 September

More information

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech. Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons

More information

Novel Fuzzy logic Based Edge Detection Technique

Novel Fuzzy logic Based Edge Detection Technique Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on

More information

RAPID CARDIAC MRI USING RANDOM RADIAL TRAJECTORIES S. M. EL-METWALLY 1, K. Z. ABD-ELMONIEM 2, A. M. YOUSSEF 1 AND Y. M.

RAPID CARDIAC MRI USING RANDOM RADIAL TRAJECTORIES S. M. EL-METWALLY 1, K. Z. ABD-ELMONIEM 2, A. M. YOUSSEF 1 AND Y. M. JOURNAL OF ENGINEERING AND APPLIED SCIENCE, VOL. 55, NO. 5, OCT. 008, PP. 44-456 FACULTY OF ENGINEERING, CAIRO UNIVERSITY requred k-space. Sparse MRI s a fast magng method based on undersampled k-space

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

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

Fusion Performance Model for Distributed Tracking and Classification

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

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

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

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

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

RECONSTRUCTING a high quality image from one or

RECONSTRUCTING a high quality image from one or 1620 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 4, APRIL 2013 Nonlocally Centralzed Sparse Representaton for Image Restoraton Wesheng Dong, Le Zhang, Member, IEEE, Guangmng Sh, Senor Member, IEEE,

More information

Geophysical Journal International

Geophysical Journal International Geophyscal Journal Internatonal Geophys. J. Int. (2014) 196, 1508 1524 Advance Access publcaton 2013 December 22 do: 10.1093/gj/ggt482 Two-dmensonal probablstc nverson of plane-wave electromagnetc data:

More information

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout We 14 15 Two Sesmc Interference Attenuaton Methods Based on Automatc Detecton of Sesmc Interference Moveout S. Jansen* (Unversty of Oslo), T. Elboth (CGG) & C. Sanchs (CGG) SUMMARY The need for effcent

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

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

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

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

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

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

More information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

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

Efficient Sparsity Estimation via Marginal-Lasso Coding

Efficient Sparsity Estimation via Marginal-Lasso Coding Effcent Sparsty Estmaton va Margnal-Lasso Codng Tzu-Y Hung 1,JwenLu 2, Yap-Peng Tan 1, and Shenghua Gao 3 1 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty, Sngapore 2 Advanced

More information

General Regression and Representation Model for Face Recognition

General Regression and Representation Model for Face Recognition 013 IEEE Conference on Computer Vson and Pattern Recognton Workshops General Regresson and Representaton Model for Face Recognton Janjun Qan, Jan Yang School of Computer Scence and Engneerng Nanjng Unversty

More information

Contourlet-Based Image Fusion using Information Measures

Contourlet-Based Image Fusion using Information Measures Proceedngs of the 2nd WSEAS Internatonal Symposum on WAVELETS THEORY & APPLICATIONS n Appled Mathematcs, Sgnal Processng & Modern Scence (WAV '08), Istanbul, Turkey, May 2730, 2008 ContourletBased Image

More information

Exploiting Spatial and Spectral Image Regularities for Color Constancy

Exploiting Spatial and Spectral Image Regularities for Color Constancy Explotng Spatal and Spectral Image Regulartes for Color Constancy Barun Sngh and Wllam T. Freeman MIT Computer Scence and Artfcal Intellgence Laboratory July 2, 23 Abstract We study the problem of color

More information

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

More information

Complex Filtering and Integration via Sampling

Complex Filtering and Integration via Sampling Overvew Complex Flterng and Integraton va Samplng Sgnal processng Sample then flter (remove alases) then resample onunform samplng: jtterng and Posson dsk Statstcs Monte Carlo ntegraton and probablty theory

More information