Cascaded Sobol' sampling

Rendering quality is largely influenced by the samplers used in Monte Carlo integration. Important factors include sample uniformity (e.g., low discrepancy) in the high-dimensional integration domain, sample uniformity in lower-dimensional projections, and lack of dominant structures that could result in aliasing artifacts. A widely used and successful construction is the Sobol' sequence that guarantees good high-dimensional uniformity and consequently results in faster convergence of quasi-Monte Carlo integration. We show that this sequence exhibits low uniformity and dominant structures in low-dimensional projections. These structures impair quality in the context of rendering, as they precisely occur in the 2-dimensional projections used for sampling light sources, reflectance functions, or the camera lens or sensor. We propose a new cascaded construction, which, despite dropping the sequential aspect of Sobol' samples, produces point sets exhibiting provably perfect dyadic partitioning (and therefore, excellent uniformity) in consecutive 2-dimensional projections, while preserving good high-dimensional uniformity. By optimizing the initialization parameters and performing Owen scrambling at finer levels of binary representations, we further improve over Sobol's integration convergence rate. Our method does not incur any overhead as compared to the generation of the Sobol' sequence, is compatible with Owen scrambling and can be used in rendering applications.

[1]  Hans-Peter Seidel,et al.  Projective Blue‐Noise Sampling , 2016, Comput. Graph. Forum.

[2]  O. Deussen,et al.  Capacity-constrained point distributions: a variant of Lloyd's method , 2009, SIGGRAPH 2009.

[3]  Alexander Keller,et al.  Quasi-Monte Carlo Image Synthesis in a Nutshell , 2013 .

[4]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[5]  Alexander Keller,et al.  Enumerating Quasi-Monte Carlo Point Sequences in Elementary Intervals , 2012 .

[6]  Andrew Kensler,et al.  Progressive Multi‐Jittered Sample Sequences , 2018, Comput. Graph. Forum.

[7]  Fred J. Hickernell,et al.  A generalized discrepancy and quadrature error bound , 1998, Math. Comput..

[8]  Oliver Deussen,et al.  Blue noise sampling with controlled aliasing , 2013, TOGS.

[9]  Art B. Owen,et al.  Scrambling Sobol' and Niederreiter-Xing Points , 1998, J. Complex..

[10]  Laurent Belcour,et al.  Distributing Monte Carlo Errors as a Blue Noise in Screen Space by Permuting Pixel Seeds Between Frames , 2019, Comput. Graph. Forum.

[11]  Alexander Keller,et al.  Stratification by Rank-1 Lattices , 2004 .

[12]  R. Cranley,et al.  Randomization of Number Theoretic Methods for Multiple Integration , 1976 .

[13]  P. Gruber,et al.  Funktionen von beschränkter Variation in der Theorie der Gleichverteilung , 1990 .

[14]  Robert Bridson,et al.  Fast Poisson disk sampling in arbitrary dimensions , 2007, SIGGRAPH '07.

[15]  Li-Yi Wei,et al.  Point sampling with general noise spectrum , 2012, ACM Trans. Graph..

[16]  Abdalla G. M. Ahmed,et al.  Low-discrepancy blue noise sampling , 2016, ACM Trans. Graph..

[17]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[18]  Brent Burley Practical Hash-based Owen Scrambling , 2020 .

[19]  Peter Wonka,et al.  Screen-space blue-noise diffusion of monte carlo sampling error via hierarchical ordering of pixels , 2020, ACM Trans. Graph..

[20]  Andrew Kensler,et al.  Orthogonal Array Sampling for Monte Carlo Rendering , 2019, Comput. Graph. Forum.

[21]  Jean-Claude Iehl,et al.  A low-discrepancy sampler that distributes monte carlo errors as a blue noise in screen space , 2019, SIGGRAPH Talks.

[22]  F. Pillichshammer,et al.  Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration , 2010 .

[23]  Mathieu Desbrun,et al.  Sliced optimal transport sampling , 2020, ACM Trans. Graph..

[24]  Alexander Keller,et al.  ( t, m, s )-Nets and Maximized Minimum Distance , 2008 .

[25]  Frances Y. Kuo,et al.  Constructing Sobol Sequences with Better Two-Dimensional Projections , 2008, SIAM J. Sci. Comput..

[26]  Marcos Fajardo,et al.  Blue-noise dithered sampling , 2016, SIGGRAPH Talks.

[27]  Honglei Han,et al.  Rank‐1 Lattices for Efficient Path Integral Estimation , 2021, Comput. Graph. Forum.

[28]  P. L’Ecuyer,et al.  Algorithm 958: Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules , 2015, ACM Trans. Math. Softw..

[29]  H. Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing , 1995 .

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

[31]  Pat Hanrahan,et al.  Sequences with Low‐Discrepancy Blue‐Noise 2‐D Projections , 2018, Comput. Graph. Forum.

[32]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[33]  A. Owen Randomly Permuted (t,m,s)-Nets and (t, s)-Sequences , 1995 .

[34]  V. Ostromoukhov,et al.  Fast hierarchical importance sampling with blue noise properties , 2004, SIGGRAPH 2004.

[35]  O. Deussen,et al.  Capacity-constrained point distributions: a variant of Lloyd's method , 2009, ACM Trans. Graph..

[36]  C. Lemieux Monte Carlo and Quasi-Monte Carlo Sampling , 2009 .

[37]  Gurprit Singh,et al.  Analysis of Sample Correlations for Monte Carlo Rendering , 2019, Comput. Graph. Forum.

[38]  Raanan Fattal Blue-noise point sampling using kernel density model , 2011, SIGGRAPH 2011.

[39]  I. Sobol On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .