Adjoint-Driven Russian Roulette and Splitting in Light Transport Simulation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10336441" target="_blank" >RIV/00216208:11320/16:10336441 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1145/2897824.2925912" target="_blank" >http://dx.doi.org/10.1145/2897824.2925912</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2897824.2925912" target="_blank" >10.1145/2897824.2925912</a>

Result language

angličtina

Original language name

Adjoint-Driven Russian Roulette and Splitting in Light Transport Simulation

Original language description

While Russian roulette (RR) and splitting are considered fundamental importance sampling techniques in neutron transport simulations, they have so far received relatively little attention in light transport. In computer graphics, RR and splitting are most often based solely on local reflectance properties. However, this strategy can be far from optimal in common scenes with non-uniform light distribution as it does not accurately predict the actual path contribution. In our approach, like in neutron transport, we estimate the expected contribution of a path as the product of the path weight and a pre-computed estimate of the adjoint transport solution. We use this estimate to generate so-called weight window which keeps the path contribution roughly constant through RR and splitting. As a result, paths in unimportant regions tend to be terminated early while in the more important regions they are spawned by splitting. This results in substantial variance reduction in both path tracing and photon tracing-based simulations. Furthermore, unlike the standard computer graphics RR, our approach does not interfere with importance-driven sampling of scattering directions, which results in superior convergence when such a technique is combined with our approach. We provide a justification of this behavior by relating our approach to the zero-variance random walk theory.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ACM Transactions on Graphics

ISSN

0730-0301

e-ISSN

—

Volume of the periodical

35

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

11

Pages from-to

—

UT code for WoS article

000380112400012

EID of the result in the Scopus database

2-s2.0-84980002272