How To Improve Efficiency In Ray Tracing



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

CSE168 Computer Graphics II, Rendering. Spring 2006 Matthias Zwicker

path tracing computer graphics path tracing 2009 fabio pellacini 1

Chapter 10. Bidirectional Path Tracing

Monte Carlo Path Tracing

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

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

Path Tracing Overview

Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan , Fall 2010

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

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

Volumetric Path Tracing

Monte Carlo Path Tracing

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition

Mathematics for Global Illumination

VARIANCE REDUCTION TECHNIQUES FOR IMPLICIT MONTE CARLO SIMULATIONS

Monte Carlo Ray Tracing

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

A Short Introduction to Computer Graphics

CS 431/636 Advanced Rendering Techniques"

SPI HS70. Remote Control of Multiple Lines with RMCworks. Systematic Process Management by Inspection Spec Server

The RADIANCE Lighting Simulation and Rendering System

Rendering Area Sources D.A. Forsyth

Knowledge Discovery and Data Mining. Structured vs. Non-Structured Data

Optimization of sampling strata with the SamplingStrata package

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

Two Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering

EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set

1 The Brownian bridge construction

Comparing Alternate Designs For A Multi-Domain Cluster Sample

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

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

Variance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers

Using Photorealistic RenderMan for High-Quality Direct Volume Rendering

STORM: Stochastic Optimization Using Random Models Katya Scheinberg Lehigh University. (Joint work with R. Chen and M. Menickelly)

Path tracing everything. D.A. Forsyth

Norbert Schuff Professor of Radiology VA Medical Center and UCSF

Environmental Remote Sensing GEOG 2021

Performance Metrics for Graph Mining Tasks

Assessment. Presenter: Yupu Zhang, Guoliang Jin, Tuo Wang Computer Vision 2008 Fall

The patch tool and content-aware filling

E27 SPRING 2013 ZUCKER PROJECT 2 PROJECT 2 AUGMENTED REALITY GAMING SYSTEM

Large-Scale Similarity and Distance Metric Learning

Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling

Variance reduction techniques used in BEAMnrc

Realtime 3D Computer Graphics Virtual Reality

An introduction to OBJECTIVE ASSESSMENT OF IMAGE QUALITY. Harrison H. Barrett University of Arizona Tucson, AZ

Face Model Fitting on Low Resolution Images

1 Maximum likelihood estimation

Lezione 4: Grafica 3D*(II)

Monte Carlo Methods and Models in Finance and Insurance

Parallel Ray Tracing using MPI: A Dynamic Load-balancing Approach

Cork Education and Training Board. Programme Module for. 3 Dimensional Computer Graphics. Leading to. Level 5 FETAC

Monte Carlo Methods in Finance

Statistics 100A Homework 3 Solutions

Choosing Colors for Data Visualization Maureen Stone January 17, 2006

Using Earned Value, Part 2: Tracking Software Projects. Using Earned Value Part 2: Tracking Software Projects

Neural Network Add-in

Be visual all the time, and be verbal when labeling because explanations help clarify ideas.

Expert Color Choices for Presenting Data

Optical Design Tools for Backlight Displays

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

Subspace Analysis and Optimization for AAM Based Face Alignment

SIMPLIFIED PERFORMANCE MODEL FOR HYBRID WIND DIESEL SYSTEMS. J. F. MANWELL, J. G. McGOWAN and U. ABDULWAHID

Machine Learning Final Project Spam Filtering

Pricing Discrete Barrier Options

APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION

Behavioral Segmentation

Monte Carlo Sampling Methods

A Study on M2M-based AR Multiple Objects Loading Technology using PPHT

Gerry Hobbs, Department of Statistics, West Virginia University

MassArt Studio Foundation: Visual Language Digital Media Cookbook, Fall 2013

Recursive Estimation

Object Recognition and Template Matching

Introduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization

Mean-Shift Tracking with Random Sampling

How To Understand The Theory Of Probability

Practical Calculation of Expected and Unexpected Losses in Operational Risk by Simulation Methods

A Markov Chain Analysis of Blackjack Strategy

LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING. ----Changsheng Liu

Probabilistic Models for Big Data. Alex Davies and Roger Frigola University of Cambridge 13th February 2014

Credibility and Pooling Applications to Group Life and Group Disability Insurance

Self-adjusting Importances for the Acceleration of MCBEND

Thresholding technique with adaptive window selection for uneven lighting image

Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection

Digital Image Requirements for New Online US Visa Application

Component Ordering in Independent Component Analysis Based on Data Power

