Final Gathering using Adaptive Multiple Importance Sampling

Slides:



Advertisements
Similar presentations
Final Gathering using Adaptive Multiple Importance Sampling 1. Introduction We propose an efficient final gathering technique using adaptive multiple importance.
Advertisements

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
CHAPTER 8 More About Estimation. 8.1 Bayesian Estimation In this chapter we introduce the concepts related to estimation and begin this by considering.
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Based on slides created by Edward Angel
1 Angel: Interactive Computer Graphics 5E © Addison-Wesley 2009 Shading I.
University of New Mexico
Artificial Learning Approaches for Multi-target Tracking Jesse McCrosky Nikki Hu.
Monte Carlo Integration Robert Lin April 20, 2004.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lectures 18, 19: Monte Carlo Integration Ravi Ramamoorthi Acknowledgements.
Resampling techniques Why resampling? Jacknife Cross-validation Bootstrap Examples of application of bootstrap.
Sérgio Pequito Phd Student
An Optimal Learning Approach to Finding an Outbreak of a Disease Warren Scott Warren Powell
Final Gathering on GPU Toshiya Hachisuka University of Tokyo Introduction Producing global illumination image without any noise.
Objectives Learn to shade objects so their images appear three- dimensional Learn to shade objects so their images appear three- dimensional Introduce.
Photometric Stereo & Shape from Shading
1 Angel: Interactive Computer Graphics 4E © Addison-Wesley 2005 Shading I Ed Angel Professor of Computer Science, Electrical and Computer Engineering,
CS 480/680 Computer Graphics Shading I Dr. Frederick C Harris, Jr.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.
-Global Illumination Techniques
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:
An Efficient Representation for Irradiance Environment Maps Ravi Ramamoorthi Pat Hanrahan Stanford University SIGGRAPH 2001 Stanford University SIGGRAPH.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
Optimally Combining Sampling Techniques for Monte Carlo Rendering Eric Veach and Leonidas J. Guibas Computer Science Department Stanford University SIGGRAPH.
Importance Resampling for Global Illumination Justin F. Talbot Master’s Thesis Defense Brigham Young University Provo, UT.
Importance Resampling for Global Illumination Justin Talbot, David Cline, and Parris Egbert Brigham Young University Provo, UT.
Announcements Office hours today 2:30-3:30 Graded midterms will be returned at the end of the class.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
University of Montreal & iMAGIS A Light Hierarchy for Fast Rendering of Scenes with Many Lights E. Paquette, P. Poulin, and G. Drettakis.
On robust Monte Carlo algorithms for multi-pass global illumination Frank Suykens – De Laet 17 September 2002.
Monte-Carlo Ray Tracing and
Simulation Study for Longitudinal Data with Nonignorable Missing Data Rong Liu, PhD Candidate Dr. Ramakrishnan, Advisor Department of Biostatistics Virginia.
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.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
Reflectance Function Estimation and Shape Recovery from Image Sequence of a Rotating object Jiping Lu, Jim Little UBC Computer Science ICCV ’ 95.
Discussion of Report 2 1.To include the indirect lighting from a large diffuse surface such as the floor or a wall. 2.To compute the lighting from area.
OpenGL Shading. 2 Objectives Learn to shade objects so their images appear three-dimensional Introduce the types of light-material interactions Build.
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
Computacion Inteligente Least-Square Methods for System Identification.
Computer graphics III – Multiple Importance Sampling Jaroslav Křivánek, MFF UK
Computer Graphics: Illumination
Lesson 8: Basic Monte Carlo integration
12. Principles of Parameter Estimation
Limited Dependent Variables
Reconstruction For Rendering distribution Effect
Approximate Confidence Interval for the Ratio of Normal Means
Path Tracing (some material from University of Wisconsin)
Introduction to Computer Graphics with WebGL
CONCEPTS OF ESTIMATION
Introduction to Computer Graphics with WebGL
Today (2/16/16) Learning objectives (Sections 5.1, 5.2, and 5.3):
Graduate School of Information Sciences, Tohoku University
Isaac Gang University of Mary Hardin-Baylor
Progressive Photon Mapping Toshiya Hachisuka Henrik Wann Jensen
Monte Carlo Rendering Central theme is sampling:
Missing feature theory
Exploring Shaders in Unity
Econometrics Chengyuan Yin School of Mathematics.
Advanced Computer Graphics
Homework A Let us use the log-likelihood function to derive an on-line adaptation rule analogous to LMS. Our goal is to update our estimate of weights.
12. Principles of Parameter Estimation
CS 480/680 Computer Graphics Shading.
Monte Carlo Path Tracing and Caching Illumination
Photon Density Estimation using Multiple Importance Sampling
Presentation transcript:

Final Gathering using Adaptive Multiple Importance Sampling Yusuke Tokuyoshi Square Enix Co.,Ltd. Shinji Ogaki Square Enix Co.,Ltd. Sebastian Schoellhammer Square Enix Co.,Ltd. Figure 1: Upper: classic final gathering. Lower: our method. The same number of samples is used for both images (512 × 512 pixels, 4 oversamples, 1024 final gather rays/pixel). The number of iterations for AMIS is 4. The rendering times for upper and lower images are 116.5 seconds and 134.5 seconds, respectively. Figure 2: Upper: classic final gathering. Bottom: our method. The same number of samples is used for both images (640×480 pixels, 4 oversamples, 1024 final gather rays/pixel). The number of iterations for AMIS is 4. The rendering times for upper and lower images are 185.5 seconds and 206.6 seconds, respectively. Model source: Sponza Atrium by Marko Dabrovic. Maximum likelihood estimation (MLE) is an appropriate method to update θ. The parameter αt+1 is estimated by MLE as 1. Introduction (2) We propose an efficient final gathering technique using adaptive multiple importance sampling (AMIS) [Cornuet et al. 2009] for scenes with a highly intense spot of light. The performance of AMIS depends on a sampling strategy, i.e. the choice of a PDF. This poster suggests a suitable PDF for final gathering. Our method increases error in some cases, however, improves image quality if a scene has a highly bright spot of light compared to the classic method. and the integral is estimated as (5) (3) However, obtaining nt+1 with MLE is computationally expensive. Therefore, we assume nt+1 to be the average of the sampled directions, which is given as recompute weighting functions update PDF sample initialize PDF highly intense spot of light (6) Figure 4: AMIS pipeline. Note that PDFs for glossy reflection can be operated in the same manner. For example, if a reflectance model includes the phong distribution function [Lafortune and Willems 1994], we can replace the ray direction with the halfway vector in Equations (4)(5)(6), and the α0 with the phong exponent of the reflectance model. 3. Method The performance of AMIS depends on an updating scheme. In this section we propose an appropriate method for final gathering. Normally, final gather rays are generated according to the PDF of a reflectance model. If it is diffuse, the PDF of the lambertian model: p(ω) = (ω ・ ns)/π is often used (ω : ray direction, ns : surface normal). We extend the PDF p with the parameter θt = (nt, αt) as The computation order of our method is O(TM), where T is the number of iterations, and M the total number of samples. To reduce the computation time, we are bound to use a small number of iterations. It is more efficient to use only recent samples instead of all samples generated in the past. Figure 3: The sampling strategy of classic final gathering is using only reflectance model. It fails in the case of a scene contains a highly intense spot of light. 2. Adaptive Multiple Importance Sampling (4) The initial values of n0 and α0 are ns and 1, respectively. Hence, Equation (4) is equivalent to the lambertian model at the beginning. However, it approximates the integrand as t increases. Therefore, our method is expected to generate less variance than the lambertian model. 4. Result AMIS is aimed at optimally recycling past simulations in an iterative importance sampling scheme. The difference to earlier adaptive importance sampling methods is that the past weighting functions are recomputed by multiple importance sampling [Veach 1997] at each iteration. After t iterations, the weighting function wj(ω) (0 ≤ j ≤ t) is given as Figure 1 and Figure 2 show the experimental results. Our method reduces noise compared to the classic method with small overhead. first iteration next iteration References (1) CORNUET, J.-M., MARIN, J.-M., MIRA, A., AND ROBERT, C. 2009. Adaptive multiple importance sampling. Tech. rep., arXiv:0907.1254. LAFORTUNE, E. P., AND WILLEMS, Y. D. 1994. Using the modified phong reflectance model for physically based rendering. Tech. rep., Report CW197, Department of Computer Science, K.U.Leuven. VEACH, E. 1997. Robust Monte Carlo Methods for Light Transport Simulation. PhD thesis, Stanford University. where p is the PDF at the jth iteration. The parameter θj is updated by using past samples. This procedure will be described in the next section. Let f(ω) be the integrand, the weighted value of the ith sample at the jth iteration is obtained as Figure 5: Our PDF is optimized to incident radiance distribution in an iterative fashion.