Autocorrelation

From Wikipedia, the free encyclopedia
  (Redirected from Auto-correlation)
Jump to: navigation, search
Above: A plot of a series of 100 random numbers concealing a sine function. Below: The sine function revealed in a correlogram produced by autocorrelation.
Visual comparison of convolution, cross-correlation and autocorrelation.

Autocorrelation, also known as serial correlation, is the cross-correlation of a signal with itself. Informally, it is the similarity between observations as a function of the time lag between them. It is a mathematical tool for finding repeating patterns, such as the presence of a periodic signal obscured by noise, or identifying the missing fundamental frequency in a signal implied by its harmonic frequencies. It is often used in signal processing for analyzing functions or series of values, such as time domain signals.

Definitions[edit]

Different fields of study define autocorrelation differently, and not all of these definitions are equivalent. In some fields, the term is used interchangeably with autocovariance.

Statistics[edit]

In statistics, the autocorrelation of a random process describes the correlation between values of the process at different times, as a function of the two times or of the time lag. Let X be some repeatable process, and i be some point in time after the start of that process. (i may be an integer for a discrete-time process or a real number for a continuous-time process.) Then Xi is the value (or realization) produced by a given run of the process at time i. Suppose that the process is further known to have defined values for mean μi and variance σi2 for all times i. Then the definition of the autocorrelation between times s and t is


R(s,t) = \frac{\operatorname{E}[(X_t - \mu_t)(X_s - \mu_s)]}{\sigma_t\sigma_s}\, ,

where "E" is the expected value operator. Note that this expression is not well-defined for all time series or processes, because the variance may be zero (for a constant process) or infinite. If the function R is well-defined, its value must lie in the range [−1, 1], with 1 indicating perfect correlation and −1 indicating perfect anti-correlation.

If Xt is a second-order stationary process then the mean μ and the variance σ2 are time-independent, and further the autocorrelation depends only on the lag between t and s: the correlation depends only on the time-distance between the pair of values but not on their position in time. This further implies that the autocorrelation can be expressed as a function of the time-lag, and that this would be an even function of the lag τ = s − t. This gives the more familiar form


R(\tau) = \frac{\operatorname{E}[(X_t - \mu)(X_{t+\tau} - \mu)]}{\sigma^2}, \,

and the fact that this is an even function can be stated as


R(\tau) = R(-\tau).\,

It is common practice in some disciplines, other than statistics and time series analysis, to drop the normalization by σ2 and use the term "autocorrelation" interchangeably with "autocovariance". However, the normalization is important both because the interpretation of the autocorrelation as a correlation provides a scale-free measure of the strength of statistical dependence, and because the normalization has an effect on the statistical properties of the estimated autocorrelations.

Signal processing[edit]

In signal processing, the above definition is often used without the normalization, that is, without subtracting the mean and dividing by the variance. When the autocorrelation function is normalized by mean and variance, it is sometimes referred to as the autocorrelation coefficient.[1]

Given a signal f(t), the continuous autocorrelation R_{ff}(\tau) is most often defined as the continuous cross-correlation integral of f(t) with itself, at lag \tau.

R_{ff}(\tau) = (f(t) * \overline{f}(-t))(\tau) = \int_{-\infty}^\infty f(t+\tau)\overline{f}(t)\, {\rm d}t = \int_{-\infty}^\infty f(t)\overline{f}(t-\tau)\, {\rm d}t

where \overline{f} represents the complex conjugate and * represents convolution. For a real function, \overline{f} = f.

The discrete autocorrelation R at lag j for a discrete signal x_n is

R_{xx}(j) = \sum_n x_n\,\overline{x}_{n-j}.

The above definitions work for signals that are square integrable, or square summable, that is, of finite energy. Signals that "last forever" are treated instead as random processes, in which case different definitions are needed, based on expected values. For wide-sense-stationary random processes, the autocorrelations are defined as

