Show simple item record

dc.contributor.authorRagan-Kelley, Jonathan Millar
dc.contributor.authorLehtinen, Jaakko
dc.contributor.authorDoggett, Michael
dc.contributor.authorDurand, Fredo
dc.date.accessioned2012-09-21T17:17:52Z
dc.date.available2012-09-21T17:17:52Z
dc.date.issued2011-05
dc.date.submitted2010-11
dc.identifier.issn0730-0301
dc.identifier.issn1557-7368
dc.identifier.urihttp://hdl.handle.net/1721.1/73101
dc.description.abstractWe propose a generalized approach to decoupling shading from visibility sampling in graphics pipelines, which we call decoupled sampling. Decoupled sampling enables stochastic supersampling of motion and defocus blur at reduced shading cost, as well as controllable or adaptive shading rates which trade off shading quality for performance. It can be thought of as a generalization of multisample antialiasing (MSAA) to support complex and dynamic mappings from visibility to shading samples, as introduced by motion and defocus blur and adaptive shading. It works by defining a many-to-one hash from visibility to shading samples, and using a buffer to memoize shading samples and exploit reuse across visibility samples. Decoupled sampling is inspired by the Reyes rendering architecture, but like traditional graphics pipelines, it shades fragments rather than micropolygon vertices, decoupling shading from the geometry sampling rate. Also unlike Reyes, decoupled sampling only shades fragments after precise computation of visibility, reducing overshading. We present extensions of two modern graphics pipelines to support decoupled sampling: a GPU-style sort-last fragment architecture, and a Larrabee-style sort-middle pipeline. We study the architectural implications of decoupled sampling and blur, and derive end-to-end performance estimates on real applications through an instrumented functional simulator. We demonstrate high-quality motion and defocus blur, as well as variable and adaptive shading rates.en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1966394.1966396en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleDecoupled Sampling for Graphics Pipelinesen_US
dc.typeArticleen_US
dc.identifier.citationJonathan Ragan-Kelley, Jaakko Lehtinen, Jiawen Chen, Michael Doggett, and Frédo Durand. 2011. Decoupled sampling for graphics pipelines. ACM Trans. Graph. 30, 3, Article 17 (May 2011), 17 pages.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorRagan-Kelley, Jonathan Millar
dc.contributor.mitauthorLehtinen, Jaakko
dc.contributor.mitauthorChen, Jiawen
dc.contributor.mitauthorDurand, Fredo
dc.relation.journalACM Transactions on Graphics (TOG)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsRagan-Kelley, Jonathan; Lehtinen, Jaakko; Chen, Jiawen; Doggett, Michael; Durand, Frédoen
dc.identifier.orcidhttps://orcid.org/0000-0001-9919-069X
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record