Markov-Chain Monte Carlo Sampling of Visibility Boundaries for Differentiable Rendering
Peiyu Xu1, Sai Bangaru2, 3, Tzu-Mao Li4, and Shuang Zhao1
1University of California, Irvine          2MIT CSAIL          3NVIDIA          4University of California, San Diego
ACM SIGGRAPH Asia 2024 (Conference Track Full Paper)
teaser
Abstract

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.

Downloads
  • Paper: pdf (4.2 MB)
  • Source code: coming soon.
Bibtex citation
@inproceedings{Xu:2024:PSDR-LMC,
  title={Markov-Chain Monte Carlo Sampling of Visibility Boundaries for Differentiable Rendering},
  author={Xu, P. and Bangaru, S. and Li, T.-M. and Zhao, S.},
  booktitle = {ACM SIGGRAPH Asia 2024 Conference Proceedings},
  year = {2024},
}
Acknowledgments

We thank the anonymous reviewers for their comments and suggestions. This project was partially funded by NSF grant 2105806.