Marina Villanueva Barreiro

dblp:424/4376 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0006-5839-0920ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 50% Image and video processing · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image restoration
denoising
0.912025
A compact stochastic representation for Monte Carlo Path Traced images · SIGGRAPH Asia 2025
Rendering › ray tracing
path tracing
0.912025
A compact stochastic representation for Monte Carlo Path Traced images · SIGGRAPH Asia 2025

Methods — techniques the papers use, named apart from their topics

quantization · 0.9gaussian mixture model · 0.9codebook · 0.9
YearPublicationVenuePosition
2025 A compact stochastic representation for Monte Carlo Path Traced images
abstract
We present a compact, learning-based representation that captures the full Monte Carlo sampling distribution of a rendered image. Our approach enables rendering at arbitrary samples per pixel (SPP) during inference without requiring expensive path tracing operations. This is achieved by fitting parametric distributions to per-pixel radiance values, which can be efficiently estimated, stored, and sampled. Our method proceeds in three stages. First, we map radiance samples into radial log space, which encourages Gaussian-like distributions while preserving angular relationships. Second, we fit each pixel’s distribution using 3D Gaussian Mixture Models (GMMs), trained online with minimal memory overhead, making the approach compatible with standard path tracers. For inference, we introduce an optimized sampling scheme whose complexity is independent of the target SPP, enabling fast synthesis of high-SPP images. Additionally, we demonstrate that the learned representations can be heavily compressed using quantization and codebook techniques with negligible quality loss. Experiments show that GMMs strike an effective balance between expressiveness and sparsity. Compared to alternative models, our method better captures pixel-wise Monte Carlo distributions. Lastly, we illustrate the versatility of our representation with applications such as firefly rejection and ray-distribution-driven denoising.
Matthias Treder, Pavlos Makridis, Alexis Lechat, Jesus Zarzar, Marina Villanueva Barreiro, Roc R. Currius
SIGGRAPH Asia5