Markov-Chain Monte Carlo Sampling of Visibility Boundaries for Differentiable Rendering
Author(s)
Xu, Peiyu; Bangaru, Sai; Li, Tzu-Mao; Zhao, Shuang
Download3680528.3687622.pdf (4.090Mb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
Physics-based differentiable rendering requires estimating boundary path integrals emerging from the shift of discontinuities (e.g., visibility boundaries). Previously, although the mathematical formulation of boundary path integrals has been established, efficient and robust estimation of these integrals has remained challenging. Specifically, state-of-the-art boundary sampling methods all rely on primary-sample-space guiding precomputed using sophisticated data structures—whose performance tends to degrade for finely tessellated geometries.
In this paper, we address this problem by introducing a new Markov-Chain-Monte-Carlo (MCMC) method. At the core of our technique is a local perturbation step capable of efficiently exploring highly fragmented primary sample spaces via specifically designed jumping rules. We compare the performance of our technique with several state-of-the-art baselines using synthetic differentiable-rendering and inverse-rendering experiments.
Description
SA Conference Papers ’24, December 03–06, 2024, Tokyo, Japan
Date issued
2024-12-03Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryPublisher
ACM|SIGGRAPH Asia 2024 Conference Papers
Citation
Xu, Peiyu, Bangaru, Sai, Li, Tzu-Mao and Zhao, Shuang. 2024. "Markov-Chain Monte Carlo Sampling of Visibility Boundaries for Differentiable Rendering."
Version: Final published version
ISBN
979-8-4007-1131-2
Collections
The following license files are associated with this item: