Neural Resampling with Optimized Candidate Allocation

We propose a novel framework that accelerates Monte Carlo rendering with the help of machine learning. Unlike previous works that learn parametric distributions that can be sampled directly, our method learns the 5-dimensional unnormalized incident radiance field and samples its product with the material response (BRDF) through Resampled Importance Sampling. This allows for more flexible network architectures that can be used to improve upon existing path guiding approaches and can also be reused for other tasks such as radiance caching. To reduce the cost of resampling, we derive optimized spatially-varying candidate counts to maximize the efficiency of the render process. We designed our method to accelerate CPU production renders by benefiting from otherwise idle GPU resources without need of intrusive changes to the renderer. We compare our approach against state-of-the-art path guiding methods, both neural and non-neural, and demonstrate significant variance reduction at equal render times on production scenes.

Institutions

Publication Details

Journal
Eurographics
Published
2025-01-01
DOI
https://doi.org/10.2312/sr.20251181
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Neural Resampling with Optimized Candidate Allocation

Eurographics
Computer Graphics and Visualization Techniques
article

Neural Resampling with Optimized Candidate Allocation

article en

Abstract

We propose a novel framework that accelerates Monte Carlo rendering with the help of machine learning. Unlike previous works that learn parametric distributions that can be sampled directly, our method learns the 5-dimensional unnormalized incident radiance field and samples its product with the material response (BRDF) through Resampled Importance Sampling. This allows for more flexible network architectures that can be used to improve upon existing path guiding approaches and can also be reused for other tasks such as radiance caching. To reduce the cost of resampling, we derive optimized spatially-varying candidate counts to maximize the efficiency of the render process. We designed our method to accelerate CPU production renders by benefiting from otherwise idle GPU resources without need of intrusive changes to the renderer. We compare our approach against state-of-the-art path guiding methods, both neural and non-neural, and demonstrate significant variance reduction at equal render times on production scenes.

Eurographics
Walt Disney (Switzerland) (CH), Walt Disney (United States) (US), University of Maryland, College Park (US), Saarland University (DE)
Openalex Percentile: Top 34%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Neural Resampling with Optimized Candidate Allocation · Eurographics (2025) | TGRS Research Map | TGRS