Using Red-Eye to improve face detection in low quality video images

Size: px
Start display at page:

Download "Using Red-Eye to improve face detection in low quality video images"

Transcription

1 Using Re-Eye to improve fe etetion in low qulity vieo imges Rihr Youmrn Shool of Informtion Tehnology University of Ottw, Cn Any Aler Shool of Informtion Tehnology University of Ottw, Cn Astrt This pper presents metho to improve fe etetion y loting eyes in n imge using infrre (IR) light. IR light proues Re-Eye effet mking the pupil to shine more thn in norml lighting onitions. The lotion of the eyes n the fe ontour re ompute from the IR imges using olletion of imge proessing tehniques. The lgorithm opertes on gry imges uner vriety of skin tones, eye olors, ngles, n illumintions. The evelope metho nlyzes two onseutive frmes where the first one is tken uner regulr illumintion with no IR n the seon one using IR in orer to filitte eye etetion for sujets wering glsses. Keywors Re Eye effet, fe etetion, infrre lighting. 1 Introution Reently, iometris hs een mjor fiel of reserh tht is inispensle for uthentition n ientifition of suspets n for inresing seurity. Biometris is mesurement of uniqueness of humn eing suh s voie, hnprint or fil hrteristis. The use of iometris s wy to uthentite users ientities hs een topi of isussion for yers. Fe etetion n reognition is one importnt rnh of iometris tht is employe in mny res suh s irport seurity n orer mngement. The nee of fully utomte systems tht nlyze the informtion ontine in fe imges is neessry n for this reson, roust n effiient fe etetion lgorithms re require [5]. Given single imge or sequene of imges, the gol of fe etetion is to ientify ll imge regions, whih ontin fe regrless of its three-imensionl position, orienttion n lighting onitions. Suh prolem is hllenging euse fes re non-rigi n hve high egree of vriility in size, shpe, olor, n texture. The ility to etet fes in sene is ritil to moern surveillne pplitions. While mny imge proessing lgorithms exist to etet fes in imges [5], their performne is not ompletely relile, espeilly in situtions with vrile lighting, n when eling with low resolution imges. In this pper, we explore new tehnology tht improves fe etetion using the Re-Eye effet sine we know tht humn eyes will shine with o-xil infrre illumintion ([7], [?]). By using IR illumintion, it is possile to get informtion from whih the eye positions in the imge n e lulte. The evelope lgorithm will nlyze two onseutive frmes where the first one hs no IR n the other is shine with IR illumintion in orer to inrese the eye region vliity t erly stges. The propose pproh will etet n ignore refletions use y glsses. A similr work ws omplete in [1] where ontrst n ege enhnement tehnique were use for eye etetion without using frme ifferentil tehnique. 2 Experimentl setup The imges were tken using single lk n white mer, sensitive to infrre light, with zoom lens of mm n NTSC out to the frme grer. In orer to just the overll illumintion of the re where imges re tken, stnr 60W ul with vrile illumintions is instlle. A frequeny genertor is use to use the ioes to stroe llowing the quisition of experimentl t with ON n OFF IR. The omplete setup n e foun in [1]. The t is pture for ifferent users uner vrious experimentl vriles tht simulte rel life senrios. Eh volunteer is ple 1.5 m wy from the mer. 24 test smples (5 seons eh) per volunteer re quire with omintion of ON n OFF IR. The experimentl vriles re the following: 1) pose t 0, 15, 30 n 45, 2) sujet with n without glsses, 3) sujets with ifferent skin tone level, 4) sujets with ifferent eye olor. 3 Algorithm esign This setion evelops n lgorithm to utomte the etetion of the eyes in imges tken uner low illumintion with ON n OFF IR. The propose lgorithm is ivie into two steps n esigne to etet refletions rising from glsses using ifferentil frme tehnique (onseutive IR/Non-IR frmes). The tehnique n lso e pplie on fes rotte from 0 to 45. The imges ontin only one iniviul n they re tken in poor lighting onitions. 3.1 Step 1 The gol of this setion is to extrt the fe ontour from the IR imge using the following sequene of opertions. The originl IR imges of sujet re shown in Fig. 1. The imges re tken with fe rotte t 15 n with n without glsses Non-liner ontrst streth n imge smoothing The originl imge is low pss filtere with 5x5 Gussin filter with N = 4 itertions, using the non-liner ege n ontrst enhnement lgorithm esrie in [4]. We onsier the imge gry level igitl representtion in the

2 Figure 1. Originl IR imges of sujet with glsses () n () without glsses. We n see refletions use y glsses (), whih n misle the lssifition prolem if it is etete s n eye region. The orresponing imge histogrms (, ) show tht most pixels hve low intensity vlues ue to poor illumintion. [0,M) rnge, where M =256 for n 8-it imge. In orer to voi loss of informtion, rithmeti opertions on imge pixel vlues re efine in logrithmil mppe spe where the forwr mpping funtion etween the imge pixel spe (F ) n the rel numer spe (Ψ) is: Ψ(F ) = log((m F ) /F ). In [4], Deng n Chill use the symols, n to represent ition, multiplition n sutrtion, respetively, in the log spe. Sine vetor ition, sutrtion n multiplition re oune opertions n well efine in the log spe, it is possile to erive non-liner equtions tht overome the loss of informtion prolem use y liner methos [2]. The itertive tehnique shown in Fig. 2 overomes the limittions of liner methos y performing non-liner weighting opertion on the input pixels of the imge. This requires the seletion of prmeters s i to ontrol the mount of highfrequenies introue in the solution. If s i < 1, the solution will e smoothe otherwise, it mplifies eges. The output of this system results in n enhne imge with reue high-frequenies ontent n etter ontrst Histogrm streth The histogrm in Fig.3() is strethe in orer to fill the entire ville gry-sle rnge (Fig.3()). Threshol vlues t L1 n t H2 re lulte orresponing to 15% n 95% of the totl numer of pixels in the histogrm of Fig.3(). This results in more visully istintive imge with ro histogrm (Fig.3)(). Also, this opertion provies etter ege elinetion, whih filittes the extrtion of the fe ontour from the kgroun. Figure 3. () Noise reution n ontrst enhnement using the log-rtio pproh. The imge is righter sine the histogrm of the imge () is shifte towrs higher intensity vlues. The histogrm streth opertion(, ) presents etter ege elinetion roun the fe region ompre to (). The upper n lower threshols re hosen s 15% n 95% of ll pixels in the histogrm shown in () Non-liner orse ege enhnement The imge otine in setion is low pss filtere with 9x9 Gussin filter with N = 8 itertions, using the non-liner ege n ontrst enhnement lgorithm esrie in The output of this system results in orsely enhne imge with well-efine fe ounry (Fig. 4). Figure 4. : () Corsely enhne imge using nonliner orse enhnement lgorithm, () inrize imge using t H1 s threshol. Figure 2. Multisle lgorithm lok igrm showing three stges. At eh stge, the input imge (F or A) is filtere using Gussin [5x5] low-pss filter. An imge ontining only high-frequenies H(x, y) is otine y sutrting the smoothe output from the input. The ege mplifition prmeter s i is selete t eh stge, i, se on the level of high frequeny noise in H i (x,y). is slr ontrolling the ontrst level in the enhne imge Imge erosion n Ege etetion Erosion is pplie on the inry imge in Fig. 4 to reue region expnsion use y the lur effet from the non-liner ege enhnement opertion in setion A 3x3 isk-shpe struturing element is use for the erosion proess. Using the eroe inry imge, Soel opertor is onstrute to perform 2-D sptil grient mesurement on n imge n gives more emphsis to high-frequeny regions tht orrespon to eges. The Soel opertor onsists

3 of pir of 3x3 onvolution kernels, whih re esigne to fin horizontl n vertil eges in n imge Fe ontour extrtion The following re the neessry steps for fe ontour extrtion: (i) Compute ll points on the ontour in the imge of Fig. 5(), (ii) fin n ritrry point lote in the fe region y snning the imge row-wise n y tking the men of ll ompute ege points on the ontour, (iii) strting t the pproximte fe lotion foun in (ii), serh for ll points lote on the inner fe ounry (itertively), (iii) rete n intensity vetor y summing ll intensity vlues in Fig. 5 () olumn-wise. The intensity vlues orresponing to oth mxim on the grph in Fig. 5 () n tht re lote on the inner ontour re hosen s fe proximities (Fig. 5 ()). Figure 6. Ege mplifition n noise reution proess illustrting the output of the multisle lgorithm for N = 4 itertions. The first two imges were otine fter setting s i < 1 (high-frequenies ttenution) for the first two itertions while the lst two, orrespon to n ege mplifition proess where s i > 1. The histogrms of eh imge re lso shown to illustrte how the unerlying intensity vlues of eh imge hnge s numer of itertions inreses. reue the numer of possile eye nite regions in the finl imge n will spee up the proess. Figure 5. () Ege mp using the Soel opertor, () Inner ontour extrte y serhing for ll the first pixels on the inner ontour in ege mp, ()plot of pixel intensity summtion in the vertil iretion, () Peks orrespon fe sies lotion, 3.2 Step 2 The gol of this setion is to fin ll possile eye lotion nites in n IR imge using two onseutive frmes. First, the non-ir imge is use to etet n nel ll possile refletions use y glsses n then, use the IR imge to fin finl eye lotions Non-liner fine enhnement The IR n non-ir frmes re low pss filtere with 5x5 Gussin filter with N = 4 itertions, using the non-liner ege n ontrst enhnement lgorithm esrie in [4]. Reuing the numer of itertions results in signifint reution of lur in the imge. The output of this system results in two finely enhne imges. An exmple of the fine enhnement proess n e seen in Fig Imge inriztion After the enhnement proess, imges re inrize y seleting threshol t the til of the histogrm of the enhne imges (Fig. 6). Refletions re seen s white pixels in the inry imge(fig. 7). If the non-ir enhne imge ontins white pixels (i.e. refletions use y glsses or oily skin), oth imges otine in setion 3.2.1re summe together n resultnt regions with pixel intensity vlues greter thn one re set to zero (i.e. lk). This opertion removes refletions rising from glsses n reue the numer of white pixels in the imge. This will Figure 7. Finely enhne imges fter thresholing (() non-ir, () IR). Lote refletions from glsses (lk spot) re seen in () Imge lssifition Any region in Fig. 7(,) with re greter thn 50 pixels is neglete sine it nnot orrespon to eye refletions. Also, only regions lote within oth fe sies ompute in setion re onsiere sine we re uniquely looking for eyes Eye etetion Compute mtrix (Λ) of size ixj s ll possile istnes in the vertil iretion etween ll eye regions suh s Λ(i,j)= y i -y j if i j n 0 otherwise. Repet the proess y omputing mtrix (Θ) of Eulien istnes etween ll possile nite regions s (Θ(i, j)= (x i x j ) 2 + (y i y j ) 2 ) where x n y re the imge oorintes in the horizontl n vertil iretion, respetively. Serh through Λ n Θ for the two nite region tht hve the smllest istne (greter thn zero) in the vertil iretion n whih hve n Eulien istne eu lote within 25% n 75% of the fe with (0.25 sies < eu < 0.75 sies ). sies is ompute from setion Results The lgorithm ws pplie on imges of ifferent sujets with ifferent skin olor, fe orienttion, tilt n

