Discrete approximations of Gaussian smoothing and Gaussian derivatives
Tony Lindeberg
TL;DR
The paper analyzes how to discretize Gaussian smoothing and Gaussian derivatives while preserving scale-space properties on discrete data. It compares three discretization families—sampled, integrated, and the genuinely discrete analogue—across theoretical criteria and quantitative measures, identifying the discrete analogue as the most robust at fine scales and the sampled variant as highly accurate at coarser scales. For derivatives, convolving with the discrete Gaussian kernel followed by small-step central differences yields the most faithful derivatives at fine scales, while at larger scales the sampled derivatives perform best. The work extends to scale selection applications, directional derivatives, and affine extensions, offering a rigorous framework and practical masks for efficient, scale-consistent feature detection with potential use in deep learning. A comprehensive appendix provides exact formulas, diffusion connections, and directional-derivative constructions to support implementation and reproducibility.
Abstract
This paper develops an in-depth treatment concerning the problem of approximating the Gaussian smoothing and Gaussian derivative computations in scale-space theory for application on discrete data. With close connections to previous axiomatic treatments of continuous and discrete scale-space theory, we consider three main ways discretizing these scale-space operations in terms of explicit discrete convolutions, based on either (i) sampling the Gaussian kernels and the Gaussian derivative kernels, (ii) locally integrating the Gaussian kernels and the Gaussian derivative kernels over each pixel support region and (iii) basing the scale-space analysis on the discrete analogue of the Gaussian kernel, and then computing derivative approximations by applying small-support central difference operators to the spatially smoothed image data. We study the properties of these three main discretization methods both theoretically and experimentally, and characterize their performance by quantitative measures, including the results they give rise to with respect to the task of scale selection, investigated for four different use cases, and with emphasis on the behaviour at fine scales. The results show that the sampled Gaussian kernels and derivatives as well as the integrated Gaussian kernels and derivatives perform very poorly at very fine scales. At very fine scales, the discrete analogue of the Gaussian kernel with its corresponding discrete derivative approximations performs substantially better. The sampled Gaussian kernel and the sampled Gaussian derivatives do, on the other hand, lead to numerically very good approximations of the corresponding continuous results, when the scale parameter is sufficiently large, in the experiments presented in the paper, when the scale parameter is greater than a value of about 1, in units of the grid spacing.
