Open main menu

Wikipedia β

In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the form:

for arbitrary real constants a, b and c. It is named after the mathematician Carl Friedrich Gauss. Gaussian functions are often used to represent the the probability density function of a normally distributed random variable with expected value μ = b and variance σ2 = c2. In this case, the Gaussian is of the form:

The graph of a Gaussian is a characteristic symmetric "bell curve" shape. The parameter a is the height of the curve's peak, b is the position of the center of the peak and c (the standard deviation, sometimes called the Gaussian RMS width) controls the width of the "bell".

Gaussian functions are widely used in statistics to describe the normal distributions, in signal processing to define Gaussian filters, in image processing where two-dimensional Gaussians are used for Gaussian blurs, and in mathematics to solve heat equations and diffusion equations and to define the Weierstrass transform.

Contents

PropertiesEdit

Gaussian functions arise by composing the exponential function with a concave quadratic function. The Gaussian functions are thus those functions whose logarithm is a concave quadratic function.

The parameter c is related to the full width at half maximum (FWHM) of the peak according to

 [1]

The function may then be expressed in terms of the FWHM, represented by w:

 

Alternatively, the parameter c can be interpreted by saying that the two inflection points of the function occur at x = b − c and x = b + c.

The full width at tenth of maximum (FWTM) for a Gaussian could be of interest and is

 

Gaussian functions are analytic, and their limit as x → ∞ is 0 (for the above case of b = 0).

Gaussian functions are among those functions that are elementary but lack elementary antiderivatives; the integral of the Gaussian function is the error function. Nonetheless their improper integrals over the whole real line can be evaluated exactly, using the Gaussian integral

 

and one obtains

 

This integral is 1 if and only if  , and in this case the Gaussian is the probability density function of a normally distributed random variable with expected value μ = b and variance σ2 = c2:

 

These Gaussians are plotted in the accompanying figure.

 
Normalized Gaussian curves with expected value μ and variance σ2. The corresponding parameters are  , b = μ and c = σ.

Gaussian functions centered at zero minimize the Fourier uncertainty principle.

The product of two Gaussian functions is a Gaussian, and the convolution of two Gaussian functions is also a Gaussian, with variance being the sum of the original variances:  . The product of two Gaussian probability density functions, though, is not in general a Gaussian PDF.

Taking the Fourier transform (unitary, angular frequency convention) of a Gaussian function with parameters a = 1, b = 0 and c yields another Gaussian function, with parameters  , b = 0 and  .[2] So in particular the Gaussian functions with b = 0 and   are kept fixed by the Fourier transform (they are eigenfunctions of the Fourier transform with eigenvalue 1). A physical realization is that of the diffraction pattern: for example, a photographic slide whose transmittance has a Gaussian variation is also a Gaussian function.

The fact that the Gaussian function is an eigenfunction of the continuous Fourier transform allows us to derive the following interesting[clarification needed] identity from the Poisson summation formula:

 

Integral of a Gaussian functionEdit

The integral of an arbitrary Gaussian function is

 

An alternative form is

 

where f must be strictly positive for the integral to converge.

ProofEdit

The integral

 

for some real constants a, b, c > 0 can be calculated by putting it into the form of a Gaussian integral. First, the constant a can simply be factored out of the integral. Next, the variable of integration is changed from x to y = x - b.

 

and then to  

 

Then, using the Gaussian integral identity

 

we have

 

Two-dimensional Gaussian functionEdit

 
Gaussian curve with a 2-dimensional domain

In two dimensions, the power to which e is raised in the Gaussian function is any negative-definite quadratic form. Consequently, the level sets of the Gaussian will always be ellipses.

A particular example of a two-dimensional Gaussian function is

 

Here the coefficient A is the amplitude, xo,yo is the center and σx, σy are the x and y spreads of the blob. The figure on the right was created using A = 1, xo = 0, yo = 0, σx = σy = 1.

The volume under the Gaussian function is given by

 

In general, a two-dimensional elliptical Gaussian function is expressed as

 

where the matrix

 

is positive-definite.

Using this formulation, the figure on the right can be created using A = 1, (xo, yo) = (0, 0), a = c = 1/2, b = 0.

Meaning of parameters for the general equationEdit

For the general form of the equation the coefficient A is the height of the peak and (xoyo) is the center of the blob.

If we set

 


 


 

then we rotate the blob by a clockwise angle   (for counterclockwise rotation invert the signs in the b coefficient). This can be seen in the following examples:

 
 
 
 
 
 

Using the following Octave code one can easily see the effect of changing the parameters

A = 1;
x0 = 0; y0 = 0;

sigma_x = 1;
sigma_y = 2;

[X, Y] = meshgrid(-5:.1:5, -5:.1:5);

for theta = 0:pi/100:pi
    a = cos(theta)^2/(2*sigma_x^2) + sin(theta)^2/(2*sigma_y^2);
    b = -sin(2*theta)/(4*sigma_x^2) + sin(2*theta)/(4*sigma_y^2);
    c = sin(theta)^2/(2*sigma_x^2) + cos(theta)^2/(2*sigma_y^2);

    Z = A*exp( - (a*(X-x0).^2 + 2*b*(X-x0).*(Y-y0) + c*(Y-y0).^2)) ;

surf(X,Y,Z);shading interp;view(-36,36)
waitforbuttonpress
end

Such functions are often used in image processing and in computational models of visual system function—see the articles on scale space and affine shn.

Also see multivariate normal distribution.

Higher-order Gaussian or super-Gaussian functionEdit

