LESSONS LEARNED FROM PSIC4: IMPROVING PSI RESULTS FOR A CONSTRAINED TEST SITE

Size: px
Start display at page:

Download "LESSONS LEARNED FROM PSIC4: IMPROVING PSI RESULTS FOR A CONSTRAINED TEST SITE"

Transcription

1 LESSONS LEARNED FROM PSIC4: IMPROVING PSI RESULTS FOR A CONSTRAINED TEST SITE Smi Smiei Esfhny, Freek J vn Leijen, Petr Mrinkovic, Gini Ketelr, nd Rmon F Hnssen Delft Institute of Erth Oservtion nd Spce Systems, Delft University of Technology, Kluyverweg, 2629 HS Delft, The Netherlnds Emil: SSmieiesfhny@studenttudelftnl ABSTRACT In the PSIC4 experiment, eight different processing pproches for time series nlysis of InSAR dt were pplied to dt set contining n unknown deformtion signl Results of the experiment showed different sptil point density for different processing pproches The results of most of the groups tht prticipted in the project suffer from low sptil density of persistent sctterers in deforming res This lck of PS points in the re of interest rises the hypothesis of type-i errors (flsely rejected PS) due to imperfections in the mthemticl model of PS processing We investigte the contriution of three different sources of type-i errors: tmospheric phse screen (APS) nd oritl errors, non-liner deformtion mechnisms, nd zimuthl su-pixel position of the sctterers We investigte these type-i errors nd present significnt improvements in their identifiction y optimiztion of the mthemticl model, leding to n improved density of persistent sctterers Key words: Persistent Sctterer; deformtion; InSAR results At TU Delft, the results of the PSIC4 study hve een used to evlute lgorithm performnce nd ssess which pproches re most importnt to retrieve relile deformtion prmeters t high sptil density This includes n nlysis of type-i errors (flsely rejected PS) due to imperfections in the functionl model (eg, imperfection due to highly non-liner deformtion, su-pixel position of the sctterer), or in the stochstic model (eg imperfection due to tmospheric errors, orit errors, geometricl decorreltion) In this pper, we investigte the contriution of three different sources of type I errors (functionlly nd stochsticlly) We optimized the mthemticl model to cope with these three sources of errors in order to decrese the flse rejection rte of sctterers The improvements re sed on the Guss-Mrkov model (which is used in the integer lest-squre nd ootstrpping technique), which llows for the ddition of extr prmeters in the functionl model nd for the doption of the stochstic model without n increse of the computtionl effort INTRODUCTION In the PSIC4 experiment (Rcoules et l, 2006), eight different processing pproches for time series nlysis of InSAR dt were pplied to dt set contining n unknown deformtion signl The experiment proved to e highly successful, s it clerly indicted tht different pproches resulted in different results, in terms of sptil point density, temporl deformtion ehvior, phse miguity resolution, nd precision nd reliility Results showed trde-off etween one or more of the ove chrcteristics, nd high sensitivity to chosen threshold vlues As PSIC4 ws lind experiment, where no -priori informtion on the loction, mgnitude, temporl ehvior, nd other chrcteristics of the deformtion ws ville, it rises the question to wht extent -priori informtion cn nd should e used in PSI processing Informtion, or ssumptions, either on temporl or sptil ehvior pper to e very importnt in the processing 2 MATHEMATICAL FRAMEWORK The sic concept of our PS processing pproch is sed on the mthemticl model which cn e formulted s: E{y} = A + B () D{y} = Q y, where E{} is the expecttion opertor, D{} the dispersion, y the vector of oservtions, A nd B re design mtrices for the integer nd rel vlued prmeter vectors nd respectively, nd Q y is the covrince mtrix This mthemticl model comprises of the functionl nd the stochstic model The functionl model descries the reltion etween the oservtions nd the unknowns, wheres the stochstic model represents the stochstic properties of the oservtions The functionl model for single mster stck, where the mster is indicted y zero nd N slve cquisitions re

