Path guiding in production

Path guiding is a family of adaptive variance reduction techniques in physically-based rendering, which includes methods for sampling both direct and indirect illumination, surfaces and volumes but also for sampling optimal path lengths and making splitting decisions. Since adoption of path tracing as a de facto standard in the VFX industry several years ago, there has been an increased interest in producing high-quality images with low amount of Monte Carlo samples per pixel. Path guiding, which has received attention in the research community in the past few years, has proven to be useful for this task and therefore has been adopted by Weta Digital. Recently, it has also been implemented in the Walt Disney Animation Studios' Hyperion and Pixar's Renderman. The goal of this course is to share our practical experience with path guiding in production and to provide self-contained overview of recently published techniques and to discuss their pros and cons. We also take audience through theoretical background of various path guiding methods which are mostly based on machine learning - used to adapt sampling distributons based on observed samples - and zero-variance random walk theory - used as a framework for combining different sampling decisions in an optimal way. At the end of our course we discuss open problems and invite researchers to further develop path guiding in their future work.

[1]  Tim Weyrich,et al.  Density‐based Outlier Rejection in Monte Carlo Rendering , 2010, Comput. Graph. Forum.

[2]  Alexander Keller,et al.  Learning light transport the reinforced way , 2016, SIGGRAPH Talks.

[3]  Hendrik P. A. Lensch,et al.  A Unified Manifold Framework for Efficient BRDF Sampling based on Parametric Mixture Models , 2018, EGSR.

[4]  Derek Nowrouzezahrai,et al.  Joint importance sampling of low-order volumetric scattering , 2013, ACM Trans. Graph..

[5]  Andrew Kensler,et al.  RenderMan , 2018, ACM Trans. Graph..

[6]  Jaroslav Krivánek,et al.  Adjoint-driven Russian roulette and splitting in light transport simulation , 2016, ACM Trans. Graph..

[7]  Alexandre Lacoste,et al.  Neural Autoregressive Flows , 2018, ICML.

[8]  Robert Ulichney,et al.  Void-and-cluster method for dither array generation , 1993, Electronic Imaging.

[9]  Thomas Bashford-Rogers,et al.  A Significance Cache for Accelerating Global Illumination , 2012, Comput. Graph. Forum.

[10]  Jaroslav Krivánek,et al.  Monte Carlo methods for physically based volume rendering , 2018, SIGGRAPH Courses.

[11]  Carsten Dachsbacher,et al.  Improving the Dwivedi Sampling Scheme , 2016, Comput. Graph. Forum.

[12]  Jaroslav Krivánek,et al.  A zero-variance-based sampling scheme for Monte Carlo subsurface scattering , 2014, SIGGRAPH Talks.

[13]  Petr Vévoda,et al.  Bayesian online regression for adaptive direct illumination sampling , 2018, ACM Trans. Graph..

[14]  Carsten Dachsbacher,et al.  Selective guided sampling with complete light transport paths , 2018, ACM Trans. Graph..

[15]  Markus H. Gross,et al.  Practical Path Guiding for Efficient Light‐Transport Simulation , 2017, Comput. Graph. Forum.

[16]  Andrew Gordon Wilson,et al.  Averaging Weights Leads to Wider Optima and Better Generalization , 2018, UAI.

[17]  Tobias Ritschel,et al.  On-line learning of parametric mixture models for light transport simulation , 2014, ACM Trans. Graph..

[18]  David Duvenaud,et al.  Neural Ordinary Differential Equations , 2018, NeurIPS.

[19]  James T. Kajiya,et al.  The rendering equation , 1986, SIGGRAPH.

[20]  Christopher D. Kulla,et al.  Eurographics Symposium on Rendering 2012 Importance Sampling Techniques for Path Tracing in Participating Media , 2022 .

[21]  Johannes Hanika,et al.  Monte Carlo Methods for Volumetric Light Transport Simulation , 2018, Comput. Graph. Forum.

[22]  Leonidas J. Guibas,et al.  Robust Monte Carlo methods for light transport simulation , 1997 .

[23]  Brent Burley,et al.  The Design and Evolution of Disney’s Hyperion Renderer , 2018, ACM Trans. Graph..

[24]  Derek Nowrouzezahrai,et al.  Volume Path Guiding Based on Zero-Variance Random Walk Theory , 2019, ACM Trans. Graph..

[25]  Alejandro Conty Estevez,et al.  Importance sampling of many lights with adaptive tree splitting , 2017, SIGGRAPH Talks.

[26]  J. E. Hoogenboom,et al.  Zero-Variance Monte Carlo Schemes Revisited , 2008 .