Precomputed Radiance Transfer with Spatially-Varying Lighting Effects
|
|
- Mildred McBride
- 5 years ago
- Views:
Transcription
1 Precomputed Radiance Transfer with Spatially-Varying Lighting Effects Masahiro Fujita Keio University SFC Graduate School of Media and Governance Takashi Kanai Keio University SFC Faculty of Environmental Information Abstract We propose a new method to render physicallybased globally illuminated scenes at interactive speed. Our method is based on Precomputed Radiance Transfer (PRT) [0]. Although the shape of model does not change and its position is fixed, we can move any light source with arbitrary shape dynamically during rendering process. This enables a spatially-varying lighting effect which has not been considered in the previous approach [0]. We also describe the details of rendering the scene with dynamic lights using cube mapping. Our implementation demonstrates that our method is suited for interactive applications such as 3D games and lighting simulations. Keywords: interactive graphics, global illumination, PRT, spherical harmonics. Introduction In this paper, we propose a new interactive rendering technique based on Precomputed Radiance Transfer [0]. Our major contribution in this paper is to handle more general scenes with PRT, especially for indoor scenes which has middle scale lighting variation. Our implementation demonstrates that our method is suited for interactive applications such as 3D games and lighting simulations... Precomputed Radiance Transfer Precomputed Radiance Transfer (PRT) was first proposed by Sloan et al. in [0]. In PRT, spherical harmonic function is employed for the decomposition of incident lighting and geometric scattering. In [0], the light source is placed at infinity. A rendering equation is expanded using spherical harmonic functions. It replaces the integral of the rendering equation by a simple set of dot products using orthogonality of spherical harmonics. This enables dynamic movements of lights, using environment mapping and a rigid object, at an interactive speed..2. Related Work An application of spherical harmonic functions to computer graphics as the deviation of isotropic BRDF was first introduced by Cabral et al. []. They represented a light integral on a hemisphere as several dot products of its coefficient vector and then reduced its computational cost. Westin et al. [4] extended their approach to the case of anisotropic BRDF. Sillion et al. [8] used spherical harmonic functions for approximating the formulation of a radiance launched from a point in the radiosity method. Ramamoorthi et al. [7] represented a light integral of diffuse reflectance as several dot products of spherical harmonic coefficients in the scene of environment mapping. Kautz et al [4] proposed a method to combine Sloan s original PRT to an arbitrary BRDF. Lehtinen et al. [5] generalized their combined formulations in a matrix form, and improved the rendering speed by compression of the matrices using principal component analysis (PCA). Sloan et al. [] decomposed the original PRT into a macro-scale PRT with the accuracy of ordinary surface level and a meso-scale PRT with the accuracy of surface texture level. They were used in combination with bidirectional texture functions to establish more sophisticated rendering results with high accuracy. They also improved rendering speed by compressing the matrix of spherical harmonic coefficients using clustered principal component analysis (CPCA) in [9]..3. Our Contribution Our contributions presented in this paper are as follows: Spatially-varying lighting effect. In the previous approach by Sloan et al. [0], light sources are placed at infinity. This assumption causes constant color shading. For example, when applying the light to a plane, any point of the plane will be shaded with a constant color (spatially-invariant
2 (a) Figure. (a) Spatially-invariant lighting effect in [0]. Note that the ground plane is flat-shaded. Our spatially-varying lighting effect. Note that the ground plane is now shaded gradually. lighting effect). PRT is by nature suitable for rendering outdoor scenes. But it is difficult to render indoor scenes in which the scale of variation in lighting is small with this approach. In Sloan et al. [0], vector quantization is used to represent local lighting effects. They propose an approach for sampling points in a part of a model. Then lighting environments are re-sampled from these points. Our approach considers the attenuation term by the distance from a light position to a point of an object. It enables a spatially-varying lighting effect even when applied to a plane. Figure illustrates the comparison between spatiallyconstant (left) and spatially-varying (right) lighting effects. It can be seen that in our approach the ground plane is shaded gradually compared to the previous one which is flat-shaded. PRT can be used in more general scenes including indoor scenes thanks to our spatially-varying lighting effects. Application to the dynamic lighting environments. In the previous approach, lighting environments are given by environment mapping, dynamic variation of lighting is done by rigid rotations thanks to rotation-invariant properties of spherical harmonics. Thus the environment of lighting is fixed. In our approach, We use a cube mapping to render the scene with moving lights or its background scene. The usage of cube mapping has already been pointed out by Sloan et al. [0]. However, we show here the details of its implementation, and demonstrate its use for more general lighting environments. 2. Interactive Global Illumination Using PRT 2.. Pseudo Code We show in this subsection a pseudo code of our approach. Our approach is divided into two steps. One is the simulation of irradiance transformation as pre-processing, and the other is an interactive rendering process. First, the transfer simulation of radiance is described as follows: Generate sampling points using [2]; For each vertex x Compute coefficients for shadow pass M 0 x; For b =, 2,... Compute coefficients for interreflection pass M b x; end M x = M 0 x + M x +...; end We store M calculated by transfer simulation. In the interactive rendering step, the following procedure is executed by using M. Compute lighting coefficients L by cube map rendering; For each vertex x; compute matrix-vector multiplication of M x and L; end
3 x (a) q q 2 q 3 Figure 2. (a) Shadow pass. Rays are shot towards the hemisphere and a flag (bit) is set where a ray hits the hemisphere. Interreflection pass. Transfer coefficients Mq b i are computed from each q i to point x Transfer simulation In the pre-process, transfer simulation is done by the similar procedure as radiosity method. Each transferred radiance is expanded by using a set of spherical harmonic functions, and transfer coefficients are computed for each vertex of an object. This process can be done by the following two steps. We use here a quasi-monte Carlo method [2] for generating sampling rays on a hemisphere. The low-discrepancy sequence we have choosen is the Hammersley point sets. In the first shadow pass, a shadow of a ray directly entering each vertex is computed. In the following interreflection pass, inter-reflective effects are computed. We use transfer coefficients computed by the shadow pass. This computation is repeated until the whole energy integral is less than a threshold. Diffuse reflection The transfer simulation of diffuse reflection (Lambert BRDF) is processed as follows: Shadow pass. The following integral is computed for each vertex (See Figure 2(a)). (M x ) 0 i = ρ x π Ω x M b q q M b q2 M b q3 V (x, ω ) max(cos θ x, 0)y i (ω )dω, where (M x ) 0 denotes the transfer vector in the shadow pass for a vertex x. A subscript i is defined as i = l(l +)+ m +where l, m denote parameters of spherical harmonic functions. ρ x (0 ρ x ) denotes the diffuse reflectance at a point x. V represents a two-valued visibility function which is equal to if no interruption exists between x and ω, otherwise it is equal to 0. This equation is computed for each RGB value. q 2 q 3 A binary flag is set to for a sampling direction with an interruption. It is used to reduce the computational cost of ray tracing in the following inter-reflection pass. Inter-reflection pass. The following integral is computed based on the transfer vector (M x ) 0 calculated in the previous pass (See Figure 2). (M x) b i = ρx π Ω ( V (x,ω )) max(cos θ x,0)(m q(ω ) ) b i dω, where b ( ) denotes the number of inter-reflection pass. This integral is computed only for sampling directions which have a binary flag. q(ω ) is a point hit at first on a direction of ω. The computation of transfer simulation is done for each vertex. Then it is rare that q(ω ) is exactly on a vertex. Thus, M q is computed by linear interpolation of M between vertices neighbor to q. We record the whole transfer energy for each interreflection pass. We stop the computation if it is less than a threshold. In practice, only three or four iterations are sufficient due to the rapid decrease of the energy. A transfer vector at a point x is represented by the sum of those computed in shadow pass and in inter-reflection pass: (M x ) i =(M x ) 0 i +(M x ) i +(M x ) 2 i + = N (M x ) k i, k=0 where N is the number of passes. Figure 3 demonstrates the results of three different settings (without interruption of diffuse reflectance transfer, shadow pass only, and shadow pass + inter-reflection pass). The case without interruption (Figure 3(a)) is just the same as the irradiance environment mapping described in [7]. It is brighter than the other two settings, because the plane below the model does not stop the light from illuminating the model. The difference between a shadow pass (Figure 3) and both a shadow pass and an inter-reflection pass (Figure 3(c)) can not be easily distinguished. However, in the latter case, the shadowed regions are slightly brighter due to inter-reflective effects. Glossy reflection Glossy BRDF can also be represented by PRT. This has an obtuse reflectance property in between Lambert BRDF and ideal specular reflectance BRDF. Here we treat only an isotropic case described in [0]. It should be noted that the transfer coefficient in glossy BRDF is represented by a matrix and not by a vector [0]. Shadow pass. A transfer coefficient (M x ) 0 ij computed in the shadow pass is as follows: (M x ) 0 ij = V (x, ω )y i (ω )y j (ω )dω. Ω
4 (a) (c) Figure 3. (a): No occlusion. : After shadow pass. (c): After shadow pass + inter-reflection pass. scene is surrounded with a virtual sphere. The lighting environments projected by cube mapping (described later) correspond to such a virtual sphere. We also assume that the light source is outside the sphere. In the first incidence of a light, we use the formulation which is measured by their surface, that is, the area A(x) for a point x on a surface is integrated by da(x) as intervals of the whole surface A R2. The rendering equation re-formulated by its surface measure is as follows: (a) Figure 4. Different BRDF models. (a): Using diffuse reflection. : Using glossy reflection. Inter-reflection pass. A transfer coefficient (Mx )bij computed in the following inter-reflection pass is as follows: b (Mx )ij = ( V (x, ω )) Ω n αk (G xq(ω ) )k (Mq(ω ) )b kj yk R( ω, Nq(ω ) ) yi (ω )dω, L(x, x ) = L e (x, x ) L(x, x )f (x, x )V (x, x ) + A cos θx cos θx da(x ), x x 2 () Since a point in the lighting environment can be projected to that on a surface of a sphere by cube mapping, we get the following transfer coefficients by treating an interval of a scene surface A as that of a sphere with radius r: ρx 0 (Mx )i = V (x, x )G(x, x )yi (x )dx, π S cos θ where α is a constant and G x is a coefficient of projected isotropic glossy BRDF at a point x by spherical harmonic functions. where G = r(x xx ) 2. A term of cos θx in Equation () can be omitted because it is included in cube mapping. In the second inter-reflection pass or later, we use an original formulation based on a solid angle. Consequently, we can represent a PRT including the attenuation by the distance from a light source. 3. PRT with Spatially-varying and Dynamic Lights 3.2. Generation of the distribution of lights by cube map rendering 3.. Spatially-varying formulation of rendering equation We get a distribution of lights incident to a point by using cube mapping. This can be done using a cube map constructed by rendering each face of a cube with a camera put on its origin. We set fov of the camera to 45. The camera direction and the up vector for each face are set as de- k=0 Here we describe our novel spatially-varying formulation. In spatially-varying lighting, we assume the whole
5 Face direction view direction up vector +x +x y x x y +y +y +z y y z +z +z y z z y Table. Coordinates of each face in cube map rendering. Z y Figure 5. The derivation of pixel weight. scribed in Table (which are based on a coordinate system used in OpenGL). By this, we can get a lighting environment of a light with arbitrary shape. For each pixel of textures from cube map rendering, we can quickly compute an expansion of spherical harmonic functions by multiplying spherical harmonic functions which are computed in advance. Correction for a pixel Distortion arises at the corner of a cube by projection. This happens because different pixels in each face of a cube map have no longer the same solid angle. To solve this issue, a correction is applied for a pixel as in [2]. In Figure 5, a weight correction W of (x, y) for upper and lower faces is as follows: θ r = x 2 + y 2 + cos θ = x2 + y 2 + W (ω(x, y, )) = x2 + y 2 + A Y x X where A =4π/N. N denotes the total number of pixels for six faces of a cube. We can also compute the correction W (ω(,y,z)) = A for other four side y2 +z 2 + faces. Finally, a spherical harmonic function for each pixel is computed by SH k (s, t) i,j = y i,j (ω(k, s, t))w (ω(k, s, t)), where k denotes a face id, (s, t) denotes the uv-coordinate of a texture, and ω(k, s, t) denotes the unique direction clearly defined by (k, s, t) Interactive rendering Using transfer coefficients as pre-computation and lighting coefficients by dynamic cube map rendering, we can render the scene with dynamically moving lights by GPU. It is easy to implement the computation of this stage by using the vertex program on GPU. Diffuse reflection In the case of diffuse reflection, radiance L x for each vertex can be computed simply by the following sum of dot products: L x = N (M x ) i L i, (2) i= where N denotes the number of coefficients of spherical harmonic functions, and L denotes the lighting coefficients computed by dynamic cube map rendering. Glossy reflection In the case of glossy reflection, the multiplication of a matrix and a vector is needed. L x = N α i G i ((M x ) ij L i ) y i (R), (3) i= where R denotes an inverse direction of a viewing vector. α and G can be computed the same fashion as described in Section Results and Discussion All of our programs are implemented in C language. We also use OpenGL for rendering and Cg [6] for the vertex program functionality on GPU. We use a software renderer lucille [3] to pre-compute transfer coefficients. For the expansion of spherical harmonic functions, we set l =4, e.g. coefficients of N =25. This is because it is the maximum value that can be processed with a current CPU and GPU. In our experiments, the case of N =25presents a good approximation for the light distribution of low frequency. If we treat only the ideal diffuse reflection and the complexity of occlusion is adequately small, N =9also gives a good approximation [7]. In the case of diffuse reflection, Equation (2) can be processed by a simple combination of the
6 Mobility Radeon 9600 GeForce FX 5900 Ultra diffuse glossy diffuse glossy stage seconds (%) seconds (%) seconds (%) seconds (%) Scene rendering (83%) (6%) (70%) (0%) Cube map rendering (0.7%) (0.%) (4%) (0.6%) glreadpixels (.5%) (0.4%) (6%) (2.4%) Lighting coefficients computation (0%) (3%) (9%) (%) Glossy coefficient matrix manipulation (90%) (84%) Others (4%) (4%) (%) (%) Total 0.8 sec sec sec sec. Frame rate 5.6 FPS.5 FPS 27 FPS 4 FPS Table 2. Computation time for each frame. summation and multiplication, and then a vertex program on GPU can be used. In the case of glossy reflection, coefficients of glossy transfer is a matrix when N =25. In the matrix computation, however, the number of elements is much more than the number of instructions which a vertex program can be processed at a time. We use CPU computation only for this case. Table 2 shows the detail of computation time in each frame. These timings are measured on two machines (PowerPC G4.25 GHz / ATI Mobility Radeon 9600 / Mac OS X, and Pentium GHz / NVIDIA GeForce FX 5900 Ultra / Windows XP). The scene used for measuring computation time is Stanford dragon scene (Figure 4) consisting of about 50k polygons. Dragon diffuse is shown in Figure 4(a) and Dragon glossy in Figure 4. Scene rendering is the rendering time of polygons using vertex program on GPU in final rendering stage. Cube map rendering is the rendering time based on cube map rendering in the scene with dynamic lights. glreadpixels counts the time consumed by transferring cube map pixel memory on VRAM to CPU memory. lighting coefficients computation calculates lighting coefficients convolving read-backed cube map pixel values and pre-computed spherical harmonic functions. Coefficients for the diffuse surface expanded by spherical harmonics and lighting coefficients are multiplied in vertex program. For the glossy surface, we calculate shading for each vertex on CPU (this is listed in Table 2 as Glossy coefficient matrix manipulation) because the data associated to each vertex can not fit into the hardware limit of vertex program. Interactively rendered images using our method are shown in Figure 6. We used area light sources to illuminate these scenes. The number of lights can be freely chosen and no performance drops occurs even if hundreds of lights are placed in the scene. Each of these scenes consists of k polygons which can be rendered interactively. 5. Conclusion and Future Work We proposed a new interactive rendering method by an extended PRT method. It can be implemented on GPU almost entirely if the scene consists of diffuse surface. Our method is suited for scenes with middle scale lighting variation such as indoor environment, which is difficult to represent in the previous work. Our future work includes the support for more general BDRFs, data compression and animated objects. Acknowledgements The dragon and Buddha models are courtesy of Stanford University, Computer Graphics Laboratory, other models we used is from 3D cafe. We would like to thank Mr. Alexandre Gouaillard for proofreading this paper. We would also like to thank Prof. Yoshinori Dobashi, Hokkaido University for useful discussions and Prof. Tomoshi Miyamura, Nihon University for granting us the usage of 6 CPU parallel PC cluster. A. Spherical Harmonic A.. Real Spherical Harmonic Spherical harmonic is a complex function, but in computer graphics we need only real part of it. So we use real spherical harmonic. There is a correspondence between spherical harmonic Y l,m and real spherical harmonic y l,m. y l,m = 2 (Y l,m + Y l, m ) m>0 i (Y 2 l,m Y l, m ) m<0 Y l,m m =0 Rewriting it in terms of associated Legendre polynomial P l,m, we get
7 (a) (c) (d) Figure 6. Interactively rendered images using our method. yl,m m>0 2Kl,m cos(mφ)pl,m (cos θ) = 2Kl,m sin( mφ)pl, m (cos θ) m < 0 m = 0, Kl,m Pl,m (cos θ) where Kl,m = 2l+ (l m)! 4 (l+m)!. A.2. Spherical Harmonics in Cartesian Coordinates Solid harmonic rl Yl,m (θ, φ) in spherical coordinates (r, θ, φ) can also be described in Cartesian coordinates [3]. r Yl,m (θ, φ) l = 2l + (l + m)!(l m)! 4π x + iy p x iy q s ( ) ( ) z p!q!s! 2 2 p,q,s p, q, s are positive integer numbers. Summation is taken over all combination of p, q, r that fulfills p + q + s = l, p q = m. If we think a unit sphere(r = ), real spherical harmonic in Cartesian coordinates is represented by simple polynomial up to order l. Table 3 lists real spherical harmonic in Cartesian coordinates up to l = 4.
8 l=0,,2 l=3 l=4 y 0,0 = 4π 3 y, = 3 y,0 = 3 y, = y 4π z 4π x 4π 5 y 2, 2 = xy 4π 5 y 2, = yz 4π 5 y 2,0 = 6π (3z2 ) 5 y 2, = xz 4π 5 y 2,2 = 6π x2 y 2 35 y 3, 3 = 32π (3x2 y y 3 ) 05 y 3, 2 = xyz 4π 2 y 3, = 32π y(5z2 ) 7 y 3,0 = 6π (5z3 3z) 2 y 3, = 32π x(5z2 ) 05 y 3,2 = 6π z(x2 y 2 ) 35 y 3,3 = 32π (x3 3xy 2 ) 35 y 4, 4 = 6π (x3 y xy 3 ) 35 y 4, 3 = 32π z(3x2 y y 3 ) 45 y 4, 2 = 6π xy(7z2 ) 45 y 4, = 32π (7yz3 3yz) 9 y 4,0 = 256π (35z4 30z 2 +3) 45 y 4, = 32π (7xz3 3xz) 45 y 4,2 = 64π (x2 y 2 )(7z 2 ) 35 y 4,3 = 32π z(x3 3xy 2 ) 35 y 4,4 = 256π (x4 6x 2 y 2 + y 4 ) Table 3. Real spherical harmonics up to l 4 with normalized vector (x, y, z) representation in Cartesian coordinates. References [] B. Cabral, N. Max, and R. Springmeyer. Bidirectional reflection functions from surface bump maps. In Proceedings of ACM SIGGRAPH 987, pages , 987. [2] M. F. Cohen and D. P. Greenberg. The hemi-cube: A radiosity solution for complex environments. Proceedings of ACM SIGGRAPH 985, 9(3):3 40, 985. [3] M. Fujita and T. Kanai. lucille: Open source global illumination renderer. In The 7th IASTED International Conference on Computer Graphics and Imaging (CGIM 2004), to appear, [4] J. Kautz, P.-P. Sloan, and J. Snyder. Fast, arbitrary BRDF shading for low-frequency lighting using spherical harmonics. In Proceedings of Thirteenth Eurographics Workshop on Rendering, pages , [5] J. Lehtinen and J. Kautz. Matrix radiance transfer. In Proceedings of the 2003 symposium on Interative 3D graphics, pages 59 64, [6] W. R. Mark, R. S. Glanville, K. Akeley, and M. J. Kilgard. Cg: a system for programming graphics hardware in a c-like language. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2003), 22(3): , [7] R. Ramamoorthi and P. Hanrahan. An efficient representation for irradiance environment maps. In Proceedings of ACM SIGGRAPH 200, pages , 200. [8] F. X. Sillion, J. R. Arvo, S. H. Westin, and D. P. Greenberg. A global illumination solution for general reflectance distributions. In Proceedings of ACM SIGGRAPH 99, pages 87 96, 99. [9] P.-P. Sloan, J. Hall, J. Hart, and J. Snyder. Clustered principal components for precomputed radiance transfer. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2003), 22(3):382 39, [0] P.-P. Sloan, J. Kautz, and J. Snyder. Precomputed radiance transfer for real-time rendering in dynamic, low-frequency lighting environments. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2002), 2(3): , [] P.-P. Sloan, X. Liu, H.-Y. Shum, and J. Snyder. Bi-scale radiance transfer. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2003), 22(3): , [2] W.-S. L. Tien-Tsin Wong and P.-A. Heng. Sampling with hammersley and halton points. Journal of Graphics Tools, 2(2):9 24, 997. [3] D. A. Varshalovich, A. N. Moksalev, and V. K. Khersonskii. Quantum Theory of Angular Momentum. World Scientific Publishing Co., Singapore, 988. [4] S. H. Westin, J. R. Arvo, and K. E. Torrance. Predicting reflectance functions from complex surfaces. In Proceedings of ACM SIGGRAPH 992, pages , 992.
Rendering Algorithms: Real-time indirect illumination. Spring 2010 Matthias Zwicker
Rendering Algorithms: Real-time indirect illumination Spring 2010 Matthias Zwicker Today Real-time indirect illumination Ray tracing vs. Rasterization Screen space techniques Visibility & shadows Instant
More informationx ~ Hemispheric Lighting
Irradiance and Incoming Radiance Imagine a sensor which is a small, flat plane centered at a point ~ x in space and oriented so that its normal points in the direction n. This sensor can compute the total
More informationSpherical Harmonic Gradients for Mid-Range Illumination
Eurographics Symposium on Rendering (2004) H. W. Jensen, A. Keller (Editors) Spherical Harmonic Gradients for Mid-Range Illumination Thomas Annen 1 Jan Kautz 2 Frédo Durand 2 Hans-Peter Seidel 1 1 MPI
More informationEfficient Rendering of Glossy Reflection Using Graphics Hardware
Efficient Rendering of Glossy Reflection Using Graphics Hardware Yoshinori Dobashi Yuki Yamada Tsuyoshi Yamamoto Hokkaido University Kita-ku Kita 14, Nishi 9, Sapporo 060-0814, Japan Phone: +81.11.706.6530,
More informationImproved Radiance Gradient Computation
Improved Radiance Gradient Computation Jaroslav Křivánek Pascal Gautron Kadi Bouatouch Sumanta Pattanaik Czech Technical University New gradients Gradients by [Křivánek et al. 2005] Figure 1: Right: The
More informationPrecomputed Radiance Transfer: Theory and Practice
1 Precomputed Radiance Transfer: Peter-Pike Sloan Microsoft Jaakko Lehtinen Helsinki Univ. of Techn. & Remedy Entertainment Jan Kautz MIT 2 Introduction Jan Kautz MIT 3 Introduction We see here an example
More informationPrecomputation-Based Real-Time Rendering
CS294-13: Advanced Computer Graphics Lecture #11 Real-Time Rendering University of California, Berkeley Precomputation-Based Real-Time Rendering Lecture #11: Wednesday, 7 October 2009 Lecturer: Ravi Ramamoorthi
More informationSpherical Harmonic Lighting: The Gritty Details Robin Green
Spherical Harmonic Lighting: The Gritty Details Robin Green R&D Programmer Sony Computer Entertainment America What This Talk Is About Advanced Lecture Explicit equations will be shown This talk is one
More informationAmbien Occlusion. Lighting: Ambient Light Sources. Lighting: Ambient Light Sources. Summary
Summary Ambien Occlusion Kadi Bouatouch IRISA Email: kadi@irisa.fr 1. Lighting 2. Definition 3. Computing the ambient occlusion 4. Ambient occlusion fields 5. Dynamic ambient occlusion 1 2 Lighting: Ambient
More informationlucille: Open Source Global Illumination Renderer
lucille: Open Source Global Illumination Renderer http://lucille.sourceforge.net Masahiro Fujita Keio University Graduate School of Media and Governance email: syoyo@sfc.keio.ac.jp Takashi Kanai Keio University
More informationAnd if that 120MP Camera was cool
Reflectance, Lights and on to photometric stereo CSE 252A Lecture 7 And if that 120MP Camera was cool Large Synoptic Survey Telescope 3.2Gigapixel camera 189 CCD s, each with 16 megapixels Pixels are 10µm
More informationChapter 1 Introduction
Chapter 1 Introduction The central problem in computer graphics is creating, or rendering, realistic computergenerated images that are indistinguishable from real photographs, a goal referred to as photorealism.
More informationOverview. Radiometry and Photometry. Foundations of Computer Graphics (Spring 2012)
Foundations of Computer Graphics (Spring 2012) CS 184, Lecture 21: Radiometry http://inst.eecs.berkeley.edu/~cs184 Overview Lighting and shading key in computer graphics HW 2 etc. ad-hoc shading models,
More informationA Practical and Fast Rendering Algorithm for Dynamic Scenes Using Adaptive Shadow Fields
A Practical and Fast Rendering Algorithm for Dynamic Scenes Using Adaptive Shadow Fields Naoki Tamura 1, Henry Johan 2, Bing-Yu Chen 3 and Tomoyuki Nishita 1 1 The University of Tokyo 2 Nanyang Technological
More informationA Frequency Analysis of Light Transport
A Frequency Analysis of Light Transport Frédo Durand MIT CSAIL With Nicolas Holzschuch, Cyril Soler, Eric Chan & Francois Sillion Artis Gravir/Imag-Inria & MIT CSAIL Our research 3D rendering Light transport
More informationMotivation. My General Philosophy. Assumptions. Advanced Computer Graphics (Spring 2013) Precomputation-Based Relighting
Advanced Computer Graphics (Spring 2013) CS 283, Lecture 17: Precomputation-Based Real-Time Rendering Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/sp13 Motivation Previously: seen IBR. Use measured
More informationThe Rendering Equation and Path Tracing
The Rendering Equation and Path Tracing Louis Feng April 22, 2004 April 21, 2004 Realistic Image Synthesis (Spring 2004) 1 Topics The rendering equation Original form Meaning of the terms Integration Path
More informationRadiance. Radiance properties. Radiance properties. Computer Graphics (Fall 2008)
Computer Graphics (Fall 2008) COMS 4160, Lecture 19: Illumination and Shading 2 http://www.cs.columbia.edu/~cs4160 Radiance Power per unit projected area perpendicular to the ray per unit solid angle in
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. A wavelet based real-time rendering technology for indoor mixed reality ABSTRACT
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 24 2014 BioTechnology An Indian Journal FULL PAPER BTAIJ, 10(24), 2014 [15095-15100] A wavelet based real-time rendering technology
More informationBRDF Computer Graphics (Spring 2008)
BRDF Computer Graphics (Spring 2008) COMS 4160, Lecture 20: Illumination and Shading 2 http://www.cs.columbia.edu/~cs4160 Reflected Radiance proportional to Irradiance Constant proportionality: BRDF [CW
More informationCMSC427 Advanced shading getting global illumination by local methods. Credit: slides Prof. Zwicker
CMSC427 Advanced shading getting global illumination by local methods Credit: slides Prof. Zwicker Topics Shadows Environment maps Reflection mapping Irradiance environment maps Ambient occlusion Reflection
More informationEfficient Irradiance Normal Mapping
Efficient Irradiance Normal Mapping Ralf Habel and Michael Wimmer Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria Figure : A typical game scene using standard light
More informationGlobal Illumination. CMPT 361 Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller
Global Illumination CMPT 361 Introduction to Computer Graphics Torsten Möller Reading Foley, van Dam (better): Chapter 16.7-13 Angel: Chapter 5.11, 11.1-11.5 2 Limitation of local illumination A concrete
More informationImage Based Lighting with Near Light Sources
Image Based Lighting with Near Light Sources Shiho Furuya, Takayuki Itoh Graduate School of Humanitics and Sciences, Ochanomizu University E-mail: {shiho, itot}@itolab.is.ocha.ac.jp Abstract Recent some
More informationImage Based Lighting with Near Light Sources
Image Based Lighting with Near Light Sources Shiho Furuya, Takayuki Itoh Graduate School of Humanitics and Sciences, Ochanomizu University E-mail: {shiho, itot}@itolab.is.ocha.ac.jp Abstract Recent some
More informationPhotometric Stereo. Lighting and Photometric Stereo. Computer Vision I. Last lecture in a nutshell BRDF. CSE252A Lecture 7
Lighting and Photometric Stereo Photometric Stereo HW will be on web later today CSE5A Lecture 7 Radiometry of thin lenses δa Last lecture in a nutshell δa δa'cosα δacos β δω = = ( z' / cosα ) ( z / cosα
More informationAnnouncement. Lighting and Photometric Stereo. Computer Vision I. Surface Reflectance Models. Lambertian (Diffuse) Surface.
Lighting and Photometric Stereo CSE252A Lecture 7 Announcement Read Chapter 2 of Forsyth & Ponce Might find section 12.1.3 of Forsyth & Ponce useful. HW Problem Emitted radiance in direction f r for incident
More informationIllumination Under Trees. Nelson Max University of Tokyo, and University of California, Davis
Illumination Under Trees Nelson Max University of Tokyo, and University of California, Davis Topics Hierarchical image based rendering for trees Atmospheric illumination and shadows Shadow penumbras with
More information2/1/10. Outline. The Radiance Equation. Light: Flux Equilibrium. Light: Radiant Power. Light: Equation. Radiance. Jan Kautz
Outline Jan Kautz Basic terms in radiometry Radiance Reflectance The operator form of the radiance equation Meaning of the operator form Approximations to the radiance equation 2005 Mel Slater, 2006 Céline
More informationRendering Light Reflection Models
Rendering Light Reflection Models Visual Imaging in the Electronic Age Donald P. Greenberg October 3, 2017 Lecture #13 Program of Computer Graphics, Cornell University General Electric - 167 Cornell in
More informationCS 563 Advanced Topics in Computer Graphics Spherical Harmonic Lighting by Mark Vessella. Courtesy of
CS 563 Advanced Topics in Computer Graphics Spherical Harmonic Lighting by Mark Vessella Courtesy of http://www.yasrt.org/shlighting/ Outline for the Night Introduction to Spherical Harmonic Lighting Description
More informationA Practical and Fast Rendering Algorithm for Dynamic Scenes Using Adaptive Shadow Fields
The Visual Computer manuscript No. (will be inserted by the editor) Naoki Tamura Henry Johan Bing-Yu Chen Tomoyuki Nishita. A Practical and Fast Rendering Algorithm for Dynamic Scenes Using Adaptive Shadow
More informationThe Shading Probe: Fast Appearance Acquisition for Mobile AR
The Shading Probe: Fast Appearance Acquisition for Mobile AR Dan Andrei Calian * Kenny Mitchell Derek Nowrouzezahrai Jan Kautz * * University College London Disney Research Zürich University of Montreal
More informationMIT Monte-Carlo Ray Tracing. MIT EECS 6.837, Cutler and Durand 1
MIT 6.837 Monte-Carlo Ray Tracing MIT EECS 6.837, Cutler and Durand 1 Schedule Review Session: Tuesday November 18 th, 7:30 pm bring lots of questions! Quiz 2: Thursday November 20 th, in class (one weeks
More informationAll-Frequency Relighting of Non-Diffuse Objects using Separable BRDF Approximation
Eurographics Symposium on Rendering (2004) H. W. Jensen, A. Keller (Editors) All-Frequency Relighting of Non-Diffuse Objects using Separable BRDF Approximation Rui Wang, John Tran, and David Luebke Department
More informationRay tracing based fast refraction method for an object seen through a cylindrical glass
20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Ray tracing based fast refraction method for an object seen through a cylindrical
More informationRecent Advances in Monte Carlo Offline Rendering
CS294-13: Special Topics Lecture #6 Advanced Computer Graphics University of California, Berkeley Monday, 21 September 2009 Recent Advances in Monte Carlo Offline Rendering Lecture #6: Monday, 21 September
More informationMotivation. Advanced Computer Graphics (Fall 2009) CS 283, Lecture 11: Monte Carlo Integration Ravi Ramamoorthi
Advanced Computer Graphics (Fall 2009) CS 283, Lecture 11: Monte Carlo Integration Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283 Acknowledgements and many slides courtesy: Thomas Funkhouser, Szymon
More informationLighting and Shading Computer Graphics I Lecture 7. Light Sources Phong Illumination Model Normal Vectors [Angel, Ch
15-462 Computer Graphics I Lecture 7 Lighting and Shading February 12, 2002 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/ Light Sources Phong Illumination Model
More informationInteractive Rendering of Globally Illuminated Glossy Scenes
Interactive Rendering of Globally Illuminated Glossy Scenes Wolfgang Stürzlinger, Rui Bastos Dept. of Computer Science, University of North Carolina at Chapel Hill {stuerzl bastos}@cs.unc.edu Abstract.
More informationRay Tracer Due date: April 27, 2011
Computer graphics Assignment 4 1 Overview Ray Tracer Due date: April 27, 2011 In this assignment you will implement the camera and several primitive objects for a ray tracer, and a basic ray tracing algorithm.
More informationParallel Monte Carlo Sampling Scheme for Sphere and Hemisphere
Parallel Monte Carlo Sampling Scheme for Sphere and Hemisphere I.T. Dimov 1,A.A.Penzov 2, and S.S. Stoilova 3 1 Institute for Parallel Processing, Bulgarian Academy of Sciences Acad. G. Bonchev Str., bl.
More informationGlobal Illumination. COMP 575/770 Spring 2013
Global Illumination COMP 575/770 Spring 2013 Final Exam and Projects COMP 575 Final Exam Friday, May 3 4:00 pm COMP 770 (and 575 extra credit) Projects Final report due by end of day, May 1 Presentations:
More informationImage-based BRDF Representation
JAMSI, 11 (2015), No. 2 47 Image-based BRDF Representation A. MIHÁLIK AND R. ĎURIKOVIČ Abstract: To acquire a certain level of photorealism in computer graphics, it is necessary to analyze, how the materials
More informationGlobal Illumination and the Rendering Equation
CS294-13: Special Topics Lecture #3 Advanced Computer Graphics University of California, Berkeley Handout Date??? Global Illumination and the Rendering Equation Lecture #3: Wednesday, 9 September 2009
More informationCS : Assignment 2 Real-Time / Image-Based Rendering
CS 294-13: Assignment 2 Real-Time / Image-Based Rendering Ravi Ramamoorthi 1 Introduction In this assignment, you will implement some of the modern techniques for real-time and/or image-based rendering.
More informationCENG 477 Introduction to Computer Graphics. Ray Tracing: Shading
CENG 477 Introduction to Computer Graphics Ray Tracing: Shading Last Week Until now we learned: How to create the primary rays from the given camera and image plane parameters How to intersect these rays
More informationReflection models and radiometry Advanced Graphics
Reflection models and radiometry Advanced Graphics Rafał Mantiuk Computer Laboratory, University of Cambridge Applications To render realistic looking materials Applications also in computer vision, optical
More informationOther Rendering Techniques CSE 872 Fall Intro You have seen Scanline converter (+z-buffer) Painter s algorithm Radiosity CSE 872 Fall
Other Rendering Techniques 1 Intro You have seen Scanline converter (+z-buffer) Painter s algorithm Radiosity 2 Intro Some more Raytracing Light maps Photon-map Reyes Shadow maps Sahdow volumes PRT BSSRF
More informationComputer Graphics. Lecture 14 Bump-mapping, Global Illumination (1)
Computer Graphics Lecture 14 Bump-mapping, Global Illumination (1) Today - Bump mapping - Displacement mapping - Global Illumination Radiosity Bump Mapping - A method to increase the realism of 3D objects
More informationCSE528 Computer Graphics: Theory, Algorithms, and Applications
CSE528 Computer Graphics: Theory, Algorithms, and Applications Hong Qin State University of New York at Stony Brook (Stony Brook University) Stony Brook, New York 11794--4400 Tel: (631)632-8450; Fax: (631)632-8334
More informationSchedule. MIT Monte-Carlo Ray Tracing. Radiosity. Review of last week? Limitations of radiosity. Radiosity
Schedule Review Session: Tuesday November 18 th, 7:30 pm, Room 2-136 bring lots of questions! MIT 6.837 Monte-Carlo Ray Tracing Quiz 2: Thursday November 20 th, in class (one weeks from today) MIT EECS
More informationPath Tracing part 2. Steve Rotenberg CSE168: Rendering Algorithms UCSD, Spring 2017
Path Tracing part 2 Steve Rotenberg CSE168: Rendering Algorithms UCSD, Spring 2017 Monte Carlo Integration Monte Carlo Integration The rendering (& radiance) equation is an infinitely recursive integral
More informationGlobal Illumination with Glossy Surfaces
Global Illumination with Glossy Surfaces Wolfgang Stürzlinger GUP, Johannes Kepler Universität, Altenbergerstr.69, A-4040 Linz, Austria/Europe wrzl@gup.uni-linz.ac.at Abstract Photorealistic rendering
More informationA Framework for Global Illumination in Animated Environments
A Framework for Global Illumination in Animated Environments Jeffry Nimeroff 1 Julie Dorsey 2 Holly Rushmeier 3 1 University of Pennsylvania, Philadelphia PA 19104, USA 2 Massachusetts Institute of Technology,
More informationRecovering illumination and texture using ratio images
Recovering illumination and texture using ratio images Alejandro Troccoli atroccol@cscolumbiaedu Peter K Allen allen@cscolumbiaedu Department of Computer Science Columbia University, New York, NY Abstract
More informationPractical Spherical Harmonics Based PRT Methods
Practical Spherical Harmonics Based PRT Methods Manny Ko Naughty Dog Jerome Ko UCSD / Bunkspeed Outline n i Background ambient occlusion, HL2 Spherical Harmonics theory Pre processing PRT compression 4
More informationEfficient Multiple Scattering in Hair Using Spherical Harmonics
Efficient Multiple Scattering in Hair Using Spherical Harmonics Jonathan T. Moon Bruce Walter Steve Marschner Cornell University Abstract Previous research has shown that a global multiple scattering simulation
More informationS U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T
S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T Copyright 2018 Sung-eui Yoon, KAIST freely available on the internet http://sglab.kaist.ac.kr/~sungeui/render
More informationGlobal Illumination CS334. Daniel G. Aliaga Department of Computer Science Purdue University
Global Illumination CS334 Daniel G. Aliaga Department of Computer Science Purdue University Recall: Lighting and Shading Light sources Point light Models an omnidirectional light source (e.g., a bulb)
More informationLight Animation with Precomputed Light Paths on the GPU
Light Animation with Precomputed Light Paths on the GPU László Szécsi TU Budapest szecsi@iit.bme.hu László Szirmay-Kalos TU Budapest szirmay@iit.bme.hu Mateu Sbert University of Girona mateu@ima.udg.es
More informationECS 175 COMPUTER GRAPHICS. Ken Joy.! Winter 2014
ECS 175 COMPUTER GRAPHICS Ken Joy Winter 2014 Shading To be able to model shading, we simplify Uniform Media no scattering of light Opaque Objects No Interreflection Point Light Sources RGB Color (eliminating
More informationPrecomputation-Based Rendering. Contents
Foundations and Trends R in Computer Graphics and Vision Vol. 3, No. 4 (2007) 281 369 c 2009 R. Ramamoorthi DOI: 10.1561/0600000021 Precomputation-Based Rendering By Ravi Ramamoorthi Contents 1 Introduction
More informationBiased Monte Carlo Ray Tracing:
Biased Monte Carlo Ray Tracing: Filtering, Irradiance Caching and Photon Mapping Dr. Henrik Wann Jensen Stanford University May 24, 2001 Unbiased and consistent Monte Carlo methods Unbiased estimator:
More informationShading and Illumination
Shading and Illumination OpenGL Shading Without Shading With Shading Physics Bidirectional Reflectance Distribution Function (BRDF) f r (ω i,ω ) = dl(ω ) L(ω i )cosθ i dω i = dl(ω ) L(ω i )( ω i n)dω
More informationCS 283: Assignment 3 Real-Time / Image-Based Rendering
CS 283: Assignment 3 Real-Time / Image-Based Rendering Ravi Ramamoorthi 1 Introduction In this assignment, you will implement some of the modern techniques for real-time and/or image-based rendering. To
More informationTo Do. Advanced Computer Graphics. Course Outline. Course Outline. Illumination Models. Diffuse Interreflection
Advanced Computer Graphics CSE 163 [Spring 017], Lecture 11 Ravi Ramamoorthi http://www.cs.ucsd.edu/~ravir To Do Assignment due May 19 Should already be well on way. Contact us for difficulties etc. This
More informationDiscussion. Smoothness of Indirect Lighting. History and Outline. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Spring 2013)
Advanced Computer Graphics (Spring 2013 CS 283, Lecture 12: Recent Advances in Monte Carlo Offline Rendering Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/sp13 Some slides/ideas courtesy Pat Hanrahan,
More information6. Illumination, Lighting
Jorg s Graphics Lecture Notes 6. Illumination, Lighting 1 6. Illumination, Lighting No ray tracing in OpenGL! ray tracing: direct paths COP interreflection: soft shadows, color bleeding. umbra, penumbra,
More informationLight Reflection Models
Light Reflection Models Visual Imaging in the Electronic Age Donald P. Greenberg October 21, 2014 Lecture #15 Goal of Realistic Imaging From Strobel, Photographic Materials and Processes Focal Press, 186.
More informationCPSC / Texture Mapping
CPSC 599.64 / 601.64 Introduction and Motivation so far: detail through polygons & materials example: brick wall problem: many polygons & materials needed for detailed structures inefficient for memory
More informationAnalysis of Planar Light Fields from Homogeneous Convex Curved Surfaces Under Distant Illumination
Analysis of Planar Light Fields from Homogeneous Convex Curved Surfaces Under Distant Illumination Ravi Ramamoorthi and Pat Hanrahan {ravir,hanrahan}@graphics.stanford.edu http://graphics.stanford.edu/papers/planarlf/
More informationComputergrafik. Matthias Zwicker Universität Bern Herbst 2016
Computergrafik Matthias Zwicker Universität Bern Herbst 2016 Today More shading Environment maps Reflection mapping Irradiance environment maps Ambient occlusion Reflection and refraction Toon shading
More informationRendering Hair-Like Objects with Indirect Illumination
Rendering Hair-Like Objects with Indirect Illumination CEM YUKSEL and ERGUN AKLEMAN Visualization Sciences Program, Department of Architecture Texas A&M University TR0501 - January 30th 2005 Our method
More informationChapter 7. Conclusions and Future Work
Chapter 7 Conclusions and Future Work In this dissertation, we have presented a new way of analyzing a basic building block in computer graphics rendering algorithms the computational interaction between
More informationRay Tracing: Special Topics CSCI 4239/5239 Advanced Computer Graphics Spring 2018
Ray Tracing: Special Topics CSCI 4239/5239 Advanced Computer Graphics Spring 2018 Theoretical foundations Ray Tracing from the Ground Up Chapters 13-15 Bidirectional Reflectance Distribution Function BRDF
More informationReal-time BTF Rendering
Real-time BTF Rendering Martin Schneider Institute of Computer Science II. University of Bonn Römerstr. 164, D-53177 Bonn, Germany Abstract The Bidirectional Texture Function (BTF) is a suitable representation
More informationAll-Frequency Environment Light Rendering using Rotatable Square Light and Multiple Product Approximation
All-Frequency Environment Light Rendering using Rotatable Square Light and Multiple Product Approximation Kun Xu, Yun-Tao Jia, Shi-Min Hu, Chiew-Lan Tai Technical Report (TR) 0605 May 2006 Computer Graphics
More informationFinal Project: Real-Time Global Illumination with Radiance Regression Functions
Volume xx (200y), Number z, pp. 1 5 Final Project: Real-Time Global Illumination with Radiance Regression Functions Fu-Jun Luan Abstract This is a report for machine learning final project, which combines
More informationComputer Graphics. Illumination and Shading
() Illumination and Shading Dr. Ayman Eldeib Lighting So given a 3-D triangle and a 3-D viewpoint, we can set the right pixels But what color should those pixels be? If we re attempting to create a realistic
More informationPart I The Basic Algorithm. Principles of Photon Mapping. A two-pass global illumination method Pass I Computing the photon map
Part I The Basic Algorithm 1 Principles of A two-pass global illumination method Pass I Computing the photon map A rough representation of the lighting in the scene Pass II rendering Regular (distributed)
More informationRendering Light Reflection Models
Rendering Light Reflection Models Visual Imaging in the Electronic Age Donald P. Greenberg October 27, 2015 Lecture #18 Goal of Realistic Imaging The resulting images should be physically accurate and
More informationA Fast Display Method of Sky Color Using Basis Functions
A Fast Display Method of Sky Color Using Basis Functions Yoshinori Dobashi, Tomoyuki Nishita, Kazufumi Kaneda, Hideo Yamashita Hiroshima University 1-4-1 Kagamiyama, Higashi-hiroshima, 739 Japan E-mail:
More informationGlobal Illumination The Game of Light Transport. Jian Huang
Global Illumination The Game of Light Transport Jian Huang Looking Back Ray-tracing and radiosity both computes global illumination Is there a more general methodology? It s a game of light transport.
More informationCS770/870 Spring 2017 Radiosity
Preview CS770/870 Spring 2017 Radiosity Indirect light models Brief radiosity overview Radiosity details bidirectional reflectance radiosity equation radiosity approximation Implementation details hemicube
More informationLecture 7 - Path Tracing
INFOMAGR Advanced Graphics Jacco Bikker - November 2016 - February 2017 Lecture 7 - I x, x = g(x, x ) ε x, x + S ρ x, x, x I x, x dx Welcome! Today s Agenda: Introduction Advanced Graphics 3 Introduction
More informationParallel Progressive Precomputed Radiance Transfer
Parallel Progressive Precomputed Radiance Transfer Luís Paulo Santos Departamento de Informática Universidade do Minho Portugal Sérgio Valentim Escola Superior de Artes e Design Instituto Politécnico de
More informationAssignment 3: Path tracing
Assignment 3: Path tracing EDAN30 April 2, 2011 In this assignment you will be asked to extend your ray tracer to support path tracing. In order to pass the assignment you need to complete all tasks. Make
More informationLocal vs. Global Illumination & Radiosity
Last Time? Local vs. Global Illumination & Radiosity Ray Casting & Ray-Object Intersection Recursive Ray Tracing Distributed Ray Tracing An early application of radiative heat transfer in stables. Reading
More informationA Brief Overview of. Global Illumination. Thomas Larsson, Afshin Ameri Mälardalen University
A Brief Overview of Global Illumination Thomas Larsson, Afshin Ameri Mälardalen University 1 What is Global illumination? Global illumination is a general name for realistic rendering algorithms Global
More informationA Clustering Algorithm for Radiance Calculation In General Environments
A Clustering Algorithm for Radiance Calculation In General Environments François Sillion, George Drettakis, Cyril Soler MAGIS Abstract: This paper introduces an efficient hierarchical algorithm capable
More informationHardware-Assisted Relief Texture Mapping
EUROGRAPHICS 0x / N.N. and N.N. Short Presentations Hardware-Assisted Relief Texture Mapping Masahiro Fujita and Takashi Kanai Keio University Shonan-Fujisawa Campus, Fujisawa, Kanagawa, Japan Abstract
More informationInteractive Methods in Scientific Visualization
Interactive Methods in Scientific Visualization GPU Volume Raycasting Christof Rezk-Salama University of Siegen, Germany Volume Rendering in a Nutshell Image Plane Eye Data Set Back-to-front iteration
More informationINFOGR Computer Graphics. J. Bikker - April-July Lecture 10: Shading Models. Welcome!
INFOGR Computer Graphics J. Bikker - April-July 2016 - Lecture 10: Shading Models Welcome! Today s Agenda: Introduction Light Transport Materials Sensors Shading INFOGR Lecture 10 Shading Models 3 Introduction
More informationChapter 2 A top-down approach - How to make shaded images?
Chapter 2 A top-down approach - How to make shaded images? Comp. Graphics (U), Chap 2 Global View 1 CGGM Lab., CS Dept., NCTU Jung Hong Chuang Graphics API vs. application API Graphics API Support rendering
More informationHuman Face Shape Analysis under Spherical Harmonics Illumination Considering Self Occlusion
Human Face Shape Analysis under Spherical Harmonics Illumination Considering Self Occlusion Jasenko Zivanov Andreas Forster Sandro Schönborn Thomas Vetter jasenko.zivanov@unibas.ch forster.andreas@gmail.com
More information13 Distribution Ray Tracing
13 In (hereafter abbreviated as DRT ), our goal is to render a scene as accurately as possible. Whereas Basic Ray Tracing computed a very crude approximation to radiance at a point, in DRT we will attempt
More informationCapturing light. Source: A. Efros
Capturing light Source: A. Efros Review Pinhole projection models What are vanishing points and vanishing lines? What is orthographic projection? How can we approximate orthographic projection? Lenses
More informationGame Technology. Lecture Physically Based Rendering. Dipl-Inform. Robert Konrad Polona Caserman, M.Sc.
Game Technology Lecture 7 4.12.2017 Physically Based Rendering Dipl-Inform. Robert Konrad Polona Caserman, M.Sc. Prof. Dr.-Ing. Ralf Steinmetz KOM - Multimedia Communications Lab PPT-for-all v.3.4_office2010
More informationFast Approximation to Spherical Harmonic Rotation
Fast Approximation to Spherical Harmonic Rotation Jaroslav Křivánek Czech Technical University Jaakko Konttinen Univ of Central Florida Sumanta Pattanaik Univ of Central Florida Kadi Bouatouch IRISA/INRIA
More information