“Real-time Path Guiding Using Bounding Voxel Sampling”
Conference:
Type(s):
Title:
- Real-time Path Guiding Using Bounding Voxel Sampling
Presenter(s)/Author(s):
Abstract:
We propose a real-time path guiding method, Voxel Path Guiding (VXPG), that significantly improves fitting efficiency under limited sampling budget. We show that our method can outperform other real-time path guiding and virtual point light methods, particularly in handling complex dynamic scenes.
References:
[1]
Radhakrishna Achanta, Appu Shaji, Kevin Smith, Aurelien Lucchi, Pascal Fua, and Sabine Susstrunk. 2012. SLIC Superpixels Compared to State-of-the-Art Superpixel Methods. IEEE Trans. Pattern Anal. Mach. Intell. 34, 11 (2012), 2274–2282.
[2]
Pontus Andersson, Jim Nilsson, Tomas Akenine-M?ller, Magnus Oskarsson, Kalle ?str?m, and Mark D. Fairchild. 2020. FLIP: A Difference Evaluator for Alternating Images. Proc. ACM Comput. Graph. Interact. Tech. 3, 2, Article 15 (2020), 23 pages.
[3]
James Arvo. 1995. Stratified Sampling of Spherical Triangles. In SIGGRAPH. 437–438.
[4]
Thomas Bashford-Rogers, Kurt Debattista, and Alan Chalmers. 2012. A significance cache for accelerating global illumination. Comput. Graph. Forum 31, 6 (2012), 1837–1851.
[5]
Philippe Bekaert, Mateu Sbert, and John H Halton. 2002. Accelerating Path Tracing by Re-Using Paths. Rendering Techniques (Proc. EGWR) 2 (2002), 125–134.
[6]
Nikolaus Binder, Sascha Fricke, and Alexander Keller. 2021. Massively Parallel Path Space Filtering. arXiv:1902.05942 [cs.GR]
[7]
Benedikt Bitterli. 2016. Rendering resources. https://benedikt-bitterli.me/resources/.
[8]
Benedikt Bitterli, Chris Wyman, Matt Pharr, Peter Shirley, Aaron Lefohn, and Wojciech Jarosz. 2020. Spatiotemporal reservoir resampling for real-time ray tracing with dynamic direct lighting. ACM Trans. Graph. (Proc. SIGGRAPH) 39, 4 (2020), 148.
[9]
Cyril Crassin and Simon Green. 2012. Octree-based sparse voxelization using the GPU hardware rasterizer. OpenGL Insights (2012), 303–318.
[10]
Cyril Crassin, Fabrice Neyret, Miguel Sainz, Simon Green, and Elmar Eisemann. 2011. Interactive Indirect Illumination Using Voxel Cone Tracing. Computer Graphics Forum (Pacific Graphics) 30, 7 (2011).
[11]
Carsten Dachsbacher, Jaroslav K?iv?nek, Milo? Ha?an, Adam Arbree, Bruce Walter, and Jan Nov?k. 2014. Scalable Realistic Rendering with Many-Light Methods. Comput. Graph. Forum (Proc. Eurographics STAR) 33, 1 (2014), 88–104.
[12]
Tom?? Davidovi?, Jaroslav K?iv?nek, Milo? Ha?an, Philipp Slusallek, and Kavita Bala. 2010. Combining global and local virtual lights for detailed glossy illumination. ACM Trans. Graph. (Proc. SIGGRAPH Asia) 29, 6 (2010), 1–8.
[13]
Mikhail Derevyannykh. 2022. Real-Time Path-Guiding Based on Parametric Mixture Models. In Eurographics Short Papers.
[14]
Addis Dittebrandt, Johannes Hanika, and Carsten Dachsbacher. 2020. Temporal Sample Reuse for Next Event Estimation and Path Guiding for Real-Time Path Tracing. In Eurographics Symposium on Rendering – DL-only Track.
[15]
Addis Dittebrandt, Vincent Sch?? ler, Johannes Hanika, Sebastian Herholz, and Carsten Dachsbacher. 2023. Markov Chain Mixture Models for Real-Time Direct Illumination. Comput. Graph. Forum (Proc. EGSR) (2023).
[16]
Ana Dodik, Marios Papas, Cengiz ?ztireli, and Thomas M?ller. 2022. Path Guiding Using Spatio-Directional Mixture Models. Comput. Graph. Forum 41, 1 (2022), 172–189.
[17]
Honghao Dong, Guoping Wang, and Sheng Li. 2023. Neural Parametric Mixtures for Path Guiding. In SIGGRAPH Conference Proceedings (Los Angeles, CA, USA) (SIGGRAPH ’23). Article 29, 10 pages.
[18]
Manuel N. Gamito. 2016. Solid Angle Sampling of Disk and Cylinder Lights. Comput. Graph. Forum 35, 4 (jul 2016), 25–36.
[19]
Michael Garland and Paul S. Heckbert. 1997. Surface simplification using quadric error metrics. In SIGGRAPH. 209–216.
[20]
Milo? Ha?an, Fabio Pellacini, and Kavita Bala. 2007. Matrix row-column sampling for the many-light problem. ACM Trans. Graph. (Proc. SIGGRAPH) 26, 3 (2007), 26.
[21]
Milo? Ha?an, Jaroslav K?iv?nek, Bruce Walter, and Kavita Bala. 2009. Virtual Spherical Lights for Many-Light Rendering of Glossy Scenes. ACM Trans. Graph. (Proc. SIGGRAPH Asia), Article 143 (2009), 6 pages.
[22]
Henrik Wann Jensen. 1995. Importance driven path tracing using the photon map. In Rendering Techniques (Proc. EGWR). 326–335.
[23]
James T. Kajiya. 1986. The Rendering Equation. Comput. Graph. (Proc. SIGGRAPH) 20, 4 (1986), 143–150.
[24]
Alexander Keller. 1997. Instant Radiosity. In SIGGRAPH. 49–56.
[25]
Juhyeon Kim and Young Min Kim. 2021. Fast and Lightweight Path Guiding Algorithm on GPU. In Pacific Graphics Short Papers, Posters, and Work-in-Progress Papers, Sung-Hee Lee, Stefanie Zollmann, Makoto Okabe, and Burkhard W?nsche (Eds.).
[26]
David Kirk and James Arvo. 1991. Unbiased sampling techniques for image synthesis. Comput. Graph. (Proc. SIGGRAPH) 25, 4 (1991), 153–156.
[27]
Eric P. Lafortune and Yves D. Willems. 1995. A 5D tree to reduce the variance of Monte Carlo ray tracing. In Eurographics Workshop on Rendering. 11–20.
[28]
Samuli Laine and Tero Karras. 2011. Efficient Sparse Voxel Octrees – Analysis, Extensions, and Implementation. Technical Report. NVIDIA Technical Report NVR-2010-001.
[29]
J.H. Lambert. 1770. Beitr?ge zum Gebrauche der Mathematik und deren Anwendung. Vol. 1. Im Verlag der Buchhandlung der K?nigl. Realschule.
[30]
Tianyu Li, Wenyou Wang, Daqi Lin, and Cem Yuksel. 2022. Virtual Blue Noise Lighting. Proc. ACM Comput. Graph. Interact. Tech. (Proc. HPG) 5, 3, Article 23 (2022), 26 pages.
[31]
Daqi Lin, Markus Kettunen, Benedikt Bitterli, Jacopo Pantaleoni, Cem Yuksel, and Chris Wyman. 2022. Generalized resampled importance sampling: foundations of ReSTIR. ACM Trans. Graph. (Proc. SIGGRAPH) 41, 4 (2022), 1–23.
[32]
Daqi Lin and Cem Yuksel. 2020. Real-Time Stochastic Lightcuts. Proc. ACM Comput. Graph. Interact. Tech. (Proc. I3D) 3, 1, Article 5 (2020), 18 pages.
[33]
Yifan Liu, Kun Xu, and Ling-Qi Yan. 2019. Adaptive BRDF-Oriented Multiple Importance Sampling of Many Lights. Comput. Graph. Forum (Proc. EGSR) 38, 4 (2019), 123–133.
[34]
Pierre Moreau, Matt Pharr, and Petrik Clarberg. 2019. Dynamic Many-Light Sampling for Real-Time Ray Tracing. In High Performance Graphics (Short Papers). 21–26.
[35]
P. Moreau, M. Pharr, and P. Clarberg. 2022. Dynamic Many-Light Sampling for RealTime Ray Tracing. In High Performance Graphics. 21–26.
[36]
Thomas M?ller. 2019. “Practical Path Guiding” in Production. In ACM SIGGRAPH Courses: Path Guiding in Production, Chapter 10. 18:35–18:48.
[37]
Thomas M?ller, Markus Gross, and Jan Nov?k. 2017. Practical Path Guiding for Efficient Light-Transport Simulation. Comput. Graph. Forum (Proc. EGSR) 36, 4 (2017), 91–100.
[38]
Thomas M?ller, Brian McWilliams, Fabrice Rousselle, Markus Gross, and Jan Nov?k. 2019. Neural importance sampling. ACM Transactions on Graphics (ToG) 38, 5 (2019), 1–19.
[39]
Jiawei Ou and Fabio Pellacini. 2011. LightSlice: matrix slice sampling for the many-lights problem. ACM Trans. Graph. (Proc. SIGGRAPH Asia) 30, 6 (2011), 179:1–179:8.
[40]
Y. Ouyang, S. Liu, M. Kettunen, M. Pharr, and Jacopo Pantaleoni. 2021. ReSTIR GI: Path Resampling for Real-Time Path Tracing. Computer Graphics Forum (Proc. HPG) 40 (12 2021), 17–29.
[41]
Jacopo Pantaleoni. 2019. Importance Sampling of Many Lights with Reinforcement Lightcuts Learning. arXiv preprint arXiv:1911.10217 (2019).
[42]
Jacopo Pantaleoni. 2020. Online Path Sampling Control with Progressive Spatio-temporal Filtering. SN Comput. Sci. 1, 5 (2020), 16 pages.
[43]
Jacopo Pantaleoni and Eric Heitz. 2017. Notes on optimal approximations for importance sampling. arXiv preprint arXiv:1707.08358 (2017).
[44]
Eric Paquette, Pierre Poulin, and George Drettakis. 1998. A Light Hierarchy for Fast Rendering of Scenes with Many Lights. Comput. Graph. Forum (Proc. Eurographics) (1998), 63–74.
[45]
Christoph Peters. 2021. BRDF Importance Sampling for Polygonal Lights. ACM Trans. Graph. 40, 4, Article 140 (jul 2021), 14 pages.
[46]
Stefan Popov, Ravi Ramamoorthi, Fredo Durand, and George Drettakis. 2015. Probabilistic connections for bidirectional path tracing. In Computer Graphics Forum, Vol. 34. Wiley Online Library, 75–86.
[47]
Alexander Rath, Pascal Grittmann, Sebastian Herholz, Petr V?voda, Philipp Slusallek, and Jaroslav K?iv?nek. 2020. Variance-Aware Path Guiding. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2020) 39, 4 (July 2020), 151:1–151:12.
[48]
Alexander Rath, ?mercan Yazici, and Philipp Slusallek. 2023. Focal Path Guiding for Light Transport Simulation. In SIGGRAPH Conference Proceedings. Article 30, 10 pages.
[49]
Lukas Ruppert, Sebastian Herholz, and Hendrik P. A. Lensch. 2020. Robust Fitting of Parallax-Aware Mixtures for Path Guiding. ACM Trans. Graph. 39, 4, Article 147 (aug 2020), 15 pages.
[50]
Christoph Schied, Christoph Peters, and Carsten Dachsbacher. 2018. Gradient Estimation for Real-Time Adaptive Temporal Filtering. Proc. ACM Comput. Graph. Interact. Tech. (Proc. HPG) 1, 2, Article 24 (2018), 16 pages.
[51]
B. Segovia, J. C. Iehl, R. Mitanchey, and B. P?roche. 2006. Bidirectional Instant Radiosity. Rendering Techniques (Proc. EGSR) (2006), 389–397.
[52]
Peter Shirley and Kenneth Chiu. 1997. A Low Distortion Map Between Disk and Square. Journal of Graphics Tools 2, 3 (1997), 45–52.
[53]
Peter Shirley, Changyaw Wang, and Kurt Zimmerman. 1996. Monte Carlo Techniques for Direct Lighting Calculations. ACM Trans. Graph. 15, 1 (1996), 1–36.
[54]
Florian Simon, Johannes Hanika, and Carsten Dachsbacher. 2015. Rich-VPLs for Improving the Versatility of Many-Light Methods. Comput. Graph. Forum (Proc. Eurographics) 34, 2 (May 2015), 575–584.
[55]
Florian Simon, Johannes Hanika, Tobias Zirr, and Carsten Dachsbacher. 2017. Line Integration for Rendering Heterogeneous Emissive Volumes. Comput. Graph. Forum (Proc. EGSR) 36, 4 (July 2017), 101–110.
[56]
Fujia Su, Sheng Li, and Guoping Wang. 2022. SPCBPT: subspace-based probabilistic connections for bidirectional path tracing. ACM Trans. Graph. (Proc. SIGGRAPH) 41, 4 (2022), 1–14.
[57]
Ivan E Sutherland and Gary W Hodgman. 1974. Reentrant polygon clipping. Commun. ACM 17, 1 (1974), 32–42.
[58]
Justin F. Talbot, David Cline, and Parris Egbert. 2005. Importance Resampling for Global Illumination. Rendering Techniques (Proc. EGSR) (2005), 139–146.
[59]
Christopher C. Tanner, Christopher J. Migdal, and Michael T. Jones. 1998. The Clipmap: A Virtual Mipmap. In SIGGRAPH. 151–158.
[60]
Wolfgang Tatzgern, Benedikt Mayr, Bernhard Kerbl, and Markus Steinberger. 2020. Stochastic Substitute Trees for Real-Time Global Illumination. In Symposium on Interactive 3D Graphics and Games. Article 2, 9 pages.
[61]
Yusuke Tokuyoshi. 2015. Virtual Spherical Gaussian Lights for Real-time Glossy Indirect Illumination. Comput. Graph. Forum (Proc. PG) 34, 7 (2015), 89–98.
[62]
Carlos Ure?a, Marcos Fajardo, and Alan King. 2013. An Area-Preserving Parametrization for Spherical Rectangles. Comput. Graph. Forum (Proc. EGSR) 32, 4 (2013), 59–66.
[63]
Eric Veach. 1998. Robust Monte Carlo Methods for Light Transport Simulation. Ph. D. Dissertation. Stanford, CA, USA. Advisor(s) Guibas, Leonidas J. AAI9837162.
[64]
Eric Veach and Leonidas J. Guibas. 1995. Optimally Combining Sampling Techniques for Monte Carlo Rendering. In SIGGRAPH. 419–428.
[65]
Petr V?voda, Ivo Kondapaneni, and Jaroslav K?iv?nek. 2018. Bayesian Online Regression for Adaptive Direct Illumination Sampling. ACM Trans. Graph. (Proc. SIGGRAPH) 37, 4 (2018), 125:1–125:12.
[66]
Ji?? Vorba, Johannes Hanika, Sebastian Herholz, Thomas M?ller, Jaroslav K?iv?nek, and Alexander Keller. 2019. Path Guiding in Production. In ACM SIGGRAPH Courses. Article 18, 77 pages.
[67]
Jir? Vorba, Ondrej Karl?k, Martin Sik, Tobias Ritschel, and Jaroslav Kriv?nek. 2014. On-line learning of parametric mixture models for light transport simulation. ACM Trans. Graph. (Proc. SIGGRAPH) 33, 4 (2014), 101:1–101:11.
[68]
Bruce Walter, Sebastian Fernandez, Adam Arbree, Kavita Bala, Michael Donikian, and Donald P. Greenberg. 2005. Lightcuts: A Scalable Approach to Illumination. ACM Trans. Graph. (Proc. SIGGRAPH) 24, 3 (2005), 1098–1107.
[69]
Yu-Chen Wang, Yu-Ting Wu, Tzu-Mao Li, and Yung-Yu Chuang. 2021. Learning to Cluster for Rendering with Many Lights. ACM Trans. Graph. (Proc. SIGGRAPH Asia) 40, 6, Article 277 (2021), 10 pages.
[70]
Mike Winkelmann. 2019. Zero-Day, Open Research Content Archive (ORCA). https://developer.nvidia.com/orca/beeple-zero-day
[71]
Yu-Ting Wu and Yung-Yu Chuang. 2013. VisibilityCluster: Average directional visibility for many-light rendering. IEEE Trans. Vis. Comput. Graph. 19, 9 (2013), 1566–1578.
[72]
Cem Yuksel. 2019. Stochastic Lightcuts. In High Performance Graphics. 27–32.
[73]
Cem Yuksel. 2020. Stochastic lightcuts for sampling many lights. IEEE Trans. Vis. Comput. Graph. 27, 10 (2020), 4049–4059.
