Abstract
Monte-Carlo rendering algorithms have traditionally a high computational cost, because they rely on tracing up to billions of light paths through a scene to physically simulate light transport. Traditional path reusing amortizes the cost of path sampling over multiple pixels, but introduces visually unpleasant correlation artifacts and cannot handle scenes with specular light transport. We present gradient-domain path reusing, a novel unbiased Monte-Carlo rendering technique, which merges the concept of path reusing with the recently introduced idea of gradient-domain rendering. Since correlation is a key element in gradient sampling, it is a natural fit to be performed together with path reusing and we show that the typical artifacts of path reusing are significantly reduced by exploiting the gradient domain. Further, by employing the tools for shifting paths that were designed in the context of gradient-domain rendering over the last years, we can generalize path reusing to support arbitrary scenes including specular light transport. Our method is unbiased and currently the fastest converging unidirectional rendering technique outperforming conventional and gradient-domain path tracing by up to almost an order of magnitude.
- James Arvo and David Kirk. 1990. Particle Transport and Image Synthesis. In Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '90). ACM, 63--66. Google ScholarDigital Library
- Philippe Bekaert, Mateu Sbert, and John Halton. 2002. Accelerating Path Tracing by Re-using Paths. In Proceedings of the 13th Eurographics Workshop on Rendering (EGRW '02). Eurographics Association, 125--134. Google ScholarDigital Library
- Pravin Bhat, C. Lawrence Zitnick, Michael Cohen, and Brian Curless. 2010. GradientShop: A Gradient-domain Optimization Framework for Image and Video Filtering. ACM Trans. Graph. 29, 2, Article 10 (April 2010), 14 pages. Google ScholarDigital Library
- Francesc Castro, Mateu Sbert, and John H. Halton. 2008. Efficient Reuse of Paths for Random Walk Radiosity. Comput. Graph. 32, 1 (Feb. 2008), 65--81. Google ScholarDigital Library
- Robert L. Cook, Thomas Porter, and Loren Carpenter. 1984. Distributed Ray Tracing. In Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '84). ACM, 137--145. Google ScholarDigital Library
- 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. In ACM SIGGRAPH Asia 2010 Papers. ACM, Article 143, 8 pages. Google ScholarDigital Library
- Binh-Son Hua, Adrien Gruson, Derek Nowrouzezahrai, and Toshiya Hachisuka. 2017. Gradient-Domain Photon Density Estimation. Computer Graphics Forum (2017). Google ScholarDigital Library
- Wenzel Jakob. 2010a. Mitsuba renderer. (2010). http://www.mitsuba-renderer.org.Google Scholar
- Wenzel Jakob. 2010b. Mitsuba renderer. (2010). http://www.mitsuba-renderer.org.Google Scholar
- Wenzel Jakob and Steve Marschner. 2012. Manifold Exploration: A Markov Chain Monte Carlo Technique for Rendering Scenes with Difficult Specular Transport. ACM Trans. Graph. 31, 4, Article 58 (July 2012), 13 pages. Google ScholarDigital Library
- Henrik Wann Jensen. 1996. Global Illumination Using Photon Maps. In Proceedings of the Eurographics Workshop on Rendering Techniques '96. 21--30. Google ScholarDigital Library
- James T. Kajiya. 1986. The Rendering Equation. SIGGRAPH Comput. Graph. 20, 4 (Aug. 1986), 143--150. Google ScholarDigital Library
- Alexander Keller. 1997. Instant Radiosity. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 97). 49--56. Google ScholarDigital Library
- Markus Kettunen, Marco Manzi, Miika Aittala, Jaakko Lehtinen, Frédo Durand, and Matthias Zwicker. 2015. Gradient-domain Path Tracing. ACM Trans. Graph. 34, 4, Article 123 (July 2015), 13 pages. Google ScholarDigital Library
- Jaakko Lehtinen, Tero Karras, Samuli Laine, Miika Aittala, Frédo Durand, and Timo Aila. 2013. Gradient-domain Metropolis Light Transport. ACM Trans. Graph. 32, 4, Article 95 (July 2013), 12 pages. Google ScholarDigital Library
- Anat Levin, Assaf Zomet, Shmuel Peleg, and Yair Weiss. 2006. Seamless image stitching in the gradient domain. In Proceedings of the European Conference on Computer Vision.Google Scholar
- Marco Manzi, Markus Kettunen, Miika Aittala, Jaakko Lehtinen, Frédo Durand, and Matthias Zwicker. 2015. Gradient-Domain Bidirectional Path Tracing. In Eurographics Symposium on Rendering - Experimental Ideas & Implementations.Google Scholar
- Marco Manzi, Markus Kettunen, Frédo Durand, Matthias Zwicker, and Jaakko Lehtinen. 2016. Temporal Gradient-domain Path Tracing. ACM Trans. Graph. 35, 6, Article 246 (2016), 9 pages. Google ScholarDigital Library
- Marco Manzi, Fabrice Rousselle, Markus Kettunen, Jaakko Lehtinen, and Matthias Zwicker. 2014. Improved Sampling for Gradient-domain Metropolis Light Transport. ACM Trans. Graph. 33, 6, Article 178 (Nov. 2014), 12 pages. Google ScholarDigital Library
- M. Manzi, D. Vicini, and M. Zwicker. 2016. Regularizing Image Reconstruction for Gradient-Domain Rendering with Feature Patches. Computer Graphics Forum 35, 2 (2016), 263--273.Google ScholarCross Ref
- Patrick Pérez, Michel Gangnet, and Andrew Blake. 2003. Poisson Image Editing. ACM Trans. Graph. 22, 3 (July 2003), 313--318. Google ScholarDigital Library
- Matt Pharr, Wenzel Jakob, and Greg Humphreys. 2016. Physically Based Rendering, Third Edition: From Theory To Implementation (3nd ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. Google ScholarDigital Library
- Stefan Popov, Ravi Ramamoorthi, Frédo Durand, and George Drettakis. 2015. Probabilistic Connections for Bidirectional Path Tracing. In Proceedings of the 26th Eurographics Symposium on Rendering (EGSR '15). Eurographics Association, 75--86.Google ScholarCross Ref
- Fabrice Rousselle, Wojciech Jarosz, and Jan Novák. 2016. Image-space Control Variates for Rendering. ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia) 35, 6 (December 2016), 169:1--169:12. Google ScholarDigital Library
- Fabrice Rousselle, Claude Knaus, and Matthias Zwicker. 2012. Adaptive rendering with non-local means filtering. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH Asia 2012) 31, 6 (Nov. 2012). Google ScholarDigital Library
- Daniel L Ruderman. 1994. The statistics of natural images. Network: Computation in Neural Systems 5, 4 (1994), 517--548.Google ScholarCross Ref
- Mateu Sbert and JHalton. 2004. Reuse of paths in light source animation. In Proceedings of Computer Graphics International. IEEE, 532--535. Google ScholarDigital Library
- B. Segovia, J. C. Iehl, R. Mitanchey, and B. Péroche. 2006. Bidirectional Instant Radiosity. In Proceedings of the 17th Eurographics Conference on Rendering Techniques (EGSR '06). Eurographics Association, 389--397. Google ScholarDigital Library
- Peter Shirley, Bretton Wade, Philip M. Hubbard, David Zareski, Bruce Walter, and Donald P. Greenberg. 1995. Global Illumination via Density-Estimation. 219--230.Google Scholar
- Weilun Sun, Xin Sun, Nathan A. Carr, Derek Nowrouzezahrai, and Ravi Ramamoorthi. 2017. Gradient-Domain Vertex Connection and Merging. In Eurographics Symposium on Rendering - Experimental Ideas & Implementations.Google Scholar
- Eric Veach. 1998. Robust Monte Carlo Methods for Light Transport Simulation. Ph.D. Dissertation. Stanford, CA, USA. Advisor(s) Guibas, Leonidas J. AAI9837162. Google ScholarDigital Library
- Eric Veach and Leonidas J. Guibas. 1995. Optimally Combining Sampling Techniques for Monte Carlo Rendering. In Proceedings of the 22Nd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '95). ACM, 419--428. Google ScholarDigital Library
- 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). 65--76. Google ScholarDigital Library
- Jiří Vorba and Jaroslav Křivánek. 2016. Adjoint-Driven Russian Roulette and Splitting in Light Transport Simulation. ACM Trans. Graph. 35, 4 (July 2016), 1--11. (accepted for publication). Google ScholarDigital Library
- Gregory J. Ward, Francis M. Rubinstein, and Robert D. Clear. 1988. A Ray Tracing Solution for Diffuse Interreflection. SIGGRAPH Comput. Graph. 22, 4 (June 1988), 85--92. Google ScholarDigital Library
- Qing Xu and Mateu Sbert. 2007. A New Way to Re-using Paths. In Proceedings of the 2007 International Conference on Computational Science and Its Applications - Volume Part II (ICCSA'07). 741--750. Google ScholarDigital Library
Index Terms
- Gradient-domain path reusing
Recommendations
Approximating global illumination on mesostructure surfaces with height gradient maps
Rendering global illumination for objects with mesostructure surfaces is a time-consuming task, and cannot presently be applied to interactive graphics. This paper presents a real-time rendering method based on a mesostructure height gradient map (MHGM) ...
Robust light transport simulation via metropolised bidirectional estimators
Efficiently simulating light transport in various scenes with a single algorithm is a difficult and important problem in computer graphics. Two major issues have been shown to hinder the efficiency of the existing solutions: light transport due to ...
Improved radiance gradient computation
SIGGRAPH '08: ACM SIGGRAPH 2008 classesWe describe a new and accurate algorithm for computing translational gradients of incoming radiance in the context of a ray tracingbased global illumination solution. The gradient characterizes how the incoming directional radiance function changes with ...
Comments