Diffuse and specular interreflections with classical, deterministic ray tracing
|
|
- Earl Carpenter
- 6 years ago
- Views:
Transcription
1 Dffuse and specular nterreflectons wth classcal, determnstc ray tracng Gergely Vass Dept. of Control Engneerng and Informaton Technology Techncal Unversty of Budapest Budapest, Hungary Abstract Today almost all the free as well as the commercal 3d graphcs applcatons - whch clam to be photorealstc - are capable to render mages usng the ray tracng algorthm. Ths method handles only one knd of lght transport between surfaces, namely the total, mrror-lke reflecton. In ths paper a smple practcal method s gong to be presented to extend the capabltes of the classcal ray tracng algorthm. The proposed workflow makes dffuse lght transport possble and the use of area lghts nstead of the common pont, spot and drectonal lghts. The possble dffcultes applyng the proposed procedure n dfferent software envronments s gong to be dscussed as well. Keywords: renderng, global llumnaton, ray tracng, reflecton 1. Introducton The great mprovement n the computng power of standard desktop computers made possble to use complex renderng softwares to generate photorealstc mages [5]. There are many commercal 3d graphcs applcatons on the market, whch smulate the behavor of lght so convncngly, that the resultng mage looks real. These programs use state of the art technology and are hard to get acces to. The wdely used and the free 3d applcatons generate mages n much less tme, but use smpler renderng methods. These algorthms - lke ray tracng - make lot of compromse n order to avod long render tmes keepng the mage as real as possble. In the next part these smple and commonly used renderng methods wll be dscussed focusng on ther strengths and weaknesses. 1.1 The Common Renderng Algorthms Today's graphcs systems are pxel based. Ths makes the basc step of mage synthess the calculaton for each pxel's color. Ths color value s proportonal to the ncomng radance to the camera from a gven drecton. Ths physcal value s a very hard and resource ntensve problem to solve for, even f the wave propertes of lght or the presence of lquds and gases are gnored. The problem can be expressed n the form of the renderng equaton [6]:
2 e L( ω ) = L ( + L( ω ), ω ) f ( ω, cosθ dω Ω r (1) Ths equaton shows how the radance ( L( x, ) can be calculated from a gven surface element: the surface's lght emsson ( L e ( ) and the fracton of the ncomng lght that reflects to the camera should be added together. In order to express the second term the lght from all possble ncomng drecton should be taken nto account weghted wth the bdrectonal reflectance dstrbuton functon (BRDF) and the cosne of the ncomng angle. Let us ntroduce the τ ntegral operator, whch descrbes the lght-surface nteracton: ( τl)( = L( ω ), ω ) f ω x ω θ dω r (,, ) cos Ω (2) Usng the operator above the renderng equaton can be wrtten n a compact form: e L = L +τ L (3) The unknown radance L s both dfgd nsde and outsde of the operator, whch makes the problem very complex. Because the operator cannot be nverted t os not possble to elmnate the couplng. Fortunately the problem can be solved usng a smple trck: the whole rght sde should be substtuted n the unknown functon of the same sde. Ths transforms the ntegral equaton nto an nfnte seres: = L = 0 e e e 2 e 3 e τ L = L + τ L + τ L + τ L +... (4) The elements represent the drect emsson, the sngle reflecton, the secondary reflecton and so on. The elements of the seres are ntegrals wth ncreasng dmensons. The smple renderng algorthms do not even try to solve the equaton n ths form. The local llumnaton method tres to
3 solve for only the frst two elements of the seres, ray tracng elmnates the ntegral from every element makng the seres nto a much smpler sum. Local Illumnaton Almost all of the commonly used 3d graphcs programs make use of the local llumnaton model. Ths s a drastc smplfcaton of the renderng equaton. It s assumed that the look of real world surfaces can be determned by calculatng drect emsson and sngle reflecton only. The rest of the nfnte seres s expressed n one, user defned ambent term. Usng ths assumpton only one ntegral of one dmenson should be calculated. Ths ntegral s supposed to sum the ncomng radance from all drectons. Because ths calculaton s stll hard and tme consumng to do the local llumnaton model smplfes the equaton even more. It s known that ntegratng any combnaton of Drac delta functons s very easy, snce the ntegral equals the sum of few values. In the case of the renderng equaton the ncomng radance s a combnaton of Drac delta functons only f the lght sources are nfntesmally small. The local llumnaton model uses only ambent, drectonal, pont and spotlghts - and gnores objects wth self llumnaton - when calculatng the ncomng radance n order to elmnate the hard ntegral. Ths model would be useless f the generated pctures were far from real but fortunately that s not the case. In real lfe and especally n case of artfcally lt envronments the domnant lght sources determne the look of objects, and the ntersurface lght reflectons have only secondary mportance. In cases when reflected lght acts as mportant lght source n the local llumnaton envronment the user have to defne more abstract lghts to acheve the desred effect. Ths method s physcally ncorrect and t mght be uncomfortable as well, however n producton envronment the method has proven t's usablty [1]. The renderng equaton usng the local llumnaton model turns out to be very smple due to the Drac delta type lght sources: numberoflghts e L( = L ( + LIGHT ( ω ) = 1 f ( ω, ω ) cosθ + AMBIENT r (5) Where the functon LIGHT ( represents the the ncomng radance from the -th lghtsource to the pont x from the drecton ω. In ths equaton the renderng equaton (1) s reduced to the sum of few, easly computable terms. Recursve Ray tracng The ray tracng algorthm [4] s a very common extenson of the local llumnaton method. Usng ray tracng the total reflecton and the refracton of lght can be smulated correctly. Ths effect s very mportant snce the reflecton seen on shny surfaces - lke chrome, glass or car pant - determne the overall look of these objects. The mplementaton of ray tracng s based on the local llumnaton model. Knowng the normal vector of the rendered surface element the reflecton and refracton drectons can be calculated. Callng the already mplemented local llumnaton algorthm n these drectons the value of the ncomng lght reflected or refracted toward the camera can be easly calculated. Ths process s able to work recursvely and follow a ray" from the camera along the path of the ncomng lght rays.
4 numberoflghts e L( = L ( + LIGHT ( ω ) f r ( ω, cosθ + = 1 reflect reflect refract refract + L( ω ), ω ) RL + L( ω ), ω ) RR + AMBIENT (6) Ths formula s the extenson of the equaton for local llumnaton (5). The two new terms are the reflected and refracted lght rays whch can be calculated recursvely. If no abstract lghts are used for the local llumnaton the only thng that effects the fnal renderng s the self llumnaton and ray tracng: e reflect reflect refract L( = L ( + L( ω ), ω ) RL + L( ω ), ω refract ) RR Ths equaton s practcally equaton (6) wthout the terms of equaton (5). If only non-transparent surfaces are used the thrd term can be gnored. Consderng the frst two terms t s surprsngly smlar to the renderng equaton n the form of equaton (3). The recursve ray tracng algorthm doesn't neglect any term of the nfnte seres, the only smplfcaton comparng to the orgnal s the BRDF whch conssts of Drac mpulses. Ths lkelness makes the use of the ray tracng method possble to calculate the renderng equaton, or n other words: to solve global llumnaton problems. Global Illumnaton There are numerous methods to solve the renderng equaton [6] wth no - or not much - smplfcaton. These algorthms - lke Monte Carlo ntegraton [8] - often handle not only mrror lke surfaces but glossy and dffuse objects as well and are called global llumnaton renderers. The goal s to acheve the same realstc result wth the commonly used ray tracng softwares wthout the need of modfyng the program. (7) 1.2 Fake Radosty" There are some trcks used n the 3d graphcs communty ntended to smulate the effect of global llumnaton. These trcks - often called fake radosty" methods - can be classfed nto two major groups: Non-automatc process: the user places secondary pont lghts near brght areas smulatng the effect of dffuse lght reflecton. Ths can be very tedous and slow process. Automatc process [3]: ths trck s smlar to the proposed method n ths paper, but works for only one object at a tme. The user has to flter or blur manually a very bad qualty - nosy - result and usually composte t back to the rendered mage calculated wth local llumnaton. The proposed method works for all objects n the scene and s far more physcally accurate than the avalable fake radosty" trcks.
5 Fgure 1. Images generated usng local llumnaton, ray tracng and global llumnaton methods. 2. Extendng Ray tracng The man goal s to prepare the ray tracng algorthm to handle glossy and dffuse reflecon. The local llumnaton capablty of the softwares s not used at all, snce t doesn't calculates any secondary lght reflecton. However, local llumnaton usng models lke Phong and Lambert could be used to calculate the frst shoot or the drect llumnaton of lghts but ths opton was thrown away because the followng reason. It requred to have pont lghts defned nstead of lght emttng objects thus the characterstc shadows would be not soft at all. In fact the local llumnaton method s not able to generate realstc soft shadows, whch s overcomed usng ray tracng for the frst shoot too. 2.1 Creatng Dffuse Surfaces It has to be nvestgated how dffuse materals work n the real world to acheve the same result on the vrtual surfaces. The perfectly dffuse behavor s descrbed by the Lambert model. Ths model supposes that the ncomng lght s reflected n all drectons wth the same ntensty. In realty dffuse objects have such mcroscopc structure that the ncomng rays are reflected to all drecton ndependently from the ncomng drecton. The algorthms whch use the mcrofacet model [2,9] smulate ths effect wth lttle, randomly orented mcromrrors called facets. Ths dea s very useful to create dffuse or glossy materals whle renderng wth ray tracng. The 3D programs offer usually 3 alternatve ways do defne the geometry or the structure of the surface [11]. One way should be chosen to create these random dsplacements n order to create dffuse surfaces.
6 2.2 Defnng Structure Mcrostructure: Usng the local llumnaton model an emprcal BRDF - lke Phong or Lambert model s assgned to every surface. Ths means that the lght reflecton propertes of some materal due to the mcroscopc and atomc structure are smulated by abstract mathematcal formulas. Durng ray tracng these llumnaton models are unmportant n determnng the reflecton and refracton drectons, thus these formulas wll not be used. Macrostructure: The structure of dffuse and glossy surfaces can be modeled usng standard and wdespread surface modelng methods. Ether NURBS, polygon or subdvson surfaces could be used to descrbe the geometry of the surface. However, ths approach requres lot of memory - way more than an average user has - to store even a very smple and rough estmaton of some dffuse surface. Mesostructure: To model the vsble roughness of a surface bump maps are used. These requre very lttle memory - especally when usng procedural textures - and are able to change the reflecton and refracton drectons durng ray tracng. The man dea of bump maps s that usng the partal dervatves of a standard texture the normal vector of the surface can be perturbed. Ths creates the mpresson n the vewer as f there were bumps on the surface. It s the deal for us to choose ths approach snce t s supported n all 3d graphcs packages, t s fast and requres almost no memory. 2.3 Settng Up the Materal Attrbutes The only thng that affects the lght reflecton propertes of the materals s the bump map. The goal s to create surfaces that can reflect lght n every possble drecton. To make a dffuse materal based on the Lambert rule t s necessary that the probablty densty of the drecton of the reflected ray to be constant. Ths means the bump map rotates the normal vector n any drecton wth the same probablty. If the bump s smoother more rays wll be reflected towards the deal reflecton drecton and the Fgure 2: Mcrostructure Fgure 3: Macrostructure Fgure 4: Mesostructure
7 materal wll look glossy. To acheve ths effect a very dense, hgh frequency bump map should be used snce the user does not want to see the actual mcroscopc structure of the materal. However, there are lots of materals n real lfe whch do not work ths way. Satn, velvet and dense har have such mcroscopc structure that the majorty of the reflected rays pont not toward the deal reflecton. These non-sotropc structures [2] can be modeled wth such bump maps that reproduce the effect of mcroscopc features shadowng certan drectons or reflectng lght to another specfc drecton. The frst attempt to defne the bump map was to generate textures that would represent a user gven normal vector dstrbuton. Ths approach has had seruos dsadvantages: - The repeatng texture was notcable on the fnal renderng. - If the bump map was scaled very small to avod the artfact above, the bump smply dsappeared because of the renderng software s ant-alasng method [10]. The next approach was to perturb the normal vector wth a custom scrpt. Ths would not work, however, because even the most advanced 3D applcatons are not prepared to gve ths opton to the user. The way of generatng bump maps n the research turned out to be usng bult n textures. These textures generate nosy dsplacements wth no vsble repettons. Modfyng the gan of the texture the depth of the bumps could be changed, thus the lght reflecton propertes of the materal also changed. By modfyng the texture parameters and renderng test pctures the dffuse or glossy behavor could be acheved. Fgure 5: Usng the same texture wth dfferent gan to generate the bump map.
8 3. Renderng Usng the ray tracng renderng method to defne the pcture, the program shoots rays from each pxel to ht a surface. If an object s ht - and no local llumnaton s used the color of the current surface element s calculated usng equaton (7). Snce ths process s a recursve one the rays from the camera do not stop at the frst ntersecton but follow certan paths along the reflectons. These paths wll be used certanly more for each pxel to calculate the color of the pxel defned by the renderng equaton (1). 3.1 Gatherng Walks As stated above the rays shot from the camera follow a path or gatherng walk snce they are reflected at each surface collectng the ncomng radance. Every tme one of these rays hts a surface the collected lght s the sum of the self llumnaton and the lght from the reflecton. There mght be two knd of dangerous stuatons whle renderng: - The path may not reach any object emttng lght. Ths s because ray tracng s stopped after certan number of reflecton. Ths threshold number s user defned. To overcome ths stuaton very large objects were used as lght sources. - If the lght emttng objects are also reflectve the ray tracng process does not stop untl reachng the threshold number. Because the reflecton seen on lght sources are usually not vsble non-reflectve objects were used to emt lght. 3.2 Samplng Apparently one ray shot from each pxel s not enough. To understand why many gatherng walks should be started from each pxel the common ntegral formula should be nvestgated. Ths s useful snce the goal s to calculate the ntegral of equaton (1). V f ( z) dz 1 n n = 1 f ( z ) s( z ) (8) where n s the number of samples, s() s the weght functon and z are the samplng ponts. In the actual case the radance value gven by the renderng equaton should be estmated for each surface element ht wth a ray. Ths means the samples wll be the values of reflected lght rays n dfferent drectons. The more rays are shot from the pxels the more accurate the result wll be. If a bump map defnng glossy reflecton s appled more rays samples wll be reflected toward the drecton of the deal reflecton. If the bump defnes a dffuse materal all samples wll have probably dfferent drecton. No gatherng walk s more mportant than the other, thus no weght functon s used: n e L( L ( + =1 L( ω ), ω ) R n (9) where n s the number of samples for each pxel and ths equaton the refracton s gnored. ω s the reflecton drecton of the -th ray. In
9 The man queston s: what n should be used to acheve good qualty? There s no global answer snce the amount of nose seen on the pcture and renderng tme s n drect proporton to the number of samples. 3.3 Fgure 6: The same scene rendered usng 1,3,10,32 and 320 samples for each pxel
10 3.3 Reducng Nose The 3D applcaton used [7,10] for the tests let the number of samples to be 32 at maxmum whch turned out to be not enough. To overcome ths lmtaton more mages should be rendered from the same scene. If the renderer uses stochastc samplng and the random generator uses dfferent seeds for each frame - the startng ponts of the gatherng walks wll be at slghtly dfferent poston. Averagng these pctures the result wll be as f more samples were used for each pxel. Apparently the user should not rely on the renderer ths much snce the same result can be acheved usng only one sample for each pxel even f the samplng postons are statc. The trck s to anmate the poston of the bump texture. Dong ths the reflecton drectons wll obvously change snce bump map changed whle the probablty densty of the reflecton drecton wll fortunately not be affected. The mages rendered ths way can be averaged together producng the same mage as f t was rendered wth a very hgh number of samples. 4. Conclusons Usng the proposed method global llumnaton problems can be solved wthout any major smplfcaton usng standard 3D packages wth ray tracng capabltes. The user can defne lght emttng objects nstead of abstract pont lght thus generatng realstc soft shadows. The specular and dffuse nterreflectons can be smulated as well not lke whle usng the renderer the conventonal way. The applcaton of the method does not requre any specal tranng or programmng knowledge, any standard even freeware renderers can be used. Unfortunately the generaton takes long and the fnal pctures contan sgnfcant nose. To reduce ths artfact the number of samples should be extremely ncreased causng the computer to render even longer. Ths nose makes for most of the cases mpossble to use the pctures wthout any modfcaton or flterng. However, there are many ways to make use of ths process n producton envronment. The generated pctures are great vsual references for the techncal drectors how to lt ther scenes usng local llumnaton. It s also useful to flter out the hgh frequency nose and use the generated pctures as textures for the objects n the scene. The subject of future nvestgaton mght be the effcent reducton of the nose wth some custom flter or other method. The generaton of any mcrofacet structure would be also useful to render non-sotropc objects. 5. Acknowledgements Ths work has been supported by the Natonal Scentfc Research Fund (OTKA ref. No.:T029135). The test scene wth the car has been modelled and rendered by Maya, that was generously donated by Alas Wavefront.
11 6. References [1] Apodaca, T., Grtz, L.: Advanced Renderman Creatng CG for Moton Pcture (chapter 1.), Morgan Kaufmann, [2] Ashkhmn, M., Premoze, S., Shrley, P.: A mcrofacet-based BRDF generator, n Proceedngs of SIGGRAPH 2000, p [3] Campn, E.: Fakng radosty n Maya (tutoral), [4] Glassner, A.: An Introducton to Ray Tracng, Academc Press New York, [5] Greenberg, D., Torrance, K., Shrley, P., Arvo, J., Ferwerda, J., Pattanak, S., Lafortune, E., Walter, B., Foo, S., Trumbore, B.: A framework for realstc mage synthess, n Proceedngs of SIGGRAPH 97, p [6] Kajya, J. T.: The renderng equaton, n Proceedngs of SIGGRAPH 86, p [7] Pearce, A., Sung, K.: Maya software renderng a techncal overvew, Alas Wavefront, 1998, [8] Szrmay-Kalos, L.: Monte-Carlo Methods n Global Illumnaton, [9] Szrmay-Kalos, L., Kelemen, Cs.: A mcrofacet based coupled specular-matte BRDF model wth mportance samplng, Eurographcs Conference, 2001, Short presentatons, pp [10] Woo, A.: Alasng artfacts n Maya a techncal overvew, Alas Wavefront, 1998, [11] Yu, Y.: Image-Based Surface Detals (ntroducton), Course 16 n Course Notes of SIGGRAPH 2000, p. 1-1.
Discussion. 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 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 informationComputer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides)
Computer Graphcs Jeng-Sheng Yeh 葉正聖 Mng Chuan Unversty (modfed from Bng-Yu Chen s sldes) llumnaton and Shadng llumnaton Models Shadng Models for Polygons Surface Detal Shadows Transparency Global llumnaton
More informationMonte 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 informationGlobal Illumination and Radiosity
Global Illumnaton and Radosty CS535 Danel G. Alaga Department of Computer Scence Purdue Unversty Recall: Lghtng and Shadng Lght sources Pont lght Models an omndrectonal lght source (e.g., a bulb) Drectonal
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 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 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 informationGlobal Illumination and Radiosity
Global Illumnaton and Radosty CS535 Danel G. Alaga Department of Computer Scence Purdue Unversty Recall: Lghtng and Shadng Lght sources Pont lght Models an omndrectonal lght source (e.g., a bulb) Drectonal
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 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 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 informationComputer graphics III Light reflection, BRDF. Jaroslav Křivánek, MFF UK
Computer graphcs III Lght reflecton, BRDF Jaroslav Křvánek, MFF UK Jaroslav.Krvanek@mff.cun.cz Basc radometrc quanttes Image: Wojcech Jarosz CG III (NPGR010) - J. Křvánek 2015 Interacton of lght wth a
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 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 informationForm-factors Josef Pelikán CGG MFF UK Praha.
Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23 Form-factor F It ndcates the proporton
More informationGlobal Illumination and Radiosity
Global Illumnaton and Radosty CS535 Danel lg. Alaga Department of Computer Scence Purdue Unversty Recall: Lghtng and Shadng Lght sources Pont lght Models an omndrectonal lght source (e.g., a bulb) Drectonal
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 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 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 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 informationLighting. Dr. Scott Schaefer
Lghtng Dr. Scott Schaefer 1 Lghtng/Illumnaton Color s a functon of how lght reflects from surfaces to the eye Global llumnaton accounts for lght from all sources as t s transmtted throughout the envronment
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 informationComputer Sciences Department
Computer Scences Department Populaton Monte Carlo Path Tracng Yu-Ch La Charles Dyer Techncal Report #1614 September 2007 Populaton Monte Carlo Path Tracng Yu-Ch La Unversty of Wsconsn at Madson Graphcs-Vson
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 informationGlobal Illumination. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd 3/26/07 1
Global Illumnaton Computer Graphcs COMP 770 (236) Sprng 2007 Instructor: Brandon Lloyd 3/26/07 1 From last tme Robustness ssues Code structure Optmzatons Acceleraton structures Dstrbuton ray tracng ant-alasng
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 informationScan Conversion & Shading
1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
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 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 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 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 informationMotivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009)
Advanced Comuter Grahcs Fall 29 CS 294, Renderng Lecture 4: Monte Carlo Integraton Rav Ramamoorth htt://nst.eecs.berkeley.edu/~cs294-3/a9 Motvaton Renderng = ntegraton Relectance equaton: Integrate over
More informationPhysics 132 4/24/17. April 24, 2017 Physics 132 Prof. E. F. Redish. Outline
Aprl 24, 2017 Physcs 132 Prof. E. F. Redsh Theme Musc: Justn Tmberlake Mrrors Cartoon: Gary Larson The Far Sde 1 Outlne Images produced by a curved mrror Image equatons for a curved mrror Lght n dense
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 informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
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 informationTopic 13: Radiometry. The Basic Light Transport Path
Topc 3: Raometry The bg pcture Measurng lght comng from a lght source Measurng lght fallng onto a patch: Irraance Measurng lght leavng a patch: Raance The Lght Transport Cycle The BrecAonal Reflectance
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationFast, Arbitrary BRDF Shading for Low-Frequency Lighting Using Spherical Harmonics
Thrteenth Eurographcs Workshop on Renderng (2002) P. Debevec and S. Gbson (Edtors) Fast, Arbtrary BRDF Shadng for Low-Frequency Lghtng Usng Sphercal Harmoncs Jan Kautz 1, Peter-Pke Sloan 2 and John Snyder
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 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 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 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 informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More 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 informationRendering of Complex Materials for Driving Simulators
Renderng of Complex Materals for Drvng Smulators Therry Lefebvre 1,2 +33 (0)1.76.85.06.64 therry.t.lefebvre@renault.com Andras Kemeny 1 +33 (0)1.76.85.19.85 andras.kemeny@renault.com Dder Arquès 2 +33
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
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 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 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 informationWhat are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry
Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape
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 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 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 informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationConsistent Illumination within Optical See-Through Augmented Environments
Consstent Illumnaton wthn Optcal See-Through Augmented Envronments Olver Bmber, Anselm Grundhöfer, Gordon Wetzsten and Sebastan Knödel Bauhaus Unversty Bauhausstraße 11, 99423 Wemar, Germany, {olver.bmber,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
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 informationIntroduction to Radiosity
EECS 487: Interactve Computer Graphcs EECS 487: Interactve Computer Graphcs Renderng a Scene Introducton to Radosty John. Hughes and ndres van Dam rown Unversty The scene conssts of a geometrc arrangement
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 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 informationDIFFRACTION SHADING MODELS FOR IRIDESCENT SURFACES
DIFFRACTION SHADING MODELS FOR IRIDESCENT SURFACES Emmanuel Agu Department of Computer Scence Worcester Polytechnc Insttute, Worcester, MA 01609, USA emmanuel@cs.wp.edu Francs S.Hll Jr Department of Electrcal
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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB
SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal
More informationHelp for Time-Resolved Analysis TRI2 version 2.4 P Barber,
Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More 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 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 informationAn exhaustive error-bounding algorithm for hierarchical radiosity
An exhaustve error-boundng algorthm for herarchcal radosty Ncolas Holzschuch, Franços X. Sllon To cte ths verson: Ncolas Holzschuch, Franços X. Sllon. An exhaustve error-boundng algorthm for herarchcal
More informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
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 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 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 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 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 informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More 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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
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 informationComparison of calculation methods and models in software for computer graphics and radiative heat exchange
Comparson of calculaton methods and models n software for computer graphcs and radatve heat exchange Insttute of Electrcal and Electroncs Engneerng Poznan Unversty of Technology ul. Potrowo 3A, 60-950
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
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 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 informationEfficient Region-Based Pencil Drawing
Effcent Regon-Based Pencl Drawng Shuo Sun Tanjn, 300160 Chna, School of Scence Tanjn Polytechnc Unversty Sunshuo_0@163.com Dongwe Huang Tanjn, 300160 Chna, School of Scence Tanjn Polytechnc Unversty tjhuangdw@163.com
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
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 informationPetri Net Based Software Dependability Engineering
Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013
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 informationTechnical report, November 2012 (Revision 2, July 2013) Implementing Vertex Connection and Merging
Techncal report, November 22 Revson 2, July 23) Implementng Vertex Connecton and Mergng Ilyan Georgev Saarland Unversty Intel VCI, Saarbrücken Stage : a) Trace lght sub-paths b) Connect lght vertces to
More informationLoop Transformations, Dependences, and Parallelization
Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson
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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More information