Monte Carlo Path Tracing

Save this PDF as:

Size: px
Start display at page:

Transcription

1 CS294-13: Advanced Computer Graphics Lecture #5 University of California, Berkeley Wednesday, 23 September 29 Monte Carlo Path Tracing Lecture #5: Wednesday, 16 September 29 Lecturer: Ravi Ramamoorthi Scribe: Mason Smith 1 Motivation The rendering equation, given in the previous lectures, provides a theoretical solution for computing the radiance at any point in the scene. However, direct analytic computation of the integral is intractable for anything besides the most trivial of scenes. Monte Carlo path tracing is a practical general solution to the rendering problem, which tries to enumerate all light paths in the scene. As we shall see later, in a standard practical implementation, we perform direct and indirect sampling separately. Last class, we talked about breaking up the rendering equation integral by object. We can further decompose the integral based on object types (indirectly illuminated, light source, etc.) Figure 1: In both of these path tracing examples, 1 paths were used per pixel. Notice how the second example is much more noisy, due to the specular brdfs used for the spheres. 1.1 Advantages and Disadvantages Many of the advantages of Monte Carlo path tracing (MCPT) come from its generality. MCPT is capaable of rendering any type of geometry, with any BRDF.

2 2 CS294-13: Lecture #5 Figure 2: Examples from the arnold renderer Furthermore, MCPT takes into account all types of light paths. We can enumerate light paths using regular expression notation. If we let S and D represent specular and diffuse surfaces and we let L and E represent the light and the camera eye repsectively, then we note that MCPT can handle all light paths L(S D) E. By contrast, Whitted ray tracing cannot handle diffuse-diffuse reflections of the form LDDD E, and radiosity does not handle specular reflections, e.g. of the form LDSS E. MCPT has other advantages. Basic MCPT is an unbiased algorithm. Recall that T (X) is an unbiased estimator of X if E[T (X)] = X. Thus, error in the image appears as noise do the the variance of the sample estimates, rather than less visually-appealing structured artifacts. The main disadvantage to MCPT is its speed. The final result converges only in Θ(n), where n is the number of samples used in the approxmation. We can use various approaches to try to decrease the variance in the image or increase the speed of the algorithm, but these extensions often sacrificed the unbiased nature of the algorithm. 2 Monte Carlo Path Tracing In MCPT, we integrate the radiance for each pixel by randomly sampling paths and computing the radiance along those paths. We use the samples as an estimate for the radiance.

3 CS294-13: Lecture # Simple Implementation Here we present a (very) naïve implementation of MCPT. for all pixels p do Cast n samples within pixel square and average pixel color+= 1 T racep ath(p, d) n end for T racep ath(p, d) : BEGIN Find nearest intersection p if Emitted then { The extra factor of 2 comes from the probability 1 reweighting. } 2 return 2 L emit else if Reflected then Generate ray in random direction d return 2 f r (d d ) (n d ) T racep ath(p, d ) end if END This implementation is naïve in a number of ways. First, this method essentially doesn t support point-light sources. Since the probability of choosing a random direction point directly at a point light is essentially, we would never record any contribution from these lights. Furthermore, this method wastes a large number of rays. For instance, for nonemissive objects in the scene, we waste 5% of the the rays by returning no luminance. We want to improve efficiency, ideally without introducing bias. For this, we rely on some of the variance reduction techinques discussed in previous lectures. 3 Variance Reduction 3.1 Importance Sampling In many scenes, certain areas contribute more to the scene than others. For instance, direct lighting on an object typically contributes much more to the observed radiance than indirect lighting, whenever direct lighting is present. Similarly, output angles with a higher BRDF, given the incoming angles, will contribute more to the radiance at a point on a surface. As an extreme example, consider a perfectly specular mirror. For a given incoming direction, all of the radiance is contributed by exactly one outgoing direction. Even taking a thousand samples will likely yield no contribution, compared to just one sample in the ideal direction. Importance sampling uses this phenomenon to our advantage. With importance sampling, we bias our sample paths towards those where we expect a larger contribution. This can occur in two ways, as outlined above:

4 4 CS294-13: Lecture #5 On a macro level, we can change our bias towards reflected vs. emitted contributions, or we can cast more rays toward light sources. On a micro or local level, we use importance sampling on the BRDF to choose ray directions. In order to keep our estimate unbiased, we need to weight our estimates by the inverse of the probability that they were picked. In other words, samples from low-probability areas are given a higher weight becuase they are more representative than the many samples from high-probability areas. This is no different from the original algorithm, where we used the factor fo 2 to compensate for the 5% probability of choosing either path Macro -level Importance Sampling Let s apply importance sampling to the previously outlined algorithm: T racep ath(p, d) : BEGIN Find nearest intersection p if L e = (,, ) then p emit := else p emit :=.9 end if if rand() < p emit then return 1 p emit L emit else Generate ray in random direction d return 1 1 p emit f r (d d ) (n d ) T racep ath(p, d ) end if END Aside: Do we want to sample regions with high values or high variance? In practice, finding high-value regions is easier Micro -level Importance Sampling To reflect the importance of direct lighiting, we can try the following variation: Reflected Ray variation: Pick a light source Trace a ray toward the light Trace a ray not hitting the light (via rejection sampling) 1/(solid angle) for ray to light source (1 - above) for non-light ray Also include an extra factor of two, to compensate for shooting two rays

5 CS294-13: Lecture #5 5 In some sense, this happens naturally anyway (show picture). However, this algorithm uses two rays on each iteration, rather than one, to decrease variance. 3.2 Russian Roulette In addition to importance sampling, we can exploit other techniques to decrease variance. In Russian roulette, we decrease the number of rays by terminating some rays prematurely and giving them extra weight. Specifically we choose a probability p term. We keep track of the cummulative weight in TracePath, and once weight < p term, we terminate the path, weighting it by 1/(1 p). Note that, using the terminated X as an estimator for X, we have E[X ] = p + (1 p) E[X] 1 p Thus, Russian roulette is also unbiased. = E[X] (1) 3.3 Path Tracing with Direct Lighting In this modification, we add the direct lighting contribution on every iteration of T racep ath, rather than stochastically in some iterations. Step 1: Choose a camera ray r := (x, y, u, v, t) weight := 1 L = Step 2: Find surface-ray intersection p Step 3: L += weight L[light sources] weight = reflectance Choose r based on the BRDF (p, r) goto Step 2 4 Path Tracing Extensions We briefly describe further extensions to the path-tracing algorithm, to improve the speed and quality of the resulting image.

6 6 CS294-13: Lecture #5 4.1 Unbiased Extensions Bi-Directional Path Tracing Some of our previous variations accounted for the importance of direct lighting and weighed it appropriately. Similarly, some indirect lighting effects may be difficult to happen upon when tracing rays from the eye. In bi-directional path tracing, we sample paths starting at both the eye and the lights in the scene. Figure 3: This image was rendered using bi-directional path tracing Metropolis Light Transport Following on this idea of backward tracing, the Metropolis Light Tranpsort (MLT) algorithm similarly traces paths starting at the scene lights. The algorithm generates a sequence of paths by mutating a current path with some chosen probability of acceptance. The algorithm is particularly efficient when the scene is largely lit by indirect illumination. The Veach paper on MLT is here.

7 CS294-13: Lecture # Biased, Consistent Extensions Even if an estimator T N (X 1,..., X N ) for X is biased, it can still be acceptable if it is consistent. An estimator T N is consistent if lim N > T N (X 1,..., X N ) = X. That is, a consistent estimator approaches the correct value in the limit Noise Filtering In path tracing images, most of the noise is due to indirect illumination over multiple bounces, rather than direct illumination. By separating the direct and indirect contributions and applying noise-reducing algorithms on the latter, we can significantly reduce noise in the image without blurring the entire image significantly. The UCSD Graphics page contains a useful reference Adaptive Sampling In adaptive sampling, we devote extra samples to pixels where we have high variance Irradiance Caching Irradiance caching takes advantage of the observation that indirect illumination typically more slowly over a surface than direct illumination. With irradiance caching, we store the results of indirect illumination samples, and use these samples as estimates for nearby points. Using this method, we only compute indirect illumination in areas where we don t have enough estimates, saving significant computational effort. One reference for irradiance caching is given here. Figure 4: On the left is an image rendered using irradiance caching. On the right, the points where the indirect illumination estimates were cached are visualized on the image.

8 8 CS294-13: Lecture #5 5 2D Sampling Techniques We use sampling in a number of ways during path tracing. For instance, we might takes samples with a pixel, on the lens, over an area light source, or over a projected solid angle. We can generate random directions over a hemisphere via two methods: rejection sampling and inversion. (We ve seen these two methods in previous lectures as well.) 5.1 Rejection Sampling In essence, we generate random numbers in the cube, reject elements outside of the sphere, normalize, and flip to the proper hemisphere if necessary. 1: Generate (x, y, z), x, y, z [ 1, 1] 2: Reject if x 2 + y 2 + z 2 > 1 3: (x, y, z ) := Normalize(x, y, z) 4: Flip if(x, y, z ) n < Note that rejection sampling only works for uniform distributions. method, shown below, will generalize to non-uniform distributions. The inversion 5.2 Inversion Method For the upper hemisphere, we have: 1 = 1 2π = = π 2 π 2 2π π 2 sin θ dθ p(θ) dθ sin θ dθ dφ 2π 2π 1 2π dφ q(φ) dφ where p(θ) = sin(θ) and q(φ) = 1 are the separable probability distribution functinos. These yield cumuluative distributions functions 2π of and P (x) = x p(θ) dθ = cos θ ] x = 1 cos x

