.png){kind=icon}
.png){kind=icon}
Return
Optimizing Dyadic Nets
.png){kind=icon}
PRE
AI
DOI：10.1145/3450626.3459880.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We explore the space of (0, m, 2)-nets in base 2 commonly used for sampling. We present a novel constructive algorithm that can exhaustively generate all nets - up to m-bit resolution - and thereby compute the exact number of distinct nets. We observe that the construction algorithm holds the key to defining a transformation operation that lets us transform one valid net into another one. This enables the optimization of digital nets using arbitrary objective functions. For example, we define an analytic energy function for blue noise, and use it to generate nets with high-quality blue-noise frequency power spectra. We also show that the space of (0, 2)-sequences is significantly smaller than nets with the same number of points, which drastically limits the optimizability of sequences.
Keywords:
sampling
nets
digital nets
dyadic nets
Sobol sequences
quasi-Monte Carlo
blue noise
low-discrepancy sequences
Owen's scrambling
Faure-Tezuka scrambling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W