4 with/without glsses. The s i prmeters were set to [0.1, 0.1, 1, 1] in setion 3.1.1, to [0.1, 0.1, 0.1, 0.1, 1, 5, 5, 5] in setion n to [0.1, 0.1, 10, 100] in setion As n e seen, the s i prmeters were set to vlues equl or less thn one in setion sine the sole purpose ws to reue noise n to slightly righten the imge y shifting the histogrm of the imge towrs higher pixel intensity vlues. On the other hn, fine ege enhnement ws rrie on in setion sine s i 1. Fig.( 8, 9) show eye loliztion results for sujet with n without glsses, respetively. Fig. 8(,,) represent urte eye etetion while Fig. 8(,e,f) show other possile solutions for sujet wering glsses. In the se where the sujet hs no glsses, 100% eye etetion rte ws hieve (Fig. 9). e f Figure 8. Eye positions (lk ots) extrte using the evelope lgorithm for sujet wering glsses with fe oriente t (, ) 15 (, e) 30 (, f) 45. In some ses, the lgorithm presents multiple solutions tht re onsiere s possile eyes lotion (, e, f). Figure 9. Eyes lote for sujet without glsses with fe oriente t () 15 () 30 () 45 5 Disussion This pper presente new lgorithm to extrt fe n eye positions from n IR imge ontining one iniviul n tken uner poor illumintion. Conseutive non-ir/ir frmes were use in orer to etet n remove ny refletions use y glsses, whih n misle the lgorithm in extrting the right informtion out eye lotion. If the sujet oes not wer ny glsses, the lgorithm will skip the ltter step in orer to reue omputtionl omplexity. In the se where mny refletions (white pixels) our, the lgorithm will fin ll possile eye lotions n presents ll possile solutions. In orer to reue the set of possile eye region nites, extrting the nose oorintes (i.e. enter)n mking use of fe symmetry will e neessry. This will improve the performne n ury of the evelope metho while eling with fes t ifferent orienttion. Currently, the lgorithm performs etter for fes oriente etween 0 n 30. The lgorithm performs poorly for fes oriente t n ngle igger thn 45 sine these imges ontin in generl only one eye n the lgorithm is esigne to etet oth of them. However, if we know the nose lotion n fe ontour, the lgorithm n proess this informtion n present unique solution set. Similr work ws presente in [1] where eyes lotion were extrte exept tht the propose metho i not el well with rotte fes n with sujets wering glsses. Also, the evelope lgorithm in [1] i not use fine enhnement to etet pupil ontour in imges with poor ontrst n illumintion. Furthermore, they i not mke use of the informtion tht n e otine using onseutive non-ir/ir frmes to preit refletions not ssoite with pupils or eye informtion. 6 Conlusion This pper proposes n lgorithm to utomtilly etet eye lotion in IR imges of one iniviul tken uner poor illumintion. The lgorithm etet fe region in the imge, extrt the fe ontour n provies set of ll possile eye lotions. In generl, the lgorithm preitions re goo for sujets with no glsses sine it presents unique set of solutions. However, it provies multiple solutions for sujets wering glsses sine mny refletions our in the imge. Fining nose lotion in the imge n using fe symmetry to extrt the optiml eye lotions n solve this prolem. The iffiulties enountere in proessing these imges re ssoite with the poor illumintion, poor ontrst n wek ege elinetion present in the non-ir/ir imges. For now, the lgorithm nnot el with fes oriente t n ngle igger thn 45. Referenes [1] Asfw, Y., Chen, B., Aler, A., Fe etetion using re-eye effet, Deprtment of Eletril engineering, University of Ottw, Cn, [2] Bovik, AL., Hnook of Imge n Vieo Proessing, Aemi Press Texs, 2000 [3] Deng, G., Chill, L.W., Multisle imge enhnement using the logrithmi imge proessing moel,eletronis Letters, 29: , [4] Deng, G., Chill, L.W., Imge Enhnement Using the Log-rtio Approh, Signls Systems n Computers, 1: , [5] Fromherz, T., Stuki, P., Bihsel, M., A Survey of Fe Reognition, MML Tehnil Report, No 97.01,Dept. of Computer Siene, University of Zurih, Zurih, [6] Hro, A.,Flikner, M., Irfn, E., Deteting n Trking Eyes By Using Their Physiologil Proper-

5 ties, Dynmis, n Apperne Computer Vision n Pttern Reognition Conferene, June 13-15, [7] Morimoto, C.H.,Koons, D.,Amir, A.,Flikner, M., Pupil Detetion n Trking Using Multiple Light Soures Tehnil Report RJ-10117, IBM Almen Reserh Center,, Sn Jose, C,

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

Adaptive Pixel Interpolation for Spatial Error Concealment

Adaptive Pixel Interpolation for Spatial Error Concealment J Sign Proess Syst (2010) 60:291 303 DOI 10.1007/s11265-009-0367-y Aptive Pixel Interpoltion for Sptil Error Conelment Li Song & Xin M Reeive: 9 Novemer 2008 / Revise: 23 Mrh 2009 /Aepte: 30 Mrh 2009 /Pulishe

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information

Compression of Concentric Mosaic Scenery with Alignment and 3D Wavelet Transform Lin Luo a, Yunnan Wu a, Jin Li b, Ya-Qin Zhang b,

Compression of Concentric Mosaic Scenery with Alignment and 3D Wavelet Transform Lin Luo a, Yunnan Wu a, Jin Li b, Ya-Qin Zhang b, Compression of Conentri Mosi Senery with Alignment n 3D Wvelet Trnsform Lin Luo, Yunnn Wu, Jin Li, Y-Qin Zhng, University of Siene & Tehnology of Chin Hefei, Anhui Provine, 230026, P.R.Chin Mirosoft Reserh

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

A new way to evaluate steel sheet surfaces

A new way to evaluate steel sheet surfaces A new wy to evlute steel sheet surfes L. Blunt X. ing W. Zeng T. Asim Centre for Preision Tehnologies (CPT) University of Huersfiel Queensgte Huersfiel UK HD1 3DH Tel.: + 44-1484-473634 E-mil: x.ing@hu..uk

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

[SYLWAN., 158(6)]. ISI

[SYLWAN., 158(6)]. ISI The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI

More information

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of

More information

Analysis of Fundus Fluorescein Angiogram Based on the Hessian Matrix of Directional Curvelet Sub bands and Distance Regularized Level Set Evolution

Analysis of Fundus Fluorescein Angiogram Based on the Hessian Matrix of Directional Curvelet Sub bands and Distance Regularized Level Set Evolution Originl Artile www.jmss.mui..ir Anlysis of Fundus Fluoresein Angiogrm Bsed on the Hessin Mtrix of Diretionl Curvelet Su nds nd Distne Regulrized Level Set Evolution Asieh Soltnipour 1, Seed Sdri 1,, Hossein

More information

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING

SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Chpter 17 SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Frnk Eihinger Institute for Progrm Strutures nd Dt Orgniztion (IPD) Universit-t Krlsruhe (TH), Germny eihinger@ipd.uk.de Klemens B-ohm Institute for

More information

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services Slle Sptio-temporl Continuous uery Proessing for Lotion-wre Servies iopeng iong Mohme F. Mokel Wli G. Aref Susnne E. Hmrush Sunil Prhkr Deprtment of Computer Sienes, Purue University, West Lfyette, IN

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems Amerin Journl of Intelligent Systems. 0; (): -5 DOI: 0. 593/j.jis.000.0 Cellulr-se Popultion to Enhne Geneti Algorithm for Assignment Prolems Hossein Rjlipour Cheshmehgz *, Hiollh Hron, Mohmm Rez Myoi

More information

Asurveyofpractical algorithms for suffix tree construction in external memory

Asurveyofpractical algorithms for suffix tree construction in external memory Asurveyofprtil lgorithms for suffix tree onstrution in externl memory M. Brsky,, U. Stege n A. Thomo University of Vitori, PO Box, STN CSC Vitori, BC, VW P, Cn SUMMAY The onstrution of suffix trees in

More information

Automatic Morphological Reconstruction of Neurons from Multiphoton and Confocal Microscopy Images Using 3D Tubular Models

Automatic Morphological Reconstruction of Neurons from Multiphoton and Confocal Microscopy Images Using 3D Tubular Models Neuroinform (2015) 13:297 320 DOI 10.1007/s12021-014-9253-2 ORIGINAL ARTICLE Automti Morphologil Reonstrution of Neurons from Multiphoton n Confol Mirosopy Imges Using 3D Tuulr Moels Alerto Sntmrí-Png

More information

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother

More information

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

More information

Calculus Differentiation

Calculus Differentiation //007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based Maps

On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based Maps CCCG 212, Chrlottetown, P.E.I., August 8 1, 212 On the Strengthening of Topologil Signls in Persistent Homology through Vetor Bunle Bse Mps Eri Hnson Frnis Mott Chris Peterson Lori Ziegelmeier 1 Astrt

More information

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,

More information

Geometrical reasoning 1

Geometrical reasoning 1 MODULE 5 Geometril resoning 1 OBJECTIVES This module is for study y n individul teher or group of tehers. It: looks t pprohes to developing pupils visulistion nd geometril resoning skills; onsiders progression

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1 Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl

More information

INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES

INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES In: Bretr F, Pierrot-Deseilligny M, Vosselmn G (Es) Lser snning 2009, IAPRS, Vol. XXXVIII, Prt 3/W8 Pris, Frne, Septemer 1-2, 2009 INVESTIGATIONS ON AMBIGUTY UNWRAPPING OF RANGE IMAGES B. Jutzi Institute

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES

A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES Philippe EVEN LORIA / IUT e St-Dié, 11, Rue e l Université, F-88100 Sint Dié es Vosges, Frne, Philippe.Even@lori.fr KEY WORDS: Three-imensionl,

More information

Kinetic Collision Detection: Algorithms and Experiments

Kinetic Collision Detection: Algorithms and Experiments Kineti Collision Detetion: Algorithms n Experiments Leonis J. Guis Feng Xie Li Zhng Computer Siene Deprtment, Stnfor University Astrt Effiient ollision etetion is importnt in mny rooti tsks, from high-level

More information

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

Comparison-based Choices