9 CS294-13: Lecture #5 9 Q(y) = y = φ 2π ] y = y 2π p(φ) dφ repsectively. By inverting these CDFs, we can sample the hemisphere surface uniformly. Note that inverting P directly suggests that we assign arccos (1 x) to θ, rather than arccos (x). However, sampling 1 x and x uniformly are equivalent, so we can use the simpler derivation. 1: Choose x [, 1], y [, 1], both uniformly 2: θ := arccos (x) 3: φ := 2πy 4: (x, y, z) := (sin θ cos φ, sin θ sin φ, cos θ) 5: Rotate to be around the normal, instead of the z-axis 5.3 Inversion Method For Importance Sampling In the Lambertian diffuse model, we d like to importance sample not only with respect to the BRDF, but also with respect to the cosine of the angle to the normal. Thus, we should use p(θ) = sin θ cos θ, rather than the p(θ) = sin θ as above. By performing a similar computation as above, we find that P (x) = 1 cos 2 (x), after normalization. Thus, for the Lambertian BRDF, we sample as follows: 1: Choose x [, 1], y [, 1], both uniformly 2: θ := arccos ( x) 3: φ := 2πy 4: (x, y, z) := (sin θ cos φ, sin θ sin φ, cos θ) 5: Rotate to be around the normal, instead of the z-axis

CSE168 Computer Graphics II, Rendering. Spring 2006 Matthias Zwicker

CSE168 Computer Graphics II, Rendering Spring 2006 Matthias Zwicker Last time Global illumination Light transport notation Path tracing Sampling patterns Reflection vs. rendering equation Reflection equation

Path Tracing. Michael Doggett Department of Computer Science Lund university. 2012 Michael Doggett

Path Tracing Michael Doggett Department of Computer Science Lund university 2012 Michael Doggett Outline Light transport notation Radiometry - Measuring light Illumination Rendering Equation Monte Carlo

Computer Graphics Global Illumination (2): Monte-Carlo Ray Tracing and Photon Mapping. Lecture 15 Taku Komura

Computer Graphics Global Illumination (2): Monte-Carlo Ray Tracing and Photon Mapping Lecture 15 Taku Komura In the previous lectures We did ray tracing and radiosity Ray tracing is good to render specular

An introduction to Global Illumination. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology

An introduction to Global Illumination Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Isn t ray tracing enough? Effects to note in Global Illumination image:

Advanced Computer Graphics. Rendering Equation. Matthias Teschner. Computer Science Department University of Freiburg

Advanced Computer Graphics Rendering Equation Matthias Teschner Computer Science Department University of Freiburg Outline rendering equation Monte Carlo integration sampling of random variables University

path tracing computer graphics path tracing 2009 fabio pellacini 1

path tracing computer graphics path tracing 2009 fabio pellacini 1 path tracing Monte Carlo algorithm for solving the rendering equation computer graphics path tracing 2009 fabio pellacini 2 solving rendering

PHOTON mapping is a practical approach for computing global illumination within complex

7 The Photon Mapping Method I get by with a little help from my friends. John Lennon, 1940 1980 PHOTON mapping is a practical approach for computing global illumination within complex environments. Much

Monte Carlo Path Tracing

HELSINKI UNIVERSITY OF TECHNOLOGY 16.4.2002 Telecommunications Software and Multimedia Laboratory Tik-111.500 Seminar on Computer Graphics Spring 2002: Advanced Rendering Techniques Monte Carlo Path Tracing

PATH TRACING: A NON-BIASED SOLUTION TO THE RENDERING EQUATION

PATH TRACING: A NON-BIASED SOLUTION TO THE RENDERING EQUATION ROBERT CARR AND BYRON HULCHER Abstract. In this paper we detail the implementation of a path tracing renderer, providing a non-biased solution

Path tracing everything. D.A. Forsyth

Path tracing everything D.A. Forsyth The Rendering Equation- 1 We can now write L o (x, ω o )=L e (x, ω o )+ Ω Angle between normal and incoming direction ρ bd (x, ω o, ω i )L i (x, ω i ) cos θ i dω i

Metropolis Light Transport. Samuel Donow, Mike Flynn, David Yan CS371 Fall 2014, Morgan McGuire

