August 2021
·
31 Reads
·
9 Citations
ACM Transactions on Graphics
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
August 2021
·
31 Reads
·
9 Citations
ACM Transactions on Graphics
August 2021
·
21 Reads
·
38 Citations
ACM Transactions on Graphics
High-quality denoising of Monte Carlo low-sample renderings remains a critical challenge for practical interactive ray tracing. We present a new learning-based denoiser that achieves state-of-the-art quality and runs at interactive rates. Our model processes individual path-traced samples with a lightweight neural network to extract per-pixel feature vectors. The rest of our pipeline operates in pixel space. We define a novel pairwise affinity over the features in a pixel neighborhood, from which we assemble dilated spatial kernels to filter the noisy radiance. Our denoiser is temporally stable thanks to two mechanisms. First, we keep a running average of the noisy radiance and intermediate features, using a per-pixel recursive filter with learned weights. Second, we use a small temporal kernel based on the pairwise affinity between features of consecutive frames. Our experiments show our new affinities lead to higher quality outputs than techniques with comparable computational costs, and better high-frequency details than kernel-predicting approaches. Our model matches or outperfoms state-of-the-art offline denoisers in the low-sample count regime (2--8 samples per pixel), and runs at interactive frame rates at 1080p resolution.
... They average all denoised images to get the final denoised image. ANF [Işık et al. 2021] also present a multi-scale kernel-based denoising method for interactive sequences denoising. While different from [Fan et al. 2021], they utilize the dilated convolution operators as the multiscale kernels. ...
August 2021
ACM Transactions on Graphics
... Meng et al. [19] projected the noisy input image onto the bilateral grid based on the guide image learned by the neural network and then, sliced the grid to obtain the denoised images. Isik et al. [11] proposed a filtering algorithm by computing a pairwise affinity to quantify the relationship between per-pixel deep features. Fan et al. [6] learned lightweight importance maps and constructed multi-scale filtering kernels to reduce the time cost of the kernel prediction method. ...
August 2021
ACM Transactions on Graphics