Jump to content

Whitening transformation

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BG19bot (talk | contribs) at 05:45, 29 March 2016 (top: WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. -). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A whitening transformation is a linear transformation that transforms a vector of random variables with a known covariance matrix into a set of new variables whose covariance is the identity matrix meaning that they are uncorrelated and all have variance 1.[1] The transformation is called "whitening" because it changes the input vector into a white noise vector.

Several other transformations are closely related to whitening: 1) the decorrelation transform removes only the correlations but leaves variances intact, 2) the standardization transform sets variances to 1 but leaves correlations intact, and 3) a coloring transformation transforms a vector of white random variables into a random vector with a specified covariance matrix.[2]

Definition

Suppose is a random (column) vector with non-singular covariance matrix and mean . Then the transformation with a whitening matrix satisfying the condition yields the whitened random vector with unit diagonal covariance.

There are infinitely many possible whitening matrices that all satisfy the above condition. Commonly used choices are (Mahalanobis or ZCA whitening), the Cholesky decomposition of (Cholesky whitening), or the eigen-system of (PCA whitening).

Kessy et al. (2015) demonstrate that optimal whitening transforms can be singled out by investigating the cross-covariance and cross-correlation of and . For example, the unique optimal whitening transformation achieving maximal component-wise correlation between original and whitened is produced by the whitening matrix where is the correlation matrix and the variance matrix.

Whitening a data matrix

Whitening a data matrix follows the same transformation as for random variables. An empirical whitening transform is obtained by estimating the covariance (e.g. by maximum likelihood) and subsequently constructing a corresponding estimated whitening matrix (e.g. by Cholesky decomposition).

See also

References

  1. ^ Kessy, A.; Lewin, A.; Strimmer, K. (2015). "Optimal whitening and decorrelation". arXiv:1512.00809. Retrieved 28 March 2016.
  2. ^ Hossain, Miliha. "Whitening and Coloring Transforms for Multivariate Gaussian Random Variables". Project Rhea. Retrieved 21 March 2016.