Metropolis Light Transport Samuel Donow, Mike Flynn, David Yan CS371 Fall 2014, Morgan McGuire Overview of Presentation 1. Description of necessary tools (Path Space, Monte Carlo Integration, Rendering

Chapter 10. Bidirectional Path Tracing

Chapter 10 Bidirectional Path Tracing In this chapter, we describe a new light transport algorithm called bidirectional path tracing. This algorithm is a direct combination of the ideas in the last two

CS 431/636 Advanced Rendering Techniques" Dr. David Breen" Korman 105D" Wednesday 6PM 8:50PM" Photon Mapping" 5/2/12" Slide Credits - UC San Diego Goal Efficiently create global illumination images with

Rendering Area Sources D.A. Forsyth

Rendering Area Sources D.A. Forsyth Point source model is unphysical Because imagine source surrounded by big sphere, radius R small sphere, radius r each point on each sphere gets exactly the same brightness!

Specular reflection. Dielectrics and Distribution in Ray Tracing. Snell s Law. Ray tracing dielectrics

Specular reflection Dielectrics and Distribution in Ray Tracing CS 465 Lecture 22 Smooth surfaces of pure materials have ideal specular reflection (said this before) Metals (conductors) and dielectrics

Lecture 11: Ray tracing

Interactive Computer Graphics Lecture 11: Ray tracing Graphics Lecture 11: Slide 1 Some slides adopted from H. Pfister, Harvard Graphics Lecture 10: Slide 2 Direct and Global Illumination Direct illumination:

CS 563 Advanced Topics in Computer Graphics Russian Roulette - Sampling Reflectance Functions by Alex White

CS 563 Advanced Topics in Computer Graphics Russian Roulette - Sampling Reflectance Functions by Alex White Monte Carlo Ray Tracing Monte Carlo In ray tracing, use randomness to evaluate higher dimensional

Monte Carlo Ray Tracing

Monte Carlo Ray Tracing Siggraph 2003 Course 44 Tuesday, July 29, 2003 Organizer Henrik Wann Jensen University of California, San Diego Lecturers James Arvo University of California, Irvine Phil Dutre

Mathematics for Global Illumination

Mathematics for Global Illumination Massimo Picardello Mathematics Department, University of Roma Tor Vergata Abstract and disclaimer This is a simple, almost naif approach to the mathematics of global

The RADIANCE Lighting Simulation and Rendering System

The RADIANCE Lighting Simulation and Rendering System Written by Gregory J. Ward Lighting Group Building Technologies Program Lawrence Berkeley Laboratory COMPUTER GRAPHICS Proceedings, Annual Conference

Deferred Shading & Screen Space Effects

Deferred Shading & Screen Space Effects State of the Art Rendering Techniques used in the 3D Games Industry Sebastian Lehmann 11. Februar 2014 FREESTYLE PROJECT GRAPHICS PROGRAMMING LAB CHAIR OF COMPUTER

Volumetric Path Tracing

Volumetric Path Tracing Steve Marschner Cornell University CS 6630 Spring 2012, 8 March Using Monte Carlo integration is a good, easy way to get correct solutions to the radiative transfer equation. It

Dhiren Bhatia Carnegie Mellon University

Dhiren Bhatia Carnegie Mellon University University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date

INTRODUCTION TO RENDERING TECHNIQUES

INTRODUCTION TO RENDERING TECHNIQUES 22 Mar. 212 Yanir Kleiman What is 3D Graphics? Why 3D? Draw one frame at a time Model only once X 24 frames per second Color / texture only once 15, frames for a feature

Path Tracing Overview

Path Tracing Overview Cast a ray from the camera through the pixel At hit point, evaluate material Determine new incoming direction Update path throughput Cast a shadow ray towards a light source Cast

CUBE-MAP DATA STRUCTURE FOR INTERACTIVE GLOBAL ILLUMINATION COMPUTATION IN DYNAMIC DIFFUSE ENVIRONMENTS

ICCVG 2002 Zakopane, 25-29 Sept. 2002 Rafal Mantiuk (1,2), Sumanta Pattanaik (1), Karol Myszkowski (3) (1) University of Central Florida, USA, (2) Technical University of Szczecin, Poland, (3) Max- Planck-Institut

Improving SIMD Efficiency for Parallel Monte Carlo Light Transport on the GPU. by Dietger van Antwerpen

Improving SIMD Efficiency for Parallel Monte Carlo Light Transport on the GPU by Dietger van Antwerpen Outline Introduction Path Tracing Bidirectional Path Tracing Metropolis Light Transport Results Demo

A Ray Tracing Solution for Diffuse Interreflection

A Ray Tracing Solution for Diffuse Interreflection Gregory J. Ward Francis M. Rubinstein Robert D. Clear Lighting Systems Research Lawrence Berkeley Laboratory 1 Cyclotron Rd., 90-3111 Berkeley, CA 94720

Advanced Computer Graphics. Sampling. Matthias Teschner. Computer Science Department University of Freiburg

Advanced Computer Graphics Sampling Matthias Teschner Computer Science Department University of Freiburg Outline introduction sampling strategies low-discrepancy sequences mapping samples to a disk, sphere,

Image Synthesis. Ambient Occlusion. computer graphics & visualization

Image Synthesis Ambient Occlusion Ambient Occlusion (AO) Ambient Occlusion approximates the diffuse illumination of a surface based on its directly visible occluders Idea: Trace rays through the normal-oriented

Computer Animation: Art, Science and Criticism

Computer Animation: Art, Science and Criticism Tom Ellman Harry Roseman Lecture 12 Ambient Light Emits two types of light: Directional light, coming from a single point Contributes to diffuse shading.

Shading. Reading. Pinhole camera. Basic 3D graphics. Brian Curless CSE 557 Fall 2013. Required: Shirley, Chapter 10

Reading Required: Shirley, Chapter 10 Shading Brian Curless CSE 557 Fall 2013 1 2 Basic 3D graphics With affine matrices, we can now transform virtual 3D obects in their local coordinate systems into a

IN previous chapters we assumed that all lighting interactions occurred at surfaces. In particular,

4 Light Transport in Participating Media Thus, if one is to be five times as distant, make it five times bluer. Leonardo Da Vinci, 1452 1519 IN previous chapters we assumed that all lighting interactions

Image-based Lighting in Lightwave 3D

Image-based Lighting in LightWave Page 1 of 4 Image-based Lighting in Lightwave 3D 2001 Lightwave 3D Background The Lightwave 3D renderer is one of the most widely used in Film and Broadcast production

A Theoretical Framework for Physically Based Rendering

Volume 13, (1994) number 2, pp. 97-107 A Theoretical Framework for Physically Based Rendering Eric P. Lafortune and Yves D. Willems Department of Computer Science, Katholieke Universiteit Leuven Celestijnenlaan

Accelerating the bidirectional path tracing algorithm using a dedicated intersection processor

Universität Karlsruhe (TH) Forschungsuniversität - gegründet 1825 Fakultät für Informatik Institut für Betriebs- und Dialogsysteme Studienarbeit Accelerating the bidirectional path tracing algorithm using

Thea Omni Light. Thea Spot Light. Light setup & Optimization

Light setup In this tutorial we will learn how to setup lights inside Thea Studio and how to create mesh lights and optimize them for faster rendering with less noise. Let us have a look at the different

Pre-computing Lighting in Games. David Larsson Autodesk Inc.

Pre-computing Lighting in Games David Larsson Autodesk Inc. What is baked lighting? Precompute lighting information for static scenes and lights Typically baked to Vertices Textures Light probe points

Geometric and Radiometric Camera Calibration Shape From Stereo requires geometric knowledge of: Cameras extrinsic parameters, i.e. the geometric relationship between the two cameras. Camera intrinsic parameters,

Improved predictive modeling of white LEDs with accurate luminescence simulation and practical inputs

Improved predictive modeling of white LEDs with accurate luminescence simulation and practical inputs TracePro Opto-Mechanical Design Software s Fluorescence Property Utility TracePro s Fluorescence Property

Nikolay Stefanov, PhD Ubisoft Massive GLOBAL ILLUMINATION IN GAMES

Nikolay Stefanov, PhD Ubisoft Massive GLOBAL ILLUMINATION IN GAMES What is global illumination? Interaction between light and surfaces Adds effects such as soft contact shadows and colour bleeding Can

Path Tracing - Literature Research. Rick de Bruijne May 17, 2011

Path Tracing - Literature Research Rick de Bruijne May 17, 2011 1 Contents 1 Abstract 3 2 Natural Phenomena 4 2.1 Motion Blur....................................... 4 2.2 Fresnel..........................................

Outdoor beam tracing over undulating terrain

Outdoor beam tracing over undulating terrain Bram de Greve, Tom De Muer, Dick Botteldooren Ghent University, Department of Information Technology, Sint-PietersNieuwstraat 4, B-9000 Ghent, Belgium, {bram.degreve,tom.demuer,dick.botteldooren}@intec.ugent.be,

Radiance Caching for Participating Media Wojciech Jarosz Craig Donner Matthias Zwicker Henrik Wann Jensen University of California, San Diego Pixel Lab http://mev.fopf.mipt.ru Wojciech Jarosz http://mattmosher.com/

CS 563 Advanced Topics in Computer Graphics Sampling Techniques. by Wadii Bellamine

CS 563 Advanced Topics in Computer Graphics Sampling Techniques by Wadii Bellamine Outline Why do we need sampling techniques? What are the characteristics of good sampling techniques? What are some common

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition 1. Image Pre-Processing - Pixel Brightness Transformation - Geometric Transformation - Image Denoising 1 1. Image Pre-Processing

Photon Mapping Made Easy Tin Tin Yu, John Lowther and Ching Kuang Shene Department of Computer Science Michigan Technological University Houghton, MI 49931 tiyu,john,shene}@mtu.edu ABSTRACT This paper

