Dependent Tests Driven Filtering in Monte-Carlo Global Illumination

dc.contributor.authorCsonka, Ferencen_US
dc.contributor.authorSzirmay-Kalos, Laszloen_US
dc.contributor.authorKelemen, Csabaen_US
dc.contributor.authorAntal, Györgyen_US
dc.date.accessioned2015-11-12T07:16:53Z
dc.date.available2015-11-12T07:16:53Z
dc.date.issued2002en_US
dc.description.abstractThis paper presents a multi-phase algorithm to solve the global illumination problem. In the first phase dependent tests are applied, i.e. the random walks of different pixels are built from the same random numbers. The result of the first phase is used to identify homogeneous pixel groups in the image. The criterion of the formation of such groups is that averaging the color inside these groups should result in less error than handling the pixels independently. The second phase of the algorithm is a conventional random walk method that uses independent random samples in different pixels. The final result is calculated as the average of the results of the dependent tests and the lowpass filtered version of the independent tests. This low-pass filter averages the pixel values inside the homogenous groups. The algorithm takes advantage of the fact that the image can contain larger homogeneous regions that can be calculated from much less number of samples. Thus we can focus on those pixels where significant changes happen.en_US
dc.description.seriesinformationEurographics 2002 - Short Presentationsen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20021043en_US
dc.publisherEurographics Associationen_US
dc.titleDependent Tests Driven Filtering in Monte-Carlo Global Illuminationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
short9.pdf
Size:
795.9 KB
Format:
Adobe Portable Document Format