UCLA Electronic Theses and Dissertations

Total Page:16

File Type:pdf, Size:1020Kb

UCLA Electronic Theses and Dissertations UCLA UCLA Electronic Theses and Dissertations Title A Comprehensive Study of the Seminal Monte-Carlo-Based Image Synthesis Algorithms Permalink https://escholarship.org/uc/item/3968c9k5 Author Kouhzadi, Ali Publication Date 2016 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA Los Angeles A Comprehensive Study of the Seminal Monte-Carlo-Based Image Synthesis Algorithms A thesis submitted in partial satisfaction of the requirements for the degree Master of Science in Computer Science by Ali Kouhzadi 2016 ABSTRACT OF THE THESIS A Comprehensive Study of the Seminal Monte-Carlo-Based Image Synthesis Algorithms by Ali Kouhzadi Master of Science in Computer Science University of California, Los Angeles, 2016 Professor Demetri Terzopoulos, Chair This thesis presents an in-depth study of the problem of photorealistic image synthesis in the field of computer graphics. To better understand the proposed solutions to this problem, we first briefly overview several relevant fundamental topics, such as probability, Monte Carlo integration, sampling methods, reflection methods, etc. We then review some of the most influential Monte-Carlo-Based image synthesis methods introduced over the past four decades. Finally, to better understand the advantages and weaknesses of each method, we evaluate the reviewed methods using the Mitsuba Renderer, an open-source, research- oriented rendering system. ii The thesis of Ali Kouhzadi is approved. Song-Chun Zhu Joseph M. Teran Demetri Terzopoulos, Committee Chair University of California, Los Angeles 2016 iii Contents List of Figures vi List of Tables vii 1 Introduction1 1.1 Global Illumination and Photorealistic Image Synthesis............1 1.2 Objectives.....................................3 1.3 Outline.......................................4 2 Background5 2.1 Basic Probability Concepts............................5 2.2 Estimators and Their Properties.........................8 2.3 Monte Carlo Integration.............................9 2.4 Geometrical Optics and Light Rays....................... 10 2.5 Heckbert's Light Transport Notation...................... 11 2.6 Radiometry.................................... 11 2.7 Surface Reflection and Transmission....................... 14 2.7.1 Reflection Types............................. 14 2.7.2 Transmission or Internal Reflection................... 15 2.7.3 Bidirectional Reflectance Distribution Function (BRDF)....... 16 2.8 Light Transport Equation............................ 17 2.9 Sampling Methods................................ 18 2.9.1 Uniform Sampling............................ 18 2.9.2 Stratified Sampling............................ 19 2.9.3 Importance Sampling........................... 20 iv 2.9.4 Multiple Importance Sampling...................... 21 3 Monte Carlo Ray Tracing Methods 23 3.1 Precursors to MCRT............................... 23 3.2 Path Tracing and The Rendering Equation................... 26 3.3 Bidirectional Path Tracing............................ 30 3.4 Photon Mapping................................. 34 3.5 Metropolis Light Transport........................... 39 3.6 Progressive Photon Mapping........................... 44 4 Sample Results and Comparison of MCRT Algorithms 48 5 Conclusion 56 5.1 Outlook...................................... 56 6 Bibliography 58 v List of Figures 2.1 Interaction of light with diffuse and specular surfaces.............. 15 2.2 Stratified sampling illustration.......................... 20 3.1 Example scenario for Bidirectional Path Tracing................ 31 3.2 Path construction in bidirectional path tracing................. 31 3.3 Use visibility rays to connect all the points on the subpaths in BPT...... 33 3.4 Rendering caustics................................ 36 4.1 Cornell Box scene rendered by Path Tracing, Bidirectional Path Tracing, and Metropolis Light Transport........................... 50 4.2 Torus scene rendered by Path Tracing, Bidirectional Path Tracing, and Metropo- lis Light Transport................................. 51 4.3 Room scene rendered by Path Tracing, Bidirectional Path Tracing, and Metropo- lis Light Transport................................. 52 4.4 Cornell Box scene rendered by Photon Mapping and Progressive Photon Map- ping......................................... 53 4.5 Torus scene rendered by Photon Mapping and Progressive Photon Mapping. 54 4.6 Room scene rendered by Photon Mapping and Progressive Photon Mapping. 55 vi List of Tables 4.1 Rendering times for unbiased algorithms (Cornell Box scene)......... 50 4.2 Rendering times for unbiased algorithms (torus scene with caustics)..... 51 4.3 Rendering times for unbiased algorithms (room scene with indirect illumination) 52 4.4 Rendering times for biased algorithms (Cornell box scene).......... 53 4.5 Rendering times for biased algorithms (torus scene with caustics)...... 54 4.6 Rendering times for biased algorithms (room scene with indirect illumination) 54 vii 1. Introduction 1.1 Global Illumination and Photorealistic Image Syn- thesis Global Illumination refers to a group of algorithms concerned with simulating the interaction of light with surfaces and volumes [10, p. 470], also called light transport simulation. The purpose of global illumination is in synthesizing photorealistic images based on a scene description. In the context of computer graphics, geometrical optics is almost exclusively used for simulating the behavior of light [13, 20] and other theoretical frameworks (e.g., light as waves or particles) are usually ignored, since they are either too complex and negatively affect efficiency, or do not have noticeable visual effects at macroscopic scales. The first attempt at approaching image synthesis using geometrical optics can be traced back to Appel's 1968 paper [2], which laid the foundations for Goldstein and Nagel's 1971 milestone paper that introduced the first method for simulating the physical process of photography and synthesizing fully computer-generated perspective images by \geometric ray tracing". These two seminal papers paved the way for the introduction of recursive ray tracing by Whitted in 1979 [36], ray casting by Roth in 1982 [28], and radiosity by Goral et al. in 1984 [9]. In turn, the introduction of Whitted's recursive ray tracing and Goral's radiosity were arguably the start of a wave of scholarly interest in global illumination and physically-based image synthesis. As was discussed in [2], the most obvious method for simulating light transport is to trace rays emitted from a light source through the scene until they reach the observer, but in practice this method is not feasible since it is most likely that a small number, or even none, of the selected rays reach the observer (e.g., in outdoor scenes). Tracing infinite beams of 1 light emitted from a light source is also impractical for obvious reasons. The more practical alternative is to trace light rays or beams of light backward, from the observer through the image plane, and from there through the scene until some of them reach some sort of light source. This is essentially the basis of all the global illumination methods in computer graphics. There are two types of widely-used light transport models: 1. Local Illumination and 2. Global Illumination. In the local illumination approach, only direct lighting is taken into account|light rays that are directly emitted from the light source and bounce off a single surface directly towards the observer [10, p. 140]. Using this approach, all the inter-reflections between different surfaces in a scene are ignored in exchange for performance, which makes it well- suited for realtime application (e.g., video games, virtual reality). In realtime rendering, a local lighting model is used by default, and numerous \hacks and tricks" and ad-hoc methods are used to efficiently synthesize natural-looking images. Global illumination methods, by contrast, take into account direct lighting as well as indirect lighting, so that the process of shading a point on a surface takes into account the direct light rays coming from the light sources, the reflected light rays coming from other objects in the scene (inter-reflection), and refracted light rays passing through the object itself, as well as the effects of participating media, etc., thus producing photorealistic images. Using global illumination, one can simulate optical phenomena such as caustics, color-bleeding, soft shadows, motion blur, etc. Subsequent improvements on recursive ray tracing and radiosity resulted in one of the most important contributions to the field in 1986 by Kajiya|the Rendering Equation, also referred to as the Light Transport Equation (LTE), which was introduced in his seminal paper [20] and was the starting point of Monte Carlo Ray Tracing (MCRT), methods that 2 involve evaluating the rendering equation using Monte Carlo integration. These methods can be categorized into two groups of algorithms (to be discussed in more detail in Chapter 2): 1. Biased and 2. Unbiased. In general, we can categorize global illumination algorithms into two groups: 1. Algorithms based on point sampling and Monte Carlo integration (e.g., path tracing, bidirectional path tracing, Metropolis light transport, etc.) 2. Algorithms based on the Finite Element Method (FEM) (e.g., radiosity) Over time and through the introduction of new methods, it is now widely accepted that the most general and robust approach to the global illumination problem is MCRT [13, p. vi]. 1.2 Objectives
Recommended publications
  • Cloud Renderer for Autodesk® Revit® User Guide June 21, 2017
    ENGINEERING SOFTWARE DEVELOPMENT MADE EASY Cloud Renderer for Autodesk® Revit® User Guide June 21, 2017 www.amcbridge.com Cloud Renderer for Autodesk Revit User Guide Contents Contents .................................................................................................................................................... 2 Welcome to Cloud Renderer for Autodesk Revit ...................................................................................... 3 Requirements and Installation .................................................................................................................. 5 Functionality.............................................................................................................................................. 8 Cloud Renderer Plug-in ......................................................................................................................... 8 Basic Settings ..................................................................................................................................... 8 Advanced Settings ........................................................................................................................... 10 Session manager ............................................................................................................................. 15 Single session view .......................................................................................................................... 17 Cloud Renderer on Microsoft® Azure® platfrom ...............................................................................
    [Show full text]
  • 3D Rendering Software Free Download Full Version Download 3 D Rendering - Best Software & Apps
    3d rendering software free download full version Download 3 D Rendering - Best Software & Apps. NVIDIA Control Panel is a Windows utility tool, which lets users access critical functions of the NVIDIA drivers. With a comprehensive set of dropdown menus. OpenGL. An open-source graphics library. OpenGL is an open-source graphics standard for generating vector graphics in 2D as well as 3D. The cross-language Windows application has numerous functions. Autodesk Maya. Powerful 3D modeling, animation and rendering solution. Autodesk Maya is a highly professional solution for 3D modeling, animation and rendering in one complete and very powerful package.It has won several awards. Bring Your Models To Life With Powerful Rendering Tools. V-Ray is 3D model rendering software, usable with many different modelling programs but particularly compatible with SketchUp, Maya, Blender and others for. Envisioneer Express. Free 3D home design tool. Envisioneer Express is a multimedia application from Cadsoft. It is a free graphic design program that allows users to create plans for any residential. Virtual Lab. Discover the micro world with this virtual microscope. I was always fascinated by the science laboratory hours at school, when we had to use microscopes to literally discover new words, and test chemical. An extremely powerful 3D animation tool. modo has long been the application of choice for animation studios like Pixar Studios and Industrial Light and Magic. The latest update to modo improves upon. Voyager - Buy Bitcoin Crypto. A free program for Android, by Voyager Digital LLC. Voyager is a free software for Android, that belongs to the category 'Finance'.
    [Show full text]
  • Indigo Manual
    Contents Overview.............................................................................................4 About Indigo Renderer...........................................................................5 Licensing Indigo...................................................................................9 Indigo Licence activation......................................................................11 System Requirements..........................................................................14 About Installation................................................................................16 Installation on Windows.......................................................................17 Installation on Macintosh......................................................................19 Installation on Linux............................................................................20 Installing exporters for your modelling package........................................21 Working with the Indigo Interface Getting to know Indigo........................................................................23 Resolution.........................................................................................28 Tone Mapping.....................................................................................29 White balance....................................................................................36 Light Layers.......................................................................................37 Aperture Diffraction.............................................................................39
    [Show full text]
  • Probabilistic Connections for Bidirectional Path Tracing
    Eurographics Symposium on Rendering 2015 Volume 34 (2015), Number 4 J. Lehtinen and D. Nowrouzezahrai (Guest Editors) Probabilistic Connections for Bidirectional Path Tracing Stefan Popov 1 Ravi Ramamoorthi 2 Fredo Durand 3 George Drettakis 1 1 Inria 2 UC San Diego 3 MIT CSAIL Bidirectional Path Tracing Probabilistic Connections for Bidirectional Path Tracing Figure 1: Our Probabilistic Connections for Bidirectional Path Tracing approach importance samples connections to an eye sub-path, and greatly reduces variance, by considering and reusing multiple light sub-paths at once. Our approach (right) achieves much higher quality than bidirectional path-tracing on the left for the same computation time (~8.4 min). Abstract Bidirectional path tracing (BDPT) with Multiple Importance Sampling is one of the most versatile unbiased ren- dering algorithms today. BDPT repeatedly generates sub-paths from the eye and the lights, which are connected for each pixel and then discarded. Unfortunately, many such bidirectional connections turn out to have low con- tribution to the solution. Our key observation is that we can importance sample connections to an eye sub-path by considering multiple light sub-paths at once and creating connections probabilistically. We do this by storing light paths, and estimating probability mass functions of the discrete set of possible connections to all light paths. This has two key advantages: we efficiently create connections with low variance by Monte Carlo sampling, and we reuse light paths across different eye paths. We also introduce a caching scheme by deriving an approxima- tion to sub-path contribution which avoids high-dimensional path distance computations. Our approach builds on caching methods developed in the different context of VPLs.
    [Show full text]
  • A Progressive Error Estimation Framework for Photon Density Estimation
    A Progressive Error Estimation Framework for Photon Density Estimation Toshiya Hachisuka∗ Wojciech Jaroszy;∗ Henrik Wann Jensen∗ ∗UC San Diego yDisney Research Zurich¨ Reference Image Rendered Image Noise/Bias Ratio Bounded Pixels (50%) Bounded Pixels (90%) 5 . 0 1.0 s e g a m I 0.1 r o r r E l a u t c 0.01 10 100 1000 8000 A Number of Iterations 0 . 0 actual error 90% 50% Error Threshold: 0.5 Error Threshold: 0.25 Error Threshold: 0.125 Error Threshold: 0.0625 Figure 1: Our error estimation framework takes into account error due to noise and bias in progressive photon mapping. The reference image is rendered using more than one billion photons, and the rendered image is the result using 15M photons. The noise/bias ratio shows the areas of the image dominated by noise (in green) or bias (in red). The bounded pixels images show the results corresponding to a desired confidence in the estimated error value (pixels with bounded error are shown yellow): a higher confidence (90%) provides a conservative per pixel error estimate, and lower confidence (50%) is useful to estimate the average error. One application of our error estimation framework is automatic rendering termination with a user-specified error threshold (bottom row: the images show color-coded actual error). Our framework estimates error without any input from a reference image. Abstract 1 Introduction Global illumination algorithms are increasingly used for predictive We present an error estimation framework for progressive photon rendering to verify lighting and appearance of a given scene.
    [Show full text]
  • Reweighting Firefly Samples for Improved Finite-Sample Monte
    Volume xx (200y), Number z, pp. 1–10 Reweighting Firefly Samples for Improved Finite-Sample Monte Carlo Estimates Tobias Zirr, Johannes Hanika, and Carsten Dachsbacher Karlsruhe Institute of Technology Abstract Samples with high contribution but low probability density, often called fireflies, occur in all practical Monte Carlo estima- tors and are part of computing unbiased estimates. For finite-sample estimates, however, they can lead to excessive variance. Rejecting all samples classified as outliers, as suggested in previous work, leads to estimates that are too low and can cause undesirable artifacts. In this paper, we show how samples can be reweighted depending on their contribution and sampling frequency such that the finite-sample estimate gets closer to the correct expected value and the variance can be controlled. For this, we first derive a theory for how samples should ideally be reweighted and that this would require the probability density function of the optimal sampling strategy. As this PDF is generally unknown, we show how the discrepancy between the optimal and the actual sampling strategy can be estimated and used for reweighting in practice. We describe an efficient algorithm that allows for the necessary analysis of per-pixel sample distributions in the context of Monte Carlo Rendering without storing any individual samples, with only minimal changes to the rendering algorithm. It causes negligible runtime overhead, works in constant memory, and is well-suited for parallel and progressive rendering. The reweighting runs as a fast postprocess, can be controlled interactively, and our approach is non-destructive in that the unbiased result can be reconstructed at any time.
    [Show full text]
  • Path Tracing Estimators for Refractive Radiative Transfer
    Path Tracing Estimators for Refractive Radiative Transfer ADITHYA PEDIREDLA, YASIN KARIMI CHALMIANI, MATTEO GIUSEPPE SCOPELLITI, MAYSAM CHAMAN- ZAR, SRINIVASA NARASIMHAN, and IOANNIS GKIOULEKAS, Carnegie Mellon University, USA Real capture Bidirectional path tracing (ours) Photon mapping Horizontal cross-section at center Real data BDPT (ours) PM Normalized Intensity Horizontal distance (in mm) Fig. 1. Simulating refractive radiative transfer using bidrectional path tracing. Our technique enables path tracing estimators such as particle tracing, next-event estimation, bidirectional path tracing (BDPT) for heterogeneous refractive media. Unlike photon mapping (PM), path tracing estimators are unbiased and do not introduce artifacts besides noise. The above teaser shows that the proposed path tracing technique matches the real data acquired from an acousto-optic setup (ultrasound frequency: 813 kHz, 3 mean free paths, anisotropy 6 = 0.85) more accurately compared to photon mapping. Notice the complex caustics formed in a scattering medium whose refractive index field is altered using ultrasound. For more details and the reasons behind capture system imperfections, see Section 7.2. Our renderer can accelerate developments in acousto-optics, photo-acoustics, and schlieren imaging applications. The rendering time for BDPT and PM is 2.6 hrs on a cluster of 100 72-core (AWS c5n.18xlarge) machines. Rendering radiative transfer through media with a heterogeneous refractive imaging, and acousto-optic imaging, and can facilitate the development of index is challenging because the continuous refractive index variations re- inverse rendering techniques for related applications. sult in light traveling along curved paths. Existing algorithms are based on photon mapping techniques, and thus are biased and result in strong arti- CCS Concepts: • Computing methodologies → Computational pho- facts.
    [Show full text]
  • Multiresolution Radiosity Caching for Efficient Preview and Final Quality
    Multiresolution Radiosity Caching for Efficient Preview and Final Quality Global Illumination in Movies Per H. Christensen George Harker Jonathan Shade Brenden Schubert Dana Batali Pixar Technical Memo #12-06 — July, 2012 Pixar Animation Studios Figure 1: Two scenes from the CG movie ‘Monsters University’. Top row: direct illumination. Bottom row: global illumination — images such as these render more than 30 times faster with radiosity caching. c Disney/Pixar. Abstract 1 Introduction We present a multiresolution radiosity caching method that allows Recently there has been a surge in the use of global illumination global illumination to be computed efficiently in a single pass in (“color bleeding”) in CG movies and special effects, motivated by complex CG movie production scenes. the faster lighting design and more realistic lighting that it enables. The most widely used methods are distribution ray tracing, path For distribution ray tracing in production scenes, the bottleneck is tracing, and point-based global illumination; for an overview of the time spent evaluating complex shaders at the ray hit points. We these please see the course notes by Krivˇ anek´ et al. [2010]. speed up this shader evaluation time for global illumination by sep- arating out the view-independent component and caching its result The ray-traced global illumination methods (distribution ray tracing — the radiosity. Our cache contains three resolutions of the radios- and path tracing) are slow if the scenes have not only very complex ity; the resolution used for a given ray is selected using the ray’s base geometry but also very complex and programmable displace- differential.
    [Show full text]
  • Efficient Sampling of Products of Functions Using Wavelets M.S. Thesis
    Efficient sampling of products of functions using wavelets M.S. Thesis Petrik Clarberg Department of Computer Science Lund University Advisor: Tomas Akenine-M¨oller Department of Computer Science Lund University March 2005 Abstract This thesis presents a novel method for importance sampling the product of two- dimensional functions. The functions are represented as wavelets, which enables rapid computation of the product as well as efficient compression. The sampling is done by computing wavelet coefficients for the product on-the-fly, and hierarchically sampling the wavelet tree. The wavelet multiplication is guided by the sampling distribution. Hence, the proposed method is very efficient as it avoids a full computation of the prod- uct. The generated sampling distribution is superior to previous methods, as it exactly matches the probability density of the product of the two functions. As an application, the method is applied to the problem of rendering a virtual scene with realistic mea- sured materials under complex direct illumination provided by a high-dynamic range environment map. i ii Contents 1 Introduction 1 1.1 Previous Work . 2 1.2 Outline . 3 2 Wavelets 5 2.1 The Haar Basis . 5 2.2 The 2D Haar Basis . 6 2.3 Lossy Compression . 7 2.4 2D Wavelet Product . 7 2.5 Optimized Product . 9 2.6 Implementation . 9 3 Sampling 11 3.1 Monte Carlo Integration . 11 3.2 Importance Sampling . 12 3.3 Distribution of Samples . 12 3.4 Wavelet Importance Sampling . 13 3.4.1 Preliminaries . 13 3.4.2 Random Sampling – Single Sample . 14 3.4.3 Random Sampling – Multiple Samples .
    [Show full text]
  • Physically Based 3D Rendering Using Unbiased Ray Tracing Render Engine
    Vadim Morozov PHYSICALLY BASED 3D RENDERING USING UNBIASED RAY TRACING RENDER ENGINE Bachelor’s thesis Information Technology 2019 Author (authors) Degree Time Vadim Morozov Bachelor of October 2019 Engineering Thesis title 50 Pages Physically based 3D rendering using 4 Pages of aPPendices unbiased ray tracing render engine Commissioned by Supervisor Matti Juutilainen Abstract The thesis covered the toPic of 3D rendering. The main focus was on the Physically based rendering workflow that allows creating Photorealistic 3D graPhics. The objective of the thesis was to Prove that the technology evolved and develoPed so that almost any user with a Personal computer and essential knowledge is caPable for creating Photorealistic and Physically accurate images. The main research methods were an online research on different resources and Professional literature. The study covered main concePts and terms of lighting and materials in Physically based 3D rendering. Also, the main PrinciPles and technologies of rendering and the market of render engines was reviewed and analyzed. The goal of the Practical Part was to test the theory introduced and create the computer generated imagery in order to Prove the main ProPosition of the study. It included working in a dedicated software for 3D modeling and using AMD Radeon™ ProRender as main rendering software. The implementation Part consisted of detailed descriPtion of every steP of the Project creation. The whole Process from modeling to the final image outPut was explained. The final results of the study were 8 computer generated images that indicate the implementation was successful, the goal of the study was reached and it is Proved the initial ProPosition.
    [Show full text]
  • Kerkythea 2008: Rendering, Iluminação E Materiais Recolha De Informação Sobre Rendering Em Kerkythea
    Kerkythea 2008: Rendering, Iluminação e Materiais Recolha de informação sobre Rendering em Kerkythea. Fautl. 5­2013 ­ Victor Ferreira Lista geral de Tutoriais: http://www.kerkythea.net/forum/viewtopic.php?f=16&t=5720 Luzes Tipos de luzes do Kerkythea: Omni, spot, IES e Projection (projeção). Omni: é uma luz multi­direccional, que emite raios do centro para todos os lados, como o sol ou a luz de uma simples lâmpada incadescente. Spot: é uma luz direcional, como um foco, com um ângulo mais largo ou mais estreito de iluminação. IES: é um tipo de luz que tem propriedades físicas de intensidade e distribuição da luz descritas em um arquivo com extensão .ies. O resultado é mais realista do que as Omni ou Spotlight simples. O KT fornece um arquivo como um exemplo, mas você pode encontrar muitos ficheiros IES na web. Muitos fabricantes partilham os arquivos 3D das suas luminárias juntamente com o ficheiro IES respectivo. Também se pode encontrar programas gratuitos que permitem uma visualização rápida da forma da luz IES sem precisar de a inserir no Kerkythea Controlo de edição visual: a posição e o raio de luz podem ser geridos também com o controlador que você pode encontrar no canto superior direito da janela. O controle deslizante assume funções diferentes dependendo do tipo de luz que for seleccionado: o raio para a omni. HotSpot/falloff para a spot e largura/altura para projetor. Atenção: Quando se selecciona uma luz (Omni ou IES) aparece uma esfera amarela,que representa a dimensão do emissor. Isto depende do valor do raio, expresso em metros.
    [Show full text]
  • Probabilistic Connections for Bidirectional Path Tracing
    Eurographics Symposium on Rendering 2015 Volume 34 (2015), Number 4 J. Lehtinen and D. Nowrouzezahrai (Guest Editors) Probabilistic Connections for Bidirectional Path Tracing Stefan Popov 1 Ravi Ramamoorthi 2 Fredo Durand 3 George Drettakis 1 1 Inria 2 UC San Diego 3 MIT CSAIL Bidirectional Path Tracing Probabilistic Connections for Bidirectional Path Tracing Figure 1: Our Probabilistic Connections for Bidirectional Path Tracing approach importance samples connections to an eye sub-path, and greatly reduces variance, by considering and reusing multiple light sub-paths at once. Our approach (right) achieves much higher quality than bidirectional path-tracing on the left for the same computation time (~8.4 min). Abstract Bidirectional path tracing (BDPT) with Multiple Importance Sampling is one of the most versatile unbiased ren- dering algorithms today. BDPT repeatedly generates sub-paths from the eye and the lights, which are connected for each pixel and then discarded. Unfortunately, many such bidirectional connections turn out to have low con- tribution to the solution. Our key observation is that we can importance sample connections to an eye sub-path by considering multiple light sub-paths at once and creating connections probabilistically. We do this by storing light paths, and estimating probability mass functions of the discrete set of possible connections to all light paths. This has two key advantages: we efficiently create connections with low variance by Monte Carlo sampling, and we reuse light paths across different eye paths. We also introduce a caching scheme by deriving an approxima- tion to sub-path contribution which avoids high-dimensional path distance computations. Our approach builds on caching methods developed in the different context of VPLs.
    [Show full text]