Show simple item record

dc.contributor.authorHeitz, Ericen_US
dc.contributor.authorBelcour, Laurenten_US
dc.contributor.editorBoubekeur, Tamy and Sen, Pradeepen_US
dc.date.accessioned2019-07-14T19:24:38Z
dc.date.available2019-07-14T19:24:38Z
dc.date.issued2019
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.13778
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13778
dc.description.abstractRecent 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.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectComputing methodologies
dc.subjectRendering
dc.titleDistributing Monte Carlo Errors as a Blue Noise in Screen Space by Permuting Pixel Seeds Between Framesen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersSampling
dc.description.volume38
dc.description.number4
dc.identifier.doi10.1111/cgf.13778
dc.identifier.pages149-158


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • 38-Issue 4
    Rendering 2019 - Symposium Proceedings

Show simple item record