Javascript must be enabled to continue!
Langevin monte carlo rendering with gradient-based adaptation
View through CrossRef
We introduce a suite of Langevin Monte Carlo algorithms for efficient photorealistic rendering of scenes with complex light transport effects, such as caustics, interreflections, and occlusions. Our algorithms operate in primary sample space, and use the Metropolis-adjusted Langevin algorithm (MALA) to generate new samples. Drawing inspiration from state-of-the-art stochastic gradient descent procedures, we combine MALA with adaptive preconditioning and momentum schemes that re-use previously-computed first-order gradients, either in an online or in a cache-driven fashion. This combination allows MALA to adapt to the local geometry of the primary sample space, without the computational overhead associated with previous Hessian-based adaptation algorithms. We use the theory of controlled Markov chain Monte Carlo to ensure that these combinations remain ergodic, and are therefore suitable for unbiased Monte Carlo rendering. Through extensive experiments, we show that our algorithms, MALA with online and cache-driven adaptation, can successfully handle complex light transport in a large variety of scenes, leading to improved performance (on average more than 3× variance reduction at equal time, and 7× for motion blur) compared to state-of-the-art Markov chain Monte Carlo rendering algorithms.
Association for Computing Machinery (ACM)
Title: Langevin monte carlo rendering with gradient-based adaptation
Description:
We introduce a suite of Langevin Monte Carlo algorithms for efficient photorealistic rendering of scenes with complex light transport effects, such as caustics, interreflections, and occlusions.
Our algorithms operate in primary sample space, and use the Metropolis-adjusted Langevin algorithm (MALA) to generate new samples.
Drawing inspiration from state-of-the-art stochastic gradient descent procedures, we combine MALA with adaptive preconditioning and momentum schemes that re-use previously-computed first-order gradients, either in an online or in a cache-driven fashion.
This combination allows MALA to adapt to the local geometry of the primary sample space, without the computational overhead associated with previous Hessian-based adaptation algorithms.
We use the theory of controlled Markov chain Monte Carlo to ensure that these combinations remain ergodic, and are therefore suitable for unbiased Monte Carlo rendering.
Through extensive experiments, we show that our algorithms, MALA with online and cache-driven adaptation, can successfully handle complex light transport in a large variety of scenes, leading to improved performance (on average more than 3× variance reduction at equal time, and 7× for motion blur) compared to state-of-the-art Markov chain Monte Carlo rendering algorithms.
Related Results
Adaptive Planning for Resilient Coastal Waterfronts
Adaptive Planning for Resilient Coastal Waterfronts
Many delta and coastal cities worldwide face increasing flood risk due to changing climate conditions and sea level rise. The question is how to develop measures and strategies for...
Sampling with the Langevin Monte-Carlo
Sampling with the Langevin Monte-Carlo
L’échantillonnage avec Langevin Monte-Carlo
L’échantillonnage des lois aléatoires est un problème de taille en statistique et en machine learning. Les approches gén...
The Langevin and generalized Langevin equations
The Langevin and generalized Langevin equations
Abstract
In Chapter 15, stochastic equations of motion, specifically the Langevin and generalized Langevin equations, are discussed as a means of generating classica...
Monte Carlo methods: barrier option pricing with stable Greeks and multilevel Monte Carlo learning
Monte Carlo methods: barrier option pricing with stable Greeks and multilevel Monte Carlo learning
For discretely observed barrier options, there exists no closed solution under the Black-Scholes model. Thus, it is often helpful to use Monte Carlo simulations, which are easily a...
Research on Multi-Group Monte Carlo Calculations Based on Group Constants Generated by RMC
Research on Multi-Group Monte Carlo Calculations Based on Group Constants Generated by RMC
Abstract
Nowadays, deterministic two-step or Monte Carlo methods are commonly used in core physics calculations. However, with the development of reactor core design, tradi...
Successful coastal adaptation projects? The role of multi-lateral climate funding.
Successful coastal adaptation projects? The role of multi-lateral climate funding.
<p><strong>This thesis investigates the evaluation of climate change adaptation success of projects in coastal zones of developing countries, specifically focusing on t...
Evaluating View Factors Using a Hybrid Monte-Carlo Method
Evaluating View Factors Using a Hybrid Monte-Carlo Method
AbstractThis paper demonstrates that the well-known method for calculating view factors, the Monte Carlo method, combined with ray tracing is not necessarily the most efficient str...
Automation of the Monte Carlo simulation of medical linear accelerators
Automation of the Monte Carlo simulation of medical linear accelerators
The main result of this thesis is a software system, called PRIMO, which simulates clinical linear accelerators and the subsequent dose distributions using the Monte Carlo method. ...

