02/9/05© 2005 University of Wisconsin Last Time Lights Next assignment – Implement Kubelka-Munk as a BSDF.

Slides:



Advertisements
Similar presentations
Photorealistic Rendering. Ray tracing v. photorealistic rendering What illumination effects are not captured by ray tracing? What illumination effects.
Advertisements

Ray Tracing & Radiosity Dr. Amy H. Zhang. Outline  Ray tracing  Radiosity.
Subsurface scattering Model of light transport in translucent materials Marble, jade, milk, skin Light penetrates material and exits at different point.
Computer Graphics - Class 10
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Previous lecture Reflectance I BRDF, BTDF, BSDF Ideal specular.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lectures 18, 19: Monte Carlo Integration Ravi Ramamoorthi Acknowledgements.
CSCE 641: Photon Mapping Jinxiang Chai. Outline Rendering equation Photon mapping.
Photon Tracing with Arbitrary Materials Patrick Yau.
Advanced Computer Graphics (Fall 2009) CS 294, Rendering Lecture 5: Monte Carlo Path Tracing Ravi Ramamoorthi
Radiosity A Fascinating Presentation by Alex Danilevky.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 10: Global Illumination Ravi Ramamoorthi Some images courtesy.
Rendering General BSDFs and BSSDFs Randy Rauwendaal.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 20: Monte Carlo Path Tracing Ravi Ramamoorthi Acknowledgements.
1 Monte Carlo Global Illumination Brandon Lloyd COMP 238 December 16, 2002.
Paper by Alexander Keller
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Global Illumination Jian Huang, CS 594, Fall 2002 This set of slides reference text book and the course note of Dutre et. al on SIGGRAPH 2001.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
02/11/05© 2005 University of Wisconsin Last Time Direct Lighting Light Transport Equation (LTE) Intro.
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
01/28/05© 2005 University of Wisconsin Last Time Improving Monte Carlo Efficiency.
Today More raytracing stuff –Soft shadows and anti-aliasing More rendering methods –The text book is good on this –I’ll be using images from the CDROM.
12/05/02(c) 2002 University of Wisconsin Last Time Subdivision techniques for modeling Very brief intro to global illumination.
02/25/05© 2005 University of Wisconsin Last Time Meshing Volume Scattering Radiometry (Adsorption and Emission)
02/28/05© 2005 University of Wisconsin Last Time Scattering theory Integrating tranfer equations.
-Global Illumination Techniques
01/29/03© 2003 University of Wisconsin Last Time Radiosity.
Monte Carlo I Previous lecture Analytical illumination formula This lecture Numerical evaluation of illumination Review random variables and probability.
02/16/05© 2005 University of Wisconsin Last Time Re-using paths –Irradiance Caching –Photon Mapping.
CS447/ Realistic Rendering -- Radiosity Methods-- Introduction to 2D and 3D Computer Graphics.
02/18/05© 2005 University of Wisconsin Last Time Radiosity –Converting the LTE into the radiosity equation –Solving with Gauss-Seidel relaxation –Form.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
02/10/03© 2003 University of Wisconsin Last Time Participating Media Assignment 2 –A solution program now exists, so you can preview what your solution.
Computer Graphics Global Illumination: Photon Mapping, Participating Media Lecture 12 Taku Komura.
Path Integral Formulation of Light Transport
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
111/17/ :21 Graphics II Global Rendering and Radiosity Session 9.
04/30/02(c) 2002 University of Wisconsin Last Time Subdivision techniques for modeling We are now all done with modeling, the standard hardware pipeline.
On robust Monte Carlo algorithms for multi-pass global illumination Frank Suykens – De Laet 17 September 2002.
Pure Path Tracing: the Good and the Bad Path tracing concentrates on important paths only –Those that hit the eye –Those from bright emitters/reflectors.
02/12/03© 2003 University of Wisconsin Last Time Intro to Monte-Carlo methods Probability.
02/2/05© 2005 University of Wisconsin Last Time Reflectance part 1 –Radiometry –Lambertian –Specular.
In the name of God Computer Graphics. Last Time Some techniques for modeling Today Global illumination and raytracing.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
Slide 1Lastra, 2/14/2016 Monte-Carlo Methods. Slide 2Lastra, 2/14/2016 Topics Kajiya’s paper –Showed that existing rendering methods are approximations.
Monte Carlo Path Tracing
01/19/05© 2005 University of Wisconsin CS 779: Rendering Prof Stephen Chenney Spring 2005
Global Illumination (3) Photon Mapping (1). Overview Light Transport Notation Path Tracing Photon Mapping –Photon Tracing –The Photon Map.
01/26/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
02/07/03© 2003 University of Wisconsin Last Time Finite element approach Two-pass approaches.
Global Illumination (3) Path Tracing. Overview Light Transport Notation Path Tracing Photon Mapping.
PATH INTEGRAL FORMULATION OF LIGHT TRANSPORT Jaroslav Křivánek Charles University in Prague
Distributed Ray Tracing. Can you get this with ray tracing?
Distributed Ray Tracing. Can you get this with ray tracing?
Computer graphics III – Multiple Importance Sampling Jaroslav Křivánek, MFF UK
Lesson 8: Basic Monte Carlo integration
Shading Revisited Some applications are intended to produce pictures that look photorealistic, or close to it The image should look like a photograph A.
Sampling and Reconstruction of Visual Appearance
© 2003 University of Wisconsin
© University of Wisconsin, CS559 Fall 2004
The Rendering Equation
© 2005 University of Wisconsin
(c) 2002 University of Wisconsin
Path Tracing (some material from University of Wisconsin)
Monte Carol Integration
(c) 2002 University of Wisconsin
Monte Carlo Path Tracing
Monte Carlo Rendering Central theme is sampling:
Monte Carlo Path Tracing and Caching Illumination
Photon Density Estimation using Multiple Importance Sampling
Presentation transcript:

