
TL;DR
This paper introduces charted Metropolis-Hastings algorithms with sampling charts to improve sampling efficiency in light transport simulation, bridging primary sample space and path space methods.
Contribution
It presents a novel family of Markov chain Monte Carlo algorithms called charted Metropolis-Hastings, specifically applied to light transport, enabling easier sampling and escape from local maxima.
Findings
New algorithms improve sampling in light transport.
Framework requires only right inverses of sampling functions.
Density estimation integrated as an independence sampler.
Abstract
In this manuscript, inspired by a simpler reformulation of primary sample space Metropolis light transport, we derive a novel family of general Markov chain Monte Carlo algorithms called charted Metropolis-Hastings, that introduces the notion of sampling charts to extend a given sampling domain and making it easier to sample the desired target distribution and escape from local maxima through coordinate changes. We further apply the novel algorithms to light transport simulation, obtaining a new type of algorithm called charted Metropolis light transport, that can be seen as a bridge between primary sample space and path space Metropolis light transport. The new algorithms require to provide only right inverses of the sampling functions, a property that we believe crucial to make them practical in the context of light transport simulation. We further propose a method to integrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
