TY - JOUR
T1 - Screen-space blue-noise diffusion of monte carlo sampling error via hierarchical ordering of pixels
AU - Ahmed, Abdalla G. M.
AU - Wonka, Peter
N1 - KAUST Repository Item: Exported on 2020-12-08
Acknowledgements: Thanks to the anonymous reviewers for the valuable comments. We credit reviewer #1 for pointing out the advantage of arithmetic
hashing for GPU implementation. Thanks to the scientific editing team at KAUST for proofreading the paper and to Mohanad Ahmed
for his insightful discussions.
PY - 2020/11/26
Y1 - 2020/11/26
N2 - We present a novel technique for diffusing Monte Carlo sampling error as a blue noise in screen space. We show that automatic diffusion of sampling error can be achieved by ordering the pixels in a way that preserves locality, such as Morton's Z-ordering, and assigning the samples to the pixels from successive sub-sequences of a single low-discrepancy sequence, thus securing well-distributed samples for each pixel, local neighborhoods, and the whole image. We further show that a blue-noise distribution of the error is attainable by scrambling the Z-ordering to induce isotropy. We present an efficient technique to implement this hierarchical scrambling by defining a context-free grammar that describes infinite self-similar lookup trees. Our concept is scalable to arbitrary image resolutions, sample dimensions, and sample count, and supports progressive and adaptive sampling.
AB - We present a novel technique for diffusing Monte Carlo sampling error as a blue noise in screen space. We show that automatic diffusion of sampling error can be achieved by ordering the pixels in a way that preserves locality, such as Morton's Z-ordering, and assigning the samples to the pixels from successive sub-sequences of a single low-discrepancy sequence, thus securing well-distributed samples for each pixel, local neighborhoods, and the whole image. We further show that a blue-noise distribution of the error is attainable by scrambling the Z-ordering to induce isotropy. We present an efficient technique to implement this hierarchical scrambling by defining a context-free grammar that describes infinite self-similar lookup trees. Our concept is scalable to arbitrary image resolutions, sample dimensions, and sample count, and supports progressive and adaptive sampling.
UR - http://hdl.handle.net/10754/666257
UR - https://dl.acm.org/doi/10.1145/3414685.3417881
U2 - 10.1145/3414685.3417881
DO - 10.1145/3414685.3417881
M3 - Article
SN - 0730-0301
VL - 39
SP - 1
EP - 15
JO - ACM Transactions on Graphics
JF - ACM Transactions on Graphics
IS - 6
ER -