### Ling-Qi Yan, Soham Uday Mehta, Ravi Ramamoorthi and Fredo Durand

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/EECS-2014-174

October 23, 2014

### http://www2.eecs.berkeley.edu/Pubs/TechRpts/2014/EECS-2014-174.pdf

Soft shadows, depth of field, and diffuse global illumination are common distribution effects, usually rendered by Monte Carlo ray tracing. Physically correct, noise-free images can require hundreds or thousands of ray samples per pixel, and take a long time to compute. Recent approaches have exploited sparse sampling and filtering; the filtering is either fast (axis-aligned), but requires more input samples, or needs fewer input samples but is very slow (sheared). We present a new approach for fast sheared filtering on the GPU. Our algorithm factors the 4D sheared filter into four 1D filters. We derive complexity bounds for our method, showing that the per-pixel complexity is reduced from O(n^2 l^2) to O(nl), where n is the linear filter width (filter size is O(n^2)) and l is the (usually very small) number of samples for each dimension of the light or lens per pixel (spp is l^2). We thus reduce sheared filtering overhead dramatically. We demonstrate rendering of depth of field, soft shadows and diffuse global illumination at interactive speeds. We reduce the number of samples needed by 5 − 8×, compared to axis-aligned filtering, and framerates are 4× faster for equal quality.

BibTeX citation:

@techreport{Yan:EECS-2014-174, Author = {Yan, Ling-Qi and Uday Mehta, Soham and Ramamoorthi, Ravi and Durand, Fredo}, Title = {Fast 4D Sheared Filtering for Interactive Rendering of Distribution Effects}, Institution = {EECS Department, University of California, Berkeley}, Year = {2014}, Month = {Oct}, URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2014/EECS-2014-174.html}, Number = {UCB/EECS-2014-174}, Abstract = {Soft shadows, depth of field, and diffuse global illumination are common distribution effects, usually rendered by Monte Carlo ray tracing. Physically correct, noise-free images can require hundreds or thousands of ray samples per pixel, and take a long time to compute. Recent approaches have exploited sparse sampling and filtering; the filtering is either fast (axis-aligned), but requires more input samples, or needs fewer input samples but is very slow (sheared). We present a new approach for fast sheared filtering on the GPU. Our algorithm factors the 4D sheared filter into four 1D filters. We derive complexity bounds for our method, showing that the per-pixel complexity is reduced from O(n^2 l^2) to O(nl), where n is the linear filter width (filter size is O(n^2)) and l is the (usually very small) number of samples for each dimension of the light or lens per pixel (spp is l^2). We thus reduce sheared filtering overhead dramatically. We demonstrate rendering of depth of field, soft shadows and diffuse global illumination at interactive speeds. We reduce the number of samples needed by 5 − 8×, compared to axis-aligned filtering, and framerates are 4× faster for equal quality.} }

EndNote citation:

%0 Report %A Yan, Ling-Qi %A Uday Mehta, Soham %A Ramamoorthi, Ravi %A Durand, Fredo %T Fast 4D Sheared Filtering for Interactive Rendering of Distribution Effects %I EECS Department, University of California, Berkeley %D 2014 %8 October 23 %@ UCB/EECS-2014-174 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2014/EECS-2014-174.html %F Yan:EECS-2014-174