Survey of Markov Chain Monte Carlo Methods in Light Transport Simulation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10386789" target="_blank" >RIV/00216208:11320/18:10386789 - isvavai.cz</a>

Výsledek na webu

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=TazkGh0wHd" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=TazkGh0wHd</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TVCG.2018.2880455" target="_blank" >10.1109/TVCG.2018.2880455</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Survey of Markov Chain Monte Carlo Methods in Light Transport Simulation

Popis výsledku v původním jazyce

Two decades have passed since the introduction of Markov chain Monte Carlo (MCMC) into light transport simulation by Veach and Guibas, and numerous follow-up works have been published since then. However, up until now no survey has attempted to cover the majority of these methods. The aim of this paper is therefore to offer a first comprehensive survey of MCMC algorithms for light transport simulation. The methods presented in this paper are categorized by their objectives and properties, while we point out their strengths and weaknesses. We discuss how the methods handle the main issues of MCMC and how they could be combined or improved in the near future. To make the paper suitable for readers unacquainted with MCMC methods, we include an introduction to general MCMC and its demonstration on a simple example.

Název v anglickém jazyce

Survey of Markov Chain Monte Carlo Methods in Light Transport Simulation

Popis výsledku anglicky

Two decades have passed since the introduction of Markov chain Monte Carlo (MCMC) into light transport simulation by Veach and Guibas, and numerous follow-up works have been published since then. However, up until now no survey has attempted to cover the majority of these methods. The aim of this paper is therefore to offer a first comprehensive survey of MCMC algorithms for light transport simulation. The methods presented in this paper are categorized by their objectives and properties, while we point out their strengths and weaknesses. We discuss how the methods handle the main issues of MCMC and how they could be combined or improved in the near future. To make the paper suitable for readers unacquainted with MCMC methods, we include an introduction to general MCMC and its demonstration on a simple example.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-18964S" target="_blank" >GA16-18964S: Adaptivní vzorkování a metody Markov chain Monte Carlo v simulaci transportu světla</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Transactions on Visualization and Computer Graphics

ISSN

1077-2626

e-ISSN

—

Svazek periodika

2018

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

20

Strana od-do

1-20

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85056348542