open research problems

Slides:



Advertisements
Similar presentations
PATH INTEGRAL FORMULATION OF LIGHT TRANSPORT Jaroslav Křivánek Charles University in Prague
Advertisements

Multidimensional Lightcuts Bruce Walter Adam Arbree Kavita Bala Donald P. Greenberg Program of Computer Graphics, Cornell University.
Scalability with Many Lights 1 Lightcuts & Multidimensonal Lightcuts Course: Realistic Rendering with Many-Light Methods Note: please see website for the.
Szirmay-Kalos László Magdics Milán Tóth Balázs
Anton S. Kaplanyan Karlsruhe Institute of Technology, Germany Path Space Regularization Framework.
Proximity Computations between Noisy Point Clouds using Robust Classification 1 Jia Pan, 2 Sachin Chitta, 1 Dinesh Manocha 1 UNC Chapel Hill 2 Willow Garage.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lectures 18, 19: Monte Carlo Integration Ravi Ramamoorthi Acknowledgements.
Rendering theory & practice. Introduction  We’ve looked at modelling, surfacing and animating.  The final stage is rendering.  This can be the most.
Global Illumination May 7, Global Effects translucent surface shadow multiple reflection.
Tomo-gravity Yin ZhangMatthew Roughan Nick DuffieldAlbert Greenberg “A Northern NJ Research Lab” ACM.
WHAT IS VRAY? V-ray is a rendering engine that is used as an extension of certain 3D computer graphics software. The core developers of V-Ray are Vladimir.
1 Patch Complexity, Finite Pixel Correlations and Optimal Denoising Anat Levin, Boaz Nadler, Fredo Durand and Bill Freeman Weizmann Institute, MIT CSAIL.
Selected Topics in Global Illumination Computation Jaroslav Křivánek Charles University, Prague
Emerging Technologies for Games Alpha Sorting and “Soft” Particles CO3303 Week 15.
Computer Graphics Global Illumination: Photon Mapping, Participating Media Lecture 12 Taku Komura.
Path Integral Formulation of Light Transport
Improved VPL Distribution Jaroslav Křivánek Charles University in Prague (Optimizing) Realistic Rendering with Many-Light Methods (part of the “Handling.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Charles University in Prague
Importance Resampling for Global Illumination Justin Talbot, David Cline, and Parris Egbert Brigham Young University Provo, UT.
Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.
1 Temporal Radiance Caching P. Gautron K. Bouatouch S. Pattanaik.
PATH INTEGRAL METHODS FOR LIGHT TRANSPORT SIMULATION THEORY & PRACTICE Jaroslav Křivánek Charles University Prague Juan Cañada Next Limit Technologies.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Pure Path Tracing: the Good and the Bad Path tracing concentrates on important paths only –Those that hit the eye –Those from bright emitters/reflectors.
02/12/03© 2003 University of Wisconsin Last Time Intro to Monte-Carlo methods Probability.
Bidirectional Path Sampling Techniques
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
Slide 1Lastra, 2/14/2016 Monte-Carlo Methods. Slide 2Lastra, 2/14/2016 Topics Kajiya’s paper –Showed that existing rendering methods are approximations.
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2007 Don Fussell Photon Mapping and Irradiance Caching.
Global Illumination (3) Path Tracing. Overview Light Transport Notation Path Tracing Photon Mapping.
PATH INTEGRAL FORMULATION OF LIGHT TRANSPORT Jaroslav Křivánek Charles University in Prague
Computer graphics III – Multiple Importance Sampling Jaroslav Křivánek, MFF UK
© 2010 Pearson Prentice Hall. All rights reserved Chapter Hypothesis Tests Regarding a Parameter 10.
Computer graphics III – Path tracing Jaroslav Křivánek, MFF UK
Bootstrap – The Statistician’s Magic Wand
Advanced Computer Graphics
Advanced Computer Graphics
Recent Advances in Light Transport Simulation Theory & Practice
A Brachytherapy Treatment Planning Software Based on Monte Carlo Simulations and Artificial Neural Network Algorithm Amir Moghadam.
Reading: Pedro Domingos: A Few Useful Things to Know about Machine Learning source: /cacm12.pdf reading.
Ray Tracing via Markov Chain Monte-Carlo Method
3D Graphics Rendering PPT By Ricardo Veguilla.
Metropolis light transport
Stylized Environmental Rendering
© University of Wisconsin, CS559 Fall 2004
Department of Computer Science
The Rendering Equation
© 2005 University of Wisconsin
Primary Sample Space Path Guiding
Radiative Transfer & Volume Path Tracing
Path Tracing (some material from University of Wisconsin)
Real-time Volumetric Lighting in Participating Media
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Caustics Ray Tracing CSS522
Virtual Spherical Lights for Many-Light Rendering of Glossy Scenes
Chapter 12 Power Analysis.
Metropolis Light Transport for Participating Media
Bidirectional Path Sampling Techniques
CS5500 Computer Graphics May 29, 2006
The Next Frontier.
Computer graphics III – Path tracing
Metropolis Light Transit
(Optimizing) Realistic Rendering with Many-Light Methods
Future Research.
Lesson 4: Application to transport distributions
Monte Carlo Path Tracing and Caching Illumination
Path Space Regularization for Robust and Holistic Light Transport
Directional Occlusion with Neural Network
Photon Density Estimation using Multiple Importance Sampling
Presentation transcript:

open research problems In this concluding part of the course, I will discuss some open problems in volumetric light transport. Jaroslav Křivánek Charles University – Render Legion | Chaos Group © 2018 SIGGRAPH. All Rights Reserved

Speed in general Heterogeneus volumes – volume lookups Unidirectional estimators are not robust Combined bidir estimators slow The first problem is of course speed: light transport is generally slow, transport in volumes even slower. Especially in large heterogeneous volumes, just looking up the volume data can easily overwhelm the entire computation budget. Furthermore, the unidirectional estimators commonly used in practice, such as path tracing, are generally rather fragile: they do not handle well complex lighting such as caustics or strong indirect illumination. They also have trouble with light sources embedded directly into the volumes. Bidirectional methods, such as bidirectional path tracing or UPBP [Křivánek et al. 2014], are more robust thanks to the use of combined estimators, however they tend to be generally slow, even in the simple cases that the path tracer already handles fairly well.

null collision algorithms and MIS “How do I combine Woodcock tracking with equi-angular sampling?” MIS could do that – but we need the Woodcock tracking PDF PDF not easily available – it’s a rejection method Can we estimate the PDF (for MIS)? Ray marching – accurate but slow, bias does not matter (it’s just for the MIS weights) Some more specific problems include calculation of sampling pdfs for the null-collision tracking algorithms, such as Woodcock tracking. Woodcock tracking is a rejection method of sorts, we know it generates samples from the appropriate distribution, but we have no way of evaluating the pdf value for a given distance. This prevents the use of Woodcock tracking in bidirectional estimators, where the pdf value is essential for the calculation of MIS weights (e.g. the balance heuristic) [Veach and Guibas 1995].

leverage machine learning Path guiding for volumes [Herholz et al. 2019], still needs improvements Denoising of volumes – currently does not work well No features available Learn a BSSRDF for dense media Can be done for fluffy clouds, but becomes harder for more structured media Difficult to bound error One interesting direction for improving the performance of volumetric light transport is the use of Machine learning. One option, already exploited in surface rendering, is the so called path guiding. Path guiding refers to adaptive sampling in the path space, with the purpose of preferably sampling paths to scene locations where light sources can be easily reached. Machine learning can be used to learn the guiding distributions (unknown upfront) from the samples used in rendering. The upcoming work of Herholz et al. [2019] goes in this direction, but more work will be needed. Another challenge is denoising of volumetric media, which currently does not work very well. The main reason is the lack of any reliable features (such as surface normals, depth, texture/albedo) that are readily available for surfaces. For this reason the denoiser has no way of telling noise from actual features. A ML methods trained on a sufficiently large pool of examples could help to improve this. Another interesting direction follows from the realization that – especially in dense media – the transport has diffusive character, so the solutions are generally rather smooth and stable (in the sense that small perturbations of the volume data will not yield large perturbations of the light transport solution). These facts give some hope that it might be possible to learn – through regression – the light transport solution for canonical configurations.

correlated scatterers Core assumption of exponential path length – uncorrelated particles Particles can be very correlated (biological tissue – cells, sand particles) Some existing work [d'Eon 2018, Jarabo et al. 2018, Bitterli et al. 2018] Another interesting direction of future research is the co-called non-classical transport, that is, transport in media for which the Beer-Lambert law does not hold. Such cases include all media with correlated internal structure (the exponential Beer-Lambert light falloff assumes uncorrelated particles in the volume). Some recent work in this direction already exists, but efficient rendering methods for such media are yet to be devised.

surfaces & volumes Joint handling of surfaces and volumes Represent surfaces as volumes, too? … and then jointly downscale for LOD The volumetric representation can also be though of as a natural unified representation of scenes. Indeed, for some materials, such as fabrics, surface representation with a texture might be too limiting, while a volumetric representation easily captures all the intricacies of such materials. A unified volumetric scene representation has the significant advantage of enabling effective level-of-detail in large scenes.

Thank you! Acknowledgments Funding: Czech Science Foundation (16-18964S)