Resampling-aware Weighting Functions for Bidirectional Path Tracing Using Multiple Light Sub-Paths

Bidirectional path tracing (BPT) with multiple importance sampling (MIS) is a popular technique for rendering realistic images. Recently, it has been shown that BPT can be improved by preparing multiple light sub-paths and by resampling a small number of light sub-paths from them to generate full paths with large contribution. Traditionally, for MIS weights, the balance heuristic has widely been used to minimize the upper bound of variance, where each full path is weighted in proportion to the probability of the path. Although the probability of the path can change due to the resampling process, the weighting functions used in the previous methods remain unaffected by the change in probability, resulting in less efficiency. To address this problem, we propose new weighting functions for BPT with multiple light sub-paths. Our main contribution is a precise formulation of the variance and the derivation of the weighting functions that can appropriately treat the change in probability. We demonstrate that our weighting functions significantly improve the image quality. We will release a simple version of our implementation as open source to ensure reproducibility.

[1]  K. Bala,et al.  Lightcuts: a scalable approach to illumination , 2005, SIGGRAPH 2005.

[2]  Parris K. Egbert,et al.  Importance resampling for global illumination , 2005, EGSR '05.

[3]  Philipp Slusallek,et al.  Optimal multiple importance sampling , 2019, ACM Trans. Graph..

[4]  Philipp Slusallek,et al.  Progressive Light Transport Simulation on the GPU , 2014, ACM Trans. Graph..

[5]  Philipp Slusallek,et al.  Light transport simulation with vertex connection and merging , 2012, ACM Trans. Graph..

[6]  Philipp Slusallek,et al.  Importance Caching for Complex Illumination , 2012, Comput. Graph. Forum.

[7]  H. Jensen,et al.  Progressive photon mapping , 2008, SIGGRAPH 2008.

[8]  Yves D. Willems,et al.  Bi-directional path tracing , 1993 .

[9]  Alejandro Conty Estevez,et al.  Importance sampling of many lights with adaptive tree splitting , 2017, SIGGRAPH Talks.

[10]  Kavita Bala,et al.  Matrix row-column sampling for the many-light problem , 2007, ACM Trans. Graph..

[11]  Jacopo Pantaleoni,et al.  A path space extension for robust light transport simulation , 2012, ACM Trans. Graph..

[12]  Adam Arbree,et al.  Multidimensional lightcuts , 2006, ACM Trans. Graph..

[13]  Leonidas J. Guibas,et al.  Bidirectional Estimators for Light Transport , 1995 .

[14]  Petr Vévoda,et al.  Bayesian online regression for adaptive direct illumination sampling , 2018, ACM Trans. Graph..

[15]  Philipp Slusallek,et al.  Variance-aware multiple importance sampling , 2019, ACM Trans. Graph..

[16]  VorbaJiří,et al.  Product Importance Sampling for Light Transport Path Guiding , 2016 .

[17]  SlusallekPhilipp,et al.  Variance-aware multiple importance sampling , 2019 .

[18]  Leonidas J. Guibas,et al.  Optimally combining sampling techniques for Monte Carlo rendering , 1995, SIGGRAPH.

[19]  Alexander Keller,et al.  Instant radiosity , 1997, SIGGRAPH.

[20]  Hendrik P. A. Lensch,et al.  Product Importance Sampling for Light Transport Path Guiding , 2016, Comput. Graph. Forum.

[21]  DachsbacherCarsten,et al.  Scalable Realistic Rendering with Many-Light Methods , 2014 .

[22]  Adam Arbree,et al.  To appear in the ACM SIGGRAPH conference proceedings Lightcuts: A Scalable Approach to Illumination , 2022 .

[23]  Markus H. Gross,et al.  Practical Path Guiding for Efficient Light‐Transport Simulation , 2017, Comput. Graph. Forum.

[24]  Tobias Ritschel,et al.  On-line learning of parametric mixture models for light transport simulation , 2014, ACM Trans. Graph..

[25]  Leonidas J. Guibas,et al.  Robust Monte Carlo methods for light transport simulation , 1997 .

[26]  Adam Arbree,et al.  Scalable Realistic Rendering with Many‐Light Methods , 2014, Eurographics.

[27]  Frédo Durand,et al.  Eurographics Symposium on Rendering 2015 Probabilistic Connections for Bidirectional Path Tracing Bidirectional Path Tracing Probabilistic Connections for Bidirectional Path Tracing , 2022 .

[28]  Pramook Khungurn,et al.  Bidirectional lightcuts , 2012, ACM Trans. Graph..

[29]  T. Kollig,et al.  Illumination in the Presence of Weak Singularities , 2006 .