2 ville, hs the form ψ 0 2π ψ 0N S E{ 2π H } = D DP 4π λ β 0 α (t 0 ) α P (t 0 ) 4π λ β 0N α (t 0N ) α P (t 0N ) + 0 0N S H D D P covrince mtrix The covrince mtrix of the pseudooservtions Q y contins vrinces which ound the solution spce of the unknowns Using lest-squre estimtion with the functionl model, Eq (2), nd the stochstic model, Eq (3), ech phse doule difference etween two PS cndidtes is unwrpped in time The testing criterion for ccepting sctterer s PS is the -posteriori vrince fctor ˆσ 2 = et Q ψ e, (4) r where e is the vector of residuls etween the unwrpped phse nd the deformtion model nd r is the redundncy in the functionl model A PS cndidte is ccepted s, (2) PS when ˆσ 2 is smller thn 0 3 SOURCES OF TYPE I ERRORS where ψ re the phse oservtions, S is the tmospheric dely of the mster cquisition, H the height, D p re deformtion prmeters with p = P, λ is the rdr wvelength, β is the height-to-phse conversion fctor, α p descries deformtion model s function of temporl seline t nd () denotes pseudo-oservle needed to solve for the rnk deficiency of the system (Kmpes nd Hnssen, 2004) The rnk deficiency is cused y the fct tht for ech oserved phse n miguity needs to e estimted, together with the prmeters of interest As result, the numer of unknowns exceeds the numer of oservtions With the introduction of pseudo-oservles, the mthemticl model is regulrized Without -priori knowledge of the topogrphy nd deformtion in the re, the pseudo-oservtions re set to zero To reduce the influence of tmospheric delys nd orit errors on the estimtion process, differentil phses etween two neighoring PS cndidtes re used s oservtions After unwrpping these rcs in time, sptil testing nd unwrpping lgorithm is pplied to otin estimtes with respect to single reference Additionl prmeters cn esily e dded to the functionl model, eg su-pixel position in zimuth direction to ccount for Doppler vritions in the cquisitions (Kmpes, 2005) The second prt of the mthemticl model is the stochstic model, represented y the covrince mtrix [ ] [ ] ψ Qψ 0 D{ y } =, (3) 0 Q y where y represents the vector of pseudo-oservtions The covrince mtrix of the phse oservtions Q ψ is otined y vrince component estimtion (VCE) (Teunissen nd Amiri-Simkooei, 2006; Kmpes, 2005) The VCE technique estimtes the covrince mtrix directly from the dt Hence, the covrince mtrix used in the estimtion process is not dependent on -priori ssumptions on the qulity of the dt After estimtion nd sutrction of certin signls, eg the tmospheric dely, the VCE lgorithm is pplied gin to updte the Any imperfection in the functionl model (eg, imperfection due to non-liner deformtion, su-pixel position of the sctterer) results in lrger devitions etween oservtions nd model As consequence, these lrge residues will result in lrger ˆσ 2 nd type-i errors, so the sctterer will e discrded for further nlysis In order to optimize the mthemticl model to hndle these kinds of deficiencies, n extended model with dditionl prmeters should e used Using extended functionl models, the numer of detected PS cn e enlrged, leit t the expense of decresed rnk of the estimtion prolem This decresed rnk increses the chnce on undetected unwrpping errors, denoted s type-ii errors Therefore, extended deformtion models should only e pplied when necessry On the other hnd, imperfections in the stochstic model (Q ψ ) cn lso cuse type I errors Using too optimistic stochstic model results in lrger ˆσ 2, leding to the flse rejection of PS For exmple, imperfections in the stochstic model cn e due to tmospheric errors, orit errors, geometricl decorreltion or su-pixel position of the sctterer In generl, there re two pproches to cope with these kinds of imperfections: ) dpt the covrince mtrix (dding dditionl vlues in entries of Q ψ ), or 2) remove the corresponding errors from the oservtions (filtering) In this study we will investigte three sources of type-i errors: ) APS nd orit errors 2) Non-liner deformtion model nd 3) Azimuthl su-pixel position of the sctterer We optimize the functionl nd the stochstic models in order to cope with these three sources of flse rejections 4 APS INTERPOLATION AND ORBIT ERRORS In the stndrd PS-InSAR methodology, the residul signl of ll differentil rcs in the initil network is filtered

