Generalized ART-Owen Scrambling

Ahmed, Abdalla G. M. and Wang, Cheng ORCID: https://orcid.org/0000-0003-4711-4534 (2026) Generalized ART-Owen Scrambling. In: Computer Graphics & Visual Computing (CGVC) 2026. UNSPECIFIED. ISBN 978-3-03868-319-3

[thumbnail of cgvc20261017]
Preview
PDF (cgvc20261017) - Published Version
Available under License Creative Commons Attribution.

Download (7MB) | Preview

Abstract

Owen scrambling is a widely used randomization technique for sampling distributions in quasi-Monte Carlo applications such as rendering. ART-Owen scrambling is a flexible and scalable algorithm for implementing binary Owen scrambling, leveraging the binary structure of Adaptive Regular Tiles (ART). In this formulation, scrambling data is dynamically composed over a static ART tree. Q-ART Owen scrambling extends the approach to base 4 by factoring the 4! possible permutations into affine transformations that are easier to compose over the ART tree. We further extend the model to higher power-of-2 bases using a similar factorization into two components, and discuss a few implementation alternatives.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Colour and Imaging Lab
Faculty of Science > Research Groups > Data Science and AI
Depositing User: LivePure Connector
Date Deposited: 01 Jun 2026 11:03
Last Modified: 18 Jun 2026 22:20
URI: https://ueaeprints.uea.ac.uk/id/eprint/103216
DOI: 10.2312/cgvc.20261017

Downloads

Downloads per month over past year

Actions (login required)

View Item View Item