Difference of Gaussians

Comparison of difference of Gaussian with Mexican hat wavelet

Given an n-dimensional gray-scale image ${\displaystyle I:\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ The difference of Gaussians (DoG) of the image ${\displaystyle I}$ is the function ${\displaystyle \Gamma _{\sigma _{1},\sigma _{2}}:\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ obtained by subtracting the image ${\displaystyle I}$ convolved with the Gaussian of standard deviation ${\displaystyle \sigma _{2}}$ from the image ${\displaystyle I}$ convolved with a Gaussian of narrower standard deviation ${\displaystyle \sigma _{1}<\sigma _{2}}$:

${\displaystyle \Gamma _{\sigma _{1},\sigma _{2}}=I*G_{\sigma _{1}}-I*G_{\sigma _{2}},}$

where ${\displaystyle G_{\sigma }:\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ is a Gaussian with standard deviation ${\displaystyle \sigma }$:

${\displaystyle G_{\sigma }(x)={\frac {1}{(\sigma ^{2}2\pi )^{n/2}}}e^{-{\frac {\|x\|^{2}}{2\sigma ^{2}}}}.}$

Equivalently one can write

${\displaystyle \Gamma _{\sigma _{1},\sigma _{2}}=I*(G_{\sigma _{1}}-G_{\sigma _{2}})}$

which represents an image convolved by the difference of two Gaussians, which approximates a Mexican hat function.

The relation between the difference of Gaussians operator and the Laplacian of the Gaussian operator (the Mexican hat wavelet) is explained in appendix A in Lindeberg (2015).[2]

Example before difference of Gaussians

After difference of Gaussians filtering in black and white

As a feature enhancement algorithm, the difference of Gaussians can be utilized to increase the visibility of edges and other detail present in a digital image. A wide variety of alternative edge sharpening filters operate by enhancing high frequency detail, but because random noise also has a high spatial frequency, many of these sharpening filters tend to enhance noise, which can be an undesirable artifact. The difference of Gaussians algorithm removes high frequency detail that often includes random noise, rendering this approach one of the most suitable for processing images with a high degree of noise. A major drawback to application of the algorithm is an inherent reduction in overall image contrast produced by the operation.[1]

When utilized for image enhancement, the difference of Gaussians algorithm is typically applied when the size ratio of kernel (2) to kernel (1) is 4:1 or 5:1. In the example images to the right, the sizes of the Gaussian kernels employed to smooth the sample image were 10 pixels and 5 pixels.

The algorithm can also be used to obtain an approximation of the Laplacian of Gaussian when the ratio of size 2 to size 1 is roughly equal to 1.6.[3] The Laplacian of Gaussian is useful for detecting edges that appear at various image scales or degrees of image focus. The exact values of sizes of the two kernels that are used to approximate the Laplacian of Gaussian will determine the scale of the difference image, which may appear blurry as a result.

Differences of Gaussians have also been used for blob detection in the scale-invariant feature transform. In fact, the DoG as the difference of two Multivariate normal distribution has always a total null sum and convolving it with a uniform signal generates no response. It approximates well a second derivate of Gaussian (Laplacian of Gaussian) with K~1.6 and the receptive fields of ganglion cells in the retina with K~5. It may easily be used in recursive schemes and is used as an operator in real-time algorithms for blob detection and automatic scale selection.

In its operation, the difference of Gaussians algorithm is believed to mimic how neural processing in the retina of the eye extracts details from images destined for transmission to the brain.[4] [5] [6]

• Marr–Hildreth algorithm
• Treatment of the difference of Gaussians approach in blob detection.
• Blob detection
• Gaussian pyramid
• Scale space
• Scale-invariant feature transform

• Notes by Melisa Durmuş on Edge Detection and Gaussian related mathematics from the University of Edinburgh.