02/9/05© 2005 University of Wisconsin Last Time Lights Next assignment – Implement Kubelka-Munk as a BSDF

02/9/05© 2005 University of Wisconsin Today Direct Lighting The Light Transport Equation

02/9/05© 2005 University of Wisconsin Direct Lighting (Sect 16.1) The direct lighting equation only accounts for power leaving the light, being reflected once or not at all, and hitting the image –L(D|S|G)E and LE paths in Heckbert’s 1994 notation Light to reflection to eye and light to eye –Also called “3 point transfer paths” + “2 point transfer paths” –Also called “1 bounce” paths

02/9/05© 2005 University of Wisconsin Direct Lighting Equation The integral is typically difficult to solve –Implicit in the L d term is visibility –The f r term may be non-analytic So we sample … Outgoing radiance toward eye If the point is a light Integral, over all incoming directions, of light reflected from sources

02/9/05© 2005 University of Wisconsin Breaking it Up Different lights and functions are best served by different sampling techniques Break up the domain of integration to most efficient handle each piece What are the sub-domains?

02/9/05© 2005 University of Wisconsin Light Path Classification L delta SEL delta GEL delta DE L area SEL area GEL area DE

02/9/05© 2005 University of Wisconsin Direct Lighting Equation Delta lights must be treated differently Delta reflectance functions must be treated differently Then there are two obvious ways to do the others Why is there no Delta Light - Delta Reflectance contribution?

02/9/05© 2005 University of Wisconsin Specular Reflectance Contribution Algorithmically, what are we doing?

02/9/05© 2005 University of Wisconsin Point Light Contribution Algorithmically, what are we doing?

02/9/05© 2005 University of Wisconsin Diffuse/Glossy to Area Contribution We will turn to Monte Carlo Integration for these contributions This is computed with SurfaceIntegrator in PBRT Two strategies: Multiple samples from all lights, or a single sample from a single light –Why two strategies?

02/9/05© 2005 University of Wisconsin Sampling All Lights Integral can be broken into sum over single lights To evaluate it, loop over lights and do a Monte Carlo estimate for each light –Samples to use for each light are passed into the integrator- details in book

02/9/05© 2005 University of Wisconsin Sampling One Light Say we want to evaluate E[f+g] If we choose, uniformly at random, to evaluate a sample with either f or g, then multiply it by 2, the expected value of the result is E[f+g] Result generalizes to any distribution for choosing which function to sample The upshot, we can choose a single sample from a single light, weight it appropriately, and use it for estimate

02/9/05© 2005 University of Wisconsin Sampling for Direct Lighting We can choose to sample according to BRDF’s importance function … Or we can sample according to light’s importance function Which is best depends on the situation

02/9/05© 2005 University of Wisconsin Multiple Importance Sampling (15.4.1) Say we want to integrate f(x)g(x) Say we have a good importance sampling pdf for f, p f, and another one suited to g, p g Using only p f gives high variance in some places because it is a bad match for the g component, and vice versa

02/9/05© 2005 University of Wisconsin Combining Importance Functions (1) You could get an estimate using the p f sampler, and another using the p g sampler, and then average their results: But this does nothing for variance – it is the sum of each estimators’ variance –Once variance is in the estimate, you can’t cancel it out

02/9/05© 2005 University of Wisconsin Combining Importance Functions (2) A better strategy includes a weight term for each sample: The weight term is chosen to provably reduce variance –It takes into account all the ways to generate each sample –We’ll see something similar later, with MCMC algorithms

02/9/05© 2005 University of Wisconsin Power Heuristic Even better at reducing variance: In practice,  =2 is good

02/9/05© 2005 University of Wisconsin Two Poor Estimators

02/9/05© 2005 University of Wisconsin Make One Good One

02/9/05© 2005 University of Wisconsin Many estimates

02/9/05© 2005 University of Wisconsin Combination of Estimates

02/9/05© 2005 University of Wisconsin PBRT’s DirectLighting Integrator It does not do the LSE case –Most algorithms that build on the DirectLighting integrator will treat these paths separately If it detects a L point case it just uses the estimate obtained by tracing a ray to the light Otherwise, it generates one estimate based on sampling the area light, another sampling the BSDF (but not the specular components), and combines them with the power heuristic

02/9/05© 2005 University of Wisconsin Light Transport Equation (Sect 16.2) Power leaving is power emitted plus incoming power that is scattered The trace operation, t(p,  ) traces a ray and finds the first surface seen There are many variants on this equation –Mostly related to changing domain of integration

02/9/05© 2005 University of Wisconsin Trivial Solutions In almost all cases, there is no closed form solution –Reflectance, visibility, and lights conspire to make it difficult But in some simple cases, a closed form solution exists –These are extremely useful test cases to ensure algorithm correctness Web sites exist with known solutions for simple geometry –Actually, web sites with Form Factors or Configuration Factors These are terms we will see again shortly –Combine these with uniform lighting and diffuse reflectance and you can solve –We saw this in the first assignment (a little)

02/9/05© 2005 University of Wisconsin Next Time Path Tracing Irradiance Caching