3 Figure ) PSI results from stndrd PS processing using only kriging interpoltion for the mining re in Grdnne, Frnce (red dshed rectngle) ) PSI result otined y pplying dpted APS estimtion with trend nd strtifiction Liner deformtion rtes estimted from the unwrpped time series re shown to extrct the tmospheric signl per cquisition, see eg Ferretti et l (200) Bsed on the correltion of the tmosphere in spce nd its decorreltion in time, comined smoothing nd interpoltion opertion using kriging is used to derive the APS (ie, the tmosphere signl for the whole scene) After sutrction of the APS from the originl differentil phse, the estimtion procedure cn e repeted for ll pixels This pproch is optiml for interpoltion of the turulence signl of the tmosphere However filtered residuls not only contin the turulence signl ut lso orit errors nd verticl strtifiction signl of the tmosphere, see Hnssen (200) Although differentil phses etween two neighoring PS cndidtes re used s oservtions in the mthemticl model to reduce orit error nd strtifiction, these effects cn e source of error in the finl estimtion nd cuse PS to e flsely rejected especilly in res with low signl to noise rtio (eg non-urn res with high non-liner deformtion mechnism) Bsed on this hypothesis we optimized our APS interpoltion pproch Insted of only using kriging interpoltion on filtered residuls, we used three steps For ech cquisition, detrend the dt y fitting first order plne to the unwrpped phse nd sutrct the estimted trend from the originl phse 2 Estimte verticl tmospheric strtifiction sed on the liner correltion etween topogrphy (DEM) nd strtifiction signl nd sutrct it from the detrended phse 3 Interpolte turulence using kriging on residuls (s in stndrd pproch) Consequently, the finl estimted APS is summtion of trend signl, strtifiction, nd turulence Fig shows the detected PS nd their displcement rtes otined from stndrd processing using only kriging interpoltion Fig visulizes the results fter pplying detrending nd estimtion of strtifiction The numer of detected PS in deforming re (red dsh rectngle) incresed in this cse from 749 pplying the stndrd pproch to 889 (8% improvement) using detrending nd to 9 (9% improvement) using detrending nd strtifiction estimtion Also some PS re detected close to the center of susidence region (white circle in Fig ) 5 NON-LINEAR DEFORMATION MODEL Becuse the -posteriori vrince fctor ˆσ 2 is dependent on the devition etween the oservtions nd the ssumed deformtion model (usully liner model), lrge residues due to higher order deformtion mechnism cn result in type I errors In other words, persistent sctterers with more complex displcement histories will not e detected vn Leijen nd Hnssen (2007,) presented two strtegies to increse the numer of detected persistent sctterers using dptive deformtion models The first strtegy is sed on lterntive hypothesis testing during the PSI processing A sequentil scheme is used to pply nd test extended deformtion models per phse doule difference, intending to find model tht sufficiently fits to the dt to void type-i errors The dption of the deformtion model is sed on hypothesis testing The lgorithm is initilized with the selection of set of these models Then, ech phse doule difference etween two PS cndidtes is unwrpped in time pplying the sequentil scheme of lterntive hypothesis testing until deformtion model fits to the dt well enough A liner model is good null hypothesis ecuse of the mximum redundncy in the estimtion process Apply-

4 c d Figure 2 ) PSI result using liner deformtion model for the mining re in Grdnne, Frnce (red dsh rectngle) ) Results otined y pplying the sequentil hypothesis testing scheme using liner nd rekpoint model The rekpoint ws set -priori t 9 My 995 c) Result otined y pplying the sequentil hypothesis testing scheme using liner nd qudrtic model d) Result otined using integrtion of the sequentil hypothesis testing scheme nd itertive deformtion modeling using kriging Liner deformtion rtes estimted from the unwrpped time series re shown Figure 3 ) PSI result from stndrd PS processing using dpted functionl model with zimuthl su-pixel position for mining re in Grdnne, Frnce (red dsh rectngle) ) PSI result otined y pplying dopted stochstic model for zimuthl su-pixel position Liner deformtion rtes estimted from the unwrpped time series re shown

