Optimizing Path Termination for Radiance Caching Through Explicit Variance Trading

Lukas Kandlbinder, Addis Dittebrandt, Alexander Schipek and Carsten Dachsbacher

Proceedings of the ACM on Computer Graphics and Interactive Techniques Vol. 7 Issue 3 (Proceedings of High Performance Graphics) 2024

Left: Winding corridor that requires multiple indirections to reach a light source. The variance bounding scheme is applied with increasing thresholds to allow for longer paths while bounding image variance (visualized below). Right: Bunny in a Cornell box that casts a shadow to the floor. The mean squared error minimization scheme detects cache records with high bias (right visualization) and avoids direct termination.

Abstract

Radiance caching allows to amortize the cost of path tracing by sharing contributions of path suffices in a spatial data structure. This sharing generally introduces bias, but it can be traded with variance by terminating into the cache at deeper path vertices. We develop a framework to implicitly reduce bias by optimizing path termination towards a chosen variance bound. Importantly, this bound can be chosen large enough while still being amenable to denoising. This results in longer paths being sampled with unbiased path tracing as permitted by the estimator variance and variance bound. To that end, we reformulate the variance of a path tracing estimator as a quantity that can be expressed locally for a path, relying on auxiliary statistics that are shared through the radiance cache structure independently of the path prefix. This allows to perform the optimization locally during path construction, while still translating to a global bound. Our method is capable of maintaining the variance bound in complex scenes, resulting in lower bias compared to other techniques such as heuristics based on ray differentials. We additionally present first findings on directly optimizing the bias-variance tradeoff based on local bias estimates of individual cache records, although the optimization is only approximate, resulting in suboptimal termination decisions.

Downloads

Bibtex

@article {2024_variance_trading,
    title = {{Optimizing Path Termination for Radiance Caching Through Explicit Variance Trading}},
    author = {Kandlbinder, Lukas and Dittebrandt, Addis and Schipek, Alexander and Dachsbacher, Carsten},
    journal = {Proceedings of the ACM on Computer Graphics and Interactive Techniques},
    year = {2024},
    volume = 7,
    number = 3,  
    DOI = {10.1145/3675381}
}