Stratified Markov Chain Monte Carlo Light Transport
| dc.contributor.author | Gruson, Adrien | en_US |
| dc.contributor.author | West, Rex | en_US |
| dc.contributor.author | Hachisuka, Toshiya | en_US |
| dc.contributor.editor | Panozzo, Daniele and Assarsson, Ulf | en_US |
| dc.date.accessioned | 2020-05-24T12:52:26Z | |
| dc.date.available | 2020-05-24T12:52:26Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Markov chain Monte Carlo (MCMC) sampling is a powerful approach to generate samples from an arbitrary distribution. The application to light transport simulation allows us to efficiently handle complex light transport such as highly occluded scenes. Since light transport paths in MCMC methods are sampled according to the path contributions over the sampling domain covering the whole image, bright pixels receive more samples than dark pixels to represent differences in the brightness. This variation in the number of samples per pixel is a fundamental property of MCMC methods. This property often leads to uneven convergence over the image, which is a notorious and fundamental issue of any MCMC method to date. We present a novel stratification method of MCMC light transport methods. Our stratification method, for the first time, breaks the fundamental limitation that the number of samples per pixel is uncontrollable. Our method guarantees that every pixel receives a specified number of samples by running a single Markov chain per pixel. We rely on the fact that different MCMC processes should converge to the same result when the sampling domain and the integrand are the same. We thus subdivide an image into multiple overlapping tiles associated with each pixel, run an independent MCMC process in each of them, and then align all of the tiles such that overlapping regions match. This can be formulated as an optimization problem similar to the reconstruction step for gradient-domain rendering. Further, our method can exploit the coherency of integrands among neighboring pixels via coherent Markov chains and replica exchange. Images rendered with our method exhibit much more predictable convergence compared to existing MCMC methods. | en_US |
| dc.description.number | 2 | |
| dc.description.sectionheaders | Ray Tracing and Global Illumination | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 39 | |
| dc.identifier.doi | 10.1111/cgf.13935 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 351-362 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13935 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13935 | |
| 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.title | Stratified Markov Chain Monte Carlo Light Transport | en_US |