Title: | Go with the winners strategy in path tracing |
Authors: | Szirmay-Kalos, László György, Antal Sbert, Mateu |
Citation: | Journal of WSCG. 2005, vol. 13, no. 2, p. 49-56. |
Issue Date: | 2005 |
Publisher: | Václav Skala - UNION Agency |
Document type: | článek article |
URI: | http://wscg.zcu.cz/WSCG2005/Papers_2005/Journal/!WSCG2005_Journal_Final.pdf http://hdl.handle.net/11025/1454 |
ISSN: | 1213–6964 (online) 1213–6980 (CD-ROM) 1213–6972 (hardcover) |
Keywords: | globální osvětlení;náhodná procházka;Monte Carlo |
Keywords in different language: | global illumination;random walk;Monte Carlo |
Abstract: | This paper proposes a new random walk strategy that minimizes the variance of the estimate using statistical estimations of local and global features of the scene. Based on the local and global properties, the algorithm decides at each point whether a Russian-roulette like random termination is worth performing, or on the contrary, we should split the path into several child paths. In this sense the algorithm is similar to the go-with-the-winners strategy invented in general Monte Carlo context. However, instead of establishing thresholds to make decisions, we compute the number of child paths on a continuous level and show that Russian roulette can be interpreted as a kind of splitting using fractional number of children. The new method is built into a path tracing algorithm, and a minimum cost heuristic is proposed for choosing the number of rejected rays. Comparing it with the classical path tracing approach we concluded that the new method reduced the variance significantly. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | Volume 13, Number 1-3 (2005) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Szirmay-Kalos.pdf | Plný text | 223,78 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/1454
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.