Comparison-based Choices Comprison-se Choies John Ugner Mngement Siene & Engineering Stnfor University Joint work with: Jon Kleinerg (Cornell) Senhil Mullinthn (Hrvr) EC 17 Boston June 28, 2017 Preiting isrete hoies Clssi prolem:

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

Computational geometry

Computational geometry Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

Minimal Memory Abstractions

Minimal Memory Abstractions Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

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

COSC 6374 Parallel Computation. Dense Matrix Operations

COSC 6374 Parallel Computation. Dense Matrix Operations COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.

More information

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow Shifting n Comption for the High-Level Synthesis of Designs with Complex Control low Sumit Gupt Nikil Dutt Rjesh Gupt Alexnru Niolu Center for Emee Computer Systems Shool of Informtion n Computer Siene

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

Comparison of Global Histogram Methods for 2D and 3D Entropy Based Image Segmentation

Comparison of Global Histogram Methods for 2D and 3D Entropy Based Image Segmentation 9th WSEAS Interntionl Conferene on EVOLUTIONARY COMPUTING (EC 8, Sofi, Bulgri, My 2-4, 28 Comrison of Glol Histogrm Methods for 2D nd 3D Entroy Bsed Imge Segmenttion GEORGI PETROV (, PANAYOT ILIEV (2,

More information

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms Using SIMD Registers n Instrutions to Enle Instrution-Level Prllelism in Sorting Algorithms Timothy Furtk furtk@s.ulert. José Nelson Amrl mrl@s.ulert. Roert Niewiomski niewio@s.ulert. Deprtment of Computing

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

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing

More information

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

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding Triple/Qudruple Ptterning Lyout Deomposition vi Novel Liner Progrmming nd Itertive Rounding Yio Lin, Xioqing Xu, Bei Yu, Ross Bldik nd Dvid Z. Pn ECE Dept., University of Texs t Austin, Austin, TX USA

More information

WORKSHOP 8A TENSION COUPON

WORKSHOP 8A TENSION COUPON WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

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

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

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

Profile Based Sub-Image Search in Image Databases

Profile Based Sub-Image Search in Image Databases Profile Bsed Su-Imge Serh in Imge Dtses Vishwkrm Singh 1, Amuj K. Singh 2 Deprtment of Computer Siene, University of Cliforni, Snt Brr, USA 1 vsingh@s.us.edu, 2 muj@s.us.edu Astrt Su-imge serh with high

More information

Proceedings 23rd Annual Conference IEEE/EMBS Oct.25-28, 2001, Istanbul, TURKEY

Proceedings 23rd Annual Conference IEEE/EMBS Oct.25-28, 2001, Istanbul, TURKEY Alignment of Serilly Aquire Slies using Glol Proeeings 23r Annul Conferene IEEE/EMBS Ot.25-28, 2001, Istnul, TURKEY Energy Funtion Stelios KRINIDIS, Christophoros NIKOU, Ionnis PITAS Deprtment of Informtis,

More information

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals Outline CS38 Introution to Algorithms Leture 2 April 3, 2014 grph trversls (BFS, DFS) onnetivity topologil sort strongly onnete omponents heps n hepsort greey lgorithms April 3, 2014 CS38 Leture 2 2 Grphs

More information

Lecture 11: Interactive Rendering Chapters 7 in Advanced GI

Lecture 11: Interactive Rendering Chapters 7 in Advanced GI Leture 11: Intertive endering Chpters 7 in Advned GI Questions? HW 1 Fll 2004 Kvit Bl Computer Siene Cornell University Intertive Softwre endering Intertive User-driven, not pre-sripted nimtion At lest

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

Colour-texture analysis of paintings using ICA filter banks

Colour-texture analysis of paintings using ICA filter banks Colour-texture nlysis of pintings using ICA filter nks Nnne vn Noord Nnne@tilurguniversity.edu Tilurg University, Wrndeln 2, 5037 AB Tilurg, The Netherlnds Eri Postm E.O.Postm@tilurguniversity.edu Tilurg

More information

Convex Hull Algorithms. Convex hull: basic facts

Convex Hull Algorithms. Convex hull: basic facts CG Leture D Conve Hull Algorithms Bsi fts Algorithms: Nïve, Gift wrpping, Grhm sn, Quik hull, Divide-nd-onquer Lower ound 3D Bsi fts Algorithms: Gift wrpping, Divide nd onquer, inrementl Conve hulls in

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information