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 条
  • [11] Monte Carlo volume rendering
    Cséfalvi, B
    Szirmay-Kalos, L
    IEEE VISUALIZATION 2003, PROCEEDINGS, 2003, : 449 - 456
  • [12] Examining the Distribution of Sampling Point Sets on Sphere for Monte Carlo Image Rendering
    Penzov, A. A.
    Dimov, I. T.
    Mitev, N. M.
    Sirakova, G. I.
    Szirmay-Kalos, L.
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, 2010, 1281 : 2103 - +
  • [14] Concepts in Monte Carlo sampling
    Tartero, Gabriele
    Krauth, Werner
    AMERICAN JOURNAL OF PHYSICS, 2024, 92 (01) : 65 - 77
  • [15] Analysis of Sample Correlations for Monte Carlo Rendering
    Singh, Gurprit
    Oztireli, Cengiz
    Ahmed, Abdalla G. M.
    Coeurjolly, David
    Subr, Kartic
    Deussen, Oliver
    Ostromoukhov, Victor
    Ramamoorthi, Ravi
    Jarosz, Wojciech
    COMPUTER GRAPHICS FORUM, 2019, 38 (02) : 473 - 491
  • [16] Efficient Monte Carlo rendering with realistic lenses
    Hanika, Johannes
    Dachsbacher, Carsten
    COMPUTER GRAPHICS FORUM, 2014, 33 (02) : 323 - 332
  • [17] Perceptual Error Optimization for Monte Carlo Rendering
    Chizhov, Vassillen
    Georgiev, Iliyan
    Myszkowski, Karol
    Singh, Gurprit
    ACM TRANSACTIONS ON GRAPHICS, 2022, 41 (03):
  • [18] Bayesian Collaborative Denoising for Monte Carlo Rendering
    Boughida, Malik
    Boubekeur, Tamy
    COMPUTER GRAPHICS FORUM, 2017, 36 (04) : 137 - 153
  • [19] Unifying Orthogonal Monte Carlo Methods
    Choromanski, Krzysztof
    Rowland, Mark
    Chen, Wenyu
    Weller, Adrian
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [20] Monte Carlo Sampling with Hierarchical Move Sets: POSH Monte Carlo
    Nilmeier, Jerome
    Jacobson, Matthew P.
    JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 2009, 5 (08) : 1968 - 1984