Lezione 4: Grafica 3D*(II)

Lezione 4: Grafica 3D*(II) Informatica Multimediale Docente: Umberto Castellani *I lucidi sono tratti da una lezione di Maura Melotti (m.melotti@cineca.it) RENDERING Rendering What is rendering? Rendering

Acceleration Methods for Ray Tracing based Global Illumination

Acceleration Methods for Ray Tracing based Global Illumination Dissertation zur Erlangung des Doktorgrades Dr. rer. nat. der Fakultät für Ingenieurwissenschaften und Informatik der Universität Ulm vorgelegt

Shading. Reading. Pinhole camera. Basic 3D graphics. Brian Curless CSE 557 Fall 2014. Required: Shirley, Chapter 10

Reading Required: Shirley, Chapter 10 Shading Brian Curless CSE 557 Fall 2014 1 2 Basic 3D graphics With affine matrices, we can now transform virtual 3D objects in their local coordinate systems into

Radiometry. Steve Marschner Cornell University CS 6630 Spring 2012, 26 January

Radiometry Steve Marschner Cornell University CS 6630 Spring 2012, 26 January Radiometry is a system for describing the flow of radiant energy through space. It is essentially a geometric topic all the

Efficient Implementation of Bi-directional Path Tracer on GPU

Efficient Implementation of Bi-directional Path Tracer on GPU Bc. Vilém Otte Supervised by: RNDr. Marek Vinkler Ph.D. Faculty of Informatics Masaryk University Brno / Czech Republic Abstract Most of the

Lighting Estimation in Indoor Environments from Low-Quality Images

Lighting Estimation in Indoor Environments from Low-Quality Images Natalia Neverova, Damien Muselet, Alain Trémeau Laboratoire Hubert Curien UMR CNRS 5516, University Jean Monnet, Rue du Professeur Benoît

Monte Carlo Sampling Methods

[] Monte Carlo Sampling Methods Jasmina L. Vujic Nuclear Engineering Department University of California, Berkeley Email: vujic@nuc.berkeley.edu phone: (50) 643-8085 fax: (50) 643-9685 [2] Monte Carlo

Introduction to Computer Graphics

Introduction to Computer Graphics Torsten Möller TASC 8021 778-782-2215 torsten@sfu.ca www.cs.sfu.ca/~torsten Today What is computer graphics? Contents of this course Syllabus Overview of course topics

Lecture 3: Solving Equations Using Fixed Point Iterations

cs41: introduction to numerical analysis 09/14/10 Lecture 3: Solving Equations Using Fixed Point Iterations Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore Our problem,

Convention Paper Presented at the 118th Convention 2005 May 28 31 Barcelona, Spain

Audio Engineering Society Convention Paper Presented at the 118th Convention 2005 May 28 31 Barcelona, Spain This convention paper has been reproduced from the author s advance manuscript, without editing,

Reflectance Characteristics of Accuflect Light Reflecting Ceramic

Reflectance Characteristics of Accuflect Light Reflecting Ceramic Copyright July 1 Accuratus Corporation 35 Howard Street Phillipsburg, NJ 8865 USA +1.98.13.77 http://accuratus.com SUMMARY Accuflect is

Efficient Illumination by High Dynamic Range Images

Eurographics Symposium on Rendering 23 Per Christensen and Daniel Cohen-Or (Editors) Efficient Illumination by High Dynamic Range Images Thomas Kollig 1 and Alexander Keller 2 1 Department of Computer

Architecture of a Graphics Pipeline. 6 February 2007 CMPT370 Dr. Sean Ho Trinity Western University

Architecture of a Graphics Pipeline 6 February 2007 CMPT370 Dr. Sean Ho Trinity Western University Review last time Visual computing: Computer graphics and image analysis Objectives of visual computing

Illumination Models and Shading. Foley & Van Dam, Chapter 16

Illumination Models and Shading Foley & Van Dam, Chapter 16 Illumination Models and Shading Light Source Models Ambient Illumination Diffuse Reflection Specular Reflection Polygon Rendering Methods Flat

A Short Introduction to Computer Graphics

A Short Introduction to Computer Graphics Frédo Durand MIT Laboratory for Computer Science 1 Introduction Chapter I: Basics Although computer graphics is a vast field that encompasses almost any graphical

