Bidirectional Lightcuts

Similar documents
Virtual Spherical Lights for Many-Light Rendering of Glossy Scenes

Scalable many-light methods

Effects of Global Illumination Approximations on Material Appearance

Lightcuts: A Scalable Approach to Illumination

Lecture 15: Many Lights. CS 6620, Spring 2009 Kavita Bala Computer Science Cornell University. Many Lights

In this part of the course, I will discuss various approaches for generating VPLs where they are most needed for a given camera view.

LightSlice: Matrix Slice Sampling for the Many-Lights Problem

Philipp Slusallek Karol Myszkowski. Realistic Image Synthesis SS18 Instant Global Illumination

GAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao

Precomputed & Hybrid Variants of Lightcuts

Advanced Graphics. Path Tracing and Photon Mapping Part 2. Path Tracing and Photon Mapping

Progressive photon mapping can be interpreted as an estimator that constructs the full paths from camera to light by constantly connecting two fresh

Fast Agglomerative Clustering for Rendering

Choosing the Right Algorithm & Guiding

Virtual Spherical Lights for Many-Light Rendering of Glossy Scenes

Lightcuts. Jeff Hui. Advanced Computer Graphics Rensselaer Polytechnic Institute

Single Scattering in Refractive Media with Triangle Mesh Boundaries

This course covers a group of global illumination algorithms known as many light methods, or VPL rendering methods. (VPL = virtual point light)

Pixelcuts: Scalable Approximate Illumination from Many Point Lights

Multidimensional Lightcuts

Lecture 12: Photon Mapping. Biased Methods

Discussion. Smoothness of Indirect Lighting. History and Outline. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Spring 2013)

CS 563 Advanced Topics in Computer Graphics Irradiance Caching and Particle Tracing. by Stephen Kazmierczak

Mixing Monte Carlo and Progressive Rendering for Improved Global Illumination

Illumination Algorithms

Practical Product Importance Sampling for Direct Illumination

Final Project: Real-Time Global Illumination with Radiance Regression Functions

Metropolis Light Transport

Motivation. Advanced Computer Graphics (Fall 2009) CS 283, Lecture 11: Monte Carlo Integration Ravi Ramamoorthi

Importance Sampling of Area Lights in Participating Media

Consider a partially transparent object that is illuminated with two lights, one visible from each side of the object. Start with a ray from the eye

Irradiance Gradients. Media & Occlusions

To Do. Real-Time High Quality Rendering. Motivation for Lecture. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing

Today. Participating media. Participating media. Rendering Algorithms: Participating Media and. Subsurface scattering

Global Illumination. COMP 575/770 Spring 2013

Toward Evaluating Progressive Rendering Methods in Appearance Design Tasks

Raytracing & Epsilon. Today. Last Time? Forward Ray Tracing. Does Ray Tracing Simulate Physics? Local Illumination

Toward Evaluating Progressive Rendering Methods in Appearance Design Tasks

Real-Time Global Illumination for Games using Topological Information

Global Illumination. Why Global Illumination. Pros/Cons and Applications. What s Global Illumination

A Brief Overview of. Global Illumination. Thomas Larsson, Afshin Ameri Mälardalen University

Path Tracing part 2. Steve Rotenberg CSE168: Rendering Algorithms UCSD, Spring 2017

The Rendering Equation. Computer Graphics CMU /15-662

Biased Monte Carlo Ray Tracing:

These are the annotated slides of the real time part of the Many Lights Rendering

Photon Mapping. Kadi Bouatouch IRISA

Photon Mapping. Michael Doggett Department of Computer Science Lund university

Schedule. MIT Monte-Carlo Ray Tracing. Radiosity. Review of last week? Limitations of radiosity. Radiosity

MIT Monte-Carlo Ray Tracing. MIT EECS 6.837, Cutler and Durand 1

rendering equation camera all

Biased Monte Carlo Ray Tracing

Rendering Algorithms: Real-time indirect illumination. Spring 2010 Matthias Zwicker

Realistic Image Synthesis

Monte Carlo Path Tracing. The Rendering Equation

Rendering: Reality. Eye acts as pinhole camera. Photons from light hit objects

Instant Radiosity for Real-Time Global Illumination

Global Illumination. Global Illumination. Direct Illumination vs. Global Illumination. Indirect Illumination. Soft Shadows.

Bidirectional Path Tracing

rendering equation computer graphics rendering equation 2009 fabio pellacini 1

