Importance Caching for Complex Illumination

Realistic rendering requires computing the global illumination in the scene, and Monte Carlo integration is the best‐known method for doing that. The key to good performance is to carefully select the costly integration samples, which is usually achieved via importance sampling. Unfortunately, visibility is difficult to factor into the importance distribution, which can greatly increase variance in highly occluded scenes with complex illumination. In this paper, we present importance caching – a novel approach that selects those samples with a distribution that includes visibility, while maintaining efficiency by exploiting illumination smoothness. At a sparse set of locations in the scene, we construct and cache several types of probability distributions with respect to a set of virtual point lights (VPLs), which notably include visibility. Each distribution type is optimized for a specific lighting condition. For every shading point, we then borrow the distributions from nearby cached locations and use them for VPL sampling, avoiding additional bias. A novel multiple importance sampling framework finally combines the many estimators. In highly occluded scenes, where visibility is a major source of variance in the incident radiance, our approach can reduce variance by more than an order of magnitude. Even in such complex scenes we can obtain accurate and low noise previews with full global illumination in a couple of seconds on a single mid‐range CPU.

[1]  Tomas Akenine-Möller,et al.  Practical Product Importance Sampling for Direct Illumination , 2008, Comput. Graph. Forum.

[2]  Philipp Slusallek,et al.  Combining global and local virtual lights for detailed glossy illumination , 2010, SIGGRAPH 2010.

[3]  Fabio Pellacini,et al.  LightSlice: matrix slice sampling for the many-lights problem , 2011, ACM Trans. Graph..

[4]  Gregory J. Ward,et al.  A ray tracing solution for diffuse interreflection , 2008, SIGGRAPH '08.

[5]  Parris K. Egbert,et al.  Importance resampling for global illumination , 2005, EGSR '05.

[6]  Adam Arbree,et al.  To appear in the ACM SIGGRAPH conference proceedings Lightcuts: A Scalable Approach to Illumination , 2022 .

[7]  Werner Purgathofer,et al.  Importance sampling with hemispherical particle footprints , 2002, SCCG '02.

[8]  Tomas Akenine-Möller,et al.  Wavelet importance sampling: efficiently evaluating products of complex functions , 2005, ACM Trans. Graph..

[9]  Sumanta N. Pattanaik,et al.  Radiance caching for efficient global illumination computation , 2008, IEEE Transactions on Visualization and Computer Graphics.

[10]  T. Hesterberg,et al.  Weighted Average Importance Sampling and Defensive Mixture Distributions , 1995 .

[11]  Pierre Poulin,et al.  Efficient product sampling using hierarchical thresholding , 2008, The Visual Computer.

[12]  Tomas Akenine-Möller,et al.  Exploiting Visibility Correlation in Direct Illumination , 2008, Comput. Graph. Forum.

[13]  Hans-Peter Seidel,et al.  Real-time Indirect Illumination with Clustered Visibility , 2009, VMV.

[14]  Jaroslav Krivánek,et al.  Spatial Directional Radiance Caching , 2009 .

[15]  Bernard Péroche,et al.  Metropolis Instant Radiosity , 2007, Comput. Graph. Forum.

[16]  Wolfgang Heidrich,et al.  Bidirectional importance sampling for illumination from environment maps , 2004, SIGGRAPH '04.

[17]  Parris K. Egbert,et al.  Two Stage Importance Sampling for Direct Lighting , 2006, Rendering Techniques.

[18]  K. Bala,et al.  Matrix row-column sampling for the many-light problem , 2007, ACM Trans. Graph..

[19]  J. Steinhurst,et al.  Global Importance Sampling of Glossy Surfaces Using the Photon Map , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[20]  Bernard Péroche,et al.  Bidirectional instant radiosity , 2006, EGSR '06.

[21]  T. Kollig,et al.  Illumination in the Presence of Weak Singularities , 2006 .

[22]  Wolfgang Heidrich,et al.  Bidirectional importance sampling for direct illumination , 2005, EGSR '05.

[23]  Hans-Peter Seidel,et al.  Making Imperfect Shadow Maps View‐Adaptive: High‐Quality Global Illumination in Large Dynamic Scenes , 2011, Comput. Graph. Forum.

[24]  K. Bala,et al.  Multidimensional lightcuts , 2006, SIGGRAPH 2006.

[25]  J. Zára,et al.  Making radiance and irradiance caching practical: adaptive caching and neighbor clamping , 2006, EGSR '06.

[26]  Parris K. Egbert,et al.  Table‐driven Adaptive Importance Sampling , 2008, Comput. Graph. Forum.

[27]  Hans-Peter Seidel,et al.  Imperfect shadow maps for efficient computation of indirect illumination , 2008, SIGGRAPH Asia '08.

[28]  Kavita Bala,et al.  Matrix row-column sampling for the many-light problem , 2007, ACM Trans. Graph..

[29]  Philipp Slusallek,et al.  Simple and Robust Iterative Importance Sampling of Virtual Point Lights , 2010, Eurographics.

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

[31]  Janne Kontkanen,et al.  Irradiance Filtering for Monte Carlo Ray Tracing , 2006 .

[32]  Rui Wang,et al.  Bidirectional Importance Sampling for Unstructured Direct Illumination , 2009, Comput. Graph. Forum.

[33]  Henrik Wann Jensen,et al.  Importance Driven Path Tracing using the Photon Map , 1995, Rendering Techniques.

[34]  Alexander Keller,et al.  Instant radiosity , 1997, SIGGRAPH.

[35]  Philipp Slusallek,et al.  Interactive Global Illumination in Complex and Highly Occluded Environments , 2003, Rendering Techniques.

[36]  Bruce Walter,et al.  Virtual spherical lights for many-light rendering of glossy scenes , 2009, ACM Trans. Graph..