{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T01:27:22Z","timestamp":1784251642245,"version":"3.55.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3478513.3480482","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T18:28:45Z","timestamp":1639160925000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Cascaded Sobol' sampling"],"prefix":"10.1145","volume":"40","author":[{"given":"Lo\u00efs","family":"Paulin","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lyon, CNRS, LIRIS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Claude","family":"Iehl","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Bonneel","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Keller","sequence":"additional","affiliation":[{"name":"NVIDIA, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Ostromoukhov","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2980218"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417881"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576246.1531392"},{"key":"e_1_2_2_4_1","unstructured":"Benedikt Bitterli. 2016. Rendering resources. https:\/\/benedikt-bitterli.me\/resources\/.  Benedikt Bitterli. 2016. Rendering resources. https:\/\/benedikt-bitterli.me\/resources\/."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278780.1278807"},{"key":"e_1_2_2_6_1","first-page":"1","article-title":"Practical Hash-based Owen Scrambling","volume":"10","author":"Burley Brent","year":"2020","unstructured":"Brent Burley . 2020 . Practical Hash-based Owen Scrambling . Journal of Computer Graphics Techniques (JCGT) 10 , 4 (2020), 1 -- 20 . Brent Burley. 2020. Practical Hash-based Owen Scrambling. Journal of Computer Graphics Techniques (JCGT) 10, 4 (2020), 1--20.","journal-title":"Journal of Computer Graphics Techniques (JCGT)"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13472"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0713071"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941868"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964943"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Iliyan Georgiev and Marcos Fajardo. 2016. Blue-Noise Dithered Sampling. 35:1--35:1.  Iliyan Georgiev and Marcos Fajardo. 2016. Blue-Noise Dithered Sampling. 35:1--35:1.","DOI":"10.1145\/2897839.2927430"},{"key":"e_1_2_2_12_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Gr\u00fcnschlo\u00df Leonhard","year":"2006","unstructured":"Leonhard Gr\u00fcnschlo\u00df , Johannes Hanika , Ronnie Schwede , and Alexander Keller . 2008. (t , m, s)-Nets and Maximized Minimum Distance . In Monte Carlo and Quasi-Monte Carlo Methods 2006 . Springer , 397--412. Leonhard Gr\u00fcnschlo\u00df, Johannes Hanika, Ronnie Schwede, and Alexander Keller. 2008. (t, m, s)-Nets and Maximized Minimum Distance. In Monte Carlo and Quasi-Monte Carlo Methods 2006. Springer, 397--412."},{"key":"e_1_2_2_13_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Gr\u00fcnschlo\u00df Leonhard","year":"2010","unstructured":"Leonhard Gr\u00fcnschlo\u00df , Matthias Raab , and Alexander Keller . 2012. Enumerating Quasi-Monte Carlo Point Sequences in Elementary Intervals . In Monte Carlo and Quasi-Monte Carlo Methods 2010 , Leszek Plaskota and Henryk Wo\u017aniakowski (Eds.). Springer , 399--408. Leonhard Gr\u00fcnschlo\u00df, Matthias Raab, and Alexander Keller. 2012. Enumerating Quasi-Monte Carlo Point Sequences in Elementary Intervals. In Monte Carlo and Quasi-Monte Carlo Methods 2010, Leszek Plaskota and Henryk Wo\u017aniakowski (Eds.). Springer, 399--408."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365104"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487228.2487233"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306307.3328191"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00894-1"},{"key":"e_1_2_2_18_1","volume-title":"Funktionen von beschr\u00e4nkter Variation in der Theorie der Gleichverteilung. Annali di Matematica Pura ed Applicata 54, 1","author":"Hlawka Edmund","year":"1961","unstructured":"Edmund Hlawka . 1961. Funktionen von beschr\u00e4nkter Variation in der Theorie der Gleichverteilung. Annali di Matematica Pura ed Applicata 54, 1 ( 1961 ), 325--333. Edmund Hlawka. 1961. Funktionen von beschr\u00e4nkter Variation in der Theorie der Gleichverteilung. Annali di Matematica Pura ed Applicata 54, 1 (1961), 325--333."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13777"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709359"},{"key":"e_1_2_2_21_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Keller Alexander","year":"2002","unstructured":"Alexander Keller . 2004. Stratification by rank-1 lattices . In Monte Carlo and Quasi-Monte Carlo Methods 2002 , Harald Niederreiter (Ed.). Springer , 299--313. Alexander Keller. 2004. Stratification by rank-1 lattices. In Monte Carlo and Quasi-Monte Carlo Methods 2002, Harald Niederreiter (Ed.). Springer, 299--313."},{"key":"e_1_2_2_22_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Keller Alexander","year":"2012","unstructured":"Alexander Keller . 2013. Quasi-Monte Carlo Image Synthesis in a Nutshell . In Monte Carlo and Quasi-Monte Carlo Methods 2012 , Joseph Dick, Frances Kuo , Gareth Peters, and Ian Sloan (Eds.). Springer , 203--238. Alexander Keller. 2013. Quasi-Monte Carlo Image Synthesis in a Nutshell. In Monte Carlo and Quasi-Monte Carlo Methods 2012, Joseph Dick, Frances Kuo, Gareth Peters, and Ian Sloan (Eds.). Springer, 203--238."},{"key":"e_1_2_2_23_1","volume-title":"Uniform distribution of sequences","author":"Kuipers Lauwerens","unstructured":"Lauwerens Kuipers and Harald Niederreiter . 2012. Uniform distribution of sequences . Courier Corporation . Lauwerens Kuipers and Harald Niederreiter. 2012. Uniform distribution of sequences. Courier Corporation."},{"key":"e_1_2_2_24_1","volume-title":"Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules. https:\/\/github.com\/umontreal-simul\/latnetbuilder.","author":"L'Ecuyer Pierre","year":"2016","unstructured":"Pierre L'Ecuyer and David Munger . 2016 . Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules. https:\/\/github.com\/umontreal-simul\/latnetbuilder. Pierre L'Ecuyer and David Munger. 2016. Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules. https:\/\/github.com\/umontreal-simul\/latnetbuilder."},{"key":"e_1_2_2_25_1","volume-title":"Monte Carlo and Quasi Monte Carlo Sampling","author":"Lemieux Christiane","unstructured":"Christiane Lemieux . 2009. Monte Carlo and Quasi Monte Carlo Sampling . Springer . Christiane Lemieux. 2009. Monte Carlo and Quasi Monte Carlo Sampling. Springer."},{"key":"e_1_2_2_26_1","volume-title":"Rank-1 Lattices for Efficient Path Integral Estimation. Computer Graphics Forum","author":"Liu Hongli","year":"2021","unstructured":"Hongli Liu , Honglei Han , and Min Jiang . 2021. Rank-1 Lattices for Efficient Path Integral Estimation. Computer Graphics Forum ( 2021 ). Hongli Liu, Honglei Han, and Min Jiang. 2021. Rank-1 Lattices for Efficient Path Integral Estimation. Computer Graphics Forum (2021)."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/130653"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015750"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2552-2_19"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0487"},{"key":"e_1_2_2_31_1","volume-title":"Sliced optimal transport sampling. ACM Trans. Graph 39","author":"Paulin Lois","year":"2020","unstructured":"Lois Paulin , Nicolas Bonneel , David Coeurjolly , Jean-Claude Iehl , Antoine Webanck , Mathieu Desbrun , and Victor Ostromoukhov . 2020. Sliced optimal transport sampling. ACM Trans. Graph 39 ( 2020 ). Lois Paulin, Nicolas Bonneel, David Coeurjolly, Jean-Claude Iehl, Antoine Webanck, Mathieu Desbrun, and Victor Ostromoukhov. 2020. Sliced optimal transport sampling. ACM Trans. Graph 39 (2020)."},{"key":"e_1_2_2_32_1","volume-title":"Computer Graphics Forum","author":"Perrier H\u00e9l\u00e8ne","unstructured":"H\u00e9l\u00e8ne Perrier , David Coeurjolly , Feng Xie , Matt Pharr , Pat Hanrahan , and Victor Ostromoukhov . 2018. Sequences with Low-Discrepancy Blue-Noise 2-D Projections . In Computer Graphics Forum , Vol. 37 . Wiley Online Library , 339--353. H\u00e9l\u00e8ne Perrier, David Coeurjolly, Feng Xie, Matt Pharr, Pat Hanrahan, and Victor Ostromoukhov. 2018. Sequences with Low-Discrepancy Blue-Noise 2-D Projections. In Computer Graphics Forum, Vol. 37. Wiley Online Library, 339--353."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3044800"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12725"},{"key":"e_1_2_2_35_1","volume-title":"David Coeurjolly, Kartic Subr, Oliver Deussen, Victor Ostromoukhov, Ravi Ramamoorthi, and Wojciech Jarosz.","author":"Singh Gurprit","year":"2019","unstructured":"Gurprit Singh , Cengiz \u00d6ztireli , Abdalla GM Ahmed , David Coeurjolly, Kartic Subr, Oliver Deussen, Victor Ostromoukhov, Ravi Ramamoorthi, and Wojciech Jarosz. 2019 . Analysis of sample correlations for Monte Carlo rendering. In Computer Graphics Forum, Vol. 38 . Wiley Online Library , 473--491. Gurprit Singh, Cengiz \u00d6ztireli, Abdalla GM Ahmed, David Coeurjolly, Kartic Subr, Oliver Deussen, Victor Ostromoukhov, Ravi Ramamoorthi, and Wojciech Jarosz. 2019. Analysis of sample correlations for Monte Carlo rendering. In Computer Graphics Forum, Vol. 38. Wiley Online Library, 473--491."},{"key":"e_1_2_2_36_1","volume-title":"The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A058943","author":"Alexander Sloane Neil James","year":"2017","unstructured":"Neil James Alexander Sloane . 2017. The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A058943 ( 2017 ). Neil James Alexander Sloane. 2017. The On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A058943 (2017)."},{"key":"e_1_2_2_37_1","volume-title":"On the distribution of points in a cube and the approximate evaluation of integrals. Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 7, 4","author":"Sobol' Il'ya Meerovich","year":"1967","unstructured":"Il'ya Meerovich Sobol' . 1967. On the distribution of points in a cube and the approximate evaluation of integrals. Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 7, 4 ( 1967 ), 784--802. Il'ya Meerovich Sobol'. 1967. On the distribution of points in a cube and the approximate evaluation of integrals. Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 7, 4 (1967), 784--802."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185572"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3478513.3480482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:48Z","timestamp":1750191108000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1145\/3478513.3480482"],"URL":"https:\/\/doi.org\/10.1145\/3478513.3480482","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"2021-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}