5 [] [%] All(%48) Higher order Deformtion(%25) Azimuthl Supixel Position(%2) Adopted APS (%7) Figure 4 ) PSI result from dpted mthemticl model to optimized APS interpoltion, non-liner deformtion, nd zimuthl su-pixel position for mining re in Grdnne, Frnce (red dsh rectngle) ) Contriution of different dpttions in the PS processing Note tht the sum of the three contriution (44%) is not equl to the totl improvement (48%) due to the synergy effect ing the sequentil scheme of hypothesis testing, certin deformtion model is ccepted when ˆσ 2 is smller thn 0 Otherwise, the next model is tested until the complete set of models is evluted The second method is sed on n itertive scheme of deformtion modeling After stndrd PSI processing under the null hypothesis, tht is, pplying liner model, deformtion model is estimted sed on interpoltion (eg, kriging) from the PS results The modeled deformtion is then sutrcted from the originl interferometric phse nd the PSI processing is repeted (gin using liner model) Becuse the deformtion models re estimted per epoch using the displcement time series, possile non-liner deformtion is modeled s well As result, points which were previously rejected s PS due to too lrge devitions from the model my now e ccepted Herey the density of PS improves Oviously, this procedure cn e repeted itertively Note tht similr procedure is often followed in stndrd PSI processing to remove tmospheric delys nd, sed on uxiliry dt, heights The results of stndrd processing using liner deformtion model re shown in Fig 2 Fig 2 shows the result fter pplying the sequentil testing scheme using liner nd rekpoint model The rekpoint model is chrcterized y two susequent liner models seprted y n event or rekpoint In this study, the rekpoint is defined -priori on 9 My 995, sed on the strt of the mining ctivities With this model PS re detected in the center of the susidence region To enle visuliztion, the figure shows liner deformtion rtes estimted through the unwrpped time series, even when the rekpoint model ws used for the unwrpping The numer of detected PS in the deforming re (red dshed rectngle) incresed in this cse from 749 using the liner model to 2069 (8% improvement) Fig 2c shows the result of the sequentil testing scheme using liner nd qudrtic deformtion model In this cse, the numer of detected PS in the re of interest incresed 749 to 26 (20% improvement) Applying itertive deformtion modeling using kriging interpoltion in comintion with sequentil hypothesis testing (with liner, rekpoint, nd qudrtic deformtion model) gve the results which is presented in Fig 2d The numer of detected PS incresed from 749 to 255 (23% improvement), confirming the expected increse in PS density Importntly, this dptive pproch enled the detection of PS in the center of susidence region 6 AZIMUTHAL SUB-PIXEL POSITION The su-pixel position of PS point in zimuth direction induces n dditionl phse component in the PSI oservtion, especilly when there is lrge difference etween the Doppler centroid frequency of the mster nd slve imge This term is only importnt for point sctterers, since for distriuted sctterers the effective phse center is pproximtely t center for ll pixels The zimuthl su-pixel position cn e estimted s n dditionl prmeter in the mthemticl model sed on the liner reltionship with the Doppler difference etween the mster nd slve imge (Kmpes, 2005; Mrinkovic et l, 2008) ψ 0n = 4π 0n fdc ξ x, (5) v where v is the stellite velocity, fdc 0n is the Doppler centeroid difference etween mster nd nth cquisition, nd ξ x is the su-pixel position of the PS in zimuth detection However, dding this dditionl prmeter to the functionl model leds to decresed rnk of the estimtion

6 prolem Moreover, the zimuth su-pixel position cnnot e estimted with high precision in the cse of smll vrition of the Doppler frequencies This suggests treting this prmeter stochsticlly rther thn functionlly Tht is, insted of estimting this prmeter s new unknown, introduce it in the stochstic model Tht is, dd extr vlues to the digonl elements of the Q ψ This extr vlue is scled reltive to the Doppler difference of ech interferogrm So oservtions with higher Doppler difference hve higher vrince nd so lower weight in the estimtion, leding to smller ˆσ 2 nd so cceptnce of the PS However, oth of these dptions (ie dopt functionl model or stochstic model) should e pplied only when it is necessry Estimtion of the zimuthl su-pixel position s n extr prmeter for ll pixels cuses tht pixels with smll zimuthl su-pixel position re unwrpped with n unnecessry complex model, incresing the chnce of unwrpping errors (type-ii errors) On the other hnd, dding this term to the stochstic model for ll pixels results in underestimtion of ˆσ 2, leding to the flse detection of PS (gin type-ii errors) So oth dptions should only e used for pixels with lrge zimuthl su-pixel position In order to detect these pixels, we nlyzed the residuls (devition etween the oservtions nd the model) fter temporl unwrpping Looking t the correltion etween residuls nd Doppler differences, we cn detect the pixels which show high correltion with Doppler differences Fig 5 shows the histogrm of this correltion in smll re in the Grdnne re It is cler tht these pixels cn e clssified in two groups: ) norml distriution prt which contins pixels with smll zimuthl su-pixel position nd lso distriuted sctterers with zero men correltion with Doppler differences (red norml ell shpe), nd 2) pixels outside the norml ell shpe which show correltion with Doppler differences (red circle) The second group contins pixels which we detected for dption of the mthemticl model for zimuthl su-pixel position 83% of these detected points re rejected in the stndrd PS pproch without tking the zimuthl su-pixel position into ccount For these rejected PS, we dpt the mthemticl model (oth functionl nd stochstic prt) nd iterted the PS estimtion Fig 3 shows the result fter itertion of the PS processing using the dopted functionl model with zimuthl su-pixel position The density of PS did in this cse not improve significntly (numer of PS incresed from 749 to 785 (2% improvement)) However, dding the su-pixel position term in the stochstic model results in incresed numer of PS from 749 to 972 in deforming res (Fig 3), tht is 2% improvement in density of PS in the re of interest These results show tht it is etter to del with zimuthl supixel position stochsticlly rther thn functionlly in this dtset Figure 5 Histogrm of correltion etween residuls nd Doppler differences 7 FINAL RESULTS After evluting the three mentioned sources of type-i errors in the Grdnne re, we comined ll proposed pproches together Tht is, we pplied the following dption Adpted APS interpoltion with trend nd strtifiction effect 2 Sequentil hypothesis testing scheme using liner, rekpoint, nd qudertic models 3 Itertive deformtion modeling using kriging 4 Adpted stochstic model for pixels with zimuthl su-pixel position Fig 4 shows the results The density of PS in the deforming re incresed significntly from 749 to 258, tht is 48% improvement in PS detection cpility Fig 4 presents the contriution of the different dptions in PS density in the re of interest Note tht the sum of the three contriution (44%) is not equl to the totl improvement (48%) due to the synergy effect mong these optimiztions Tht is, integrtion of ll these dptions cting together improves the results more thn pplying the indivisul dptions Improving the PS density in the deforming re results in etter estimtion of the finl velocity mp of the re Figs 6 nd show interpolted velocity mps using kriging interpoltion for the stndrd PS pproch nd the dopted pproch respectively These results show tht the dpted lgorithm cn etter ctch the deformtion signl in this mining re

7 Figure 6 ) nd ) Interpolted velocity mps using stndrd PS pproch nd dopted pproch respectively 8 CONCLUSIONS The results of the PSIC4 study hve een used to evlute lgorithm performnce nd ssess which pproches re most importnt to retrieve relile deformtion prmeters t high sptil density This includes n nlysis of type-i errors (flsely rejected PS) due to imperfections in the functionl model (eg, imperfection due to non-liner deformtion, su-pixel position of the sctterer), or in the stochstic model (eg imperfection due to tmospheric errors, orit errors, geometricl decorreltion) We investigte the contriution of three different sources of type I errors: tmosphere phse screen (APS) nd oritl error, non-liner deformtion mechnism, nd zimuthl su-pixel position of the sctterers nd optimized the mthemticl model to del with these errors The results show significnt improvements in the identifiction of these type I errors, leding to improved PS density in the deforming re Appliction of the proposed optimiztions shows 48% increse in the numer of detected PS in the deforming re This improvement cn significntly improve the finl velocity mp which is one of the min products of the PSI technique from n ppliction point of view REFERENCES Ferretti, A, C Prti, nd F Rocc (200, Jnury) Permnent sctterers in SAR interferometry IEEE Trnsctions on Geoscience nd Remote Sensing 39(), 8 20 Hnssen, R F (200) Rdr Interferometry: Dt Interprettion nd Error Anlysis Dordrecht: Kluwer Acdemic Pulishers Kmpes, B M (2005, Septemer) Displcement Prmeter Estimtion using Permnent Sctterer Interferometry Ph D thesis, Delft University of Technology, Delft, the Netherlnds Kmpes, B M nd R F Hnssen (2004, Novemer) Amiguity resolution for permnent sctterer interferometry IEEE Trnsctions on Geoscience nd Remote Sensing 42(), Mrinkovic, P, G Ketelr, F vn Leijen, nd R Hnssen (2008) InSAR qulity control: Anlysis of five yers of corner reflector time series In Fifth Interntionl Workshop on ERS/Envist SAR Interferometry, FRINGE07, Frscti, Itly, 26 Nov-30 Nov 2007, pp 8 pp Rcoules, D, B Bourgine, M de Michele, G L Coznnet, C Luc, C Bremmer, H Veldkmp, D Trgheim, L Bteson, M Crosetto, M Agudo, nd M Engdhl (2006, June) Psic4: Persistent sctterer interferometry independent vlidtion nd intercomprison of results Technicl report, BRGM BRGM/RP FR Teunissen, P J G nd A R Amiri-Simkooei (2006) Lest-squres vrince component estimtion Journl of Geodesy xx, sumitted vn Leijen, F J nd R F Hnssen (2007) Persistent sctterer density improvement using dptive deformtion models In Interntionl Geoscience nd Remote Sensing Symposium, Brcelon, Spin, July 2007, pp 4 pp vn Leijen, F J nd R F Hnssen (2007) Persistent sctterer interferometry using dptive deformtion models In ESA ENVISAT Symposium, Montreux, Switzerlnd, April 2007, pp pp

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS LETKF compred to 4DVAR for ssimiltion of surfce pressure oservtions in IFS Pu Escrià, Mssimo Bonvit, Mts Hmrud, Lrs Isksen nd Pul Poli Interntionl Conference on Ensemle Methods in Geophysicl Sciences Toulouse,

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

