1. [Publications](/publications)
2. An Efficient Denoising Algorithm for Global Illumination
 
 # An Efficient Denoising Algorithm for Global Illumination

  ![](/sites/default/files/styles/wide/public/publications/icon_0.png?itok=b9iq2aTk)

 We propose a hybrid ray-tracing/rasterization strategy for real-time rendering enabled by a fast new denoising method. We factor global illumination into direct light at rasterized primary surfaces and two indirect lighting terms, each estimated with one path-traced sample per pixel. Our factorization enables efficient (biased) reconstruction by denoising light without blurring materials. We demonstrate denoising in under 10 ms per 1280×720 frame, compare results against the leading offline denoising methods, and include a supplement with source code, video, and data.



 ## Authors



Michael Mara (Stanford University)

Morgan McGuire (NVIDIA &amp; Williams College)

Benedikt Bitterli (Dartmouth College)

Wojciech Jarosz (Dartmouth College)

 

 

 ## Publication Date



Friday, July 28, 2017

 

 ## Published in



[ACM SIGGRAPH / EuroGraphics High Performance Graphics 2017](http://www.highperformancegraphics.org/2017/)

 

 ## Research Area



[Computer Graphics](/research-area/computer-graphics)

[Real-Time Rendering](/research-area/real-time-rendering)

 

 

 ## External Links



[Paper](http://casual-effects.com/research/Mara2017Denoise/Mara2017Denoise.pdf)

[Reference code](http://casual-effects.com/research/Mara2017Denoise/code.zip)

[More information](http://casual-effects.com/research/Mara2017Denoise/index.html)

 

 

 ## Copyright



Copyright by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or <permissions@acm.org>. The definitive version of this paper can be found at ACM's Digital Library <http://www.acm.org/dl/>.