Primary Sample Space Path Guiding

Guiding path tracing in light transport simulation has been one of the practical choices for variance reduction in production rendering. For this purpose, typically structures in the spatial-directional domain are built. We present a novel scheme for unbiased path guiding. Different from existing methods, we work in primary sample space. We collect records of primary samples as well as the luminance that the resulting path contributes and build a multiple dimensional structure, from which we derive random numbers that are fed into the path tracer. This scheme is executed completely outside the rendering kernel. We demonstrate that this method is practical and efficient. We manage to reduce variance and zero radiance paths by only working in the primary sample space.

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

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

[3]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[4]  Csaba Kelemen,et al.  Simple and Robust Mutation Strategy for Metropolis Light Transport Algorithm , 2001 .

[5]  Gregory J. Ward,et al.  Measuring and modeling anisotropic reflection , 1992, SIGGRAPH.

[6]  Yoshifumi Kitamura,et al.  Replica Exchange Light Transport , 2009, Comput. Graph. Forum.

[7]  Jacopo Pantaleoni,et al.  Charted metropolis light transport , 2016, ACM Trans. Graph..

[8]  Leonidas J. Guibas,et al.  Metropolis light transport , 1997, SIGGRAPH.

[9]  Toshiya Hachisuka,et al.  Multiplexed metropolis light transport , 2014, ACM Trans. Graph..

[10]  Donald P. Greenberg,et al.  Non-linear approximation of reflectance functions , 1997, SIGGRAPH.

[11]  Greg Humphreys,et al.  Physically Based Rendering: From Theory to Implementation , 2004 .

[12]  Philippe Bekaert,et al.  Advanced global illumination , 2006 .

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

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

[15]  Leonidas J. Guibas,et al.  Bidirectional Estimators for Light Transport , 1995 .

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

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

[18]  Michael D. McCool,et al.  Probability Trees , 1997, Graphics Interface.

[19]  Peter Shirley,et al.  Physically based lighting calculations for computer graphics , 1991 .

[20]  Steve Marschner,et al.  Manifold exploration , 2012, ACM Trans. Graph..

[21]  Jacopo Pantaleoni,et al.  A path space extension for robust light transport simulation , 2012, ACM Trans. Graph..

[22]  James Arvo,et al.  Particle transport and image synthesis , 1990, SIGGRAPH.

[23]  Leonidas J. Guibas,et al.  Optimally combining sampling techniques for Monte Carlo rendering , 1995, SIGGRAPH.

[24]  Hendrik P. A. Lensch,et al.  Product Importance Sampling for Light Transport Path Guiding , 2016, Comput. Graph. Forum.

[25]  Niels Jørgen Christensen,et al.  Photon maps in bidirectional Monte Carlo ray tracing of complex objects , 1995, Comput. Graph..

[26]  Paul Debevec Rendering synthetic objects into real scenes: bridging traditional and image-based graphics with global illumination and high dynamic range photography , 2008, SIGGRAPH Classes.

[27]  H. Jensen,et al.  Wavelet importance sampling: efficiently evaluating products of complex functions , 2005, SIGGRAPH 2005.