Practical Product Sampling by Fitting and Composing Warps

We introduce a Monte Carlo importance sampling method for integrands composed of products and show its application to rendering where direct sampling of the product is often difficult. Our method is based on warp functions that operate on the primary samples in [0,1)n, where each warp approximates sampling a single factor of the product distribution. Our key insight is that individual factors are often well‐behaved and inexpensive to fit and sample in primary sample space, which leads to a practical, efficient sampling algorithm. Our sampling approach is unbiased, easy to implement, and compatible with multiple importance sampling. We show the results of applying our warps to projected solid angle sampling of spherical triangles, to sampling bilinear patch light sources, and to sampling glossy BSDFs and area light sources, with efficiency improvements of over 1.6× on real‐world scenes.

[1]  E. Tabak,et al.  A Family of Nonparametric Density Estimation Algorithms , 2013 .

[2]  Alejandro Conty Estevez,et al.  Fast product importance sampling of environment maps , 2018, SIGGRAPH Talks.

[3]  Laurent Belcour,et al.  A spherical cap preserving parameterization for spherical distributions , 2017, ACM Trans. Graph..

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

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

[6]  Thomas Müller,et al.  Neural Importance Sampling , 2018, ACM Trans. Graph..

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

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

[9]  Jamie Portsmouth.  Efficient barycentric point sampling on meshes , 2017, ArXiv.

[10]  James Arvo,et al.  Stratified Sampling of Convex Quadrilaterals , 2007, J. Graph. Tools.

[11]  K. Subr,et al.  Steerable Importance Sampling , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[12]  Carlos Ureña,et al.  An Area‐Preserving Parametrization for Spherical Rectangles , 2013, Comput. Graph. Forum.

[13]  Carsten Dachsbacher,et al.  Sampling Projected Spherical Caps in Real Time , 2019, PACMCGIT.

[14]  E. Tabak,et al.  DENSITY ESTIMATION BY DUAL ASCENT OF THE LOG-LIKELIHOOD ∗ , 2010 .

[15]  Jerry Jinfeng Guo,et al.  Primary Sample Space Path Guiding , 2018, EGSR.

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

[17]  Yu-Ming Cheng,et al.  Tunable Bounding Volumes for Monte Carlo Applications , 2006, ICCSA.

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

[19]  Matthias Zwicker,et al.  Learning to Importance Sample in Primary Sample Space , 2018, Comput. Graph. Forum.

[20]  Carlos Ureña,et al.  Stratified Sampling of Projected Spherical Caps , 2018, Comput. Graph. Forum.

[21]  Henrik Wann Jensen,et al.  State of the Art in Monte Carlo Ray Tracing for Realistic Image Synthesis , 2001 .

[22]  Tomasz Luczak,et al.  On k-leaf connectivity of a random graph , 1988, J. Graph Theory.

[23]  James Arvo,et al.  Stratified sampling of spherical triangles , 1995, SIGGRAPH.

[24]  Eric Heitz,et al.  Importance Sampling Microfacet‐Based BSDFs using the Distribution of Visible Normals , 2014, Comput. Graph. Forum.

[25]  Peter Shirley,et al.  Monte Carlo techniques for direct lighting calculations , 1996, TOGS.

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

[27]  Carlos Ureña,et al.  Computation of Irradiance from Triangles by Adaptive Sampling , 2000, Comput. Graph. Forum.

[28]  Shakir Mohamed,et al.  Variational Inference with Normalizing Flows , 2015, ICML.

[29]  Alexander Reshetov.  Cool Patches: A Geometric Approach to Ray/Bilinear Patch Intersections , 2019, Ray Tracing Gems.

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

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

[32]  W. Jakob,et al.  Quantifying the Error of Light Transport Algorithms , 2019, Comput. Graph. Forum.

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

[34]  Manuel N. Gamito.  Solid Angle Sampling of Disk and Cylinder Lights , 2016, Comput. Graph. Forum.

[35]  Yoshua Bengio,et al.  NICE: Non-linear Independent Components Estimation , 2014, ICLR.

[36]  Thomas E. Booth.  A Monte Carlo Learning/Biasing Experiment with Intelligent Random Numbers , 1986 .

[37]  J. Arvo.  Stratified Sampling of 2-Manifolds , 2001 .