Chapter 11 Global Illumination. Part 1 Ray Tracing. Reading: Angel s Interactive Computer Graphics (6 th ed.) Sections 11.1, 11.2, 11.

Stochastic Progressive Photon Mapping

Progressive Expectation Maximization for Hierarchical Volumetric Photon Mapping

Ongoing Developments in Photon Mapping

Reusing Shading for Interactive Global Illumination GDC 2004

The Rendering Equation. Computer Graphics CMU /15-662, Fall 2016

Recent Advances in Monte Carlo Offline Rendering

CMSC427 Shading Intro. Credit: slides from Dr. Zwicker

Variance Reduction. Computer Graphics CMU /15-662, Fall 2016

Other Rendering Techniques CSE 872 Fall Intro You have seen Scanline converter (+z-buffer) Painter s algorithm Radiosity CSE 872 Fall

Global Illumination. CSCI 420 Computer Graphics Lecture 18. BRDFs Raytracing and Radiosity Subsurface Scattering Photon Mapping [Ch

Variance reduction using interframe coherence for animated scenes

Global Illumination The Game of Light Transport. Jian Huang

Monte-Carlo Ray Tracing. Antialiasing & integration. Global illumination. Why integration? Domains of integration. What else can we integrate?

Progressive Photon Mapping: A Probabilistic Approach

REAL-TIME GPU PHOTON MAPPING. 1. Introduction

RND102 - Intro to Path Tracing & RIS in RenderMan

Real-Time Rendering with Lighting Grid Hierarchy

Corona Sky Corona Sun Corona Light Create Camera About

2/1/10. Outline. The Radiance Equation. Light: Flux Equilibrium. Light: Radiant Power. Light: Equation. Radiance. Jan Kautz

Radiometry & BRDFs CS295, Spring 2017 Shuang Zhao

THEA RENDER ADAPTIVE BSD ENGINE

Today. Global illumination. Shading. Interactive applications. Rendering pipeline. Computergrafik. Shading Introduction Local shading models

Motivation: Monte Carlo Path Tracing. Sampling and Reconstruction of Visual Appearance. Monte Carlo Path Tracing. Monte Carlo Path Tracing

I present Adjoint-Driven Russian Roulette and Splitting for efficient light transport simulation which is a part of my PhD.

Lighting. To do. Course Outline. This Lecture. Continue to work on ray programming assignment Start thinking about final project

Progressive Virtual Beam Lights

Progressive Photon Beams

COMBINING VOLUMETRIC ESTIMATORS

Computer graphics Labs: Blender (2/3) LuxRender: Interior Scene Rendering

Recollection. Models Pixels. Model transformation Viewport transformation Clipping Rasterization Texturing + Lights & shadows

Accelerated Raytracing

CS354R: Computer Game Technology

Global Rendering. Ingela Nyström 1. Effects needed for realism. The Rendering Equation. Local vs global rendering. Light-material interaction

Motivation. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing

SOME THEORY BEHIND REAL-TIME RENDERING

Ray Tracing. Computer Graphics CMU /15-662, Fall 2016

Global Illumination. Global Illumination. Direct Illumination vs. Global Illumination. Indirect Illumination. Soft Shadows.

Monte Carlo Path Tracing

Rendering Part I (Basics & Ray tracing) Lecture 25 December 1, 2015

Today. Global illumination. Shading. Interactive applications. Rendering pipeline. Computergrafik. Shading Introduction Local shading models

Transcription:

Bidirectional Lightcuts Bruce Walter Pramook Khungurn Kavita Bala Cornell University 1

Realistic Rendering Challenge Complex light sources Global illumination Wide range of materials Images: Autodesk 360 Rendering & Autodesk Homestyler 2

Realistic Rendering Challenge Complex light sources Global illumination Wide range of materials Glossy, subsurface, volumetric... 3

Equal Time Comparison Probabilistic Photon Map Multidimensional Lightcuts (VPL) Bidirectional Path Trace [Knaus & Zwicker 11] [Walter et al. 06] [Veach & Guibas 94,95] 4

Equal Time Comparison Probabilistic Photon Map Multidimensional Lightcuts (VPL) Bidirectional Path Trace 5

Equal Time Comparison Probabilistic Photon Map Multidimensional Lightcuts (VPL) Bidirectional Path Trace 6

Equal Time Comparison Probabilistic Multidimensional Bidirectional New Method Photon Map Lightcuts (VPL) Path Trace 7

Equal Time Comparison Probabilistic Multidimensional Bidirectional New Method Photon Map Lightcuts (VPL) Path Trace 8

Goal: Combine Strengths Multidimensional Lightcuts Biased virtual point light (VPL) method Low noise and scalable performance Bidirectional Path Tracing Noisy and slow to converge Supports wide range of materials 9

Bidirectional Lightcuts Bidirectional VPL algorithm Bidirectional estimators Novel weighting scheme Control bias vs. noise tradeoff Scalable and low noise Integrated with Lightcuts 10

Outline Prior work: VPL and Bidirectional review New weighting strategy Integration with Multidimensional Lightcuts Results 11

Virtual Point Light Methods Approximate global illumination using point lights Light Source Camera 12

Virtual Point Light Methods Approximate global illumination using point lights Generate point lights (VPL) VPL Light Source 13

Virtual Point Light Methods Approximate global illumination using point lights Generate point lights (VPL) Generate point sensors (VPS) Camera VPS 14

Virtual Point Light Methods Approximate global illumination using point lights Generate point lights (VPL) Generate point sensors (VPS) Gather illumination More VPLs = more accurate Camera 15

Material Appearance Problem Naive VPL (no clamping) 16

Material Appearance Problem Naive VPL (no clamping) Standard VPL (with clamping) - Clamping distorts material appearance [Krivanek et al. 10] 17

Material Appearance Problem Naive VPL (no clamping) Standard VPL (with clamping) Our Result - Clamping distorts material appearance [Krivanek et al. 10] 18

Prior VPL Work Adaptive VPL generation [Segovia et al. 06, Davidovic et al. 10] Modified VPLs [Hasan et al. 09] VPL bias compensation [Kollig & Keller 04, Engelhardt et al. 10, Novak et al. 11] Specialized BSSRDF extension [Arbree et al. 08] Hybrid algorithms [Dammertz et al. 10] 19

Bidirectional Path Tracing Review Bidirectional Path Tracing Camera Light Source 20

Bidirectional Path Tracing Review Bidirectional Path Tracing Trace path from light 21

Bidirectional Path Tracing Review Bidirectional Path Tracing Trace path from light Trace path from camera 22

Bidirectional Path Tracing Review Bidirectional Path Tracing Trace path from light Trace path from camera Sum over all connections 23

Bidirectional Path Tracing Review Multiple ways to generate each path 24

Bidirectional Path Tracing Review Multiple ways to generate each path 25

Bidirectional Path Tracing Review Multiple ways to generate each path 26

Bidirectional Path Tracing Review Multiple ways to generate each path Combine using weights: wi e.g., Balance heuristic Best connection depends on path w0 Unbiased if: wi = 1 w1 w2 27

Bidirectional Path Tracing Review Advantages Wider range of paths handled efficiently Disadvantages Increased cost per sample Some paths are still hard to find May be noisy or slow to converge 28

Bidirectional VPL Rendering Standard VPL rendering Limited subset of bidirectional methods Clamping causes weight sum < 1 29

Bidirectional VPL Rendering Standard VPL rendering Limited subset of bidirectional methods Clamping causes weight sum < 1 Bidirectional extension 30

Bidirectional VPL Rendering Standard VPL rendering Limited subset of bidirectional methods Clamping causes weight sum < 1 Bidirectional extension Unbiased weighting [Kollig & Keller 04] Low noise properties of VPL rendering is lost 31

Outline Prior work: VPL and Bidirectional review New weighting strategy Integration with Multidimensional Lightcuts Results 32

New Weighting Strategy Designed for low noise while minimizing bias Four weight constraints 1) Energy conservation 2) Clamping 3) Diffuse VPLs 4) Exclude high variance eye paths Actual weight is the minimum of constraints 33