A Learning Based Method for Super-Resolution of Low Resolution Images

1. INTRODUCTION Graphics 2

Building an Advanced Invariant Real-Time Human Tracking System

Basics of Statistical Machine Learning

3D Animation Graphic Designer

D animation. Advantages of 2-D2. Advantages of 3-D3. Related work. Key idea. Applications of Computer Graphics in Cel Animation.

Data analysis for Internal Audit

Transcription:

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 integrals But while correct on the average, a variance is induced Variance leads to a noisy image Convergence rate: quadruple samples to reduce variance by half Goal: Improve efficiency without increasing samples

What is efficiency? For an estimator F : [ F] = 1 V[ F] T[ F] V[F] = its variance T[F] = running time to compute the value

Russian Roulette Improve efficiency by increasing likelihood that sample will have a significant contribution Spend less time on small contributions

Russian Roulette Direct lighting integral Estimator for N samples Most of the work comes from tracing a shadow ray How to optimize? ( ) ( ) ( ) = N i i i i i d i o r p d p L p f N 1 cos,,, 1 ω ω θ ω ω ω i i i d i o S r o o dw p L p f p L θ ω ω ω ω cos ), ( ),, ( ), ( 2 =

Russian Roulette If f r p, ω o, ω i is zero for the direction ωi we can skip the tracing work Why stop there? What about rays where this value is very small? Or when ( ) ω i is close to the horizon? We can t ignore or we would underestimate the end result Answer: weighting!

However, this never reduces variance Russian Roulette Imagine a bunch of black pixels with a few very bright ones A technique known as efficiency-optimized Russian roulette attempts to rectify this Keep track of average variance and average ray count Use to compute threshold for each new sample

Full scene efficiency-optimized Russian roulette (10.5m) Battle of the Roulettes - Thiago Ize, University of Utah

Fixed Max Depth of 100 (53.2m) Battle of the Roulettes

Fixed Max Depth of 10 (10.6m) Battle of the Roulettes

Russian roulette (30% termination) Battle of the Roulettes

Russian roulette (q proportional to paththroughput/0.5 (27.8m)) Battle of the Roulettes

Russian roulette (q proportional to paththroughput/0.1 (31.3m)) Battle of the Roulettes

Russian roulette (q proportional to paththroughput/0.01 (32.6m)) Battle of the Roulettes

Efficiency-optimized Russian roulette (28.8m) Battle of the Roulettes

Russian roulette (q proportional to paththroughput/0.5 (27.8m)) Battle of the Roulettes

Splitting Russian roulette reduces effort spent evaluating unimportant samples Splitting increases important samples to improve efficiency Each sample = 1 camera ray + 1 shadow ray Important means shadow rays in many cases

Careful Sample Placement - Stratified Sampling Revisited Divide a domain into non-overlapping regions Stratified sampling can never increase variance Large strata contain more variation and will have individual means closer to the real mean Why not keep making strata smaller? Curse of dimensionality Possible to stratify some dimensions independently Latin Hypercube sampling

Figure 15.02a Random Sampling

Figure 15.02b Stratified Sampling

Quasi Monte Carlo Replace random numbers with lowdiscrepancy point sets generated by carefully designed deterministic algorithms Advantage: faster rates of convergence Works better with a smooth integrand not characteristic of graphics performs slightly better in practice Works better with smaller dimensions A hybrid technique randomized quasi-monte Carlo extends the benefits to larger dimensions

Sample points lie within [0,1] 2 Warping Samples PBRT uses algorithms to transform to map to light sources Mapping must preserve benefits of stratification (0,2)-sequence still well distributed Random stratified is not

Bias Sometimes, picking an estimator whose expected value does NOT equal the actual, can lead to lower variance Bias ( β ): β = E[ F] F How can this be good?

Importance sampling Importance Sampling Choose a sampling distribution that is similar in shape to the integrand Samples tend to be taken from important parts where the value is higher One of the most frequently use variation reduction techniques It s not difficult to fine an appropriate distribution in graphics Often integrand a product of more than one function Finding one similar to one multiplicand is easier However a bad choice can be worse than uniform

Multiple Importance Sampling But often we can find one similar to multiple terms Which one do we use?

Physically Based Rendering. Pharr and Humphreys. References Efficiency-Optimized Russian Roulette. Thiago Ize, University of Utah. http://www.cs.utah.edu/~thiago/cs7650/hw1 2/index.html. Quasi-Monte Carlo method. Wikipedia. http://en.wikipedia.org/wiki/quasi- Monte_Carlo_method