R_{ff}(\tau) = \operatorname{E}\left[f(t)\overline{f}(t-\tau)\right]
R_{xx}(j) = \operatorname{E}\left[x_n\,\overline{x}_{n-j}\right].

For processes that are not stationary, these will also be functions of t, or n.

For processes that are also ergodic, the expectation can be replaced by the limit of a time average. The autocorrelation of an ergodic process is sometimes defined as or equated to[1]

R_{ff}(\tau) = \lim_{T \rightarrow \infty} \frac{1}{T} \int_0^T f(t+\tau)\overline{f}(t)\, {\rm d}t
R_{xx}(j) = \lim_{N \rightarrow \infty} \frac{1}{N} \sum_{n=0}^{N-1}x_n\,\overline{x}_{n-j}.

These definitions have the advantage that they give sensible well-defined single-parameter results for periodic functions, even when those functions are not the output of stationary ergodic processes.

Alternatively, signals that last forever can be treated by a short-time autocorrelation function analysis, using finite time integrals. (See short-time Fourier transform for a related process.)

Multi-dimensional autocorrelation is defined similarly. For example, in three dimensions the autocorrelation of a square-summable discrete signal would be

R(j,k,\ell) = \sum_{n,q,r} x_{n,q,r}\,x_{n-j,q-k,r-\ell}.

When mean values are subtracted from signals before computing an autocorrelation function, the resulting function is usually called an auto-covariance function.

Properties[edit]

In the following, we will describe properties of one-dimensional autocorrelations only, since most properties are easily transferred from the one-dimensional case to the multi-dimensional cases.

  • A fundamental property of the autocorrelation is symmetry, R(i) = R(-i), which is easy to prove from the definition. In the continuous case,
the autocorrelation is an even function
R_f(-\tau) = R_f(\tau)\, when f is a real function,
and the autocorrelation is a Hermitian function
R_f(-\tau) = R_f^*(\tau)\, when f is a complex function.
  • The continuous autocorrelation function reaches its peak at the origin, where it takes a real value, i.e. for any delay \tau, |R_f(\tau)| \leq R_f(0). This is a consequence of the Rearrangement inequality. The same result holds in the discrete case.
  • The autocorrelation of a periodic function is, itself, periodic with the same period.
  • The autocorrelation of the sum of two completely uncorrelated functions (the cross-correlation is zero for all \tau) is the sum of the autocorrelations of each function separately.
  • Since autocorrelation is a specific type of cross-correlation, it maintains all the properties of cross-correlation.
  • The autocorrelation of a continuous-time white noise signal will have a strong peak (represented by a Dirac delta function) at \tau=0 and will be absolutely 0 for all other \tau.
R(\tau) = \int_{-\infty}^\infty S(f) e^{j 2 \pi f \tau} \, {\rm d}f
S(f) = \int_{-\infty}^\infty R(\tau) e^{- j 2 \pi f \tau} \, {\rm d}\tau.
  • For real-valued functions, the symmetric autocorrelation function has a real symmetric transform, so the Wiener–Khinchin theorem can be re-expressed in terms of real cosines only:
R(\tau) = \int_{-\infty}^\infty S(f) \cos(2 \pi f \tau) \, {\rm d}f
S(f) = \int_{-\infty}^\infty R(\tau) \cos(2 \pi f \tau) \, {\rm d}\tau.

Efficient computation[edit]

For data expressed as a discrete sequence, it is frequently necessary to compute the autocorrelation with high computational efficiency. A brute force method based on the signal processing definition R_{xx}(j) = \sum_n x_n\,\overline{x}_{n-j} can be used when the signal size is small. For example, to calculate the autocorrelation of the real signal sequence x = (2,3,1) (i.e. x(0)=2, x(1)=3, x(2)=1, and x(i)=0 for all other values of i) by hand, we first recognize that the definition just given is nothing but the usual multiplication with right shifts, where each vertical addition gives the autocorrelation for particular lag values:

          2  3  1
       ×  2  3  1
       ------------------
          2  3  1
             6  9  3
                4  6  2
       ------------------
          2  9 14  9  2