First Weight Constraint 1) Energy conservation Weight sum 1 Reduce amortized cost Prefer shorter eye paths Lower cost Higher cost 34

Second Weight Constraint 2) Clamping Control VPL noise Matches previous clamping [Walter et al. 06] No clamping With clamping 35

Third Weight Constraint 3) Diffuse VPLs: Primarily a cost optimization Narrowly directional VPLs are inefficient Typically expensive with little effect Glossy Surface 36

Third Weight Constraint 3) Diffuse VPLs: Primarily a cost optimization Narrowly directional VPLs are inefficient Typically expensive with little effect New diffuse vs. glossy classifier Independent of material model Preserves Lambertian, isotropic, etc. Applicable to other rendering algorithms 37

Fourth Weight Constraint 4) Exclude high variance eye paths: Control VPS noise Based on directional spread heuristic 4a) Narrow eye ray spread E.g., sharp glossy reflections Unrestricted recursion 4b) Wide eye ray spread E.g., Subsurface, diffuse indirect Restrict to short range effects only 38

Diffuse Back Wall Plate 1 Plate 2 Plate 3 Narrow gloss Broad gloss 39

Standard VPL (not bidirectional) Diffuse Back Wall Plate 1 Plate 2 Plate 3 Narrow gloss Broad gloss 40