A more general formulation of a Gaussian function with a flat-top and Gaussian fall-off can be taken by raising the content of the exponent to a power,  :

  This function is known as a super-Gaussian function and is often used for Gaussian beam formulation.[3] In a two-dimensional formulation, a Gaussian function along   and   can be combined with potentially different   and   to form an elliptical Gaussian distribution,  or a rectangular Gaussian distribution,  .[4]

Multi-dimensional Gaussian functionEdit

In an  -dimensional space a Gaussian function can be defined as

 

where   is a column of   coordinates,   is a positive-definite   matrix, and   denotes matrix transposition.

The integral of this Gaussian function over the whole  -dimensional space is given as

 

It can be easily calculated by diagonalizing the matrix   and changing the integration variables to the eigenvectors of  .

More generally a shifted Gaussian function is defined as

 

where   is the shift vector and the matrix   can be assumed to be symmetric,  , and positive-definite. The following integrals with this function can be calculated with the same technique,

 

Gaussian profile estimationEdit

A number of fields such as stellar photometry, Gaussian beam characterization, and emission/absorption line spectroscopy work with sampled Gaussian functions and need to accurately estimate the height, position, and width parameters of the function. These are  ,  , and   for a 1D Gaussian function,  ,  , and   for a 2D Gaussian function. The most common method for estimating the profile parameters is to take the logarithm of the data and fit a parabola to the resulting data set.[5] While this provides a simple least squares fitting procedure, the resulting algorithm is biased by excessively weighting small data values, and this can produce large errors in the profile estimate. One can partially compensate for this through weighted least squares estimation, in which the small data values are given small weights, but this too can be biased by allowing the tail of the Gaussian to dominate the fit. In order to remove the bias, one can instead use an iterative procedure in which the weights are updated at each iteration (see Iteratively reweighted least squares).[5]

Once one has an algorithm for estimating the Gaussian function parameters, it is also important to know how accurate those estimates are. While an estimation algorithm can provide numerical estimates for the variance of each parameter (i.e. the variance of the estimated height, position, and width of the function), one can use Cramér–Rao bound theory to obtain an analytical expression for the lower bound on the parameter variances, given some assumptions about the data.[6][7]

  1. The noise in the measured profile is either i.i.d. Gaussian, or the noise is Poisson-distributed.
  2. The spacing between each sampling (i.e. the distance between pixels measuring the data) is uniform.
  3. The peak is "well-sampled", so that less than 10% of the area or volume under the peak (area if a 1D Gaussian, volume if a 2D Gaussian) lies outside the measurement region.
  4. The width of the peak is much larger than the distance between sample locations (i.e. the detector pixels must be at least 5 times smaller than the Gaussian FWHM).

When these assumptions are satisfied, the following covariance matrix K applies for the 1D profile parameters  ,  , and   under i.i.d. Gaussian noise and under Poisson noise:[6]

 

where   is the width of the pixels used to sample the function,   is the quantum efficiency of the detector, and   indicates the standard deviation of the measurement noise. Thus, the individual variances for the parameters are, in the Gaussian noise case,

 

and in the Poisson noise case,

 

For the 2D profile parameters giving the amplitude  , position  , and width   of the profile, the following covariance matrices apply:[7]

 
 

where the individual parameter variances are given by the diagonal elements of the covariance matrix.

Discrete GaussianEdit

 
The discrete Gaussian kernel (solid), compared with the sampled Gaussian kernel (dashed) for scales  

One may ask for a discrete analog to the Gaussian; this is necessary in discrete applications, particularly digital signal processing. A simple answer is to sample the continuous Gaussian, yielding the sampled Gaussian kernel. However, this discrete function does not have the discrete analogs of the properties of the continuous function, and can lead to undesired effects, as described in the article scale space implementation.

An alternative approach is to use discrete Gaussian kernel:[8]

 

where   denotes the modified Bessel functions of integer order.

This is the discrete analog of the continuous Gaussian in that it is the solution to the discrete diffusion equation (discrete space, continuous time), just as the continuous Gaussian is the solution to the continuous diffusion equation.[9]

ApplicationsEdit

Gaussian functions appear in many contexts in the natural sciences, the social sciences, mathematics, and engineering. Some examples include:

See alsoEdit

ReferencesEdit

  1. ^ Using the logarithmic identity  , this expression can be transformed to  .
  2. ^ Weisstein, Eric W. "Fourier Transform – Gaussian". MathWorld. Retrieved 19 December 2013. 
  3. ^ Parent, A., M. Morin, and P. Lavigne. "Propagation of super-Gaussian field distributions." Optical and quantum electronics 24.9 (1992): S1071-S1079.
  4. ^ "GLAD optical software commands manual, Entry on GAUSSIAN command" (PDF). Applied Optics Research. 2016-12-15. 
  5. ^ a b Hongwei Guo, "A simple algorithm for fitting a Gaussian function," IEEE Sign. Proc. Mag. 28(9): 134-137 (2011).
  6. ^ a b N. Hagen, M. Kupinski, and E. L. Dereniak, "Gaussian profile estimation in one dimension," Appl. Opt. 46:5374–5383 (2007)
  7. ^ a b N. Hagen and E. L. Dereniak, "Gaussian profile estimation in two dimensions," Appl. Opt. 47:6842–6851 (2008)
  8. ^ Lindeberg, T., "Scale-space for discrete signals," PAMI(12), No. 3, March 1990, pp. 234–254.
  9. ^ Campbell, J, 2007, The SMM model as a boundary value problem using the discrete diffusion equation, Theor Popul Biol. 2007 Dec;72(4):539–46.
  10. ^ Honarkhah, M and Caers, J, 2010, Stochastic Simulation of Patterns Using Distance-Based Pattern Modeling, Mathematical Geosciences, 42: 487–517

External linksEdit