MULTI-DIMENSIONAL MONTE CARLO INTEGRATION
|
|
- Everett Malone
- 5 years ago
- Views:
Transcription
1 CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1
2 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals Suppose: b I = f (x)dx, x [a,b] a The Monte-Carlo converts this to an expected value computation problem, where p(x) is some probability density function: I = ( f (x) / p(x))p(x)dx = E[ f (x) / p(x)] 3 Monte Carlo Integration Values can be estimated by taking N samples x 1, x 2,, x n drawn from PDF p(x): I = E[ f (x) / p(x)] I = (1/ N) f (x i ) / p(x i ) The variance is proportional to 1/N Error decrease: 1/sqrt(N) (=stddev.) N i=1 4 2
3 Monte Carlo Integration The expected value of the estimator <I> E I = E 1 N N i=1 f (x i ) p(x i ) = 1 N E f (x ) i N p(x i ) i=1 = 1 N N f (x) p(x) p(x)dx = f (x)dx = I. σ 2 = 1 N f (x) g(x) I 2 p(x)dx. 5 Example We know it should be 1.0. Here with uniform sample (p(x)=1): 2 σ est I = 1 0 5x 4 dx I I = 1 N N 5x i 4 σ i= σ 2 Error = 1 1 N (5x4 1) 2 dx = N Number of samples 6 3
4 Bias When the expected value of the estimator E[<I>] is exactly the value of the integral I à unbiased Bias is: B I = E I I. When N is infinite, lim B N I = 0 7 Accuracy Chebyshev s Inequality The probability that a sample deviates form the solution by a value greater than σ 2, where δ is δ an arbitrary positive number, is smaller than δ. Pr I E[ I ] σ 2 δ δ If δ = , Pr I E[ I ] 100σ primary N
5 Accuracy Central Limit Theorem As N, the values of the estimator have a normal distribution. o = 12 u = 1.0 Mode, Median, Mean Pr(X) u = % u = % 99.7 % µ-3s µ-2s µ-1s µ µ+1s µ+2s µ+3s 9 Deterministic Quadrature vs. MC One approximation of the integral I: N I w i f (x i ) = i=1 N i=1 f (x i )(b a) N Extending these deterministic quadrature rules to a d-dimensional integral would require N d samples 10 5
6 Multidimensional MC Integration Multidimensional Monte Carlo integration: I = I = 1 N f (x, y)dx dy N i=1 f (x i, y i ) p(x i, y i ) Note that unlike deterministic quadrature techniques, Monte Carlo techniques permit an arbitrary choice of N 11 MC Integration over a Hemisphere Consider a light source L. Irradiance can be computed as an integral: I = L source cosθ dw Θ 2π = L source cosθ sinθ dθ dφ. 0 π /2 0 Differential solid angle: dw Θ = sinθdθdφ 12 6
7 MC Integration over a Hemisphere The estimator for irradiance is: I = 1 N L source (Θ i )cosθ sinθ N i=1 p(θ i ) Choose our samples from the following probability distribution: cosθ sinθ p(θ i ) = π The estimator for irradiance is: I = π N N i=1 L source (Θ i ) 13 Summary of Monte Carlo A Monte Carlo estimator for an integral I = 1 N f (x i ) N i=1 p(x i ) The variance of this estimator is: I = f (x)dx σ 2 = 1 N f (x) p(x) I 2 p(x)dx MC computation steps: 1. Sampling according to a PDF 2. Evaluating the PDF at that sample 3. Averaging these appropriately weighted sampled values 14 7
8 Chapter 3 RANDOM(?) SAMPLING 15 Sampling The Monte Carlo technique computes samples from a probability distribution p(x). We want to find samples such that the distribution of the samples matches p(x). Suppose p(x) is known How could we achieve better sampling? Inverse cumulative distribution function Rejection sampling 16 8
9 Inverse Cumulative Distribution Function Given a set of probability p i, we pick discrete random variables x i, discrete cumulative probability distribution function (CDF), i corresponding to the p i as follows: F i = Compute a sample u that is uniformly distributed over the domain [0,1) F k 1 u < F k ; k 1 k p j=1 j u < p j=1 j ; k 1 p j u < F k 1 + p k. j=1 p j=1 j 17 Uniform Probability A uniform PDF: p u (x) = 1 b a. A CDF: F(a u < b) = (b a) b' 1 b' a' Pr(x [a',b']) = dx = ; a' b a b a y 1 Pr(x y) = CDF(y) = b a dx = y a b a when a=0, b=1, Pr(x y) = CDF(y) = y. The probability that the value of u lies between F k-1 and F k is: p k = F k F k
10 Inverse Cumulative Distribution Function Continuous random variables A sample can be generated according to a given distribution p(x) by applying the inverse cumulative distribution function of p(x) to a uniformly generated random variable u over the interval [0,1). F(y) = y p(x)dx 1. Pick u uniformly from [0,1) 2. Output y=f -1 (y) 19 Inverse Cumulative Distribution Function Based on the CDF of the uniform PDF, we know: Pr[u X] = X. Therefore, Pr[F 1 (u) F 1 (X)] = X if X = F(Y ) Pr[y Y ] = F(Y ) = Pr[y Y ] = Y Y p(x)dx p(x)dx
11 Example Draw random samples from PDF: in [0,1] CDF: p(x) = 5x 4 Sample: F(x) = p(t)dt = x 5 0 x x i = F 1 (u i ) = 5 u i 21 Cosine sampling example A cosine weighting factor arises in the rendering equation; therefore, it is often useful to sample the hemisphere to compute radiance using a cosine PDF. The hemisphere can be sampled such that the samples are weighted by the cosine term. The PDF is cos( q ) p( qf, ) = p 22 11
12 Cosine sampling example Its CDF is computed as: 1 F = cos qdw ; p ò 1 f q F( qf, ) = cos q'sin q' dq' df' p òò f q = df' cos q'sin q' dq' p ò0 ò0 f 2 q = (-cos q '/ 2) p 0 f 2 = (1- cos q ) 2p 23 Cosine sampling example The CDF, with respect to f and q functions, is separable: f 2 Ff =, Fq = 1- cos q p Therefore, we compute two uniformly distributed samples u 1 and u 2 : -1 fi = 2 pu1, qi = cos u2 Where 1-u is replaced by u 2, since the uniform random variables lie in the domain [0,1). These f i and q i values are distributed according to the cosine PDF
13 Empirical CDF In case we need to learn the CDF by an example. Consider the following dataset: [ ] The formula for the CDF F n (t) is The empirical CDF is a step function that has a step of 1/n=1/5=0.2 at each of the observed data points. () # of sample values t Fn t = n t F n (t) 0 1/5 1 1/5 2 3/5 3 4/5 4 5/ Empirical CDF If there are k observations that have the sample value as t, then the size of the step is k n. For our example, the size of the step at t = 2 is 2/5 since two of the observations equal to 2. t F n (t) 0 1/5 1 1/5 2 3/5 3 4/5 4 5/5 t F n (t) 0.0 1/ / / / /
14 Draw samples from PDF Draw random samples x i from PDF p(x) range: [, ] Compute CDF F(x) = x f (t)dt Sample inverse CDF uniformly: x i = F 1 (u i ), u i [0,1) 27 Inverse CDF Therefore, k is selected with probability p k, which is exactly what we want. Computing the F value à O(N) time Looking up the appropriate value to output O(log 2 (N)) time per sample (by conducting a binary search on the precomputed F table) 28 14
15 Rejection Sampling It is often impossible to derive an analytical formula for the inverse of the cumulative distribution function. Rejection sampling is an alternative. Samples are tentatively proposed and tested to determined acceptance or rejection of the sample. This method raises the dimension of the function being sampled by one And then uniformly samples the bounding box that includes the entire PDF. This sampling technique yields samples with the appropriate distribution. 29 Rejection Sampling A 1D PDF whose maximum value over the domain [a,b] to be sampled M. Create a 2D function [a,b]x[0,m]. Sample uniformly as (x,y). Then reject samples such that p(x)<y. The distribution of the accepted samples is the pdf p(x) 30 15
16 Jittered sampling Generate N x N stratified sample per pixel at (i,j) Generate random variable λ 1 & λ 2 to index stratified sample Generate Ray: COP to sampled position at (i+ λ 1,j+ λ 2 ) Radiance = Total Radiance / N_RAYS_PER_PIXEL Stratified Sampling A uniform random sample is random! Each type of pattern is equally probable. A stratified sample, where we sample randomly within strata significantly reduces the variance. Enhance the convergence speed
17 Stratified Sampling The basic idea in stratified sampling is to split the integration domain into m disjoint subdomains (socalled strata) and evaluate the integral in each of the subdomains separately with one or more samples. 1 α 1 α 2 f (x)dx = f (x)dx + f (x)dx +! 0 0 α m 1 α 1 + f (x)dx + f (x)dx. α m 2 1 α m 1 33 N-Rooks Algorithm One major disadvantage of stratified sampling arises when it is used for higher-dimensional sampling. N-Rooks algorithm distributes N samples evenly among the strata
18 Example 35 Pseudo Random Numbers C/C++ have an inbuilt random number generator For example: /* generate random number in range [0,1] */ float uniform(void) { return((float)rand()/(float)(rand_max)); } To choose an event with probability p, use if(uniform() < p) /* do the event */; else /* don t */ 36 18
19 Random Numbers Builtin random number generator Usually not very good Not stratified, etc. Better (Quasi-)random numbers: Halton sequence FUNCTION Halton(index, base) BEGIN result = 0; f = 1 / base; i = index; WHILE (i > 0) BEGIN result = result + f * (i % base); i = FLOOR(i / base); f = f / base; END RETURN result; END 37 Chapter 3 VARIANCE REDUCTION 38 19
20 Variance Reduction Monte Carlo techniques: Blind Monte Carlo (no information about the probability function, what we learnt, assuming uniform distribution) Informed Monte Carlo (more accurate) Designing efficient estimators is the major area in Monte Carlo techniques. E.g., importance sampling, stratified sampling, multiple importance sampling, quasi-monte Carlo, etc. 39 Importance Sampling Importance sampling uses a non-uniform probability distribution function to generate sample. Consider N random samples over domain with probability p(x) Define an estimator of integral <I> as: I = 1 N f (x i ) N i=1 p(x i ) Expected value of this estimator is I
21 Importance Sampling Since a perfect estimator would have the variance be zero, We could define a function L for the perfect estimator: 2 f (x L(p) = i ) p(x i ) p(x)dx + λ D p(x)dx D Where, the integral of p(x) over the integration domain D is 1. p(x)dx = 1 D We need to find a scalar λ to minimize L. 41 Importance Sampling The minimization problem can be solved using the Euler-Lagrange differential equation. f (x L(p) = i ) 2 p(x i ) + λ p(x) dx D Differentiate L(p) with respect to p(x) 0 = f (x) 2 p p(x) + λ p(x) 0 = f 2 (x) p 2 (x) + λ p(x) = 1 λ f (x)
22 Importance Sampling The constant is a scaling factor, such that p(x) can fulfill the boundary condition. The optimal p(x) is then given by: f (x) p(x) = f (x)dx D We use p that resembles f. Does not change convergence rate (still sqrt) bad uniform good 43 Example Evaluate: Use PDF Yields: I = 1 0 5x 4 dx p(x) = 5x 4 I 1 N 5x 4 = 1 N 5x 4 i=
23 Example: Glossy Rendering 45 Example: Glossy Rendering 46 23
24 Example: Glossy Rendering 47 Antialiasing in Ray Tracing In order to reduce aliasing due to undersampling in ray tracing each pixel may be sampled and then the average radiance per pixel found. A stratified sample over the pixel is preferable to a uniform sample especially when the gradient within the pixel is sharply changing
Lecture 7: Monte Carlo Rendering. MC Advantages
Lecture 7: Monte Carlo Rendering CS 6620, Spring 2009 Kavita Bala Computer Science Cornell University MC Advantages Convergence rate of O( ) Simple Sampling Point evaluation Can use black boxes General
More informationNumerical Integration
Lecture 12: Numerical Integration (with a focus on Monte Carlo integration) Computer Graphics CMU 15-462/15-662, Fall 2015 Review: fundamental theorem of calculus Z b f(x)dx = F (b) F (a) a f(x) = d dx
More informationMonte Carlo Integration
Lecture 11: Monte Carlo Integration Computer Graphics and Imaging UC Berkeley CS184/284A, Spring 2016 Reminder: Quadrature-Based Numerical Integration f(x) Z b a f(x)dx x 0 = a x 1 x 2 x 3 x 4 = b E.g.
More informationCS 563 Advanced Topics in Computer Graphics Monte Carlo Integration: Basic Concepts. by Emmanuel Agu
CS 563 Advanced Topics in Computer Graphics Monte Carlo Integration: Basic Concepts by Emmanuel Agu Introduction The integral equations generally don t have analytic solutions, so we must turn to numerical
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 informationINFOMAGR Advanced Graphics. Jacco Bikker - February April Welcome!
INFOMAGR Advanced Graphics Jacco Bikker - February April 2016 Welcome! I x, x = g(x, x ) ε x, x + S ρ x, x, x I x, x dx Today s Agenda: Introduction Stratification Next Event Estimation Importance Sampling
More informationRealistic Image Synthesis
Realistic Image Synthesis - BRDFs and Direct ighting - Philipp Slusalle Karol Myszowsi Gurprit Singh Realistic Image Synthesis SS8 BRDFs and Direct ighting Importance Sampling Example Example: Generate
More informationMonte Carlo Integration
Lecture 15: Monte Carlo Integration Computer Graphics and Imaging UC Berkeley Reminder: Quadrature-Based Numerical Integration f(x) Z b a f(x)dx x 0 = a x 1 x 2 x 3 x 4 = b E.g. trapezoidal rule - estimate
More informationMonte Carlo Ray Tracing. Computer Graphics CMU /15-662
Monte Carlo Ray Tracing Computer Graphics CMU 15-462/15-662 TODAY: Monte Carlo Ray Tracing How do we render a photorealistic image? Put together many of the ideas we ve studied: - color - materials - radiometry
More informationMotivation. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing
Advanced Computer Graphics (Spring 2013) CS 283, Lecture 11: Monte Carlo Path Tracing Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/sp13 Motivation General solution to rendering and global illumination
More informationAnti-aliasing and Monte Carlo Path Tracing. Brian Curless CSE 557 Autumn 2017
Anti-aliasing and Monte Carlo Path Tracing Brian Curless CSE 557 Autumn 2017 1 Reading Required: Marschner and Shirley, Section 13.4 (online handout) Pharr, Jakob, and Humphreys, Physically Based Ray Tracing:
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 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 informationAnti-aliasing and Monte Carlo Path Tracing
Reading Required: Anti-aliasing and Monte Carlo Path Tracing Brian Curless CSE 557 Autumn 2017 Marschner and Shirley, Section 13.4 (online handout) Pharr, Jakob, and Humphreys, Physically Based Ray Tracing:
More informationMONTE-CARLO PATH TRACING
CS580: Computer Graphics KAIST School of Computing Chapter 4 & 5 MOTE-CARLO PATH TRACIG 2 Shadow Rays by Hemisphere Sampling Directions Ψ i are generated over the hemisphere Ω, after which the nearest
More informationMonte-Carlo Ray Tracing. Antialiasing & integration. Global illumination. Why integration? Domains of integration. What else can we integrate?
Monte-Carlo Ray Tracing Antialiasing & integration So far, Antialiasing as signal processing Now, Antialiasing as integration Complementary yet not always the same in particular for jittered sampling Image
More informationMonte Carlo Integration COS 323
Monte Carlo Integration COS 323 Last time Interpolatory Quadrature Review formulation; error analysis Newton-Cotes Quadrature Midpoint, Trapezoid, Simpson s Rule Error analysis for trapezoid, midpoint
More informationMonte Carlo Integration COS 323
Monte Carlo Integration COS 323 Integration in d Dimensions? One option: nested 1-D integration f(x,y) g(y) y f ( x, y) dx dy ( ) = g y dy x Evaluate the latter numerically, but each sample of g(y) is
More informationGAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao
GAMES Webinar: Rendering Tutorial 2 Monte Carlo Methods Shuang Zhao Assistant Professor Computer Science Department University of California, Irvine GAMES Webinar Shuang Zhao 1 Outline 1. Monte Carlo integration
More informationComputational Methods. Randomness and Monte Carlo Methods
Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling
More informationPhysically Realistic Ray Tracing
Physically Realistic Ray Tracing Reading Required: Watt, sections 10.6,14.8. Further reading: A. Glassner. An Introduction to Ray Tracing. Academic Press, 1989. [In the lab.] Robert L. Cook, Thomas Porter,
More informationDistribution Ray Tracing. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell
Distribution Ray Tracing University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Reading Required: Watt, sections 10.6,14.8. Further reading: A. Glassner. An Introduction to Ray
More informationMonte Carlo Integration and Random Numbers
Monte Carlo Integration and Random Numbers Higher dimensional integration u Simpson rule with M evaluations in u one dimension the error is order M -4! u d dimensions the error is order M -4/d u In general
More informationTesting Continuous Distributions. Artur Czumaj. DIMAP (Centre for Discrete Maths and it Applications) & Department of Computer Science
Testing Continuous Distributions Artur Czumaj DIMAP (Centre for Discrete Maths and it Applications) & Department of Computer Science University of Warwick Joint work with A. Adamaszek & C. Sohler Testing
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 informationRaytracing & Epsilon. Today. Last Time? Forward Ray Tracing. Does Ray Tracing Simulate Physics? Local Illumination
Raytracing & Epsilon intersects light @ t = 25.2 intersects sphere1 @ t = -0.01 & Monte Carlo Ray Tracing intersects sphere1 @ t = 10.6 Solution: advance the ray start position epsilon distance along the
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 informationRecursive Estimation
Recursive Estimation Raffaello D Andrea Spring 28 Problem Set : Probability Review Last updated: March 6, 28 Notes: Notation: Unless otherwise noted, x, y, and z denote random variables, p x denotes the
More informationMotivation: Monte Carlo Path Tracing. Sampling and Reconstruction of Visual Appearance. Monte Carlo Path Tracing. Monte Carlo Path Tracing
Sampling and Reconstruction of Visual Appearance CSE 274 [Winter 2018], Lecture 4 Ravi Ramamoorthi http://www.cs.ucsd.edu/~ravir Motivation: Key application area for sampling/reconstruction Core method
More informationSampling and Monte-Carlo Integration
Sampling and Monte-Carlo Integration Sampling and Monte-Carlo Integration Last Time Pixels are samples Sampling theorem Convolution & multiplication Aliasing: spectrum replication Ideal filter And its
More informationVARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung
POLYTECHNIC UNIVERSITY Department of Computer and Information Science VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung Abstract: Techniques for reducing the variance in Monte Carlo
More informationPage 129 Exercise 5: Suppose that the joint p.d.f. of two random variables X and Y is as follows: { c(x. 0 otherwise. ( 1 = c. = c
Stat Solutions for Homework Set Page 9 Exercise : Suppose that the joint p.d.f. of two random variables X and Y is as follows: { cx fx, y + y for y x, < x < otherwise. Determine a the value of the constant
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 informationMATH 2400, Analytic Geometry and Calculus 3
MATH 2400, Analytic Geometry and Calculus 3 List of important Definitions and Theorems 1 Foundations Definition 1. By a function f one understands a mathematical object consisting of (i) a set X, called
More informationReading. 8. Distribution Ray Tracing. Required: Watt, sections 10.6,14.8. Further reading:
Reading Required: Watt, sections 10.6,14.8. Further reading: 8. Distribution Ray Tracing A. Glassner. An Introduction to Ray Tracing. Academic Press, 1989. [In the lab.] Robert L. Cook, Thomas Porter,
More informationMonte Carlo Integration
Lab 18 Monte Carlo Integration Lab Objective: Implement Monte Carlo integration to estimate integrals. Use Monte Carlo Integration to calculate the integral of the joint normal distribution. Some multivariable
More informationIntegration. Volume Estimation
Monte Carlo Integration Lab Objective: Many important integrals cannot be evaluated symbolically because the integrand has no antiderivative. Traditional numerical integration techniques like Newton-Cotes
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 informationThe Rendering Equation. Computer Graphics CMU /15-662, Fall 2016
The Rendering Equation Computer Graphics CMU 15-462/15-662, Fall 2016 Review: What is radiance? Radiance at point p in direction N is radiant energy ( #hits ) per unit time, per solid angle, per unit area
More informationMonte Carlo Integration of The Rendering Equation. Computer Graphics CMU /15-662, Spring 2017
Monte Carlo Integration of The Rendering Equation Computer Graphics CMU 15-462/15-662, Spring 2017 Review: Monte Carlo integration Z b Definite integral What we seek to estimate a f(x)dx Random variables
More informationLearning Objectives. Continuous Random Variables & The Normal Probability Distribution. Continuous Random Variable
Learning Objectives Continuous Random Variables & The Normal Probability Distribution 1. Understand characteristics about continuous random variables and probability distributions 2. Understand the uniform
More informationIn the real world, light sources emit light particles, which travel in space, reflect at objects or scatter in volumetric media (potentially multiple
1 In the real world, light sources emit light particles, which travel in space, reflect at objects or scatter in volumetric media (potentially multiple times) until they are absorbed. On their way, they
More informationBiostatistics 615/815 Lecture 16: Importance sampling Single dimensional optimization
Biostatistics 615/815 Lecture 16: Single dimensional optimization Hyun Min Kang November 1st, 2012 Hyun Min Kang Biostatistics 615/815 - Lecture 16 November 1st, 2012 1 / 59 The crude Monte-Carlo Methods
More informationRendering Equation & Monte Carlo Path Tracing I
Rendering Equation & Monte Carlo Path Tracing I CS295, Spring 2017 Shuang Zhao Computer Science Department University of California, Irvine CS295, Spring 2017 Shuang Zhao 1 Announcements Homework 1 due
More informationChapter 1. Introduction
Chapter 1 Introduction A Monte Carlo method is a compuational method that uses random numbers to compute (estimate) some quantity of interest. Very often the quantity we want to compute is the mean of
More informationPhoton Maps. The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces)
Photon Mapping 1/36 Photon Maps The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces) As opposed to the radiosity method that stores information on surface
More informationPractical Product Importance Sampling for Direct Illumination
Eurographics 2008 Practical Product Importance Sampling for Direct Illumination Petrik Clarberg Tomas Akenine-Möller Lund University Sweden This work was presented by Petrik Clarberg at Eurographics 2008
More informationLecture 8: Jointly distributed random variables
Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function
More informationProbability Models.S4 Simulating Random Variables
Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard Probability Models.S4 Simulating Random Variables In the fashion of the last several sections, we will often create probability
More informationMathematical Basics of Monte Carlo Rendering Algorithms
Mathematical Basics of Monte Carlo Rendering Algorithms Mihai Calin Ghete Vienna University of Technology Abstract The high computational costs associated with global illumination in the field of computer
More information10703 Deep Reinforcement Learning and Control
10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationISyE 6416: Computational Statistics Spring Lecture 13: Monte Carlo Methods
ISyE 6416: Computational Statistics Spring 2017 Lecture 13: Monte Carlo Methods Prof. Yao Xie H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Determine area
More informationMonte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara
Monte Carlo Simula/on and Copula Func/on by Gerardo Ferrara Introduc)on A Monte Carlo method is a computational algorithm that relies on repeated random sampling to compute its results. In a nutshell,
More informationWill Monroe July 21, with materials by Mehran Sahami and Chris Piech. Joint Distributions
Will Monroe July 1, 017 with materials by Mehran Sahami and Chris Piech Joint Distributions Review: Normal random variable An normal (= Gaussian) random variable is a good approximation to many other distributions.
More informationParametric and Polar Curves
Chapter 2 Parametric and Polar Curves 2.1 Parametric Equations; Tangent Lines and Arc Length for Parametric Curves Parametric Equations So far we ve described a curve by giving an equation that the coordinates
More informationParametric and Polar Curves
Chapter 2 Parametric and Polar Curves 2.1 Parametric Equations; Tangent Lines and Arc Length for Parametric Curves Parametric Equations So far we ve described a curve by giving an equation that the coordinates
More informationPhysics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods -
Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistical Methods - Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/
More informationThe Spherical Harmonics Discrete Ordinate Method for Atmospheric Radiative Transfer
The Spherical Harmonics Discrete Ordinate Method for Atmospheric Radiative Transfer K. Franklin Evans Program in Atmospheric and Oceanic Sciences University of Colorado, Boulder Computational Methods in
More informationLab 5 Monte Carlo integration
Lab 5 Monte Carlo integration Edvin Listo Zec 9065-976 edvinli@student.chalmers.se October 0, 014 Co-worker: Jessica Fredby Introduction In this computer assignment we will discuss a technique for solving
More information1. Suppose that the equation F (x, y, z) = 0 implicitly defines each of the three variables x, y, and z as functions of the other two:
Final Solutions. Suppose that the equation F (x, y, z) implicitly defines each of the three variables x, y, and z as functions of the other two: z f(x, y), y g(x, z), x h(y, z). If F is differentiable
More informationTo Do. Real-Time High Quality Rendering. Motivation for Lecture. Monte Carlo Path Tracing. Monte Carlo Path Tracing. Monte Carlo Path Tracing
Real-Time High Quality Rendering CSE 274 [Fall 2015], Lecture 5 Tour of Modern Offline Rendering To Do Project milestone (1-2 pages), final project proposal Due on Oct 27 Please get in touch with me if
More informationDivide and Conquer Kernel Ridge Regression
Divide and Conquer Kernel Ridge Regression Yuchen Zhang John Duchi Martin Wainwright University of California, Berkeley COLT 2013 Yuchen Zhang (UC Berkeley) Divide and Conquer KRR COLT 2013 1 / 15 Problem
More informationA Random Number Based Method for Monte Carlo Integration
A Random Number Based Method for Monte Carlo Integration J Wang and G Harrell Department Math and CS, Valdosta State University, Valdosta, Georgia, USA Abstract - A new method is proposed for Monte Carlo
More informationPhoto-realistic Renderings for Machines Seong-heum Kim
Photo-realistic Renderings for Machines 20105034 Seong-heum Kim CS580 Student Presentations 2016.04.28 Photo-realistic Renderings for Machines Scene radiances Model descriptions (Light, Shape, Material,
More informationA Superconvergent Monte Carlo Method for Multiple Integrals on the Grid
A Superconvergent Monte Carlo Method for Multiple Integrals on the Grid Sofiya Ivanovska, Emanouil Atanassov, and Aneta Karaivanova Institute for Parallel Processing - Bulgarian Academy of Sciences, Acad.
More informationProbability and Statistics for Final Year Engineering Students
Probability and Statistics for Final Year Engineering Students By Yoni Nazarathy, Last Updated: April 11, 2011. Lecture 1: Introduction and Basic Terms Welcome to the course, time table, assessment, etc..
More informationNested Sampling: Introduction and Implementation
UNIVERSITY OF TEXAS AT SAN ANTONIO Nested Sampling: Introduction and Implementation Liang Jing May 2009 1 1 ABSTRACT Nested Sampling is a new technique to calculate the evidence, Z = P(D M) = p(d θ, M)p(θ
More informationSTAT 725 Notes Monte Carlo Integration
STAT 725 Notes Monte Carlo Integration Two major classes of numerical problems arise in statistical inference: optimization and integration. We have already spent some time discussing different optimization
More informationLecture 12: Photon Mapping. Biased Methods
Lecture 12: Photon Mapping CS 6620, Spring 2009 Kavita Bala Computer Science Cornell University MC problems Biased Methods Biased methods: store information (caching) Better type of noise: blurring Greg
More informationMAC2313 Test 3 A E g(x, y, z) dy dx dz
MAC2313 Test 3 A (5 pts) 1. If the function g(x, y, z) is integrated over the cylindrical solid bounded by x 2 + y 2 = 3, z = 1, and z = 7, the correct integral in Cartesian coordinates is given by: A.
More informationGenerating random samples from user-defined distributions
The Stata Journal (2011) 11, Number 2, pp. 299 304 Generating random samples from user-defined distributions Katarína Lukácsy Central European University Budapest, Hungary lukacsy katarina@phd.ceu.hu Abstract.
More informationSection 2.3: Monte Carlo Simulation
Section 2.3: Monte Carlo Simulation Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 2.3: Monte Carlo Simulation 1/1 Section
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 informationParametric and Polar Curves
Chapter 2 Parametric and Polar Curves 2.1 Parametric Equations; Tangent Lines and Arc Length for Parametric Curves Parametric Equations So far we ve described a curve by giving an equation that the coordinates
More informationMonte Carlo Integration
Chapter 2 Monte Carlo Integration This chapter gives an introduction to Monte Carlo integration. The main goals are to review some basic concepts of probability theory, to define the notation and terminology
More informationPhysics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistics and Error Analysis -
Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistics and Error Analysis - Karsten Heeger heeger@wisc.edu Feldman&Cousin what are the issues they deal with? what processes
More informationMotivation: Monte Carlo Rendering. Sampling and Reconstruction of Visual Appearance. Caustics. Illumination Models. Overview of lecture.
Sampling and Reconstruction of Visual Appearance CSE 74 [Winter 8], Lecture 3 Ravi Ramamoorthi http://www.cs.ucsd.edu/~ravir Motivation: Monte Carlo Rendering Key application area for sampling/reconstruction
More information2017 Summer Course on Optical Oceanography and Ocean Color Remote Sensing. Monte Carlo Simulation
2017 Summer Course on Optical Oceanography and Ocean Color Remote Sensing Curtis Mobley Monte Carlo Simulation Delivered at the Darling Marine Center, University of Maine July 2017 Copyright 2017 by Curtis
More informationCS 563 Advanced Topics in Computer Graphics Irradiance Caching and Particle Tracing. by Stephen Kazmierczak
CS 563 Advanced Topics in Computer Graphics Irradiance Caching and Particle Tracing by Stephen Kazmierczak Introduction Unbiased light transport algorithms can sometimes take a large number of rays to
More informationACCURACY AND EFFICIENCY OF MONTE CARLO METHOD. Julius Goodman. Bechtel Power Corporation E. Imperial Hwy. Norwalk, CA 90650, U.S.A.
- 430 - ACCURACY AND EFFICIENCY OF MONTE CARLO METHOD Julius Goodman Bechtel Power Corporation 12400 E. Imperial Hwy. Norwalk, CA 90650, U.S.A. ABSTRACT The accuracy of Monte Carlo method of simulating
More informationAnti-aliasing and sampling
Anti-aliasing and sampling 1996-2017 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Sampling 2017 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 34 Spatial and temporal
More informationCalculus III. Math 233 Spring In-term exam April 11th. Suggested solutions
Calculus III Math Spring 7 In-term exam April th. Suggested solutions This exam contains sixteen problems numbered through 6. Problems 5 are multiple choice problems, which each count 5% of your total
More informationHalftoning and quasi-monte Carlo
Halftoning and quasi-monte Carlo Ken Hanson CCS-2, Methods for Advanced Scientific Simulations Los Alamos National Laboratory This presentation available at http://www.lanl.gov/home/kmh/ LA-UR-04-1854
More informationModern Methods of Data Analysis - WS 07/08
Modern Methods of Data Analysis Lecture XV (04.02.08) Contents: Function Minimization (see E. Lohrmann & V. Blobel) Optimization Problem Set of n independent variables Sometimes in addition some constraints
More informationBiased Monte Carlo Ray Tracing
Biased Monte Carlo Ray Tracing Filtering, Irradiance Caching, and Photon Mapping Henrik Wann Jensen Stanford University May 23, 2002 Unbiased and Consistent Unbiased estimator: E{X} =... Consistent estimator:
More informationMATH 2023 Multivariable Calculus
MATH 2023 Multivariable Calculus Problem Sets Note: Problems with asterisks represent supplementary informations. You may want to read their solutions if you like, but you don t need to work on them. Set
More informationChapter 6 Normal Probability Distributions
Chapter 6 Normal Probability Distributions 6-1 Review and Preview 6-2 The Standard Normal Distribution 6-3 Applications of Normal Distributions 6-4 Sampling Distributions and Estimators 6-5 The Central
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 informationThe diagram above shows a sketch of the curve C with parametric equations
1. The diagram above shows a sketch of the curve C with parametric equations x = 5t 4, y = t(9 t ) The curve C cuts the x-axis at the points A and B. (a) Find the x-coordinate at the point A and the x-coordinate
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 informationlecture 19: monte carlo methods
lecture 19: monte carlo methods STAT 598z: Introduction to computing for statistics Vinayak Rao Department of Statistics, Purdue University April 3, 2019 Monte Carlo integration We want to calculate integrals/summations
More informationSolution of final examination
of final examination Math 20, pring 201 December 9, 201 Problem 1 Let v(t) (2t e t ) i j + π cos(πt) k be the velocity of a particle with initial position r(0) ( 1, 0, 2). Find the accelaration at the
More informationReview Initial Value Problems Euler s Method Summary
THE EULER METHOD P.V. Johnson School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 INITIAL VALUE PROBLEMS The Problem Posing a Problem 3 EULER S METHOD Method Errors 4 SUMMARY OUTLINE 1 REVIEW 2 INITIAL
More informationLaplace Transform of a Lognormal Random Variable
Approximations of the Laplace Transform of a Lognormal Random Variable Joint work with Søren Asmussen & Jens Ledet Jensen The University of Queensland School of Mathematics and Physics August 1, 2011 Conference
More informationSection Parametrized Surfaces and Surface Integrals. (I) Parametrizing Surfaces (II) Surface Area (III) Scalar Surface Integrals
Section 16.4 Parametrized Surfaces and Surface Integrals (I) Parametrizing Surfaces (II) Surface Area (III) Scalar Surface Integrals MATH 127 (Section 16.4) Parametrized Surfaces and Surface Integrals
More informationWhat you will learn today
What you will learn today Tangent Planes and Linear Approximation and the Gradient Vector Vector Functions 1/21 Recall in one-variable calculus, as we zoom in toward a point on a curve, the graph becomes
More informationAdvanced Graphics. Path Tracing and Photon Mapping Part 2. Path Tracing and Photon Mapping
Advanced Graphics Path Tracing and Photon Mapping Part 2 Path Tracing and Photon Mapping Importance Sampling Combine importance sampling techniques Reflectance function (diffuse + specular) Light source
More informationWe can conclude that if f is differentiable in an interval containing a, then. f(x) L(x) = f(a) + f (a)(x a).
= sin( x) = 8 Lecture :Linear Approximations and Differentials Consider a point on a smooth curve y = f(x), say P = (a, f(a)), If we draw a tangent line to the curve at the point P, we can see from the
More informationDouble Integrals over Polar Coordinate
1. 15.4 DOUBLE INTEGRALS OVER POLAR COORDINATE 1 15.4 Double Integrals over Polar Coordinate 1. Polar Coordinates. The polar coordinates (r, θ) of a point are related to the rectangular coordinates (x,y)
More information