Standard VPL (not bidirectional) Without constraint 4 (unbiased) Narrow gloss Broad gloss 41

Standard VPL (not bidirectional) With Constraint 4 Without constraint 4 (unbiased) Narrow gloss Broad gloss 42

Subsurface Extensions Path-based representation 2 vertices plus special segment Subsurface New BSSRDF sampling method Ray tracing random chords on spheres Applicable to other path-based algorithms

Outline Prior work: VPL and Bidirectional review New weighting strategy Integration with Multidimensional Lightcuts Results 44

Multidimensional Lightcuts Millions of sensor/light pairs per pixel Brute force expensive Multidimensional Lightcuts Evaluate small subset of pairs Grand Central [Walter et al. 05] 0.03% of sensor/light pairs evaluated 45

Multidimensional Lightcuts Cluster points into hierarchies Cluster Tree Adaptive select cut (partition) Bound max error per cluster Cut Refine until below perceptual threshold Sublinear cost per point Used in Autodesk 360 Rendering Time Naive Lightcut A million images this year Number of Points 46

Lightcuts Integration Lightcut extensions New material types Added weighting terms to bounding and evaluation Quad-tree cubemaps representation for bounds Cubemap Unfolded quad-tree cubemap 47

Outline Prior work: VPL and Bidirectional review New weighting strategy Integration with Multidimensional Lightcuts Results 48

Results: Accurate Materials Glossy Standard VPL Our Method 49

Results: Accurate Materials Glossy Subsurface Standard VPL Our Method 50

Results: Accurate Materials Glossy Subsurface Volumetric Standard VPL Our Method Anisotropic volumetric fiber model (giga-voxel resolution) 51

Bidirectional Lightcuts Standard VPL 52

Bidirectional Lightcuts Standard VPL Bidirectional Estimators + 53

Bidirectional Lightcuts Standard VPL Bidirectional Estimators Our Method + = Accurate rendering of complex materials - e.g., glossy counter, subsurface milk, volumetric cloth 54

Timing Results Standard VPL Ball Bidirectional Lightcuts Images 512x512, 1 million VPLs, 64 eye rays per pixel, 4 cores at 3.4GHz 55

Timing Results Standard VPL Ball Dragon Bidirectional Lightcuts Images 512x512, 1 million VPLs, 64 eye rays per pixel, 4 cores at 3.4GHz 56

Timing Results Standard VPL Ball Dragon SanMiguel Bidirectional Lightcuts Images 512x512, 1 million VPLs, 64 eye rays per pixel, 4 cores at 3.4GHz 57

Timing Results Standard VPL Ball Dragon SanMiguel Kitchen Bidirectional Lightcuts Images 512x512, 1 million VPLs, 64 eye rays per pixel, 4 cores at 3.4GHz 58

Timing Results Lightcuts (standard) 346s 359s 434s 1076s Bidirectional 479s (+38%) 745s (+107%) 618s (+42%) 1803s (+67%) Images 512x512, 1 million VPLs, 64 eye rays per pixel, 4 cores at 3.4GHz 59

Limitations and Future Work Noise control relies on heuristics Effective in our tests but without guarantees Cannot handle some phenomena (e.g., caustics) VPL methods are ill-suited to such paths Combine with specialized algorithms 60

Conclusion VPL-based rendering has many advantages Low noise Scalable performance Limited in materials and effects Bidirectional extension Wider range of materials Enable new applications 61

Edgar The End Acknowledgements Models and assistance: Velazquez-Armendariz, Shuang Zhao, Adam Arbree, John Hutchinson, Jaroslav Krivanek, Guillermo M. Leal Llaguno, Stanford Graphics Lab Funded by: National Science Foundation Autodesk Intel Science and Technology Center - Visual Computing 62

Summary Bidirectional VPL algorithm Recursive sensor generation Novel weighting scheme Control bias vs. noise tradeoff Scalable and low noise Integrated with Lightcuts General techniques New BSSRDF sampling Model independent diffuse classifier 63

Equal Time Comparison Progressive Photon Map Our Method Bidirectional Path Trace Enlarged 64