Orthogonal Array Sampling for Monte Carlo Rendering

被引:7
|
作者
Jarosz, Wojciech [1 ]
Enayet, Afnan [1 ]
Kensler, Andrew [2 ]
Kilpatrick, Charlie [2 ]
Christensen, Per [2 ]
机构
[1] Dartmouth Coll, Hanover, NH 03755 USA
[2] Pixar Animat Studios, Emeryville, CA USA
关键词
CCS Concepts; center dot Computing methodologies -> Computer graphics; Ray tracing; center dot Theory of computation -> Generating random combinatorial structures; center dot Mathematics of computing -> Stochastic processes; Computations in finite fields;
D O I
10.1111/cgf.13777
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We generalize N-rooks, jittered, and (correlated) multi-jittered sampling to higher dimensions by importing and improving upon a class of techniques called orthogonal arrays from the statistics literature. Renderers typically combine or "pad" a collection of lower-dimensional (e.g. 2D and 1D) stratified patterns to form higher-dimensional samples for integration. This maintains stratification in the original dimension pairs, but looses it for all other dimension pairs. For truly multi-dimensional integrands like those in rendering, this increases variance and deteriorates its rate of convergence to that of pure random sampling. Care must therefore be taken to assign the primary dimension pairs to the dimensions with most integrand variation, but this complicates implementations. We tackle this problem by developing a collection of practical, in-place multi-dimensional sample generation routines that stratify points on all t-dimensional and 1-dimensional projections simultaneously. For instance, when t=2, any 2D projection of our samples is a (correlated) multi-jittered point set. This property not only reduces variance, but also simplifies implementations since sample dimensions can now be assigned to integrand dimensions arbitrarily while maintaining the same level of stratification. Our techniques reduce variance compared to traditional 2D padding approaches like PBRT's (0,2) and Stratified samplers, and provide quality nearly equal to state-of-the-art QMC samplers like Sobol and Halton while avoiding their structured artifacts as commonly seen when using a single sample set to cover an entire image. While in this work we focus on constructing finite sampling point sets, we also discuss potential avenues for extending our work to progressive sequences (more suitable for incremental rendering) in the future.
引用
收藏
页码:135 / 147
页数:13
相关论文
共 50 条
  • [1] Antithetic Sampling for Monte Carlo Differentiable Rendering
    Zhang, Cheng
    Dong, Zhao
    Doggett, Michael
    Zhao, Shuang
    ACM TRANSACTIONS ON GRAPHICS, 2021, 40 (04):
  • [2] Sampling Analysis using Correlations for Monte Carlo Rendering
    Oztireli, A. Cengiz
    Singh, Gurprit
    SA'18: SIGGRAPH ASIA 2018 COURSES, 2018,
  • [3] Double Hierarchies for Efficient Sampling in Monte Carlo Rendering
    Bus, Norbert
    Boubekeur, Tamy
    ACM SIGGRAPH 2017 TALKS, 2017,
  • [4] Recent Advances in Adaptive Sampling and Reconstruction for Monte Carlo Rendering
    Zwicker, M.
    Jarosz, W.
    Lehtinen, J.
    Moon, B.
    Ramamoorthi, R.
    Rousselle, F.
    Sen, P.
    Soler, C.
    Yoon, S. -E.
    COMPUTER GRAPHICS FORUM, 2015, 34 (02) : 667 - 681
  • [5] Sampling-Distribution-Based Evaluation for Monte Carlo Rendering
    Freude, Christian
    Sakai, Hiroyuki
    Zsolnai-Feher, Karoly
    Wimmer, Michael
    PROCEEDINGS OF THE 18TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER VISION, IMAGING AND COMPUTER GRAPHICS THEORY AND APPLICATIONS, VISIGRAPP 2023, 2023, : 119 - 130
  • [6] Adaptive Sampling for Monte-Carlo Event Imagery Rendering
    Manabe, Yuichiro
    Yatagawa, Tatsuya
    Morishima, Shigeo
    Kubo, Hiroyuki
    PROCEEDINGS OF THE SIGGRAPH 2024 POSTERS, 2024,
  • [7] Aether: An Embedded Domain Specific Sampling Language for Monte Carlo Rendering
    Anderson, Luke
    Li, Tzu-Mao
    Lehtinen, Jaakko
    Durand, Fredo
    ACM TRANSACTIONS ON GRAPHICS, 2017, 36 (04):
  • [8] A framework for developing and benchmarking sampling and denoising algorithms for Monte Carlo rendering
    Brito dos Santos, Jonas Deyson
    Sen, Pradeep
    Oliveira, Manuel M.
    VISUAL COMPUTER, 2018, 34 (6-8): : 765 - 778
  • [9] Fuzziness driven adaptive sampling for Monte Carlo global illuminated rendering
    Xu, Qing
    Sbert, Mateu
    Pan, Zhigeng
    Wang, Wei
    Xing, Lianping
    ADVANCES IN COMPUTER GRAPHICS, PROCEEDINGS, 2006, 4035 : 148 - 159
  • [10] A framework for developing and benchmarking sampling and denoising algorithms for Monte Carlo rendering
    Jonas Deyson Brito dos Santos
    Pradeep Sen
    Manuel M. Oliveira
    The Visual Computer, 2018, 34 : 765 - 778