Fast HighDimensional Filtering Using the Permutohedral Lattice


 Kellie McCormick
 1 years ago
 Views:
Transcription
1 EUROGRAPHICS x / NN an NN (Eitors) Volume (98), Number Fast HihDimensional Filterin Usin the Permutoheral Lattice Anrew Aams, Jonmin Baek, Myers Abraham Davis Stanfor University Abstract Many useful alorithms for rocessin imaes an eometry fall uner the eneral framework of hihimensional Gaussian filterin This family of alorithms inclues bilateral filterin an nonlocal means We roose a new way to erform such filters usin the ermutoheral lattice, which tessellates hihimensional sace with uniform simlices Our alorithm is the first imlementation of a hihimensional Gaussian filter that is both linear in inut size an olynomial in imensionality Furthermore it is arameterfree, aart from the filter size, an achieves a consistently hih accuracy relative to roun truth (> 45 B) We use this to emonstrate a number of interactiverate alications of filters in as hih as eiht imensions Cateories an Subject Descritors (accorin to ACM CCS): Enhancement Filterin I43 [Imae Processin an Comuter Vision]: Introuction Hihimensional Gaussian filterin (Equation ) is a owerful way to exress a smoothness rior on ata in an arbitrary Eucliean sace As such, it is an imortant comonent of many alorithms in imae rocessin an comuter vision Alorithms such as color or rayscale bilateral filterin [AW95] [SB97] [TM98], joint bilateral filterin [ED4] [PSA 4], joint bilateral usamlin [KCLU7], nonlocal means [BCM5], an satiotemoral bilateral filterin [BM5] can all be exresse as hihimensional Gaussian filters Recent work on acceleratin hihimensional Gaussian filters has focuse on exlicitly reresentin the hihimensional sace with oint samles, usin a reular ri of samles [PD9] or a clou of samles store in a ktree [AGDL9] When the sace is exlicitly reresente in this way, filterin is imlemente by resamlin the inut ata onto the hihimensional samles, erformin a hihimensional Gaussian blur on the samles, an then resamlin back into the inut sace (Fiure ) [AGDL9] terms these three staes slattin, blurrin, an slicin We roose acceleratin such filters by samlin the hihimensional sace at the vertices of the ermutoheral lattice (illustrate in Fiure ) The lattice is comose of ientical v i = n j=e i j v j Equation : Hihimensional Gaussian filterin associates an arbitrary osition i with each value v i to be filtere, an then mixes values with other values that have nearby ositions Usually the values are homoeneous ixel colors If the ositions are twoimensional ixel locations, then this exresses a Gaussian blur If the ositions are ixel locations combine with color, for a total of five imensions, this exresses a color bilateral filter If the osition vectors are erive from local neihborhoos aroun each ixel, then this exresses nonlocal means simlices (hihimensional tetrahera), an the enclosin simlex of any iven oint can be foun by a simle rounin alorithm Slattin an slicin can therefore be one by barycentric interolation, which is exonentially cheaer than the multilinear interolation of [PD9], an oes not suffer from the irreularity an arameterheavy nature of the ranomly bifurcatin ktree queries of [AGDL9] Similarly to the ri aroach, the blurrin stae can be one with a simle searable filter We escribe the lattice an its roerties in section 3 c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt Publishe by Blackwell Publishin, 96 Garsinton Roa, Oxfor OX4 DQ, UK an 35 Main Street, Malen, MA 48, USA
2 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice Inut Outut Slat Blur Slice Fiure : Hihimensional Gaussian filterin can be imlemente by first embein the inut values v at ositions in a hihimensional sace (slattin), then erformin a Gaussian blur in that sace (blurrin), then samlin the sace at the oriinal ositions (slicin) The iaram above illustrates a bilateral filter of a oneimensional sinal usin this framework Usin the ermutoheral lattice for hihimensional filterin of n values in imensions has a time comlexity of O( n) an a sace comlexity of O(n) This comares favorably to existin techniques, an in fact this metho roves to be faster than the state of the art for a wie rane of filter sizes an imensionalities (Fiure 7) We escribe its erformance an accuracy in section 4 The runtime is sufficiently low that we can emonstrate the first realtime color bilateral filter (a fiveimensional filter) The qualitative chane brouht about by this see increase is that we enable interactive use of this class of filter, escribe in section 5 Prior Work Hihimensional Gaussian filterin inclues, as secial cases, the bilateral filter, an the nonlocal means filter In turn, hihimensional Gaussian filterin is a tye of Gauss transform, in which a weihte sum of Gaussians, centere at oints i, is samle at some other locations q i For our case (Equation ), the weihts are always homoeneous vectors, usually storin color, an i tyically equals q i There are thus several cateories of relate work: Bilateral filters an attemts to accelerate them; nonlocal means an corresonin accelerations; an more eneral attemts to accelerate comutation of the fast Gauss transform We will iscuss each in turn The Bilateral Filter Bilateral filterin [AW95] [SB97] [TM98] averaes ixels with other ixels that are nearby in both osition an intensity It is a fiveimensional Gaussian filter (Eq ) in which v i = [r i, i,b i,] (the homoeneous color at ixel i), an i = [ σ xi s, yi σ s, σ ri c, i σ c, σ bi c ], where σ s is the satial stanar eviation of the filter an σ c is the colorsace stanar eviation Grayscale bilateral filterin can be exresse by relacin r i, i, an b i with just luminance, an is hence a threeimensional filter Some notable uses of the bilateral filter inclue tone main [DD], halofree sharenin, an hotorahic tone transfer [BPD6] Bilateral filters of imensionalities other than 3 an 5 also occur Weber et al [WMM 4] use a fourimensional bilateral filter with a temoral term for smoothin hoton ensity mas for renerin raytrace sequences Aams et al [AGDL9] similarly a a temoral term to a color bilateral filter to enoise vieo, which results in a 6D filter Joint Bilateral Filters By erivin i from one imae an v i from another, one can smooth an imae in a way that oes not cross the ees of another This technique was invente ineenently by Eisemann an Duran [ED4] an Petschni et al [PSA 4] an was use by each for combinin imaes taken with an without flash This iea was extene by Kof et al [KCLU7] to use as an usamlin technique By slattin at ositions etermine by the lowresolution inut, an then slicin usin a hihresolution reference imae, the low resolution ata can be interolate in a way that resects ees in the hihresolution reference Fast Bilateral Filters Given the wie ranin utility of the bilateral filter, consierable research has one into acceleratin it Duran an Dorsey [DD] iscretize in intensity, an comute a reular Gaussian blur at each intensity level usin an FFT, which can then be interolate between to rouce a rayscale bilateral filter This aroach evolve into the bilateral ri [PD6] of Paris an Duran, which was imlemente on a GPU for various interactive alications by Chen et al [CPD7] The bilateral ri iscretizes in sace an intensity, an introuce the slatblurslice ieline for hihimensional filterin (Fiure ) Paris an Duran also escribe a fiveimensional ri for color bilateral filterin [PD9] The work of Duran an Dorsey [DD] was ineenently extene by Porikli [Por8] who observe that the FFTs were unnecessary, an use faster interalimae base methos to blur each intensity level, thus roucin interal historams Yan et al [YTA9] imrove on this by not exlicitly reresentin the entire sace, but instea sweein a lane throuh the intensity levels, comutin the outut in intensity orer Their lowmemory, cachefrienly alorithm is the fastest known rayscale bilateral filter However, the laneswee aroach oes not eneralize well to hiher imensions NonLocal Means Bennett an McMillan [BM5], while enoisin vieo with a combination of bilateral filters, note that the ositions i coul be usefully aumente by incluin the color or intensity of nearby ixels as well This is equivalent to nonlocal c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
3 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice means of Buaes et al [BCM5] [BCM8], which is an otimal enoiser for aitive white noise y Fast NonLocal Means There are numerous methos for acceleratin nonlocal means that o not exlicitly reresent the hihimensional sace For examle, Mahmoui an Sairo [MS5] reclassify reions of the imae accorin to averae intensity an raient irection in orer to restrict the search, whereas Darbon et al [DCC 8] comute interal imaes of certain error terms, as o Wan et al [WGY 6] However, this family of methos is restricte to osition vectors comose of rectanular imae atches, an oes not eneralize to less structure enoisin tasks, such as the eometry enoisin [AGDL9] an the aforementione hoton ensity enoisin [WMM 4] z (,, ) (,,) (, , ) x > y > z x  z < 3 x Fast Gauss Transforms Aroaches for evaluatin Equation as a eneric Gauss transform have focuse on treebase reresentations of the hihimensional sace of osition vectors Aams et al use a ktree coule with ranomize queries, whereas Brox et al [BKC8] use a cluster tree Yan et al [YDGD3] escribe the imrove fast Gauss transform, which uses a cluster tree in which each leaf stores not only a value, but also some Taylor series exansion terms escribin how the value varies about that leaf It is extremely accurate, but not as fast as other methos 3 The Permutoheral Lattice We now escribe the lattice we will use to accelerate hihimensional Gaussian filters The imensional ermutoheral lattice is the rojection of the scale reular ri ( + )Z + alon the vector = [,,] onto the hyerlane H : x =, which is the subsace of R + in which coorinates sum to zero It is hence sanne by the rojection of the stanar basis for ( + )Z + onto H : B = Each of the ( + ) basis vectors (columns of B ) has coorinates that sum to zero, an that each coorinate of each basis vector has a consistent remainer moulo + Both of these roerties are reserve when takin inteer combinations, so oints in the lattice are those oints with inteer coorinates that sum to zero an have a consistent remainer moulo + We escribe a lattice oint whose coorinates have a remainer of k as a remainerk oint In Fiure we show the lattice for =, an label each lattice oint by its remainer The ermutoheral lattice has several roerties that make Fiure : The imensional ermutoheral lattice is forme by rojectin the scale ri ( + )Z + onto the lane x = This forms the lattice ( + )A, which we term the ermutoheral lattice, as it escribes how to tile sace with ermutohera Lattice oints have inteer coorinates with a consistent remainer moulo + In the iaram above, which illustrates the case =, oints are labele an colore accorin to their remainer The lattice tessellates the lane with uniform simlices, each simlex havin one vertex of each remainer The simlices are all translations an ermutations of the canonical simlex (hihlihte), which is efine by the inequalities x > x > > x an x x < + it wellsuite for hihimensional filterin usin the slatblurslice ieline illustrate in Fiure Firstly, it tessellates hihimensional sace with uniform simlices, so we can use barycentric interolation to slat the sinal onto the lattice oints Seconly, the enclosin simlex of any oint, alon with its barycentric coorinates, can be comute quickly (in O( ) time), so slattin is fast Thirly, the neihbors of a lattice oint are trivial to comute, so the blur stae is also fast Finally, slicin can be one usin the barycentric weihts alreay comute urin the slattin stae, an so is also fast These roerties are escribe briefly below Full erivations, roofs, an further helful roerties can be foun in [BA9] The ermutoheral lattice tessellates H with uniform simlices Consier the imensional simlex whose vertices s,, s are iven by: s k = [k,,k, k ( + ),,k ( + ) ] } {{ } } {{ } + k k c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
4 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice y of l x (Fiure 3) As every oint belons to a unique simlex, which is a ermutation an translation of the canonical simlex, H is tessellate by uniform simlices z z > y > x y > z > x z > x > y y > x > z x > z > y x > y > z Fiure 3: When usin the ermutoheral lattice to tessellate the subsace H, any oint x H is enclose by a simlex uniquely ientifie by the nearest remainer lattice oint l (the zeroes hihlihte in re) an the orerin of the coorinates of x l The nearest remainer lattice oint can be comute with a simle rounin alorithm, an so ientifyin the enclosin simlex of any oint an enumeratin its vertices is comutationally chea (O( )) We term this simlex the canonical simlex For examle, when = 4 the vertices are the columns of: Note that s k is a lattice oint of remainer k (ie its coorinates are all conruent to k moulo + ), an the simlex inclues one oint of each remainer The vertices of this simlex are the bounary cases of the inequalities x x x an x x +, an a oint lies within the simlex if an only if it obeys these inequalities Now consier any ermutation ρ of the coorinates of the canonical simlex Each ρ inuces a corresonin orerin of the coorinates x ρ() x ρ() x ρ(), an the inequality x ρ() x ρ() < + Takin the union of these inequalities across all ( + )! simlices results in the set {x i max i x i min i x i +} (the central hexaon in Fiure 3), which is in fact the set of all oints which have the oriin as their closest remainer oint (See Proosition A) Hence, as the lattice is translation invariant, a oint x H, with closest remainer oint l, belons to a unique simlex etermine by l an the orerin of the coorinates x The vertices of the simlex containin any oint in H can be comute in O( ) time This roerty will be useful for the slat an slice staes of filterin The vertices of the simlex containin some oint x H can be enerate by first comutin the closest remainer oint l, an then sortin the ifference l x The resultin ermutation an translation can then be alie to the canonical simlex to comute the simlex vertices in O( ) oerations The closest remainer oint can be foun by first rounin each coorinate of x to the nearest multile of ( + ), an then, if the result is outsie the subsace H, reeily walkin back to H by rounin those coorinates that move the farthest in the other irection instea The sublattice forme by the remainer oints is calle A +, an this is the alorithm iven by Conway an Sloane ( [CS99] 446) for finin the closest oint in that lattice The nearest neihbors of a lattice oint can be comute in O( ) time This roerty will be useful urin the blur stae of filterin The basis vectors iven by B above are those of minimal lenth, so the nearest neihbors of a lattice oint l k are those searate by a vector of the form ±[,,,,,, ] The are ( + ) such neihbors, an each is escribe by a vector of lenth +, an so the neihbors can be fully enumerate in O( ) time 3 Filterin usin the Lattice There are four main staes for usin the ermutoheral lattice for hihimensional Gaussian filterin, illustrate in Fiure 4 We will escribe each in turn Generatin osition vectors Firstly, the osition vectors i, reresentin the locations in the hihimensional sace, must be enerate an embee in H Generatin the ositions is somewhat alication eenent For a color bilateral filter, we enerate 5D osition vectors of the form [ σ xi, yi σ, σ ri c, i σ c, σ bi c ], by aumentin the inut imae with two extra channels encoin satial location, an then scalin each channel by the inverse of the esire stanar eviation For nonlocal means we woul instea either extract local winows aroun each ixel, or comute some bank of filters aroun each ixel an recor the resonses Tyically we o the latter, usin PCA to etermine the otimal filter bank, as first roose by Tasizen [Tas8] We must then scale the osition vectors by the inverse of the stanar eviation of the blur inuce by the remainin stes, which totals 3 ( + ) in each imension (erive c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
5 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice Slat Blur Slice Fiure 4: To erform a hihimensional Gaussian filter usin the ermutoheral lattice, first the osition vectors i R are embee in the hyerlane H usin an orthoonal basis for H (not icture) Then, each inut value slats onto the vertices of its enclosin simlex usin barycentric weihts Next, lattice oints blur their values with nearby lattice oints usin a searable filter Finally, the sace is slice at each inut osition usin the same barycentric weihts to interolate outut values below) Next we embe the osition vectors in the subsace H The basis for H iven above is unsuitable for this task because it is not orthoonal, so we instea use the orthoonal basis: b = b j, j= b i = y i y i+ + E = 6 (+) We choose this basis because it allows us to comute E x in O() time usin the recurrence: (E x) = α x (E x) i = α i x i + x i /α i+ + (E x) i+ (E x) = x i /α + (E x) α i = i/(i + ) Slattin Once each osition has been embee in the hyerlane, we must ientify its enclosin simlex an comute barycentric weihts The enclosin simlex of any oint can be escribe by the ermutation an translation that mas the simlex back to the canonical simlex, which can be comute in O( lo) by usin the rounin alorithm escribe earlier to fin the nearest remainer oint, an then sortin the resiual Therefore, to comute barycentric coorinates for a oint E i in an arbitrary simlex, we can aly the translation an ermutation to ma E i to some y within the canonical simlex Barycentric coorinates b for y are then iven by the exression below, as shown by Proosition A Barycentric interolation is invariant to translation an ermutation, an so these barycentric coorinates for y within the canonical simlex are also the barycentric coorinates for E i within its simlex Once the barycentric weihts are comute, b k v i is ae to the value store at the remainerk lattice oint in the enclosin simlex of i (recall that v i is the homoeneous value associate with osition i ) The lattice oint values are store in a hash table Lattice oints that o not yet exist in the hash table are create when they are first referre to urin the slat stae, an start with an initial value of zero There are two ways to ientify each lattice oint for use as a hash table key One can aly the inverse ermutation an translation to the remainerk oint of the canonical simlex to comute the lattice oint s osition, an use that as a key Each key is a vector of lenth +, an so this results in a memory comlexity of O(l) for l lattice oints In rare cases where l > n, we can alternatively achieve a memory comlexity of O(n) for n inut values by searately storin the simlex enclosin each inut osition i, as a simlex can be ientifie uniquely in O() memory by its remainer oint an its ermutation We then ientify a lattice oint usin its remainer an a ointer to any simlex it belons to, for an aitional O(n) memory One lattice oint belons to many simlices, so key comarison is one by usin the simlex an remainer to comute the lattice oint s coorinates on the fly l is loosely boune by O(n), as each inut value creates at most + new lattice oints However, filters near this boun correson to very small filter sizes an are not very useful, as no share lattice oints means no crosstalk between ixels, an hence no filterin In ractice, we fin that l < n, so we refer the first, faster scheme In either case, c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
6 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice each hash table access costs O() time for key comarison Each ixel accesses the hash table O() times, an so the time comlexity of slattin is O( n) Barycentric interolation in the ermutoheral lattice is equivalent to convolution by the rojection of a uniformlyweihte ( +)imensional hyercube of sie lenth + onto H, an inuces a total variance of ( + ) / (See Proosition A3) Blurrin Now that our values are embee in the subsace H, the next stae of hihimensional Gaussian filterin is erformin a reular Gaussian blur within that subsace To o this we convolve by the kernel [ ] alon each lattice irection of the form ±[,,,,,,] (Fiure 4) This rouces an aroximate Gaussian kernel with total variance ( + ) / The blur stae sreas enery from each lattice oint to O(3 ) neihbors If we create hash table entries for new lattice oints reache urin the blur then the memory use woul row quite lare We therefore o not create new lattice oints urin the blur hase, which incurs some accuracy enalty relative to a naive comutation of Equation, as oints that may have transferre enery coul instea belon to isconnecte reions of the lattice Aams et al [AGDL9] observe a similar effect, an arue it may actually be avantaeous For examle, when bilateral filterin, the absence of these steinstone lattice oints will revent enery transfer from a white ixel to a black ixel across a har ee, but will allow enery transfer between a black ixel an a white ixel on either sie of a smooth raient The blur ste involves lookin u O() neihbors for each lattice oint Each looku takes O() time for hash table key comarison, an so the blur ste has time comlexity O( l) Slicin Slicin is ientical to slattin, excet that it uses the barycentric weihts to ather from the lattice oints instea of scatterin to them It rouces the same total variance of ( + ) /, which brins the total variance inuce by the alorithm to 3 ( +), which is equivalent to a stanar eviation in each imension of 3 ( + ) Slicin can be accelerate by storin the barycentric weihts an ointers to lattice oint values comute urin slattin This slicin table can then be scanne throuh in O(n) time to slice The entire alorithm thus has a time comlexity of O( (n + l)) 3 GPU Imlementation The above alorithm is fairly straihtforwar to arallelize on a GPU We constructe an imlementation usin NVIDIA s CUDA [Buc7], an achieve tyical seeus of Fiure 5: At the to is a 5x56 cro of the inut imae use for time an memory comarisons  a tyical 5 meaixel hotorah Below is the same cro of the outut of the ermutoheral lattice use to erform a color bilateral filter with a satial stanar eviation of 6 ixels an a color stanar eviation of 8 It is visually inistinuishable from the naive result The ermutoheral lattice rouces a result with a PSNR between 45 an 5 B relative to an exhaustive evaluation of Equation, eenin on filter size an imensionality 6x on a Geforce GTX8 comare to the sinlethreae CPU imlementation on an Intel Core i7 9 Clearly a hashtable benefits from a cache The main oint of ifference between the CPU an GPU versions is relate to the creation of hash table entries urin the slattin stae It is customary to attach locks to hash table entries an synchronize all accesses to a iven entry to revent erroneously insertin one key in multile laces We foun it faster to break the slattin stae into three First, we comute the slicin table, recorin which lattice oints each inut ixel slats to, an with what weihts While oin this, we insert the lattice oints foun into the hash table in a way which ermits iniviual keys bein inserte in multile locations Secifically, while we still lock each hash table entry before insertion, other simultaneous hash table insertions simly ski over locke entries while lookin for a free sot rather than waitin on the lock to see if the key matches This means we never have ata eenencies involvin one query reain the key that another query has written, so we can write the keys usin faster nonatomic writes, an only the smaller array of locks nees to be coherent Next, we rehash the entries of the slicin table an uate it so that every reference to a lattice oint refers to the unique earliest instance of that lattice oint in the hash c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
7 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice 3D 5D 8D 6D n n n n f f f s s f s s s Time Taken s r s s GB GB Memory Use s s s r MB MB MB Filter Satial Stanar Deviation (ixels) n Naive Dense Gri s Sarse Gri Permutoheral Lattice Gaussian KDTree f Fast Gauss Transform r RTBF Fiure 6: Here we show time taken an memory use as a function of filter size an imensionality for a variety of alorithms The inut was a tyical 5 meaixel hotorah (Fiure 5) Position vectors were comose of ixel locations, ixel luminance, ixel chrominance, an then increasin numbers of filter resonses over a Gaussianweihte 9x9 local winow, eenin on the esire imensionality These filters were erive usin PCA on the sace of such local winows, an are tyically local erivatives The stanar eviation for all but the satial terms is fixe at 8 The methos comare are the naive winowe bilateral filter (n), the ense bilateral ri () [CPD7], the sarse bilateral ri (s), the ermutoheral lattice (), the Gaussian KDTree () [AGDL9], the imrove fast Gauss transform (f) [YDGD3], for which memory use is unavailable, an realtime bilateral filterin (r) [YTA9], which oes not aly to imensionalities above three The arameters of each alorithm were tune so that it ran as quickly as ossible while achievin a PSNR of rouhly 45B relative to an exhaustive evaluation of Equation table Finally, we use the correcte slicin table to slat, aitively scatterin onto lattice oints as usual In an interactive settin, it is common to erform many filters whilst only chanin a few arameters in between runs If the osition vectors an filter sizes o not chane, then the ol slicin table an hash table can be reuse for a moerate seeu 4 Results an Comarisons Here we resent results of a comarison of a number of alorithms for erformin hihimensional filterin on a tyical hotorah All alorithms were run sinlethreae on an Intel Core i7 9 runnin at 67 GHz Only alorithms with source coe available were use, an all lowlevel otimizations were left u to the comiler The inut hotorah an the outut of the ermutoheral lattice are shown in Fiure 5 The runnin times an memory use of each alorithm for a few ifferent imensionalities are shown in Fiure 6 Fiure 7 illustrates the fastest metho for a variety of imensionalities an filter sizes The ermutoheral lattice is sinificantly faster than the state of the art for a lare rane of imensionalities an filter sizes 4 The Alorithms Naive: This alorithm consiers all ixels within three satial stanar eviations of each ixel an manually comutes Equation While this alorithm scales linearly with imensionality, it is quaratic in filter size, an oes not work for unstructure ata such as eometry Dense Gri: This is the bilateral ri of Paris et al [PD9], usin multilinear slattin an slicin, an a searable blur kernel of [ ] in each imension It scales exonentially with imensionality Sarse Gri: The two major ifferences between the ermutoheral lattice an the bilateral ri are the lattice use, an also the fact that the ermutoheral lattice stores values sarsely in a hash table In orer to isambiuate these two effects, we constructe a sarse bilateral ri alorithm that uses the same hash table imlementation Similarly to the Gaussian KDTree an the ermutoheral lattice, we o not allocate new lattice oints urin the blur stae However, the time an memory comlexity are still exonential in, an inee this technique is slower than the ense bilateral ri, while savin only a moerate amount of memory This c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
8 A Aams & J Baek & M A Davis / Fast HihDimensional Filterin Usin thepermutoheral Lattice Fiure 7: This contour lot shows the fastest metho for each imensionality an satial filter size, an how many times faster it is than the secon fastest metho The bilateral ri [CPD7] is best for imensionalities three an four The Gaussian KDTree [AGDL9] is best for hih imensionalities an small filter sizes The ermutoheral lattice is the fastest metho for imensionalities from 5 (color bilateral filterin) u to aroun, eenin on the filter size Run times were samle at the small ots an interolate Only methos caable of arbitraryimensional filters were comare, an the arameters of each metho were tune to achieve an PSNR relative to roun truth of rouhly 45B Filter Dimensionality x 4x Gaussian KDTree x Bilateral Gri Permutoheral Lattice Filter Stanar Deviation x x x x 4x 4x 8x NonLocal Means Bilateral Filters shows that it is our choice of lattice, rather than our sarsity, which rovies the avantae Gaussian KDTree: This is the Gaussian KDTree of Aams et al [AGDL9] Its run time is fairly constant across filter size an imensionality, an its memory use is sinificantly lower than the other methos for imensionalities 5 an u Imrove Fast Gauss Transform: This is the fast multiole metho of evaluatin the Gauss Transform of C Yan et al [YDGD3] It is a fully eneral metho caable of extremely hih accuracy, but even when tune for see, it is not articularly fast comare to the more aroximate methos use in imae filterin RealTime O() Bilateral Filterin: This is the metho of Q Yan et al [YTA9] It is the fastest known metho for rayscale bilateral filters ( = 3), but oes not scale with imensionality 5 Interactive Alications Imaes rouce by alications of hihimensional Gaussian filterin such as nonlocal means an the bilateral filter can een heavily on the stanar eviations chosen The hih see an arallelizability of the ermutoheral lattice make these filters easier to use by lettin users interactively exlore the arameter sace Our CUDA imlementation of the lattice filters 8x6 imaes at fs We use this to imlement the followin interactive alications Reaers are encourae to view the vieo accomanyin this aer to see these alications emonstrate Interactive Color Bilateral Filterin The user is resente with sliers to control the stanar eviations for each of the imensions of the filter (x, y, r,, b) The result of chanin any of these values is resente immeiately, makin it easy to exlore the sace of bilateral filters Interactive Nonlocal Means As a rerocess, PCA is erforme on the sace of 7x7 atches centere about each ixel in the imae, in orer to reuce imensionality without losin istance relationshis We use six PCA terms in aition to the two satial terms as osition imensions Six imensions is the number sueste by Tasizen [Tas8], who emonstrate that erformin nonlocal means in this way rouces suerior results to nonlocal means without imensionality reuction Once aain the user is resente with sliers to control the stanar eviations, an the result is resente in real time, allowin for interactiverate enoisin Nonlocal Means Eitin Nonlocal means can also be use for makin eits to an imae that roaate across similar colors, textures, or brihtnesses, in the same manner as the roaatin eits of [AP8] By choosin aroriate osition imensions, local eits can be mae to resect bounaries with resect to any set of local escritors The user alies aroximate eits with a few strokes Each stroke aints values on a mask in those locations The mask is then filtere with resect to the osition imensions For our osition imensions, we use six PCA terms an two satial terms, which catures chanes in brihtness, color, an texture The filtere mask, which resects ees in the osition imensions, serves as an influence ma for how the eit shoul be alie For ajustin brihtness, the user aints ark or briht values into the mask, an we simly multily the inut imae by the filtere mask The filterin is one at interactive rates, so the user can see the fully roaate eit as they aly their rouh strokes c 9 The Author(s) Journal comilation c 9 The Eurorahics Association an Blackwell Publishin Lt
An Approach to Optimizations Links Utilization in MPLS Networks
An Aroach to Otimizations Utilization in MPLS Networks M.K Huerta X. Hesselbach R.Fabregat Deartment of Telematics Engineering. Technical University of Catalonia. Jori Girona . Camus Nor, Eif C, UPC.
More informationThe Impact of Forecasting Methods on Bullwhip Effect in Supply Chain Management
The Imact of Forecasting Methos on Bullwhi Effect in Suly Chain Management HX Sun, YT Ren Deartment of Inustrial an Systems Engineering, National University of Singaore, Singaore Schoo of Mechanical an
More informationDouble Integrals in Polar Coordinates
Double Integrals in Polar Coorinates Part : The Area Di erential in Polar Coorinates We can also aly the change of variable formula to the olar coorinate transformation x = r cos () ; y = r sin () However,
More informationWavefront Sculpture Technology
Auio Engineering Society Convention Paer Presente at the th Convention 00 Setember New York, NY, USA This convention aer has been rerouce from the author's avance manuscrit, without eiting, corrections,
More informationAlpha Channel Estimation in High Resolution Images and Image Sequences
In IEEE Comuter Society Conference on Comuter Vision and Pattern Recognition (CVPR 2001), Volume I, ages 1063 68, auai Hawaii, 11th 13th Dec 2001 Alha Channel Estimation in High Resolution Images and Image
More informationEconomics 241B Hypothesis Testing: Large Sample Inference
Economics 241B Hyothesis Testing: Large Samle Inference Statistical inference in largesamle theory is base on test statistics whose istributions are nown uner the truth of the null hyothesis. Derivation
More informationText Analytics. Modeling Information Retrieval 2. Ulf Leser
Text Analytics Moeling Information etrieval 2 Ulf Leser Content of this Lecture I Moels Boolean Moel Vector Sace Moel elevance Feebac in the VSM Probabilistic Moel Latent Semantic Inexing Other I Moels
More informationENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS
ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science
More informationApplication of Improved SSL in Data Security Transmission of Mobile Database System
Alication of Imrove SSL in Data Security Transmission of Mobile Database System RUIFENG WANG, XIAOHUA ZHANG, DECHAO XU College of Automation & Electrical Engineering Lanzhou Jiaotong University Lanzhou,
More informationTrap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
Tra Coverage: Allowing Coverage Holes of Boune Diameter in Wireless Sensor Networks Paul Balister Zizhan Zheng Santosh Kumar Prasun Sinha University of Memhis The Ohio State University {balistr,santosh.kumar}@memhis.eu
More informationLecture L253D Rigid Body Kinematics
J. Peraire, S. Winall 16.07 Dynamics Fall 2008 Version 2.0 Lecture L253D Rigi Boy Kinematics In this lecture, we consier the motion of a 3D rigi boy. We shall see that in the general threeimensional
More informationPoint Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)
Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint
More informationUnit 3. Elasticity Learning objectives Questions for revision: 3.1. Price elasticity of demand
Unit 3. Elasticity Learning objectives To comrehen an aly the concets of elasticity, incluing calculating: rice elasticity of eman; crossrice elasticity of eman; income elasticity of eman; rice elasticity
More informationThe Online Freezetag Problem
The Online Freezetag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,
More informationPower analysis of static VAr compensators
Available online at www.scienceirect.com Electrical Power an Energy ystems 0 (008) 7 8 www.elsevier.com/locate/ijees Power analysis of static VAr comensators F.. Quintela *, J.M.G. Arévalo,.. eono Escuela
More informationConcurrent Program Synthesis Based on Supervisory Control
010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30July 0, 010 ThB07.5 Concurrent Program Synthesis Based on Suervisory Control Marian V. Iordache and Panos J. Antsaklis Abstract
More informationOutsourcing Information Security: Contracting Issues and Security Implications
Outsourcing Information Security: Contracting Issues an Security Imlications Asunur Cezar Mile East Technical University Northern Cyress Camus Kalkanlı, Güzelyurt, KKTC, Mersin 10, Turkey asunur@metu.eu.tr
More information10.2 Systems of Linear Equations: Matrices
SECTION 0.2 Systems of Linear Equations: Matrices 7 0.2 Systems of Linear Equations: Matrices OBJECTIVES Write the Augmente Matrix of a System of Linear Equations 2 Write the System from the Augmente Matrix
More informationCBus Voltage Calculation
D E S I G N E R N O T E S CBus Voltage Calculation Designer note number: 3121256 Designer: Darren Snodgrass Contact Person: Darren Snodgrass Aroved: Date: Synosis: The guidelines used by installers
More informationA Third Generation Automated Teller Machine Using Universal Subscriber Module with Iris Recognition
A Third Generation Automated Teller Machine Using Universal Subscriber Module with Iris Recognition B.Sundar Raj Assistant rofessor, Det of CSE, Bharath University, Chennai, TN, India. ABSTRACT: This aer
More information1. the acceleration of the body decreases by. 2. the acceleration of the body increases by. 3. the body falls 9.8 m during each second.
Answer, Key Homework 3 Davi McIntyre 45123 Mar 25, 2004 1 This printout shoul have 21 questions. Multiplechoice questions may continue on the next column or pae fin all choices before makin your selection.
More informationWeb Application Scalability: A ModelBased Approach
Coyright 24, Software Engineering Research and Performance Engineering Services. All rights reserved. Web Alication Scalability: A ModelBased Aroach Lloyd G. Williams, Ph.D. Software Engineering Research
More informationContingent Fees, Signaling and Settlement Authority
Contingent Fees, Signaling an Settlement Authority SHMUEL LESHEM USC Law School Conventional wisom suggests that uner contingent fee contracts, attorneys have an excessive incentive to settle the case;
More informationLargeScale IP Traceback in HighSpeed Internet: Practical Techniques and Theoretical Foundation
LargeScale IP Traceback in HighSeed Internet: Practical Techniques and Theoretical Foundation Jun Li Minho Sung Jun (Jim) Xu College of Comuting Georgia Institute of Technology {junli,mhsung,jx}@cc.gatech.edu
More informationForensic Science International
Forensic Science International 214 (2012) 33 43 Contents lists available at ScienceDirect Forensic Science International jou r nal h o me age: w ww.els evier.co m/lo c ate/fo r sc iin t A robust detection
More informationChE 120B Lumped Parameter Models for Heat Transfer and the Blot Number
ChE 0B Lumed Parameter Models for Heat Transfer and the Blot Number Imagine a slab that has one dimension, of thickness d, that is much smaller than the other two dimensions; we also assume that the slab
More informationA Generalization of Sauer s Lemma to Classes of LargeMargin Functions
A Generalization of Sauer s Lemma to Classes of LargeMargin Functions Joel Ratsaby University College Lonon Gower Street, Lonon WC1E 6BT, Unite Kingom J.Ratsaby@cs.ucl.ac.uk, WWW home page: http://www.cs.ucl.ac.uk/staff/j.ratsaby/
More informationSQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWODIMENSIONAL GRID
International Journal of Comuter Science & Information Technology (IJCSIT) Vol 6, No 4, August 014 SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWODIMENSIONAL GRID
More informationPRETRIAL NEGOTIATION, LITIGATION, AND PROCEDURAL RULES
PRETRIAL NEGOTIATION, LITIGATION, AND PROCEDURAL RULES JIONG GONG AND R. PRESTON MCAFEE* We moel the ciil isute resolution rocess as a twostage game with the arties bargaining to reach a settlement in
More informationMeasures of distance between samples: Euclidean
4 Chapter 4 Measures of istance between samples: Eucliean We will be talking a lot about istances in this book. The concept of istance between two samples or between two variables is funamental in multivariate
More informationGeorge G. Burba, Dayle K. McDermitt, and Dan J. Anderson. Openpath infrared gas analyzers are widely used around the world for measuring CO 2
1 Influence of instrument surface heat exchange on CO 2 flux from oenath gas analyzers George G. Burba, Dayle K. McDermitt, an Dan J. Anerson LICOR Biosciences, 4421 Suerior Street, Lincoln, Nebraska
More informationA MOST PROBABLE POINTBASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION
9 th ASCE Secialty Conference on Probabilistic Mechanics and Structural Reliability PMC2004 Abstract A MOST PROBABLE POINTBASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION
More informationSoftmax Model as Generalization upon Logistic Discrimination Suffers from Overfitting
Journal of Data Science 12(2014),563574 Softmax Model as Generalization uon Logistic Discrimination Suffers from Overfitting F. Mohammadi Basatini 1 and Rahim Chiniardaz 2 1 Deartment of Statistics, Shoushtar
More information1 HighDimensional Space
Contents HighDimensional Space. Properties of HighDimensional Space..................... 4. The HighDimensional Sphere......................... 5.. The Sphere an the Cube in Higher Dimensions...........
More informationMemory management. Chapter 4: Memory Management. Memory hierarchy. In an ideal world. Basic memory management. Fixed partitions: multiple programs
Memory management Chater : Memory Management Part : Mechanisms for Managing Memory asic management Swaing Virtual Page relacement algorithms Modeling age relacement algorithms Design issues for aging systems
More informationManaging specific risk in property portfolios
Managing secific risk in roerty ortfolios Andrew Baum, PhD University of Reading, UK Peter Struemell OPC, London, UK Contact author: Andrew Baum Deartment of Real Estate and Planning University of Reading
More informationMetabolic control analysis in a nutshell
Metabolic control analysis in a nutshell JanHenrik S. Hofmeyr Det. of Biochemistry University of Stellenbosch Private Bag X, Matielan 76 Stellenbosch, South Africa jhsh@maties.sun.ac.za ABSRAC Metabolic
More informationRisk in Revenue Management and Dynamic Pricing
OPERATIONS RESEARCH Vol. 56, No. 2, March Aril 2008,. 326 343 issn 0030364X eissn 15265463 08 5602 0326 informs doi 10.1287/ore.1070.0438 2008 INFORMS Risk in Revenue Management and Dynamic Pricing Yuri
More informationA Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm
International Journal of Comuter Theory and Engineering, Vol. 7, No. 4, August 2015 A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm Xin Lu and Zhuanzhuan Zhang Abstract This
More informationLagrangian and Hamiltonian Mechanics
Lagrangian an Hamiltonian Mechanics D.G. Simpson, Ph.D. Department of Physical Sciences an Engineering Prince George s Community College December 5, 007 Introuction In this course we have been stuying
More informationAn Associative Memory Readout in ESN for Neural Action Potential Detection
g An Associative Memory Readout in ESN for Neural Action Potential Detection Nicolas J. Dedual, Mustafa C. Ozturk, Justin C. Sanchez and José C. Princie Abstract This aer describes how Echo State Networks
More informationDAYAHEAD ELECTRICITY PRICE FORECASTING BASED ON TIME SERIES MODELS: A COMPARISON
DAYAHEAD ELECTRICITY PRICE FORECASTING BASED ON TIME SERIES MODELS: A COMPARISON Rosario Esínola, Javier Contreras, Francisco J. Nogales and Antonio J. Conejo E.T.S. de Ingenieros Industriales, Universidad
More informationUnsteady Flow Visualization by Animating EvenlySpaced Streamlines
EUROGRAPHICS 2000 / M. Gross an F.R.A. Hopgoo Volume 19, (2000), Number 3 (Guest Eitors) Unsteay Flow Visualization by Animating EvenlySpace Bruno Jobar an Wilfri Lefer Université u Littoral Côte Opale,
More informationNOISE ANALYSIS OF NIKON D40 DIGITAL STILL CAMERA
NOISE ANALYSIS OF NIKON D40 DIGITAL STILL CAMERA F. Mojžíš, J. Švihlík Detartment of Comuting and Control Engineering, ICT Prague Abstract This aer is devoted to statistical analysis of Nikon D40 digital
More informationAn Efficient Method for Improving Backfill Job Scheduling Algorithm in Cluster Computing Systems
The International ournal of Soft Comuting and Software Engineering [SCSE], Vol., No., Secial Issue: The Proceeding of International Conference on Soft Comuting and Software Engineering 0 [SCSE ], San Francisco
More informationEnergy consumption in pumps friction losses
Energy consumtion in ums friction losses In this secon article in a series on energy savings in ums, Hans Vogelesang, irector of Netherlansbase esign consultancy PumSuort, eals with some ractical asects
More informationStatic and Dynamic Properties of Smallworld Connection Topologies Based on Transitstub Networks
Static and Dynamic Proerties of Smallworld Connection Toologies Based on Transitstub Networks Carlos Aguirre Fernando Corbacho Ramón Huerta Comuter Engineering Deartment, Universidad Autónoma de Madrid,
More informationA Modified Measure of Covert Network Performance
A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy
More informationFactoring Variations in Natural Images with Deep Gaussian Mixture Models
Factoring Variations in Natural Images with Dee Gaussian Mixture Models Aäron van den Oord, Benjamin Schrauwen Electronics and Information Systems deartment (ELIS), Ghent University {aaron.vandenoord,
More informationDiscrete Stochastic Approximation with Application to Resource Allocation
Discrete Stochastic Aroximation with Alication to Resource Allocation Stacy D. Hill An otimization roblem involves fi nding the best value of an obective function or fi gure of merit the value that otimizes
More informationSynopsys RURAL ELECTRICATION PLANNING SOFTWARE (LAPER) Rainer Fronius Marc Gratton Electricité de France Research and Development FRANCE
RURAL ELECTRICATION PLANNING SOFTWARE (LAPER) Rainer Fronius Marc Gratton Electricité de France Research and Develoment FRANCE Synosys There is no doubt left about the benefit of electrication and subsequently
More informationLoad Balancing Mechanism in Agentbased Grid
Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 5762 Available online at www.isacs.com/cacsa Volume 2016, Issue 1, Year 2016 Article ID cacsa00042, 6 Pages doi:10.5899/2016/cacsa00042
More informationDIFFRACTION AND INTERFERENCE
DIFFRACTION AND INTERFERENCE In this experiment you will emonstrate the wave nature of light by investigating how it bens aroun eges an how it interferes constructively an estructively. You will observe
More informationSimulink Implementation of a CDMA Smart Antenna System
Simulink Imlementation of a CDMA Smart Antenna System MOSTAFA HEFNAWI Deartment of Electrical and Comuter Engineering Royal Military College of Canada Kingston, Ontario, K7K 7B4 CANADA Abstract:  The
More informationOn Multicast Capacity and Delay in Cognitive Radio Mobile Adhoc Networks
On Multicast Caacity and Delay in Cognitive Radio Mobile Adhoc Networks Jinbei Zhang, Yixuan Li, Zhuotao Liu, Fan Wu, Feng Yang, Xinbing Wang Det of Electronic Engineering Det of Comuter Science and Engineering
More informationA Study on the Interfacial Characteristics of Nitramine ExplosivePolymer Binder
169 A tuy on the Interfacial Characteristics of Nitramine ExlosivePolymer Biner Jung. him, Hyoun. Kim, Keun D. Lee an Jeong K. Kim Agency for Defense Develoment (ADD) Yuseung P.O.Box 355, Daejon, Korea
More informationA Simple Model of Pricing, Markups and Market. Power Under Demand Fluctuations
A Simle Model of Pricing, Markus and Market Power Under Demand Fluctuations Stanley S. Reynolds Deartment of Economics; University of Arizona; Tucson, AZ 85721 Bart J. Wilson Economic Science Laboratory;
More informationAn inventory control system for spare parts at a refinery: An empirical comparison of different reorder point methods
An inventory control system for sare arts at a refinery: An emirical comarison of different reorder oint methods Eric Porras a*, Rommert Dekker b a Instituto Tecnológico y de Estudios Sueriores de Monterrey,
More informationMachine Learning with Operational Costs
Journal of Machine Learning Research 14 (2013) 19892028 Submitted 12/11; Revised 8/12; Published 7/13 Machine Learning with Oerational Costs Theja Tulabandhula Deartment of Electrical Engineering and
More informationJoint Production and Financing Decisions: Modeling and Analysis
Joint Production and Financing Decisions: Modeling and Analysis Xiaodong Xu John R. Birge Deartment of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208,
More informationwhere a, b, c, and d are constants with a 0, and x is measured in radians. (π radians =
Introduction to Modeling 3.61 3.6 Sine and Cosine Functions The general form of a sine or cosine function is given by: f (x) = asin (bx + c) + d and f(x) = acos(bx + c) + d where a, b, c, and d are constants
More informationUnited Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane
United Arab Emirates University College of Sciences Deartment of Mathematical Sciences HOMEWORK 1 SOLUTION Section 10.1 Vectors in the Plane Calculus II for Engineering MATH 110 SECTION 0 CRN 510 :00 :00
More informationUniversiteitUtrecht. Department. of Mathematics. Optimal a priori error bounds for the. RayleighRitz method
UniversiteitUtrecht * Deartment of Mathematics Otimal a riori error bounds for the RayleighRitz method by Gerard L.G. Sleijen, Jaser van den Eshof, and Paul Smit Prerint nr. 1160 Setember, 2000 OPTIMAL
More informationReading: Ryden chs. 3 & 4, Shu chs. 15 & 16. For the enthusiasts, Shu chs. 13 & 14.
7 Shocks Reaing: Ryen chs 3 & 4, Shu chs 5 & 6 For the enthusiasts, Shu chs 3 & 4 A goo article for further reaing: Shull & Draine, The physics of interstellar shock waves, in Interstellar processes; Proceeings
More informationRealTime MultiStep View Reconstruction for a Virtual Teleconference System
EURASIP Journal on Alied Signal Processing 00:0, 067 087 c 00 Hindawi Publishing Cororation RealTime MultiSte View Reconstruction for a Virtual Teleconference System B. J. Lei Information and Communication
More informationProvable Ownership of File in Deduplication Cloud Storage
1 Provable Ownershi of File in Dedulication Cloud Storage Chao Yang, Jian Ren and Jianfeng Ma School of CS, Xidian University Xi an, Shaanxi, 710071. Email: {chaoyang, jfma}@mail.xidian.edu.cn Deartment
More informationThe impact of metadata implementation on webpage visibility in search engine results (Part II) q
Information Processing and Management 41 (2005) 691 715 www.elsevier.com/locate/inforoman The imact of metadata imlementation on webage visibility in search engine results (Part II) q Jin Zhang *, Alexandra
More informationAn important observation in supply chain management, known as the bullwhip effect,
Quantifying the Bullwhi Effect in a Simle Suly Chain: The Imact of Forecasting, Lead Times, and Information Frank Chen Zvi Drezner Jennifer K. Ryan David SimchiLevi Decision Sciences Deartment, National
More informationMath 230.01, Fall 2012: HW 1 Solutions
Math 3., Fall : HW Solutions Problem (p.9 #). Suppose a wor is picke at ranom from this sentence. Fin: a) the chance the wor has at least letters; SOLUTION: All wors are equally likely to be chosen. The
More informationFailure Behavior Analysis for Reliable Distributed Embedded Systems
Failure Behavior Analysis for Reliable Distributed Embedded Systems Mario Tra, Bernd Schürmann, Torsten Tetteroo {tra schuerma tetteroo}@informatik.unikl.de Deartment of Comuter Science, University of
More informationMoving Objects Tracking in Video by Graph Cuts and Parameter Motion Model
International Journal of Comuter Alications (0975 8887) Moving Objects Tracking in Video by Grah Cuts and Parameter Motion Model Khalid Housni, Driss Mammass IRF SIC laboratory, Faculty of sciences Agadir
More informationStorage Basics Architecting the Storage Supplemental Handout
Storage Basics Architecting the Storage Sulemental Handout INTRODUCTION With digital data growing at an exonential rate it has become a requirement for the modern business to store data and analyze it
More informationRobust Regression on MapReduce
Xiangrui Meng LinkedIn Cororation, 2029 Stierlin Ct, Mountain View, CA 94043 Michael W. Mahoney Deartment of Mathematics, Stanford University, Stanford, CA 94305 ximeng@linkedin.com mmahoney@cs.stanford.edu
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationSensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm
Sensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm Sewoong Oh an Anrea Montanari Electrical Engineering an Statistics Department Stanfor University, Stanfor,
More informationOptimizing the Polynomial to Represent the Extended True Boiling Point Curve from High Vacuum Distillation Data Using Genetic Algorithms
A ublication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 43, 015 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Coyriht 015, AIDIC Servizi S.r.l., ISBN 9788895608341; ISSN 83916 The Italian Association
More informationBeyond the F Test: Effect Size Confidence Intervals and Tests of Close Fit in the Analysis of Variance and Contrast Analysis
Psychological Methods 004, Vol. 9, No., 164 18 Coyright 004 by the American Psychological Association 108989X/04/$1.00 DOI: 10.1037/108989X.9..164 Beyond the F Test: Effect Size Confidence Intervals
More informationMonitoring Frequency of Change By Li Qin
Monitoring Frequency of Change By Li Qin Abstract Control charts are widely used in rocess monitoring roblems. This aer gives a brief review of control charts for monitoring a roortion and some initial
More informationX How to Schedule a Cascade in an Arbitrary Graph
X How to Schedule a Cascade in an Arbitrary Grah Flavio Chierichetti, Cornell University Jon Kleinberg, Cornell University Alessandro Panconesi, Saienza University When individuals in a social network
More information4 Perceptron Learning Rule
Percetron Learning Rule Objectives Objectives  Theory and Examles  Learning Rules  Percetron Architecture 3 SingleNeuron Percetron 5 MultileNeuron Percetron 8 Percetron Learning Rule 8 Test Problem
More informationTworesource stochastic capacity planning employing a Bayesian methodology
Journal of the Oerational Research Society (23) 54, 1198 128 r 23 Oerational Research Society Ltd. All rights reserved. 165682/3 $25. www.algravejournals.com/jors Tworesource stochastic caacity lanning
More informationA Method to Segment a 3D Surface Point Cloud for Selective Sensing in Robotic Exploration
A Method to Segment a 3D Surface Point Cloud for Selectie Sensing in Robotic Exloration Philli Curtis, Pierre Payeur School of Information Technology and Engineering Uniersity of Ottawa Ottawa, O, Canada
More informationThe fast Fourier transform method for the valuation of European style options inthemoney (ITM), atthemoney (ATM) and outofthemoney (OTM)
Comutational and Alied Mathematics Journal 15; 1(1: 16 Published online January, 15 (htt://www.aascit.org/ournal/cam he fast Fourier transform method for the valuation of Euroean style otions inthemoney
More informationNAVAL POSTGRADUATE SCHOOL THESIS
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIFORNIA THESIS SYMMETRICAL RESIDUETOBINARY CONVERSION ALGORITHM PIPELINED FPGA IMPLEMENTATION AND TESTING LOGIC FOR USE IN HIGHSPEED FOLDING DIGITIZERS by Ross
More informationTimeCost TradeOffs in ResourceConstraint Project Scheduling Problems with Overlapping Modes
TimeCost TradeOffs in ResourceConstraint Proect Scheduling Problems with Overlaing Modes François Berthaut Robert Pellerin Nathalie Perrier Adnène Hai February 2011 CIRRELT201110 Bureaux de Montréal
More informationThe Priority RTree: A Practically Efficient and WorstCase Optimal RTree
The Priority RTree: A Practically Efficient and WorstCase Otimal RTree Lars Arge Deartment of Comuter Science Duke University, ox 90129 Durham, NC 277080129 USA large@cs.duke.edu Mark de erg Deartment
More informationInformation Retrieval
Information etrieval Moeling Information etrieval 2 Ulf Leser Content of this Lecture I Moels Boolean Moel Vector Sace Moel elevance Feebac in the VSM Probabilistic Moel Latent Semantic Inexing Other I
More informationManaging Sales Return in Dual Sales Channel: Common Return versus CrossChannel Return Analysis
Managing ales Return in ual ales Channel: Common Return versus CrossChannel Return Analysis Erwin Wioo, atsuhiko Takahashi, atsumi Morikawa, I Nyoman Pujawan, an Bui antosa Abstract This work examines
More informationModeling and Simulation of an Incremental Encoder Used in Electrical Drives
10 th International Symosium of Hungarian Researchers on Comutational Intelligence and Informatics Modeling and Simulation of an Incremental Encoder Used in Electrical Drives János Jób Incze, Csaba Szabó,
More informationComputational Finance The Martingale Measure and Pricing of Derivatives
1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet
More informationTitle: Stochastic models of resource allocation for services
Title: Stochastic models of resource allocation for services Author: Ralh Badinelli,Professor, Virginia Tech, Deartment of BIT (235), Virginia Tech, Blacksburg VA 2461, USA, ralhb@vt.edu Phone : (54) 2317688,
More informationy or f (x) to determine their nature.
Level C5 of challenge: D C5 Fining stationar points of cubic functions functions Mathematical goals Starting points Materials require Time neee To enable learners to: fin the stationar points of a cubic
More informationJON HOLTAN. if P&C Insurance Ltd., Oslo, Norway ABSTRACT
OPTIMAL INSURANCE COVERAGE UNDER BONUSMALUS CONTRACTS BY JON HOLTAN if P&C Insurance Lt., Oslo, Norway ABSTRACT The paper analyses the questions: Shoul or shoul not an iniviual buy insurance? An if so,
More informationEffect Sizes Based on Means
CHAPTER 4 Effect Sizes Based on Means Introduction Raw (unstardized) mean difference D Stardized mean difference, d g Resonse ratios INTRODUCTION When the studies reort means stard deviations, the referred
More informationThe Fundamental Incompatibility of Scalable Hamiltonian Monte Carlo and Naive Data Subsampling
The Fundamental Incomatibility of Scalable Hamiltonian Monte Carlo and Naive Data Subsamling Michael Betancourt Deartment of Statistics, University of Warwick, Coventry, UK CV4 7A BETANAPHA@GMAI.COM Abstract
More informationIntroduction to NPCompleteness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use timebounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More informationThe Economics of the Cloud: Price Competition and Congestion
Submitted to Oerations Research manuscrit The Economics of the Cloud: Price Cometition and Congestion Jonatha Anselmi Basque Center for Alied Mathematics, jonatha.anselmi@gmail.com Danilo Ardagna Di. di
More informationStability Improvements of Robot Control by Periodic Variation of the Gain Parameters
Proceedings of the th World Congress in Mechanism and Machine Science ril ~4, 4, ianin, China China Machinery Press, edited by ian Huang. 868 Stability Imrovements of Robot Control by Periodic Variation
More informationRisk and Return. Sample chapter. e r t u i o p a s d f CHAPTER CONTENTS LEARNING OBJECTIVES. Chapter 7
Chater 7 Risk and Return LEARNING OBJECTIVES After studying this chater you should be able to: e r t u i o a s d f understand how return and risk are defined and measured understand the concet of risk
More informationFrom Simulation to Experiment: A Case Study on Multiprocessor Task Scheduling
From to Exeriment: A Case Study on Multirocessor Task Scheduling Sascha Hunold CNRS / LIG Laboratory Grenoble, France sascha.hunold@imag.fr Henri Casanova Det. of Information and Comuter Sciences University
More information