Smooth Probabilistic Ambient Occlusion for Volume Rendering
|
|
- Elfreda Blankenship
- 5 years ago
- Views:
Transcription
1 Smooth Probablstc Ambent Occluson for Volume Renderng Thomas Kroes, Drk Schut, and Elmar Esemann 1.1 Introducton Ambent occluson [Zhukov et al. 98] s a compellng approach to mprove depth and shape percepton [Lndemann and Ropnsk 11, Langer and Bülthoff 99], to gve the lluson of global llumnaton, and t s an effcent way to approxmate low-frequency outdoor lghtng. In prncple, ambent occluson computes the lght accessblty of a pont,.e., t measures how much a pont s exposed to ts surroundng envronment. An effcent and often used verson of ambent occluson s Screen Space Ambent Occluson [Kajaln 09]. It uses the depth buffer to compute an approxmate vsblty. Ths method s very appealng, snce the computatonal overhead of ths method s mnmal. However t cannot be appled to drect volume renderng (DVR) because voxels are typcally semtransparent (defned va a transfer functon). Consequently, a depth buffer would be ambguous and s not useful n ths context. The frst method to compute ambent occluson n drect DVR, called Vcnty Shadng, was developed by Steward [Stewart 03]. Ths method computes the ambent occluson n each voxel by takng nto account how much the neghborng voxels obscure t. The resultng llumnaton s stored n an addtonal volume, whch needs to be recomputed after each scene modfcaton. Smlarly, Hernell et al. [Hernell et al. 10] compute ambent occluson by raytracng nsde a small neghborhood around the voxel. Kroes et al. extend ths method by takng the entre volume nto account [Kroes et al. 12]. Our approach tres to avod costly ray tracng and casts the problem nto a flterng process. In ths sense, t s smlar n sprt to Penner et al. [Penner and Mtchell 08], who use statstcal nformaton about the neghborhood of the voxels to estmate ambent occluson, as well as the method by Ropnsk et al. whch s smlar and also adds color bleed- 1
2 2 1. Smooth Probablstc Ambent Occluson for Volume Renderng Fgure 1.1: Left: The hemsphere around a pont whch determnes ambent occluson. The blue part s unoccluded. Rght: Volumetrc obscurance reles on a full sphere. ng [Ropnsk et al. 08]. Furthermore, our approach relates to Crassn et al. [Crassn et al. 10] who propose to use flterng for shadow and out-offocus computatons. Our Smooth Probablstc Ambent Occluson (SPAO) s a novel and easy-to-mplement soluton for ambent occluson n DVR. Instead of applyng costly ray castng to determne the accessblty of a voxel, ths technque employs a probablstc heurstc n concert wth 3D mage flterng. In ths way, ambent occluson can be effcently approxmated and t s possble to nteractvely modfy the transfer functon, whch s crtcal n many applcatons, such as medcal and scentfc DVR. Furthermore, our method offers varous qualty trade-offs regardng memory, performance, and vsual qualty. Only very few texture look-ups are needed n comparson to ray-castng solutons and the nterpretaton as a flterng process ensures a nose-free and smooth appearance. 1.2 Smooth Probablstc Ambent Occluson There are varous defntons for ambent occluson. Here, we defne t as the part of a pont that s accessble from the outsde world. A 2D example s gven n Fgure 1.1 and llustrates the ambent occluson computaton. More formally the ambent-occluson value A(p, n) s gven by the ntegral of the vsblty functon over the hemsphere Ω centered around a pont p n the drecton of the normal n of that pont: A(p, n) := 1 V (p, ω)dω, π Ω(n) where V s the vsblty functon. In other words, V stems from the volume data tself after t was transformed by the transfer functon. V (p, ω) s 0 f the ray from pont p n drecton ω s blocked, 1 f t s unblocked, and an ntermedate value attenuates the ray. To smplfy the descrpton, we wll only use the noton of blocked and unblocked rays n the followng. Please
3 1.2. Smooth Probablstc Ambent Occluson 3 notce that we can nterpret ntermedate values of V as a probablty for a ray to be blocked. For example, f V returns a value of 0.5, there s a 50% chance for a ray to be blocked. It s also possble to ntegrate the vsblty functon over the whole sphere around a pont, makng Ω a full sphere, nstead of a hemsphere, and makng t ndependent of n. The result s called obscurance and denoted A(p), and produces smlar effects. Calculatng obscurance nstead of ambent occluson has the advantage that t does not requre a normal. However, ths defnton wll lead to parts of the volume that are located behnd the pont to ntervene n the computaton. Ths property can be a dsadvantage for standard scenes, as the result mght become too dark, but n the context of DVR, t s sometmes even preferable, as t wll unvel nformaton below the surface, whch s often desred. Both, ambent occluson and obscurance, only depend on the geometry of the volume. Therefore they can be stored n an addtonal volume that s then used to modulate the orgnal volume s llumnaton. The occluson values can be calculated drectly from the opacty of the orgnal volume. Nonetheless, the values have to be recomputed when the orgnal volume changes, for example when the user changes the transfer functon. Ths latter step can be very costly and makes t mpossble to nteract wth transfer functons, whle mantanng a hgh vsual fdelty. Our approach s fast to compute and enables a user to quckly apply such modfcatons wthout havng to wat a long tme for the result. Intally, our soluton wll be explaned n the context of obscurance, but n Secton 1.3, we wll extend our algorthm to approach ambent occluson by makng use of the normals to reduce the nfluence of the part of the volume below the surface Overvew To approxmate obscurance at a certan pont n the volume, we avod ray castng. Instead, we ntroduce an approxmaton, whch s based on the probablty of the rays beng blocked by the volume. Instead of solvng A(p) and ts ntegral entrely, we consder a lmted regon around p, formed by volumes of ncreasng sze. The volume between successve volumes forms a layer of voxels, a so-called shell (Fgure 1.2). We wll show how to derve the probablty of a random ray to be blocked by a shell. From ths result, we deduce an approxmaton of the ntegral A(p) assumng that the entre volume s represented by a sngle shell. Fnally, the results for these varous shells are combned heurstcally to yeld our occluson approxmaton for the entre volume. Frst, we consder shells beng represented by a sphere wth a one-voxelwde boundary S. These shells are formed by a set of successve spheres,
4 4 1. Smooth Probablstc Ambent Occluson for Volume Renderng Fgure 1.2: A shell s a layer of voxels formed by the dfference between two dfferently-szed volumes. By creatng a cascade of these volumes, a set of shells s formed. For each shell, we approxmate the probablty of a ray to be blocked and combne these probabltes heurstcally to form the fnal obscurance value. whch each grow n radus by one voxel. In ths stuaton, f we consder one ndependent shell, any random ray sent from ts center wll ntersect exactly one voxel. If all drectons are equally lkely the probablty for a ray to be blocked then bols down to an average of all voxel values n the shell Average S (p). Lookng carefully at ths defnton, t turns out that ths probablty s equvalent to solvng for A n the presence of a sngle shell. If we now decompose the volume nto such a set of shells around a pont, we can compute the probablty of the rays to be blocked by each shell, but stll need to combne all these blockng contrbutons together. In order to do so, we make use of a heurstc. We assume a statstcal ndependence between the value dstrbutons n the varous shells. The probablty of rays orgnatng at p to be blocked by a set of n englobng shells {S } n =1 ordered from small to large s then gven by: n (1 Average S (p)). =1 To understand ths formula, t helps consderng only two layers {S 1, S 2 }. A random ray from p traverses S 1 wth probablty (1 Average S1 (p)). If ths ray passed S 1, t s agan, potentally, stopped by S 2, ths tme wth probablty (1 Average S2 (p)), yeldng a total probablty of (1 Average S1 (p))(1 Average S2 (p)). In the followng, we wll descrbe an effcent and GPU-frendly approach to compute an approxmaton of ths soluton.
5 1.2. Smooth Probablstc Ambent Occluson 5 Fgure 1.3: In ths 2D llustraton, the shell on the rght s a one voxel thck hull that s formed by subtractng the average opacty from level 1 n the mddle from level 2 on the left. Fgure 1.4: Cube shells used to approxmate obscurance Approxmatng Obscurance for Cube Shells In practce, we wll use box-shaped shells nstead of spheres (Fgure 1.3). We wll show n the next secton that ths choce wll allow us to beneft from GPU texture flterng to compute Average S, makng the algorthm very effcent. The cubes are chosen to be of ncreasng sze and centered at each pont p of the volume. The shells are then defned by hollowng out these cubes by subtractng the next-smaller cube from ts successor. In realty, these cubes wll never have to be explctly constructed, but t s helpful to thnk of them for llustratve purposes. The process s llustrated n Fgure 1.4. Followng the prevously descrbed steps, we need to deduce Average S for each of the shells, whch n our new stuaton corresponds to the average
6 6 1. Smooth Probablstc Ambent Occluson for Volume Renderng 0,0 0,0 0,0 0,0 0,0 0,1 0,0 0,0 0,0 0,0 0,0 1,0 0,0 0,0 0,1 0,1 0,1 0,0 0,0 0,0 0,0 1,0 0,0 0,0 0,1 0,3 0,1 0,0 0,0 0,0 0,0 1,0 1,0 1,0 1,0 0,3 0,3 0,3 0,1 0,0 0,5 1,0 1,0 1,0 1,0 0,5 0,3 0,3 0,3 0,1 0,5 0,5 0,5 1,0 1,0 0,5 0,3 0,3 0,3 0,1 0,0 0,5 0,5 1,0 1,0 0,5 1,0 0,3 0,1 0,0 0,0 0,5 0,0 0,0 1,0 1,0 1,0 0,1 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,3 0,3 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,3 0,3 0,0 0,0 0,1 0,1 0,0 0,0 0,0 0,0 0,0 0,5 0,5 0,0 0,1 0,2 0,2 0,1 0,0 0,0 0,0 0,0 0,5 0,8 0,5 0,5 0,4 0,3 0,2 0,1 0,0 0,0 0,1 0,6 1,0 1,0 1,0 0,7 0,4 0,3 0,3 0,1 0,0 0,3 0,6 0,8 0,9 1,0 0,8 0,4 0,3 0,3 0,2 0,1 0,1 0,4 0,5 0,8 1,0 0,8 0,6 0,5 0,3 0,1 0,0 0,0 0,3 0,4 0,4 0,8 0,9 0,9 0,6 0,1 0,0 0,0 0,0 0,1 0,1 0,0 0,3 0,6 0,7 0,4 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,1 0,2 0,1 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,1 0,1 0,1 0,1 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,1 0,1 0,1 0,1 0,0 0,1 0,1 0,0 0,0 0,0 0,0 0,2 0,3 0,3 0,4 0,3 0,2 0,2 0,1 0,1 0,0 0,0 0,3 0,4 0,5 0,6 0,5 0,4 0,3 0,2 0,1 0,1 0,1 0,3 0,4 0,6 0,8 0,6 0,5 0,4 0,3 0,2 0,1 0,1 0,3 0,4 0,7 0,9 0,8 0,7 0,6 0,4 0,3 0,1 0,1 0,2 0,3 0,5 0,7 0,7 0,8 0,6 0,4 0,3 0,1 0,0 0,1 0,2 0,3 0,5 0,5 0,6 0,5 0,4 0,2 0,1 0,0 0,1 0,1 0,2 0,3 0,3 0,4 0,4 0,3 0,2 0,0 0,0 0,0 0,0 0,0 0,1 0,1 0,2 0,2 0,2 0,1 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 Fgure 1.5: 2D Example of how N-buffers are calculated. A dataset s shown on the left, wth the frst two n buffer levels next to t. In each level the average of four values of the prevous level s combned nto one value. of all voxel values between two successve cubes. If we assume for now that we have a quck way of determnng the average nsde of a complete cube, we can rapdly determne Average S. To llustrate ths computaton, we wll assume that we want to determne Average S of a shell S defned two cubes C 1 and C 2, wth voxel-value averages A 1 and A 2 and number of voxels S 1, S 2 (S 1 < S 2 ), respectvely. The soluton s then gven by: Average S = (S 2 A 2 S 1 A 1 )/(S 2 S 1 ) In other words, we can subtract from the total voxel sum of one cube S 2 A 2, the total voxel sum of the next-smaller one (S 2 A 2 ) and normalze the result by the number of voxels n the shell between both (Fgure 1.3, lower row). Please notce, that the above formula can be rewrtten to: Average S = 1/(1 S 1 /S 2 )(A 2 (S 1 /S 2 )A1) - n consequence, only the average and the relatve change n sze (S 1 /S 2 ) s needed to deduce Average(S), whch facltates computatons further. Imagne, each cube s obtaned by doublng the length of each edge of the predecessor. Then the rato would be 1 : 8, resultng n Average S = 8/7(A 2 1/8 A 1 ) Fast Cube Averages In the prevous secton, we assumed to have a quck method to determne the average nsde of a cube. Here, we wll propose two possble solutons to ths problem. Our observaton s that, for a gven cube sze, the averages are equvalent to a box-flterng of the volume. Determnng averages of varous kernel szes s a common problem n computer graphcs n the context of texture mappng. These technques translate to correspondng operatons n a 3D volume. The most common such approxmaton s mpmappng, but we wll also present N-Buffers [Décoret 05], whch delver hgher qualty flterng at an addtonal cost.
7 1.3. Approxmatng Ambent Occluson 7 (a) (b) (c) Fgure 1.6: Volumetrc obscurance usng a) raytacng (256 rays/voxel) b) Mpmap flterng c) N-buffer flterng As mpmaps are rather standard, we wll only focus on N-buffers here. Lke mpmaps, they consst of multple levels l, each representng the average values of the orgnal volume nsde cubes of wdth 2 l. Unlke mpmaps, the resoluton of N-buffers s not reduced n each level. In consequence, t s possble to retreve the exact flled part of a cube at every poston n the volume, whereas for a mpmap lnear nterpolaton can provde only an approxmaton based on the eght closest voxels, whch reduces the qualty (Fgure 1.6). The N-Buffer constructon s effcent, as each new level can be computed from the prevous usng only 8 lookups. A 2D example of the calculaton s shown n Fgure 1.5. Nonetheless, N-Buffers result n hgher memory consumpton, so t can be useful to apply a few mpmap levels before processng the rest usng N-Buffers. 1.3 Approxmatng Ambent Occluson In Secton 1.2, we explaned that ambent occluson n comparson wth obscurance can provde cues that are closer to realstc lghtng because voxels behnd the pont of nterest are not taken nto account. To reduce ths effect, we can offset the lookup operatons n the drecton of the normal. When choosng the offset carefully, the ncrease n sze of the cubes and the offset can be correlated to obtan shells that correspond now to hemspheres. Ths goal can be acheved by multplyng the normal vector by half the sze of the box. An example wth a shorter vector s llustrated n Fgure 1.7. However, n DVR a normal s not always clearly defned, e.g., nsde
8 8 1. Smooth Probablstc Ambent Occluson for Volume Renderng Fgure 1.7: The lookups of the cubes from a pont wth a normal of length 0.75 n the upwards drecton. (a) Factor 0.0 (No normal correcton) (b) Factor 0.5 (c) Factor 1.0 (d) Factor 2.0 Fgure 1.8: Effect of the normal factor a homogeneous sem-transparent volume, e.g., a jelly puddng. Smlarly, between two dfferent sem-transparent voxels t mght be less clear how to defne a normal at the nterface between opaque and transparent materals. In consequence, we propose to scale the cube offset based on how strong the gradent s. Interestngly, whle most technques derve normals from the normalzed gradent va central dfferences, we can use the gradent magntude to determne f a normal s clearly defned. Hence, we propose to remove the normalzaton operaton and nstead normalze the voxel values themselves to the range [0,1], whch wll lead to the gradent becomng an approprately-scaled normal. Addtonally, we allow the user to specfy a global scale to ether pronounce or reduce the mpact of ths ambentoccluson approxmaton (Fgure 1.8).
9 1.4. Results 9 N-buffers Mpmaps Raytaced, 512 rays Level ms ms - Level ms 4.58 ms - Level ms 0.66 ms - Level ms 0.17 ms - Level ms 0.14 ms - Level ms 0.13 ms - Level ms 0.12 ms - Levels Total ms 38.8 ms - AO Computaton ms ms sec Total ms ms sec Table 1.1: Performance measurements for the Macoessx data set (512 x 512 x 512) for N-buffers and mpmaps based SPAO. For each technque we show the tme t takes to compute the ndvdual levels and to combne them nto an ambent occluson volume. 1.4 Results Our method has been mplemented n a CUDA-based stand-alone software program for drect DVR. The program and ts source code are avalable under the orgnal BSD lcense. It s shpped wth sample data sets. The transfer functon and, thus, the vsual representaton can be changed onthe-fly. Also, the user can select from three dfferent methods of ambent occluson computaton: mpmaps, N-buffers, and ray tracng. Our program makes use of CUDA 3.0 texture objects and wll not support lower CUDA versons. We tested the performance of our technque usng the publcly avalable Macoessx data set from the Osrx Webste 1, see Table 1.1. All tests were peformed on an Intel(r) Xeon(r) W3530 (2.80 GHz) workstaton wth 12 GB RAM and a GeForce GTX TITAN Graphcs Card wth 4 GB of RAM. N-buffers are slghtly more costly than Mpmaps, but both are orders of magntude faster than a volumetrc ambent-occluson ray tracer. The latter takes more than four mnutes, see Table 1.1. Fgure 1.9 shows some results of our approach on the Backpack and Manx data sets. 1
10 10 1. Smooth Probablstc (a) Backpack data set Ambent Occluson for Volume Renderng (b) Manx data set Fgure 1.9: SPAO appled to the Backpack (512 x 512 x 461) and Manx (512 x 512 x 460) data sets. 1.5 Concluson Ths chapter presents a novel approach to compute ambent occluson for drect DVR. We demonstrate that, by consderng the ambent-occluson computaton as a flterng process, we can sgnfcantly mprove effcency and make t usable n a real-tme DVR applcaton. Such an approach s useful for medcal vsualzaton applcatons were transfer functons are very often subject to change. Our approach s smple to mplement and effcent and leads to a very good qualty/performance tradeoff. Nonetheless, we also expermented wth more complex combnatons of the shells, especally, as the assumpton of ndependence of the occluson probabltes s usually not true n most data sets. In practce, t turns out that our soluton seems to be a good choce and any ncrease n complexty also led to a sgnfcant performance mpact. Nonetheless, ths topc remans nterestng future work. Further, we would lke to nvestgate to approxmate physcally-plausble lght transport, such as global llumnaton, wth our flterng technque, whch could further enhance the volume depcton.
11 BIBLIOGRAPHY 11 Bblography [Crassn et al. 10] Cyrl Crassn, Fabrce Neyret, Mguel Sanz, and Elmar Esemann. GPU Pro, Chapter X.3 Effcent Renderng of Hghly Detaled Volumetrc Scenes wth GgaVoxels, pp AK Peters, [Décoret 05] Xaver Décoret. N-Buffers for effcent depth map query., Avalable onlne ( Dec05). [Hernell et al. 10] Frda Hernell, Patrc Ljung, and Anders Ynnerman. Local ambent occluson n drect volume renderng., [Kajaln 09] Vladmr Kajaln. Screen Space Ambent Occluson. In ShaderX7, edted by Wolfgang Engel. Boston: Cengage Learnng, [Kroes et al. 12] Thomas Kroes, Frts H Post, and Charl P Botha. Exposure render: An nteractve photo-realstc volume renderng framework., [Langer and Bülthoff 99] Mchael S Langer and Henrch H Bülthoff. Depth dscrmnaton from shadng under dffuse lghtng., [Lndemann and Ropnsk 11] Floran Lndemann and Tmo Ropnsk. About the Influence of Illumnaton Models on Image Comprehenson n Drect Volume Renderng., [Penner and Mtchell 08] Erc Penner and Ross Mtchell. Isosurface ambent occluson and soft shadows wth flterable occluson maps., [Ropnsk et al. 08] Tmo Ropnsk, Jenns Meyer-Spradow, Stefan Depenbrock, Jörg Mensmann, and Klaus Hnrchs. Interactve volume renderng wth dynamc ambent occluson and color bleedng., [Stewart 03] A James Stewart. Vcnty shadng for enhanced percepton of volumetrc data., [Zhukov et al. 98] Sergey Zhukov, Andre Iones, and Grgorj Kronn. An ambent lght llumnaton model., 1998.
12
Monte Carlo Rendering
Monte Carlo Renderng Last Tme? Modern Graphcs Hardware Cg Programmng Language Gouraud Shadng vs. Phong Normal Interpolaton Bump, Dsplacement, & Envronment Mappng Cg Examples G P R T F P D Today Does Ray
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationSurface Mapping One. CS7GV3 Real-time Rendering
Surface Mappng One CS7GV3 Real-tme Renderng Textures Add complexty to scenes wthout addtonal geometry Textures store ths nformaton, can be any dmenson Many dfferent types: Dffuse most common Ambent, specular,
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationInteractive Virtual Relighting of Real Scenes
Frst submtted: October 1998 (#846). Edtor/revewers please consult accompanyng document wth detaled responses to revewer comments. Interactve Vrtual Relghtng of Real Scenes Célne Loscos, George Drettaks,
More informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationSome Tutorial about the Project. Computer Graphics
Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationImplementation of a Dynamic Image-Based Rendering System
Implementaton of a Dynamc Image-Based Renderng System Nklas Bakos, Claes Järvman and Mark Ollla 3 Norrköpng Vsualzaton and Interacton Studo Lnköpng Unversty Abstract Work n dynamc mage based renderng has
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationDiscussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Caching. Irradiance Calculation. Advanced Computer Graphics (Fall 2009)
Advanced Computer Graphcs (Fall 2009 CS 29, Renderng Lecture 6: Recent Advances n Monte Carlo Offlne Renderng Rav Ramamoorth http://nst.eecs.berkeley.edu/~cs29-13/fa09 Dscusson Problems dfferent over years.
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationDiscussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Fall 2009)
Advanced Computer Graphcs (Fall 2009 CS 283, Lecture 13: Recent Advances n Monte Carlo Offlne Renderng Rav Ramamoorth http://nst.eecs.berkeley.edu/~cs283/fa10 Dscusson Problems dfferent over years. Intally,
More informationInteractive Rendering of Translucent Objects
Interactve Renderng of Translucent Objects Hendrk Lensch Mchael Goesele Phlppe Bekaert Jan Kautz Marcus Magnor Jochen Lang Hans-Peter Sedel 2003 Presented By: Mark Rubelmann Outlne Motvaton Background
More informationAVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves
AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,
More informationReal-time. Shading of Folded Surfaces
Rhensche Fredrch-Wlhelms-Unverstät Bonn Insttute of Computer Scence II Computer Graphcs Real-tme Shadng of Folded Surfaces B. Ganster, R. Klen, M. Sattler, R. Sarlette Motvaton http://www www.vrtualtryon.de
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationRobust Soft Shadow Mapping with Depth Peeling
1 Robust Soft Shadow Mappng wth Depth Peelng Lous Bavol, Steven P. Callahan, Cláudo T. Slva UUSCI-2006-028 Scentfc Computng and Imagng Insttute Unversty of Utah Salt Lake Cty, UT 84112 USA August 11, 2006
More informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationGlobal Illumination: Radiosity
Last Tme? Global Illumnaton: Radosty Planar Shadows Shadow Maps An early applcaton of radatve heat transfer n stables. Projectve Texture Shadows (Texture Mappng) Shadow Volumes (Stencl Buffer) Schedule
More informationMonte Carlo 1: Integration
Monte Carlo : Integraton Prevous lecture: Analytcal llumnaton formula Ths lecture: Monte Carlo Integraton Revew random varables and probablty Samplng from dstrbutons Samplng from shapes Numercal calculaton
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationRobust Soft Shadow Mapping with Backprojection and Depth Peeling
paper 2008/3/20 15:47 page 19 #1 Vol. 13, No. 1: 19 29 Robust Soft Shadow Mappng wth Backprojecton and Depth Peelng Lous Bavol, Steven P. Callahan, and Claudo T. Slva Scentfc Computng and Imagng Insttute,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationMonte Carlo 1: Integration
Monte Carlo : Integraton Prevous lecture: Analytcal llumnaton formula Ths lecture: Monte Carlo Integraton Revew random varables and probablty Samplng from dstrbutons Samplng from shapes Numercal calculaton
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationRandom Kernel Perceptron on ATTiny2313 Microcontroller
Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationDesign of a Real Time FPGA-based Three Dimensional Positioning Algorithm
Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE,
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationLocal and Global Accessibility Evaluation with Tool Geometry
19 Local and Global Accessblty Evaluaton wth Tool Geometry Jnnan Wang 1, Chell A. Roberts 2 and Scott Danelson 3 1 Arzona State Unversty, wangn@asu.edu 2 Arzona State Unversty, chell.roberts@asu.edu 2
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationPictures at an Exhibition
1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSAO: A Stream Index for Answering Linear Optimization Queries
SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples
More informationColor in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model
Color n OpenGL Polygonal Shadng Lght Source n OpenGL Materal Propertes Normal Vectors Phong model 2 We know how to rasterze - Gven a 3D trangle and a 3D vewpont, we know whch pxels represent the trangle
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationMonte Carlo Integration
Introducton Monte Carlo Integraton Dgtal Image Synthess Yung-Yu Chuang 11/9/005 The ntegral equatons generally don t have analytc solutons, so we must turn to numercal methods. L ( o p,ωo) = L e ( p,ωo)
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationScan Conversion & Shading
Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationPlane Sampling for Light Paths from the Environment Map
jgt 2009/5/27 16:42 page 1 #1 Vol. [VOL], No. [ISS]: 1 6 Plane Samplng for Lght Paths from the Envronment Map Holger Dammertz and Johannes Hanka Ulm Unversty Abstract. We present a method to start lght
More informationOptimal Scheduling of Capture Times in a Multiple Capture Imaging System
Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationDiffuse and specular interreflections with classical, deterministic ray tracing
Dffuse and specular nterreflectons wth classcal, determnstc ray tracng Gergely Vass gergely_vass@sggraph.org Dept. of Control Engneerng and Informaton Technology Techncal Unversty of Budapest Budapest,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationClassification Based Mode Decisions for Video over Networks
Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4
More informationComplex Filtering and Integration via Sampling
Overvew Complex Flterng and Integraton va Samplng Sgnal processng Sample then flter (remove alases) then resample onunform samplng: jtterng and Posson dsk Statstcs Monte Carlo ntegraton and probablty theory
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More information