Information and Communication Technology 2022ICT22-028

Toward Optimal Path Guiding for Photorealistic Rendering


Toward Optimal Path Guiding for Photorealistic Rendering
Principal Investigator:
Institution:
Project title:
Toward Optimal Path Guiding for Photorealistic Rendering
Status:
Ongoing (01.02.2023 – 31.01.2027)
Funding volume:
€ 716,210

Photorealistic rendering, which is essential for many applications, involves evaluating complicated integrals. These integrals are predominantly approximated with a Monte Carlo method called path tracing. Unfortunately, this method generally requires many samples and therefore long computation times for noiseless images. Recently, so-called path-guiding techniques have been introduced, which gather knowledge about the integrands to facilitate sampling. In this project, we seek to identify and exploit untapped potential in path guiding to provide significant improvements in this active line of research. The two principal problems in path guiding are i) representing gathered knowledge and ii) sampling using that representation. We strive toward the ideal of optimal path guiding (considering practical constraints), which leads us to our main research questions: Q1. How can we represent path-guiding knowledge optimally? Q2. How can we sample optimally using that representation? We pursue two novel key ideas for possible answers: For Q1, we cast the problem of representing knowledge as a mathematical optimization problem, enabling us to exploit the knowledge and methods from the field of optimization. For Q2, we introduce “scalable product importance sampling”: adapting sampling accuracy as required to economize on resources. We see great potential for synergies between the two ideas and for them to open up new lines of investigation, thereby inspiring many follow-up works.

 
 
Scientific disciplines: Computer graphics (100%)

We use cookies on our website. Some of them are technically necessary, while others help us to improve this website or provide additional functionalities. Further information