2021
DOI: 10.1111/cgf.14347
|View full text |Cite
|
Sign up to set email alerts
|

Optimised Path Space Regularisation

Abstract: We present Optimised Path Space Regularisation (OPSR), a novel regularisation technique for forward path tracing algorithms. Our regularisation controls the amount of roughness added to materials depending on the type of sampled paths and trades a small error in the estimator for a drastic reduction of variance in difficult paths, including indirectly visible caustics. We formulate the problem as a joint bias‐variance minimisation problem and use differentiable rendering to optimise our model. The learnt param… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…In practice, the pure‐specular interaction is relaxed by slightly increasing roughness and employing small area light sources. The specular paths can also be selectively mollified and sampled at the cost of introducing bias [KD13, WDH*21].…”
Section: Related Workmentioning
confidence: 99%
“…In practice, the pure‐specular interaction is relaxed by slightly increasing roughness and employing small area light sources. The specular paths can also be selectively mollified and sampled at the cost of introducing bias [KD13, WDH*21].…”
Section: Related Workmentioning
confidence: 99%
“…Biased methods, such as photon mapping [Hachisuka and Jensen 2009;Jensen and Christensen 1995] and regularization [Jendersie and Grosch 2019;Kaplanyan and Dachsbacher 2013b;Weier et al 2021], are also designed to find difficult paths for caustics. Due to their biased nature, these methods tend to lose details from highfrequency caustics.…”
Section: Related Workmentioning
confidence: 99%
“…A possible solution is to connect connections (during learning) using path space regularization [KD13]. Previous work showed how this can benefit path guiding [WDH∗21] by discovering features more easily.…”
Section: Limitations and Future Workmentioning
confidence: 99%