Moroto, YujiHachisuka, ToshiyaUmetani, NobuyukiBousseau, Adrien and McGuire, Morgan2021-07-122021-07-122021978-3-03868-157-11727-3463https://doi.org/10.2312/sr.20211294https://diglib.eg.org:443/handle/10.2312/sr20211294Depth-of-field (DoF) filtering is an important image-processing task for producing blurred images similar to those obtained with a large aperture camera lens. DoF filtering applies an image convolution with a spatially varying kernel and is thus computationally expensive, even on modern computational hardware. In this paper, we introduce an approach for fast and accurate DoF filtering for polygonal kernels, where the value is constant inside the kernel. Our approach is an extension of the existing approach based on discrete differenced kernels. The performance gain here hinges upon the fact that kernels typically become sparse (i.e., mostly zero) when taking the difference. We extended the existing approach to conventional axis-aligned differences to non-axis-aligned differences. The key insight is that taking such differences along the directions of the edges makes polygonal kernels significantly sparser than just taking the difference along the axis-aligned directions, as in existing studies. Compared to a naive image convolution, we achieve an order of magnitude speedup, allowing a real-time application of polygonal kernels even on high-resolution images.Computing methodologies --> Image processingRasterizationImagebased renderingMassively parallel algorithms10.2312/sr.2021129499-109