arrow
返回

Fusing State Spaces for Markov Chain Monte Carlo Rendering

delete2017-07-20
delete16
PRE
AI
A
Anton Kaplanyan
J
Johannes Hanika
C
Carsten Dachsbacher
T
Toshiya Hachisuka
DOI:10.1145/3072959.3073691delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Rendering algorithms using Markov chain Monte Carlo (MCMC) currently build upon two different state spaces. One of them is the path space, where the algorithms operate on the vertices of actual transport paths. The other state space is the primary sample space, where the algorithms operate on sequences of numbers used for generating transport paths. While the two state spaces are related by the sampling procedure of transport paths, all existing MCMC rendering algorithms are designed to work within only one of the state spaces. We propose a first framework which provides a comprehensive connection between the path space and the primary sample space. Using this framework, we can use mutation strategies designed for one space with mutation strategies in the respective other space. As a practical example, we take a combination of manifold exploration and multiplexed Metropolis light transport using our framework. Our results show that the simultaneous use of the two state spaces improves the robustness of MCMC rendering. By combining efficient local exploration in the path space with global jumps in primary sample space, our method achieves more uniform convergence as compared to using only one space.
Keyword:
global illumination
Markov chain Monte Carlo
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Graphics 封面图
ACM Transactions on Graphics
IF:
9.5
论文数:
4.7K
被引数:
3.6W

机构

U
University of Tokyo
学者数:
7.1W
论文数: 6.5W
被引数: 2.2K
N
nvidia corporation
学者数:
767
论文数: 439
被引数: 1
H
Helmholtz Association
学者数:
13.2W
论文数: 10.7W
被引数: 145
学者 查看更多机构