dc.contributor.author | Schüßler, Vincent | en_US |
dc.contributor.author | Hanika, Johannes | en_US |
dc.contributor.author | Jung, Alisa | en_US |
dc.contributor.author | Dachsbacher, Carsten | en_US |
dc.contributor.editor | Ghosh, Abhijeet | en_US |
dc.contributor.editor | Wei, Li-Yi | en_US |
dc.date.accessioned | 2022-07-01T15:36:39Z | |
dc.date.available | 2022-07-01T15:36:39Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | https://doi.org/10.1111/cgf.14582 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14582 | |
dc.description.abstract | Good importance sampling strategies are decisive for the quality and robustness of photorealistic image synthesis with Monte Carlo integration. Path guiding approaches use transport paths sampled by an existing base sampler to build and refine a guiding distribution. This distribution then guides subsequent paths in regions that are otherwise hard to sample. We observe that all terms in the measurement contribution function sampled during path construction depend on at most three consecutive path vertices. We thus propose to build a 9D guiding distribution over vertex triplets that adapts to the full measurement contribution with a 9D Gaussian mixture model (GMM). For incremental path sampling, we query the model for the last two vertices of a path prefix, resulting in a 3D conditional distribution with which we sample the next vertex along the path. To make this approach scalable, we partition the scene with an octree and learn a local GMM for each leaf separately. In a learning phase, we sample paths using the current guiding distribution and collect triplets of path vertices. We resample these triplets online and keep only a fixed-size subset in reservoirs. After each progression, we obtain new GMMs from triplet samples by an initial hard clustering followed by expectation maximization. Since we model 3D vertex positions, our guiding distribution naturally extends to participating media. In addition, the symmetry in the GMM allows us to query it for paths constructed by a light tracer. Therefore our method can guide both a path tracer and light tracer from a jointly learned guiding distribution. | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.rights | Attribution 4.0 International License | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | CCS Concepts: Computing methodologies --> Ray tracing | |
dc.subject | Computing methodologies | |
dc.subject | Ray tracing | |
dc.title | Path Guiding with Vertex Triplet Distributions | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Global Illumination | |
dc.description.volume | 41 | |
dc.description.number | 4 | |
dc.identifier.doi | 10.1111/cgf.14582 | |
dc.identifier.pages | 1-15 | |
dc.identifier.pages | 15 pages | |