dc.contributor.author | Heitz, Eric | en_US |
dc.contributor.author | Belcour, Laurent | en_US |
dc.contributor.editor | Boubekeur, Tamy and Sen, Pradeep | en_US |
dc.date.accessioned | 2019-07-14T19:24:38Z | |
dc.date.available | 2019-07-14T19:24:38Z | |
dc.date.issued | 2019 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | https://doi.org/10.1111/cgf.13778 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13778 | |
dc.description.abstract | Recent work has shown that distributing Monte Carlo errors as a blue noise in screen space improves the perceptual quality of rendered images. However, obtaining such distributions remains an open problem with high sample counts and highdimensional rendering integrals. In this paper, we introduce a temporal algorithm that aims at overcoming these limitations. Our algorithm is applicable whenever multiple frames are rendered, typically for animated sequences or interactive applications. Our algorithm locally permutes the pixel sequences (represented by their seeds) to improve the error distribution across frames. Our approach works regardless of the sample count or the dimensionality and significantly improves the images in low-varying screen-space regions under coherent motion. Furthermore, it adds negligible overhead compared to the rendering times. | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.subject | Computing methodologies | |
dc.subject | Rendering | |
dc.title | Distributing Monte Carlo Errors as a Blue Noise in Screen Space by Permuting Pixel Seeds Between Frames | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Sampling | |
dc.description.volume | 38 | |
dc.description.number | 4 | |
dc.identifier.doi | 10.1111/cgf.13778 | |
dc.identifier.pages | 149-158 | |