Second-Order Approximation for Variance Reduction in Multiple Importance Sampling
| dc.contributor.author | Lu, Heqi | en_US |
| dc.contributor.author | Pacanowski, Romain | en_US |
| dc.contributor.author | Granier, Xavier | en_US |
| dc.contributor.editor | B. Levy, X. Tong, and K. Yin | en_US |
| dc.date.accessioned | 2015-02-28T16:12:18Z | |
| dc.date.available | 2015-02-28T16:12:18Z | |
| dc.date.issued | 2013 | en_US |
| dc.description.abstract | Monte Carlo Techniques are widely used in Computer Graphics to generate realistic images. Multiple Importance Sampling reduces the impact of choosing a dedicated strategy by balancing the number of samples between different strategies. However, an automatic choice of the optimal balancing remains a difficult problem. Without any scene characteristics knowledge, the default choice is to select the same number of samples from different strategies and to use them with heuristic techniques (e.g., balance, power or maximum). In this paper, we introduce a second-order approximation of variance for balance heuristic. Based on this approximation, we introduce an automatic distribution of samples for direct lighting without any prior knowledge of the scene characteristics. We demonstrate that for all our test scenes (with different types of materials, light sources and visibility complexity), our method actually reduces variance in average.We also propose an implementation with low overhead for offline and GPU applications. We hope that this approach will help developing new balancing strategies. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12220 | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Second-Order Approximation for Variance Reduction in Multiple Importance Sampling | en_US |