Importance Caching for Complex Illumination

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127580" target="_blank" >RIV/00216208:11320/12:10127580 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x" target="_blank" >http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x" target="_blank" >10.1111/j.1467-8659.2012.03049.x</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Importance Caching for Complex Illumination

Popis výsledku v původním jazyce

Realistic rendering requires computing the global illumination in the scene, and Monte Carlo integration is the best-known method for doing that. The key to good performance is to carefully select the costly integration samples, which is usually achievedvia importance sampling. Unfortunately, visibility is difficult to factor into the importance distribution, which can greatly increase variance in highly occluded scenes with complex illumination. In this paper, we present importance caching - a novel approach that selects those samples with a distribution that includes visibility, while maintaining efficiency by exploiting illumination smoothness. At a sparse set of locations in the scene, we construct and cache several types of probability distributions with respect to a set of virtual point lights (VPLs), which notably include visibility. Each distribution type is optimized for a specific lighting condition. For every shading point, we then borrow the distributions from nearby cache

Název v anglickém jazyce

Importance Caching for Complex Illumination

Popis výsledku anglicky

Realistic rendering requires computing the global illumination in the scene, and Monte Carlo integration is the best-known method for doing that. The key to good performance is to carefully select the costly integration samples, which is usually achievedvia importance sampling. Unfortunately, visibility is difficult to factor into the importance distribution, which can greatly increase variance in highly occluded scenes with complex illumination. In this paper, we present importance caching - a novel approach that selects those samples with a distribution that includes visibility, while maintaining efficiency by exploiting illumination smoothness. At a sparse set of locations in the scene, we construct and cache several types of probability distributions with respect to a set of virtual point lights (VPLs), which notably include visibility. Each distribution type is optimized for a specific lighting condition. For every shading point, we then borrow the distributions from nearby cache

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computer Graphics Forum

ISSN

0167-7055

e-ISSN

—

Svazek periodika

31

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

10

Strana od-do

701-710

Kód UT WoS článku

000306181700019

EID výsledku v databázi Scopus

—