Lily Yen and Mogens Hansen

Lily Yen and Mogens Hansen SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

A dual of the rectangle-segmentation problem for binary matrices

A dual of the rectangle-segmentation problem for binary matrices A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht

More information

Video-rate Image Segmentation by means of Region Splitting and Merging

Video-rate Image Segmentation by means of Region Splitting and Merging Video-rte Imge Segmenttion y mens of Region Splitting nd Merging Knur Anej, Florence Lguzet, Lionel Lcssgne, Alin Merigot Institute for Fundmentl Electronics, University of Pris South Orsy, Frnce knur.nej@gmil.com,

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Subband coding of image sequences using multiple vector quantizers. Emanuel Martins, Vitor Silva and Luís de Sá

Subband coding of image sequences using multiple vector quantizers. Emanuel Martins, Vitor Silva and Luís de Sá Sund coding of imge sequences using multiple vector quntizers Emnuel Mrtins, Vitor Silv nd Luís de Sá Instituto de Telecomunicções, Deprtmento de Engenhri Electrotécnic Pólo II d Universidde de Coimr,

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Image Segmentation Using Wavelet and watershed transform

Image Segmentation Using Wavelet and watershed transform Imge Segmenttion Using Wvelet nd wtershed trnsform Atollh Hdddi, Mhmod R. Shei, Mohmmd J. Vldn Zoej, Ali mohmmdzdeh Fculty of Geodesy nd Geomtics Engineering, K. N. Toosi University of Technology, Vli_Asr

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

Efficient Rerouting Algorithms for Congestion Mitigation

Efficient Rerouting Algorithms for Congestion Mitigation 2009 IEEE Computer Society Annul Symposium on VLSI Efficient Rerouting Algorithms for Congestion Mitigtion M. A. R. Chudhry*, Z. Asd, A. Sprintson, nd J. Hu Deprtment of Electricl nd Computer Engineering

More information

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more

More information

Spectral Analysis of MCDF Operations in Image Processing

Spectral Analysis of MCDF Operations in Image Processing Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

Approximation by NURBS with free knots

Approximation by NURBS with free knots pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde

More information

9.1 apply the distance and midpoint formulas

9.1 apply the distance and midpoint formulas 9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

Mobile IP route optimization method for a carrier-scale IP network

Mobile IP route optimization method for a carrier-scale IP network Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories 3-9-11 Midori-cho, Musshino-shi, Tokyo 180-8585, Jpn Phone:

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl

More information

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

A Fast Imaging Algorithm for Near Field SAR

A Fast Imaging Algorithm for Near Field SAR Journl of Computing nd Electronic Informtion Mngement ISSN: 2413-1660 A Fst Imging Algorithm for Ner Field SAR Guoping Chen, Lin Zhng, * College of Optoelectronic Engineering, Chongqing University of Posts

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

PARALLEL AND DISTRIBUTED COMPUTING

PARALLEL AND DISTRIBUTED COMPUTING PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce

