Real-time Monte Carlo Denoising with Weight Sharing Kernel Prediction Network
Hangming Fan, Rui Wang, Yuchi Huo, Hujun Bao

TL;DR
This paper introduces a real-time Monte Carlo denoising method that predicts kernel map encodings with a decoder, significantly reducing computation time while maintaining high denoising quality for very low samples per pixel.
Contribution
It proposes a novel kernel map encoding and decoding approach that halves denoising time and improves quality compared to existing kernel-prediction methods.
Findings
Halves denoising time for 1-spp images.
Achieves better denoising quality than neural bilateral grid methods.
Enables real-time denoising at low samples per pixel.
Abstract
Real-time Monte Carlo denoising aims at removing severe noise under low samples per pixel (spp) in a strict time budget. Recently, kernel-prediction methods use a neural network to predict each pixel's filtering kernel and have shown a great potential to remove Monte Carlo noise. However, the heavy computation overhead blocks these methods from real-time applications. This paper expands the kernel-prediction method and proposes a novel approach to denoise very low spp (e.g., 1-spp) Monte Carlo path traced images at real-time frame rates. Instead of using the neural network to directly predict the kernel map, i.e., the complete weights of each per-pixel filtering kernel, we predict an encoding of the kernel map, followed by a high-efficiency decoder with unfolding operations for a high-quality reconstruction of the filtering kernels. The kernel map encoding yields a compact…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
