Plane Sampling for Light Paths from the Environment Map
|
|
- Marybeth Lloyd
- 6 years ago
- Views:
Transcription
1 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 paths on an emttng envronment map n the context of Monte Carlo global llumnaton wth mage-based lghtng or physcal sky models. Wth ths technque we can effcently render unbased caustcs from these knds of lghts, for example usng b-drectonal path tracng. Addtonally t s now possble to use algorthms lke multple mportance samplng, photon mappng and nstant radosty correctly wth envronment maps. 1. Introducton When smulatng lght transport usng Monte Carlo methods, all knds of paths connectng lght sources and the sensor must be generated. Even though all paths wll eventually be found by a smple path tracer (startng at the sensor and recursvely prolongng the path untl a lght source s found), some effects are best captured wth some specalzed samplng technque. A lght tracer for example, startng the random walk at the lght sources and determnstcally connectng to the sensor, s well suted to render caustcs. Other global llumnaton methods, such as photon mappng [Jensen 96], bdrectonal path tracng [Veach and Gubas 94] or pont lght source-based methods as nstant radosty [Keller 97] rely on paths started from the lght sources. Whle startng paths on geometrc lght sources s common practce, t s not as easy to start a path from an emttng envronment map wth a correct samplng densty. A K Peters, Ltd /06 $0.50 per page
2 jgt 2009/5/27 16:42 page 2 #2 2 journal of graphcs tools ω y ω y ω o ω o x Fgure 1. Two ways to sample dstant llumnaton: on the left, ω s obtaned by prolongng an eye path endng n x. On the rght, a pont y outsde the scene s needed to trace a drecton ω towards x. x 2. Background Analytc sky models or envronment maps n the form of captured mages [Debevec 98] approxmate dstant llumnaton by an nfntely large sphere around the scene. Thus the radance L(ω) emtted from the envronment only depends on the drecton ω for any pont n the scene. In a classcal path tracng settng, the drect llumnaton s evaluated by samplng a drecton at a pont x and evaluatng the vsblty of the envronment map (see Fgure 1, left). In a Monte Carlo renderer ths drecton s pcked accordng to a carefully chosen probablty densty functon n order to mnmze varance. In a b-drectonal algorthm ths s not as straght forward as we need to start a path from outsde the scene wth a correct and known probablty densty functon. For example n an nstant radosty-based renderer the ndrect llumnaton s approxmated by dstrbutng pont lghts va a random walk from the lght sources. When usng envronment maps the drect llumnaton can be evaluated as descrbed above. For ndrect llumnaton, sample ponts to start the lght paths have to be generated. Ths s llustrated on the rght hand sde of Fgure 1 where the desred samplng pont s marked as y. The problem s smlar to the samplng of parallel lght sources wth a correct samplng densty that was descrbed n [Pharr and Humphreys 04]. 3. Startng Lght Paths on the Envronment Map Envronment maps can be nterpreted as an nfnte collecton of parallel lght sources (one for each drecton). To start a partcle path from the envronment we dvde the problem nto frst samplng a drecton ω and then samplng an approprate startng pont y outsde the scene for the drectonal lght source assocated wth ω. Algorthmcally, we sample the drecton ω on the envronment map, ac-
3 jgt 2009/5/27 16:42 page 3 #3 Dammertz and Hanka: Plane Samplng for Lght Paths from the Envronment Map 3 mn u ω y max u Fgure 2. Illustraton of the sampled plane n 2d (left), and vsualzaton of sx sampled planes for a 3d scene. cordng to a probablty densty p(ω), for example p(ω) = 1/(4π). Then we create an orthonormal bass (u, v, ω) around ω, and project the eght corners of the boundng box of the scene onto the plane through the orgn spanned by (u, v), as llustrated n Fgure 2. From these projectons, we only keep a 2-dmensonal boundng box n the coordnate system of the plane (mnu, maxu, mnv, maxv). Ths quad s pushed outsde the boundng box of the scene. The exact dstance does not matter, as the quad s used as a parallel lght source. In practce, we project one vertex of the scene boundng box (or the center) onto ω and shft ths pont n the drecton ω by the sum of the three boundng box wdths. Pseudo-code for the plane generaton can be found n Fgure 3. Such a quad s easy to sample. The startng pont y can be chosen unformly on ths quad, whch results n the smple probablty densty p(y) = 1/ A y, wth A y beng the area of the quad. See Fgure 4 for pseudo-code of ths operaton. The estmator remans unbased as long as the quad s large enough to cover all of the scene. In order to maxmze the number of rays actually ntersectng the scene, the quad should be as small as possble. Apart from enablng the use of algorthms relyng on lght paths (nstant radosty, photon maps, etc.), the advantage of the new technque becomes apparent when the envronment map has a hgh dynamc range and mportance samplng s used,.e. p(ω) L(ω). We use sample warpng [Clarberg et al. 05] to sample ω accordng to the lumnance of the envronment map. 4. Comparson Wth the new technque t s now possble to create caustc paths from the envronment effcently. Other unbased technques generate these paths as well, but at a much lower convergence rate. For an llustraton of ths sgnfcant dfference, see Fgure 5. The envronment map contans a sun wth pxels 1000
4 jgt 2009/5/27 16:42 page 4 #4 4 journal of graphcs tools omega = envmap_sample(); nv_p = 1/p(omega); // account for p(omega) L = envmap_radance(omega); (u,v) = get_onb(omega); // create orthonormal bass (u,v,omega) for(nt c=0;c<8;c++) // project scene boundng box { dotu = dotproduct(aabb.corner[c], u); dotv = dotproduct(aabb.corner[c], v); mnu = mn(mnu, dotu); maxu = max(maxu, dotu); mnv = mn(mnv, dotv); maxv = max(maxv, dotv); } float dst = dotproduct(aabb.center, -omega) + aabb.wdth[0] + aabb.wdth[1] + aabb.wdth[2]; Fgure 3. Pseudo-code for the generaton of the quad from a sampled envronment drecton. Ths computaton can be reused for several samples. y = - dst * omega + u*(mnu + (maxu-mnu)*rand1) + v*(mnv + (maxv-mnv)*rand2); nv_p *= (maxu-mnu)*(maxv-mnv); // compensate for p(y) = 1/A partcle.energy = L*nv_p; partcle.y = y; partcle.omega = omega; Fgure 4. quad. Random samplng of the partcle startng pont on the precomputed tmes brghter as n the rest of the mage. All three path samplers use the same mportance samplng [Clarberg et al. 05] to evaluate drect lght, thus the same sharp shadow appears n all mages. However, usng ths knd of mportance samplng for drect lght only fals to capture caustcs. Metropols samplng helps, but wll waste a lot of samples n the sun, as the probablty s proportonal to the radance contrbuted to the mage. Of course Metropols samplng wll perform better when a b-drectonal path sampler s used and when the sun s not drectly vsble, especally n dffcult areas of the mage such as caustcs from multple nner reflectons seen through a mrror.
5 jgt 2009/5/27 16:42 page 5 #5 Dammertz and Hanka: Plane Samplng for Lght Paths from the Envronment Map 5 Fgure 5. Comparson of plan backward path tracng from the eye (left), the same path tracer wth Metropols samplng (mddle), and b-drectonal path tracng wth a lght tracng pass usng plane samplng (rght). Each example on the top row has equal computaton tme (about 5 mnutes on an AMD opteron). The path tracng acheves 342 samples n that tme, the Metropols verson can only evaluate 105, the b-drectonal method has 231 samples per pxel. The bottom row shows a comparson of equal sample count (500 samples per pxel). 5. Dscusson The plane samplng technque s a specalzed soluton to effcently capture promnent effects, such as caustcs, when mage-based lghtng s used. It s also most useful when b-drectonal algorthms are used whch rely on paths started from the lght sources, such as nstant radosty or photon mappng. A b-drectonal path tracer could work around ths by employng path tracng for these effects, but effcency wll be much lower f the envronment s nondffuse. However, there are cases n whch other technques are better. For example a mostly dffuse envronment such as a cloudy sky s best sampled by a path tracer, as mportance samplng by surface reflecton can be done. If only drect lghtng s of nterest to you, combned samplng of ncomng radance and surface reflecton [Clarberg and Akenne-Mo ller 08] s the way to go. The smple method descrbed above to sample a quad, whch s the 2dboundng box of a projected 3d-boundng box, can easly be extended to choose (u, v) to mnmze the sze of the quad, or be replaced by samplng for example a dsc (the projected boundng sphere) as was done n [Pharr and Humphreys 04]. We chose quads because most render systems have the axsalgned boundng box of the scene readly avalable, and t s then straghtforward to extend the technque to projecton maps to be used wth photon mappng or nstant radosty.
6 jgt 2009/5/27 16:42 page 6 #6 6 journal of graphcs tools Acknowledgments. The authors would lke to thank the revewers for ther helpful suggestons. Addtonally they want to thank mental mages GmbH for fundng parts of ths research, and Matthas Raab and Leonhard Grünschloß for many dscussons. References [Clarberg and Akenne-Möller 08] Petrk Clarberg and Tomas Akenne-Möller. Practcal product mportance samplng for drect llumnaton. In Computer Graphcs Forum (Proc. of Eurographcs 2008), pp , [Clarberg et al. 05] Petrk Clarberg, Wojcech Jarosz, Tomas Akenne-Möller, and Henrk Wann Jensen. Wavelet mportance samplng: effcently evaluatng products of complex functons. ACM Transactons on Graphcs 24:3 (2005), [Debevec 98] Paul Debevec. Renderng synthetc objects nto real scenes: brdgng tradtonal and mage-based graphcs wth global llumnaton and hgh dynamc range photography. ACM Transactons on Graphcs (Proc. SIGGRAPH 1998), pp [Jensen 96] Henrk Wann Jensen. Global llumnaton usng photon maps. In Renderng Technques 96 (Proc. of the Seventh Eurographcs Workshop on Renderng), pp , [Keller 97] Alexander Keller. Instant Radosty. ACM Transactons on Graphcs (Proc. SIGGRAPH 1997), pp [Pharr and Humphreys 04] Matt Pharr and Greg Humphreys. Physcally Based Renderng: From Theory to Implementaton. Morgan Kaufmann Publshers Inc., [Veach and Gubas 94] Erc Veach and Leondas Gubas. Bdrectonal estmators for lght transport. In Renderng Technques 94 (Proc. of the Ffth Eurographcs Workshop on Renderng), pp , Web Informaton: Hgh-resoluton mages, the Blender fle used to synthesze the mages n Fgure 5, and a vdeo can be found at Holger Dammertz, Ulm Unversty, James-Franck Rng, Ulm (holger.dammertz@un-ulm.de) Johannes Hanka, Ulm Unversty, James-Franck Rng, Ulm (johannes.hanka@un-ulm.de) Receved [DATE]; accepted [DATE].
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationSurface Integrators. Digital Image Synthesis Yung-Yu Chuang 12/20/2007
Surface Integrators Dgtal Image Synthess Yung-Yu Chuang 12/20/2007 wth sldes by Peter Shrley, Pat Hanrahan, Henrk Jensen, Maro Costa Sousa and Torsten Moller Drect lghtng va Monte Carlo ntegraton dffuse
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 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 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 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 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 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 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 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 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 informationRealistic Rendering. Traditional Computer Graphics. Traditional Computer Graphics. Production Pipeline. Appearance in the Real World
Advanced Computer Graphcs (Fall 2009 CS 294, Renderng Lecture 11 Representatons of Vsual Appearance Rav Ramamoorth Realstc Renderng Geometry Renderng Algorthm http://nst.eecs.berkeley.edu/~cs294-13/fa09
More informationReal-Time Volumetric Shadows using 1D Min-Max Mipmaps
Real-Tme Volumetrc Shadows usng 1D Mn-Max Mpmaps Jawen Chen 1 Ilya Baran 2 Frédo Durand 1 Wojcech Jarosz 2 1 MIT CSAIL 2 Dsney Research Zürch eye vew rays lght rectfed vew drecton lght rays rectfed lght
More informationSimplification of 3D Meshes
Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
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 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 informationA Range Image Refinement Technique for Multi-view 3D Model Reconstruction
A Range Image Refnement Technque for Mult-vew 3D Model Reconstructon Soon-Yong Park and Mural Subbarao Electrcal and Computer Engneerng State Unversty of New York at Stony Brook, USA E-mal: parksy@ece.sunysb.edu
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 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 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 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 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 informationLight Factorization for Mixed-Frequency Shadows in Augmented Reality
Lght Factorzaton for Mxed-Frequency Shadows n Augmented Realty Dere Nowrouzezahra 1 Stefan Geger 2 Kenny Mtchell 3 Robert Sumner 1 Wojcech Jarosz 1 Marus Gross 1,2 1 Dsney Research Zurch 2 ETH Zurch 3
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
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 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 informationPhotorealistic Image Rendering with Population Monte Carlo Energy Redistribution
EUROGRAPHICS 0x / Jan Kautz and Sumanta Pattanak (Edtors) Volume 0 (1981), umber 0 Photorealstc Image Renderng wth Populaton Monte Carlo Energy Redstrbuton Y.-C. Yu-Ch 1 and S.H. Fan 1 and S. Chenney 2
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 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 informationAccelerating X-Ray data collection using Pyramid Beam ray casting geometries
Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
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 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 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 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 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 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 informationPBRT core. Announcements. pbrt. pbrt plug-ins
Announcements PBRT core Dgtal Image Synthess Yung-Yu Chuang 9/27/2007 Please subscrbe the malng lst. Wndows complaton Debuggng n Wndows Doxygen (onlne, download or doxygen by yourself) HW#1 wll be assgned
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 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 informationFast and accurate view factor generation
FICUP An Internatonal Conference on Urban Physcs B. Beckers, T. Pco, S. Jmenez (Eds.) Quto Galápagos, Ecuador, 6 30 September 016 Fast and accurate vew factor generaton Benot Beckers 1 and Perre Beckers
More informationReal-time Rendering of Enhanced Shallow Water Fluid Simulations
Real-tme Renderng of Enhanced Shallow Water Flud Smulatons Jesús Ojeda a, Antono Susín b a Dept. LSI, Unverstat Poltècnca de Catalunya b Dept. MA1, Unverstat Poltècnca de Catalunya Abstract The vsualzaton
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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationPHYSICS-ENHANCED L-SYSTEMS
PHYSICS-ENHANCED L-SYSTEMS Hansrud Noser 1, Stephan Rudolph 2, Peter Stuck 1 1 Department of Informatcs Unversty of Zurch, Wnterthurerstr. 190 CH-8057 Zurch Swtzerland noser(stuck)@f.unzh.ch, http://www.f.unzh.ch/~noser(~stuck)
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 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 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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationLine Clipping by Convex and Nonconvex Polyhedra in E 3
Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz
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 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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
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 informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationChapter 1. Comparison of an O(N ) and an O(N log N ) N -body solver. Abstract
Chapter 1 Comparson of an O(N ) and an O(N log N ) N -body solver Gavn J. Prngle Abstract In ths paper we compare the performance characterstcs of two 3-dmensonal herarchcal N-body solvers an O(N) and
More informationWelcome to the Three Ring %CIRCOS: An Example of Creating a Circular Graph without a Polar Axis
PharmaSUG 2018 - Paper DV14 Welcome to the Three Rng %CIRCOS: An Example of Creatng a Crcular Graph wthout a Polar Axs Jeffrey Meyers, Mayo Clnc ABSTRACT An nternal graphcs challenge between SAS and R
More informationTracking by Cluster Analysis of Feature Points and Multiple Particle Filters 1
Tracng by Cluster Analyss of Feature Ponts and Multple Partcle Flters 1 We Du, Justus Pater Unversty of Lège, Department of Electrcal Engneerng and Computer Scence, Insttut Montefore, B28, Sart Tlman Campus,
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 informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
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 informationSCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS
SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationRail-Track Viewer An Image-Based Virtual Walkthrough System
Eghth Eurographcs Workshop on rtual Envronments (00) S. Müller, W. Stürzlnger (Edtors) Ral-Track ewer An Image-Based rtual Walkthrough System Lnng Yang, Roger Crawfs Department of Computer and Informaton
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 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 informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
More information