CS3220 Lecture Notes: QR factorization and orthogonal transformations

CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss

Brightness and geometric transformations

Brightness and geometric transformations Václav Hlaváč Czech Technical University in Prague Center for Machine Perception (bridging groups of the) Czech Institute of Informatics, Robotics and Cybernetics

Lecture PowerPoints. Chapter 23 Physics: Principles with Applications, 7 th edition Giancoli

Lecture PowerPoints Chapter 23 Physics: Principles with Applications, 7 th edition Giancoli This work is protected by United States copyright laws and is provided solely for the use of instructors in teaching

Ray tracing idea. Ray Tracing. Ray tracing algorithm. Plane projection in drawing. CS 465 Lecture 3

Ray tracing idea Ray Tracing CS 465 Lecture 3 2004 Steve Marschner 1 2004 Steve Marschner 2 Ray tracing algorithm Plane projection in drawing for each pixel { compute viewing ray intersect ray with scene

Ray Optics Minicourse COMSOL Tokyo Conference 2014

Ray Optics Minicourse COMSOL Tokyo Conference 2014 What is the Ray Optics Module? Add-on to COMSOL Multiphysics Can be combined with any other COMSOL Multiphysics Module Includes one physics interface,

Chapter 9 Shading This chapter covers the physics of how light reflects from surfaces and describes a method called photometric stereo for estimating the shape of surfaces using the reflectance properties.

CORIOLIS GROUP BOOK Advanced Graphics Programming Using C/C++ Loren Heiny John Wiley & Sons, Inc. New York Chichester Brisbane Toronto Singapore Contents Preface Who This Book Is For A Glance Inside What

Introduction to Medical Imaging. Lecture 11: Cone-Beam CT Theory. Introduction. Available cone-beam reconstruction methods: Our discussion:

Introduction Introduction to Medical Imaging Lecture 11: Cone-Beam CT Theory Klaus Mueller Available cone-beam reconstruction methods: exact approximate algebraic Our discussion: exact (now) approximate

Mean-Shift Tracking with Random Sampling

1 Mean-Shift Tracking with Random Sampling Alex Po Leung, Shaogang Gong Department of Computer Science Queen Mary, University of London, London, E1 4NS Abstract In this work, boosting the efficiency of

Computer Graphics. Course SS 2007 Antialiasing. computer graphics & visualization

Computer Graphics Course SS 2007 Antialiasing How to avoid spatial aliasing caused by an undersampling of the signal, i.e. the sampling frequency is not high enough to cover all details Supersampling -

An Efficient Spatio-Temporal Architecture for Animation Rendering

Eurographics Symposium on Rendering 2003 Per Christensen and Daniel Cohen-Or (Editors) An Efficient Spatio-Temporal Architecture for Animation Rendering Vlastimil Havran, Cyrille Damez, Karol Myszkowski,

Chapter 4 Variance Reduction Techniques

Chapter 4 Variance Reduction Techniques 4.1 PDF-modifying Variance Reduction In the next few sections, we will look at heuristic variance reduction techniques. Of course, it is not really the techniques

REAL-TIME IMAGE BASED LIGHTING FOR OUTDOOR AUGMENTED REALITY UNDER DYNAMICALLY CHANGING ILLUMINATION CONDITIONS

REAL-TIME IMAGE BASED LIGHTING FOR OUTDOOR AUGMENTED REALITY UNDER DYNAMICALLY CHANGING ILLUMINATION CONDITIONS Tommy Jensen, Mikkel S. Andersen, Claus B. Madsen Laboratory for Computer Vision and Media

Geometric Transformations

CS3 INTRODUCTION TO COMPUTER GRAPHICS Geometric Transformations D and 3D CS3 INTRODUCTION TO COMPUTER GRAPHICS Grading Plan to be out Wednesdas one week after the due date CS3 INTRODUCTION TO COMPUTER

Sensor Modeling for a Walking Robot Simulation. 1 Introduction

Sensor Modeling for a Walking Robot Simulation L. France, A. Girault, J-D. Gascuel, B. Espiau INRIA, Grenoble, FRANCE imagis, GRAVIR/IMAG, Grenoble, FRANCE Abstract This paper proposes models of short-range

Chapter 23. The Reflection of Light: Mirrors

Chapter 23 The Reflection of Light: Mirrors Wave Fronts and Rays Defining wave fronts and rays. Consider a sound wave since it is easier to visualize. Shown is a hemispherical view of a sound wave emitted

13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant

æ If 3 + 4 = x, then x = 2 gold bar is a rectangular solid measuring 2 3 4 It is melted down, and three equal cubes are constructed from this gold What is the length of a side of each cube? 3 What is the

COMP 558 Exercises 1 Oct 2, 2010

Questions 1. When a face is photographed from the front and from a small distance, the nose appears much larger than it should in comparison to the other parts of the face. Why? 2. Below are sketches of

INFOGR Computer Graphics. J. Bikker - April-July 2016 - Lecture 12: Post-processing. Welcome!

INFOGR Computer Graphics J. Bikker - April-July 2016 - Lecture 12: Post-processing Welcome! Today s Agenda: The Postprocessing Pipeline Vignetting, Chromatic Aberration Film Grain HDR effects Color Grading

Lighting and Reflectance Models

Lighting and Reflectance Models Basic principles of illumination and reflectance are introduced. They are central to understanding the dependence of image colour and intensity on material reflectance,

DYNAMIC RANGE IMPROVEMENT THROUGH MULTIPLE EXPOSURES. Mark A. Robertson, Sean Borman, and Robert L. Stevenson

c 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or

Lecture PowerPoints. Chapter 23 Physics: Principles with Applications, 7th edition Giancoli

Lecture PowerPoints Chapter 23 Physics: Principles with Applications, 7th edition Giancoli This work is protected by United States copyright laws and is provided solely for the use of instructors in teaching

ABS 731 Lighting Design & Technology. Spring 2006

ABS 731 Lighting Design & Technology Spring 2006 AGI32 is used to predict the photometric performance of selected luminaires or daylight penetration in a simulated environment. The environments that can

Simulating Multiple Scattering in Hair Using a Photon Mapping Approach

Simulating Multiple Scattering in Hair Using a Photon Mapping Approach Jonathan T. Moon Stephen R. Marschner Program of Computer Graphics Cornell University Abstract Simulating multiple scattering correctly

Advanced Topics in Source Modeling Mark S. Kaminski, Kevin J. Garcia, Michael A. Stevenson, Michael Frate, and R. John Koshel * Breault Research Organization, Inc. Copyright 2002 Society of Photo-Optical

MCRT: L6. Initial weight of packet: W = L / N MC At each interaction multiply weight by probability of scattering: W = a W

MCRT: L6 Variance reduction techniques improve signal-to-noise of simulation using same number of MC packets Examples of where MCRT is inefficient optically thin (need lots of photons) Weights keep packet

(Refer Slide Time: 00:01:23 min)

Computer Aided Design Prof. Anoop Chalwa Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture No. # 02 Input Output Devices, Raster Graphics Today we will be talking about

Demonstration Experiments: The Grating Spectrometer 27 September 2012

8 The Grating Spectrometer Introduction: A spectrometer is an instrument used to study the spectrum of light. The light source can be anything from a cryogenically cooled crystal to a superhot plasma or

Computer Graphics Volume 18, Number 3 July 1984

Distributed Ray Tracing Robert L. Cook Thomas Porter Loren Carpenter Computer Division Lucasfilm Ltd. Abstract Ray tracing is one of the most elegant techniques in computer graphics. Many phenomena that

Depth from a single camera

Depth from a single camera Fundamental Matrix Essential Matrix Active Sensing Methods School of Computer Science & Statistics Trinity College Dublin Dublin 2 Ireland www.scss.tcd.ie 1 1 Geometry of two

An Optical Sudoku Solver

An Optical Sudoku Solver Martin Byröd February 12, 07 Abstract In this report, a vision-based sudoku solver is described. The solver is capable of solving a sudoku directly from a photograph taken with

Introduction to Spectral Reflectance (passive sensors) Overview. Electromagnetic Radiation (light) 4/4/2014

Introduction to Spectral Reflectance (passive sensors) Kelly R. Thorp Research Agricultural Engineer USDA-ARS Arid-Land Agricultural Research Center Overview Electromagnetic Radiation (light) Solar Energy

WHITE PAPER. Source Modeling for Illumination Design. Zemax A Radiant Zemax Company

Source Modeling for Illumination Design Source Modeling for Illumination Design Authored by: Ronald F. Rykowski and C. Benjamin Wooley Abstract As computation speeds have increased dramatically over the

Figure 5.12: Room with one shadow ray per viewing ray. area, lens area, light source area, and reection ray direction. Each of these two dimensional

Figure 5.12: Room with one shadow ray per viewing ray. 5.5 Strategies for Non-adaptive Sampling In the last section, the integrals used to calculate pixel brightness were phrased in terms of stratied Monte

Real-time skin rendering on graphics hardware

Real-time skin rendering on graphics hardware Pedro V. Sander David Gosselin Jason L. Mitchell ATI Research Skin shading Most lighting comes from sub-surface scattering Traditional Lambertian lighting