Path Space Partitioning and Guided Image Sampling for MCMC
Thomas Bashford-Rogers, Luis Paulo Santos

TL;DR
This paper introduces a novel method for rendering that partitions path space and uses guided proposals within MCMC to improve efficiency and image quality in light path integration.
Contribution
It presents a new approach combining path space partitioning with guided MCMC sampling to enhance rendering efficiency and image quality.
Findings
Improved image quality over existing MCMC methods at the same sample count.
Partitioning path space leads to more efficient light integration.
Guided proposals in image space enhance sampling effectiveness.
Abstract
Rendering algorithms typically integrate light paths over path space. However, integrating over this one unified space is not necessarily the most efficient approach, and we show that partitioning path space and integrating each of these partitioned spaces with a separate estimator can have advantages. We propose an approach for partitioning path space based on analyzing paths from a standard Monte Carlo estimator and integrating these partitioned path spaces using a Markov Chain Monte Carlo (MCMC) estimator. This also means that integration happens within a sparser subset of path space, so we propose the use of guided proposal distributions in image space to improve efficiency. We show that our method improves image quality over other MCMC integration approaches at the same number of samples.
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.