More information

Statistical classification of spatial relationships among mathematical symbols

Statistical classification of spatial relationships among mathematical symbols 2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

A Transportation Problem Analysed by a New Ranking Method

A Transportation Problem Analysed by a New Ranking Method (IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr

More information

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro

More information

Efficient K-NN Search in Polyphonic Music Databases Using a Lower Bounding Mechanism

Efficient K-NN Search in Polyphonic Music Databases Using a Lower Bounding Mechanism Efficient K-NN Serch in Polyphonic Music Dtses Using Lower Bounding Mechnism Ning-Hn Liu Deprtment of Computer Science Ntionl Tsing Hu University Hsinchu,Tiwn 300, R.O.C 886-3-575679 nhliou@yhoo.com.tw

More information

Machine vision system for surface inspection on brushed industrial parts.

Machine vision system for surface inspection on brushed industrial parts. Mchine vision system for surfce inspection on rushed industril prts. Nicols Bonnot, Rlph Seulin, Frederic Merienne Lortoire Le2i, CNRS UMR 5158, University of Burgundy, Le Creusot, Frnce. ABSTRACT This

More information

INVESTIGATION OF RESAMPLING EFFECTS ON IRS-1D PAN DATA

INVESTIGATION OF RESAMPLING EFFECTS ON IRS-1D PAN DATA INVESTIGATION OF RESAMPLING EFFECTS ON IRS-D PAN DATA Smpth Kumr P.,*, Onkr Dikshit nd YVS Murthy Geo-Informtics Division, Ntionl Remote Sensing Agency, Hyderd, Indi.-(smpth_k, murthy_yvs)@nrs.gov.in Deprtment

More information

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007 CS 88: Artificil Intelligence Fll 2007 Lecture : A* Serch 9/4/2007 Dn Klein UC Berkeley Mny slides over the course dpted from either Sturt Russell or Andrew Moore Announcements Sections: New section 06:

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016 Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

Position Heaps: A Simple and Dynamic Text Indexing Data Structure

Position Heaps: A Simple and Dynamic Text Indexing Data Structure Position Heps: A Simple nd Dynmic Text Indexing Dt Structure Andrzej Ehrenfeucht, Ross M. McConnell, Niss Osheim, Sung-Whn Woo Dept. of Computer Science, 40 UCB, University of Colordo t Boulder, Boulder,

More information

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr

More information

Outline. Two combinatorial optimization problems in machine learning. Talk objectives. Grammar induction. DFA induction.

Outline. Two combinatorial optimization problems in machine learning. Talk objectives. Grammar induction. DFA induction. Outline Two comintoril optimiztion prolems in mchine lerning Pierre.Dupont@uclouvin.e 1 Feture selection ICTEAM Institute Université ctholique de Louvin Belgium My 1, 011 P. Dupont (UCL Mchine Lerning

More information

Analysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle

Analysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle Textiles nd Light ndustril Science nd Technology (TLST) Volume 3, 2014 DO: 10.14355/tlist.2014.0301.01 http://www.tlist-journl.org Anlysis of Computed Diffrction Pttern Digrm for Mesuring Yrn Twist Angle

More information

International Journal of Mechanical Engineering and Applications

International Journal of Mechanical Engineering and Applications Interntionl Journl of Mechnicl Engineering nd Applictions 203; (2) : 28-33 Published online My 30, 203 (http://www.sciencepublishinggroup.com/j/ijme) doi: 0.648/j.ijme.203002. Evlution of intensity of

More information

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2 A TRIANGLAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Atti Mous nd Eng. Slh M. Teh ABSTRACT In the present pper the strin-bsed pproch is pplied to develop new tringulr finite element

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

Lecture 7: Integration Techniques

Lecture 7: Integration Techniques Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012 Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Performance enhancement of IEEE DCF using novel backoff algorithm

Performance enhancement of IEEE DCF using novel backoff algorithm Kuo et l. EURASIP Journl on Wireless Communictions nd Networking 212, 212:274 http://jis.eursipjournls.com/content/212/1/274 RESEARCH Open Access Performnce enhncement of IEEE 82.11 using novel ckoff lgorithm

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

Simrad ES80. Software Release Note Introduction

Simrad ES80. Software Release Note Introduction Simrd ES80 Softwre Relese 1.3.0 Introduction This document descries the chnges introduced with the new softwre version. Product: ES80 Softwre version: 1.3.0 This softwre controls ll functionlity in the

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information

Text mining: bag of words representation and beyond it

Text mining: bag of words representation and beyond it Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion

More information

Algorithm Design (5) Text Search

Algorithm Design (5) Text Search Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997. Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,

More information

Area & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area:

Area & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area: Bck to Are: Are & Volume Chpter 6. & 6. Septemer 5, 6 We cn clculte the re etween the x-xis nd continuous function f on the intervl [,] using the definite integrl:! f x = lim$ f x * i )%x n i= Where fx

More information

Fault injection attacks on cryptographic devices and countermeasures Part 2

Fault injection attacks on cryptographic devices and countermeasures Part 2 Fult injection ttcks on cryptogrphic devices nd countermesures Prt Isrel Koren Deprtment of Electricl nd Computer Engineering University of Msschusetts Amherst, MA Countermesures - Exmples Must first detect

More information

Hyperbolas. Definition of Hyperbola

Hyperbolas. Definition of Hyperbola CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces

More information

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING A COLOR CORRECTO REROCESSG METHOD FOR MLTEW DEO CODG Colin Doutre nd nos siopoulos Deprtment of Electricl nd Computer Engineering, niversity of British Columbi 66 Min Mll, 6T Z4, ncouver, BC, Cnd emil:

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Spectral Super-Resolution of Hyperspectral Imagery Using Reweighted l 1 Spatial Filtering

Spectral Super-Resolution of Hyperspectral Imagery Using Reweighted l 1 Spatial Filtering 1 Spectrl Super-Resolution of Hyperspectrl Imgery Using Reweighted l 1 Sptil Filtering Adm S. Chrles, Student Member, IEEE, nd Christopher J. Rozell, Senior Member, IEEE Abstrct Sprsity-bsed models hve

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

ASTs, Regex, Parsing, and Pretty Printing

ASTs, Regex, Parsing, and Pretty Printing ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,

More information

A Sparse Grid Representation for Dynamic Three-Dimensional Worlds

A Sparse Grid Representation for Dynamic Three-Dimensional Worlds A Sprse Grid Representtion for Dynmic Three-Dimensionl Worlds Nthn R. Sturtevnt Deprtment of Computer Science University of Denver Denver, CO, 80208 sturtevnt@cs.du.edu Astrct Grid representtions offer

More information

Step-Voltage Regulator Model Test System

Step-Voltage Regulator Model Test System IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node

More information

From Dependencies to Evaluation Strategies

From Dependencies to Evaluation Strategies From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute

More information

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing

More information

Food Quality and Preference

Food Quality and Preference Food Qulity nd Preference () Contents lists ville t ScienceDirect Food Qulity nd Preference journl homepge: www.elsevier.com/locte/foodqul Interpreting sensory dt y comining principl component nlysis nd

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Approximation of Two-Dimensional Rectangle Packing

Approximation of Two-Dimensional Rectangle Packing pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete

More information

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering

More information

8.2 Areas in the Plane

8.2 Areas in the Plane 39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Principles nd Prdigms Chpter 11 (version April 7, 2008) Mrten vn Steen Vrije Universiteit Amsterdm, Fculty of Science Dept. Mthemtics nd Computer Science Room R4.20. Tel: (020) 598 7784

More information

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,

More information

Evolutionary Approaches To Minimizing Network Coding Resources

Evolutionary Approaches To Minimizing Network Coding Resources This full text pper ws peer reviewed t the direction of IEEE Communictions Society suject mtter experts for puliction in the IEEE INFOCOM 2007 proceedings. Evolutionry Approches To Minimizing Network Coding

More information

ON THE DEHN COMPLEX OF VIRTUAL LINKS

ON THE DEHN COMPLEX OF VIRTUAL LINKS ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd

More information

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016) \ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,

More information

SPLIT PLOT AND STRIP PLOT DESIGNS

SPLIT PLOT AND STRIP PLOT DESIGNS 1. Split Plot Design SPLIT PLOT AND STRIP PLOT DESIGNS D.K. SEHGAL Indin Agriculturl Sttistics Reserch Institute Lirry Avenue, New Delhi-110 01 dksehgl@isri.res.in 1.1 Introduction In conducting experiments,

More information

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information