Thus the required autocorrelation sequence is R_{xx}=(2,9,14,9,2), where R_{xx}(0)=14, R_{xx}(-1)= R_{xx}(1)=9, and R_{xx}(-2)= R_{xx}(2)=2, the autocorrelation for other lag values being zero. In this calculation we do not perform the carry-over operation during addition as is usual in normal multiplication. Note that we can halve the number of operations required by exploiting the inherent symmetry of the autocorrelation. If the signal happens to be periodic, i.e. x=(...,2,3,1,2,3,1,...), then we get a circular autocorrelation (similar to circular convolution) where the left and right tails of the previous autocorrelation sequence will overlap and give R_{xx}=(...,14,11,11,14,11,11,...) which has the same period as the signal sequence x.

While the brute force algorithm is order n2, several efficient algorithms exist which can compute the autocorrelation in order n log(n). For example, the Wiener–Khinchin theorem allows computing the autocorrelation from the raw data X(t) with two Fast Fourier transforms (FFT):[2]

FR(f) = FFT[X(t)]
S(f) = FR(f) FR*(f)
R(τ) = IFFT[S(f)]

where IFFT denotes the inverse Fast Fourier transform. The asterisk denotes complex conjugate.

Alternatively, a multiple τ correlation can be performed by using brute force calculation for low τ values, and then progressively binning the X(t) data with a logarithmic density to compute higher values, resulting in the same n log(n) efficiency, but with lower memory requirements.[3][4]

Estimation[edit]

For a discrete process with known mean and variance for which we observe n observations \{X_1,\,X_2,\,\ldots,\,X_n\}, an estimate of the autocorrelation may be obtained as

 \hat{R}(k)=\frac{1}{(n-k) \sigma^2} \sum_{t=1}^{n-k} (X_t-\mu)(X_{t+k}-\mu)

for any positive integer k<n. When the true mean \mu and variance \sigma^2 are known, this estimate is unbiased. If the true mean and variance of the process are not known there are a several possibilities:

  • If \mu and \sigma^2 are replaced by the standard formulae for sample mean and sample variance, then this is a biased estimate.
  • A periodogram-based estimate replaces n-k in the above formula with n. This estimate is always biased; however, it usually has a smaller mean square error.[5][6]
  • Other possibilities derive from treating the two portions of data \{X_1,\,X_2,\,\ldots,\,X_{n-k}\} and \{X_{k+1},\,X_{k+2},\,\ldots,\,X_n\} separately and calculating separate sample means and/or sample variances for use in defining the estimate.

The advantage of estimates of the last type is that the set of estimated autocorrelations, as a function of k, then form a function which is a valid autocorrelation in the sense that it is possible to define a theoretical process having exactly that autocorrelation. Other estimates can suffer from the problem that, if they are used to calculate the variance of a linear combination of the X's, the variance calculated may turn out to be negative.

Regression analysis[edit]

In regression analysis using time series data, autocorrelation of the errors is a problem. Autocorrelation of the errors, which themselves are unobserved, can generally be detected because it produces autocorrelation in the observable residuals. (Errors are also known as "error terms" in econometrics.)

Autocorrelation violates the ordinary least squares (OLS) assumption that the error terms are uncorrelated, meaning that the Gauss Markov theorem does not apply, and that OLS estimators are no longer the Best Linear Unbiased Estimators (BLUE). While it does not bias the OLS coefficient estimates, the standard errors tend to be underestimated (and the t-scores overestimated) when the autocorrelations of the errors at low lags are positive.

The traditional test for the presence of first-order autocorrelation is the Durbin–Watson statistic or, if the explanatory variables include a lagged dependent variable, Durbin's h statistic. The Durbin-Watson can be linearly mapped however to the Pearson correlation between values and their lags.[7] A more flexible test, covering autocorrelation of higher orders and applicable whether or not the regressors include lags of the dependent variable, is the Breusch–Godfrey test. This involves an auxiliary regression, wherein the residuals obtained from estimating the model of interest are regressed on (a) the original regressors and (b) k lags of the residuals, where k is the order of the test. The simplest version of the test statistic from this auxiliary regression is TR2, where T is the sample size and R2 is the coefficient of determination. Under the null hypothesis of no autocorrelation, this statistic is asymptotically distributed as \chi^2 with k degrees of freedom.

