Title:	Adaptive importance caching for many-light rendering
Authors:	Yoshida, Hiroshi Nabata, Kosuke Iwasaki, Kei Dobashi, Yoshinori Nishita, Tomoyuki
Citation:	Journal of WSCG. 2015, vol. 23, no. 1, p. 65-71.
Issue Date:	2015
Publisher:	Václav Skala - UNION Agency
Document type:	článek article
URI:	http://wscg.zcu.cz/WSCG2015/!_2015_Journal_WSCG-No-1.pdf http://hdl.handle.net/11025/17147
ISSN:	1213–6972 (hardcopy) 1213–6980 (CD-ROM) 1213–6964 (online)
Keywords:	globální osvětlení;vykreslování;význam vzorkování;význam mezipaměti
Keywords in different language:	global illumination;rendering;importance sampling;importance caching
Abstract in different language:	Importance sampling of virtual point lights (VPLs) is an efficient method for computing global illumination. The key to importance sampling is to construct the probability function, which is used to sample the VPLs, such that it is proportional to the distribution of contributions from all the VPLs. Importance caching records the contributions of all the VPLs at sparsely distributed cache points on the surfaces and the probability function is calculated by interpolating the cached data. Importance caching, however, distributes cache points randomly, which makes it difficult to obtain probability functions proportional to the contributions of VPLs where the variation in the VPL contribution at nearby cache points is large. This paper proposes an adaptive cache insertion method for VPL sampling. Our method exploits the spatial and directional correlations of shading points and surface normals to enhance the proportionality. The method detects cache points that have large variations in their contribution from VPLs and inserts additional cache points with a small overhead. In equal-time comparisons including cache point generation and rendering, we demonstrate that the images rendered with our method are less noisy compared to importance caching.
Rights:	© Václav Skala - UNION Agency
Appears in Collections:	Volume 23, Number 1 (2015)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.