Efficient product sampling using hierarchical thresholding

Authors:
Fabrice Rousselle;Petrik Clarberg;Luc Leblanc;Victor Ostromoukhov;Pierre Poulin
Affiliations:
University of Montreal, PO Box 6128, Station Centre-ville, Montreal, QC, Canada and Ecole Polytechnique Fédérale de Lausanne (EPFL), PO Box 6128, Station Centre-ville, H3C 3J7, Lausa ...;Lund University, Box 117, Station Centre-ville, 221 00, Lund, QC, Sweden;University of Montreal, PO Box 6128, Station Centre-ville, Montreal, QC, Canada;University of Montreal, PO Box 6128, Station Centre-ville, Montreal, QC, Canada;University of Montreal, PO Box 6128, Station Centre-ville, Montreal, QC, Canada
Venue:
The Visual Computer: International Journal of Computer Graphics
Year:
2008

Citing 0
Cited 4

Adaptive sampling for environment mapping

Proceedings of the 26th Spring Conference on Computer Graphics
Importance Caching for Complex Illumination

Computer Graphics Forum
Deterministic importance sampling with error diffusion

EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
An optimizing compiler for automatic shader bounding

EGSR'10 Proceedings of the 21st Eurographics conference on Rendering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on the fly, based on hierarchical representations of the local maxima and averages of the individual terms. Samples are generated by exploiting the hierarchical properties of many low-discrepancy sequences, and thresholded against the estimated product. We evaluate direct illumination by sampling the triple product of environment map lighting, surface reflectance, and a visibility function estimated per pixel. Our results show considerable noise reduction compared to existing state-of-the-art methods using only the product of lighting and BRDF.