Responses to nonzero autocorrelation include generalized least squares and the Newey–West HAC estimator (Heteroskedasticity and Autocorrelation Consistent).[8]

Applications[edit]

  • Autocorrelation is used to analyze dynamic light scattering data, which notably enables determination of the particle size distributions of nanometer-sized particles or micelles suspended in a fluid. A laser shining into the mixture produces a speckle pattern that results from the motion of the particles. Autocorrelation of the signal can be analyzed in terms of the diffusion of the particles. From this, knowing the viscosity of the fluid, the sizes of the particles can be calculated.
  • The small-angle X-ray scattering intensity of a nanostructured system is the Fourier transform of the spatial autocorrelation function of the electron density.
  • In optics, normalized autocorrelations and cross-correlations give the degree of coherence of an electromagnetic field.
  • Autocorrelation in space rather than time, via the Patterson function, is used by X-ray diffractionists to help recover the "Fourier phase information" on atom positions not available through diffraction alone.
  • In statistics, spatial autocorrelation between sample locations also helps one estimate mean value uncertainties when sampling a heterogeneous population.
  • The SEQUEST algorithm for analyzing mass spectra makes use of autocorrelation in conjunction with cross-correlation to score the similarity of an observed spectrum to an idealized spectrum representing a peptide.
  • In Astrophysics, auto-correlation is used to study and characterize the spatial distribution of galaxies in the Universe and in multi-wavelength observations of Low Mass X-ray Binaries.
  • In panel data, spatial autocorrelation refers to correlation of a variable with itself through space.
  • In analysis of Markov chain Monte Carlo data, autocorrelation must be taken into account for correct error determination.

See also[edit]

References[edit]

  1. ^ a b Dunn, Patrick F. (2005). Measurement and Data Analysis for Engineering and Science. New York: McGraw–Hill. ISBN 0-07-282538-3. 
  2. ^ Box, G. E. P.; Jenkins, G. M.; Reinsel, G. C. (1994). Time Series Analysis: Forecasting and Control (3rd ed.). Upper Saddle River, NJ: Prentice–Hall. ISBN 0130607746. [page needed]
  3. ^ Frenkel, D.; Smit, B. (2002). "chap. 4.4.2". Understanding Molecular Simulation (2nd ed.). London: Academic Press. ISBN 0122673514. 
  4. ^ Colberg, P.; Höfling, F. (2011). "Highly accelerated simulations of glassy dynamics using GPUs: caveats on limited floating-point precision". Comp. Phys. Comm. 182 (5): 1120–1129. doi:10.1016/j.cpc.2011.01.009. 
  5. ^ Priestley, M. B. (1982). Spectral analysis and time series. London, New York: Academic Press. ISBN 0125649010. 
  6. ^ Percival, Donald B.; Andrew T. Walden (1993). Spectral Analysis for Physical Applications: Multitaper and Conventional Univariate Techniques. Cambridge University Press. pp. 190–195. ISBN 0-521-43541-2. 
  7. ^ http://statisticalideas.blogspot.com/2014/05/serial-correlation-techniques.html
  8. ^ Baum, Christopher F. (2006). An Introduction to Modern Econometrics Using Stata. Stata Press. ISBN 1-59718-013-0. 
  9. ^ Tyrangiel, Josh (2009-02-05). "Auto-Tune: Why Pop Music Sounds Perfect". Time Magazine. 

Further reading[edit]

  • Verbeek, Marno (2012). A Guide to Modern Econometrics (Fourth ed.). Chichester: John Wiley. pp. 112–116. ISBN 978-1-119-95167-4. 

External links[edit]