Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
55 tokens/sec
2000 character limit reached

Guiding-Based Importance Sampling for Walk on Stars (2410.18944v3)

Published 24 Oct 2024 in cs.GR

Abstract: Walk on stars (WoSt) has shown its power in being applied to Monte Carlo methods for solving partial differential equations, but the sampling techniques in WoSt are not satisfactory, leading to high variance. We propose a guiding-based importance sampling method to reduce the variance of WoSt. Drawing inspiration from path guiding in rendering, we approximate the directional distribution of the recursive term of WoSt using online-learned parametric mixture distributions, decoded by a lightweight neural field. This adaptive approach enables importance sampling the recursive term, which lacks shape information before computation. We introduce a reflection technique to represent guiding distributions at Neumann boundaries and incorporate multiple importance sampling with learnable selection probabilities to further reduce variance. We also present a practical GPU implementation of our method. Experiments show that our method effectively reduces variance compared to the original WoSt, given the same time or the same sample budget. Code and data for this paper are at https://github.com/tyanyuy3125/elaina.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Coupling Conduction, Convection and Radiative Transfer in a Single Path-Space: Application to Infrared Rendering. ACM Trans. Graph. 42, 4, Article 79 (July 2023), 20 pages. https://doi.org/10.1145/3592121
  2. Fernando de Goes and Mathieu Desbrun. 2024. Stochastic Computation of Barycentric Coordinates. ACM Trans. Graph. 43, 4, Article 42 (July 2024), 13 pages. https://doi.org/10.1145/3658131
  3. Heat Simulation on Meshless Crafted-Made Shapes. In Proceedings of the 16th ACM SIGGRAPH Conference on Motion, Interaction and Games (Rennes, France) (MIG ’23). Association for Computing Machinery, New York, NY, USA, Article 9, 7 pages. https://doi.org/10.1145/3623264.3624457
  4. Neural Parametric Mixtures for Path Guiding. In ACM SIGGRAPH 2023 Conference Proceedings (Los Angeles, CA, USA) (SIGGRAPH ’23). Association for Computing Machinery, New York, NY, USA, Article 29, 10 pages. https://doi.org/10.1145/3588432.3591533
  5. S. Ermakov and A. Sipin. 2009. The “walk in hemispheres” process and its applications to solving boundary value problems. Vestnik St. Petersburg University: Mathematics 42 (09 2009), 155–163. https://doi.org/10.3103/S1063454109030029
  6. Manifold Path Guiding for Importance Sampling Specular Chains. ACM Trans. Graph. 42, 6, Article 257 (Dec. 2023), 14 pages. https://doi.org/10.1145/3618360
  7. Conditional Mixture Path Guiding for Differentiable Rendering. ACM Trans. Graph. 43, 4, Article 48 (July 2024), 11 pages. https://doi.org/10.1145/3658133
  8. Vlastimil Havran and Mateu Sbert. 2014. Optimal combination of techniques in multiple importance sampling. In Proceedings of the 13th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry (Shenzhen, China) (VRCAI ’14). Association for Computing Machinery, New York, NY, USA, 141–150. https://doi.org/10.1145/2670473.2670496
  9. Volume Path Guiding Based on Zero-Variance Random Walk Theory. ACM Trans. Graph. 38, 3, Article 25 (June 2019), 19 pages. https://doi.org/10.1145/3230635
  10. Heinrich Hey and Werner Purgathofer. 2002. Importance sampling with hemispherical particle footprints. In Proceedings of the 18th Spring Conference on Computer Graphics (Budmerice, Slovakia) (SCCG ’02). Association for Computing Machinery, New York, NY, USA, 107–114. https://doi.org/10.1145/584458.584476
  11. Online Neural Path Guiding with Normalized Anisotropic Spherical Gaussians. ACM Trans. Graph. 43, 3, Article 26 (April 2024), 18 pages. https://doi.org/10.1145/3649310
  12. Adaptive Incident Radiance Field Sampling and Reconstruction Using Deep Reinforcement Learning. ACM Trans. Graph. 39, 1, Article 6 (Jan. 2020), 17 pages. https://doi.org/10.1145/3368313
  13. Neural Monte Carlo Fluid Simulation. In ACM SIGGRAPH 2024 Conference Papers (Denver, CO, USA) (SIGGRAPH ’24). Association for Computing Machinery, New York, NY, USA, Article 9, 11 pages. https://doi.org/10.1145/3641519.3657438
  14. Henrik Wann Jensen. 1995. Importance Driven Path Tracing using the Photon Map. In Rendering Techniques. https://api.semanticscholar.org/CorpusID:9344202
  15. A machine learning approach for filtering Monte Carlo noise. ACM Trans. Graph. 34, 4, Article 122 (July 2015), 12 pages. https://doi.org/10.1145/2766977
  16. Radiance caching for efficient global illumination computation. IEEE Transactions on Visualization and Computer Graphics 11, 5 (2005), 550–561. https://doi.org/10.1109/TVCG.2005.83
  17. Eric P. Lafortune and Yves D. Willems. 1993. Bi-directional path tracing. In Proceedings of Third International Conference on Computational Graphics and Visualization Techniques (Compugraphics ’93). Alvor, Portugal, 145–153.
  18. Eric P. Lafortune and Yves D. Willems. 1995. A 5D Tree to Reduce the Variance of Monte Carlo Ray Tracing. In Rendering Techniques. https://api.semanticscholar.org/CorpusID:7506343
  19. Megakernels considered harmful: wavefront path tracing on GPUs. In Proceedings of the 5th High-Performance Graphics Conference (Anaheim, California) (HPG ’13). Association for Computing Machinery, New York, NY, USA, 137–143. https://doi.org/10.1145/2492045.2492060
  20. Unbiased Caustics Rendering Guided by Representative Specular Paths. In Proceedings of SIGGRAPH Asia 2022.
  21. Neural Caches for Monte Carlo Partial Differential Equation Solvers. In SIGGRAPH Asia 2023 Conference Papers (Sydney, NSW, Australia) (SA ’23). Association for Computing Machinery, New York, NY, USA, Article 34, 10 pages. https://doi.org/10.1145/3610548.3618141
  22. Boundary Value Caching for Walk on Spheres. ACM Trans. Graph. 42, 4 (2023).
  23. Differential Walk on Spheres. ACM Trans. Graph. 43, 6 (2024).
  24. Walkin’ Robin: Walk on Stars with Robin Boundary Conditions. ACM Trans. Graph. 43, 4 (2024).
  25. Rafael I. Cabral Muchacho and Florian T. Pokorny. 2024. Walk on Spheres for PDE-based Path Planning. arXiv:2406.01713 [cs.RO] https://arxiv.org/abs/2406.01713
  26. Mervin E. Muller. 1956. Some Continuous Monte Carlo Methods for the Dirichlet Problem. The Annals of Mathematical Statistics 27, 3 (1956), 569 – 589. https://doi.org/10.1214/aoms/1177728169
  27. Thomas Müller. 2021. tiny-cuda-nn. https://github.com/NVlabs/tiny-cuda-nn
  28. Practical Path Guiding for Efficient Light-Transport Simulation. Computer Graphics Forum (Proceedings of EGSR) 36, 4 (June 2017), 91–100. https://doi.org/10.1111/cgf.13227
  29. Neural Importance Sampling. ACM Trans. Graph. 38, 5, Article 145 (Oct. 2019), 19 pages. https://doi.org/10.1145/3341156
  30. Real-time neural radiance caching for path tracing. ACM Trans. Graph. 40, 4, Article 36 (July 2021), 16 pages. https://doi.org/10.1145/3450626.3459812
  31. Kelvin transformations for simulations on infinite domains. ACM Transactions on Graphics (TOG) 40, 4 (2021), 97:1–97:15.
  32. Solving Poisson Equations Using Neural Walk-on-Spheres. In Forty-first International Conference on Machine Learning.
  33. Art Owen and Yi Zhou. 2000. Safe and Effective Importance Sampling. J. Amer. Statist. Assoc. 95, 449 (2000), 135–143. http://www.jstor.org/stable/2669533
  34. A bidirectional formulation for Walk on Spheres. Computer Graphics Forum (Proceedings of EGSR) 41, 4 (July 2022). https://doi.org/10/jgzr
  35. Variance-aware path guiding. ACM Trans. Graph. 39, 4, Article 151 (Aug. 2020), 12 pages. https://doi.org/10.1145/3386569.3392441
  36. Selective guided sampling with complete light transport paths. ACM Trans. Graph. 37, 6, Article 223 (Dec. 2018), 14 pages. https://doi.org/10.1145/3272127.3275030
  37. A Monte Carlo Method for Fluid Simulation. ACM Transactions on Graphics 41, 6 (Dec. 2022). https://doi.org/10.1145/3550454.3555450
  38. Rohan Sawhney. 2021. FCPW: Fastest Closest Points in the West.
  39. Rohan Sawhney and Keenan Crane. 2020. Monte Carlo Geometry Processing: A Grid-Free Approach to PDE-Based Methods on Volumetric Domains. ACM Trans. Graph. 39, 4 (2020).
  40. Walk on Stars: A Grid-Free Monte Carlo Method for PDEs with Neumann Boundary Conditions. ACM Trans. Graph. 42, 4 (2023).
  41. Grid-Free Monte Carlo for PDEs with Spatially Varying Coefficients. ACM Trans. Graph. XX, X (2022).
  42. Variance Analysis of Multi-sample and One-sample Multiple Importance Sampling. Computer Graphics Forum (2016). https://doi.org/10.1111/cgf.13042
  43. Nikolai A. Simonov. 2008. Walk-on-Spheres Algorithm for Solving Boundary-Value Problems with Continuity Flux Conditions. https://api.semanticscholar.org/CorpusID:117970575
  44. Velocity-Based Monte Carlo Fluids. In ACM SIGGRAPH 2024 Conference Papers (Denver, CO, USA) (SIGGRAPH ’24). Association for Computing Machinery, New York, NY, USA, Article 8, 11 pages. https://doi.org/10.1145/3641519.3657405
  45. A Practical Walk-on-Boundary Method for Boundary Value Problems. ACM Trans. Graph. 42, 4, Article 81 (jul 2023), 16 pages. https://doi.org/10.1145/3592109
  46. Projected Walk on Spheres: A Monte Carlo Closest Point Method for Surface PDEs. In ACM SIGGRAPH Asia 2024 Conference Papers (Tokyo, Japan) (SIGGRAPH Asia ’24). Association for Computing Machinery, New York, NY, USA, 10 pages. https://doi.org/10.1145/3680528.3687599
  47. Eric Veach and Leonidas Guibas. 1995a. Bidirectional Estimators for Light Transport. In Photorealistic Rendering Techniques, Georgios Sakas, Stefan Müller, and Peter Shirley (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 145–167.
  48. Eric Veach and Leonidas J. Guibas. 1995b. Optimally combining sampling techniques for Monte Carlo rendering. In Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’95). Association for Computing Machinery, New York, NY, USA, 419–428. https://doi.org/10.1145/218380.218498
  49. Eric Veach and Leonidas J. Guibas. 1997. Metropolis light transport. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’97). ACM Press/Addison-Wesley Publishing Co., USA, 65–76. https://doi.org/10.1145/258734.258775
  50. Path guiding in production. In ACM SIGGRAPH 2019 Courses (Los Angeles, California) (SIGGRAPH ’19). Association for Computing Machinery, New York, NY, USA, Article 18, 77 pages. https://doi.org/10.1145/3305366.3328091
  51. On-line learning of parametric mixture models for light transport simulation. ACM Trans. Graph. 33, 4, Article 101 (July 2014), 11 pages. https://doi.org/10.1145/2601097.2601203
  52. Solving Inverse PDE Problems using Monte Carlo Estimators. Transactions on Graphics (Proceedings of SIGGRAPH Asia) 43 (Dec. 2024). https://doi.org/10.1145/3687990
  53. A Differential Monte Carlo Solver For the Poisson Equation. In ACM SIGGRAPH 2024 Conference Proceedings.
  54. Hierarchical neural reconstruction for path guiding using hybrid path and photon samples. ACM Trans. Graph. 40, 4, Article 35 (July 2021), 16 pages. https://doi.org/10.1145/3450626.3459810

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.