You get a bonus - 1 coin for daily activity. Now you have 1 coin

The Karhunen-Loève Theorem

Lecture



An important fundamental question in the theory of discretization is the question of the volume of the discrete description of signals, that is, the number The Karhunen-Loève Theorem of basis functions used for the representation:

The Karhunen-Loève Theorem.

To find the optimal basis, one must define the class of signals for which it is being sought, and also specify the required reconstruction accuracy for that class. Under a statistical approach to describing signals, the optimal The Karhunen-Loève Theorem — dimensional basis for representing individual signal realizations is usually taken to be the basis for which the error norm, averaged over the ensemble of realizations, is minimal. In this case the necessary and sufficient conditions for the minimum error norm of a signal representation as a sum of basis functions are given by the Karhunen-Loève theorem.

Popular formulation

The minimum value of the error norm for representing signals on an interval of length The Karhunen-Loève Theorem is achieved when the basis used consists of the eigenfunctions of the operator whose kernel is the correlation function of the signals The Karhunen-Loève Theorem:

The Karhunen-Loève Theorem,

corresponding to the The Karhunen-Loève Theorem largest eigenvalues. In this case the error norm equals:

The Karhunen-Loève Theorem.

Such an expansion is a Karhunen-Loève expansion .

Application

In the theory of random processes, the Karhunen-Loève theorem (named after Kari Karhunen and Michel Loève) — is a representation of a random process as an infinite linear combination of orthogonal functions, analogous to a Fourier series representation — the sequential representation of functions on a bounded interval. Unlike a Fourier series, where the coefficients are real numbers and the representation basis consists of sinusoidal functions (that is, of sine and cosine functions of different frequencies), the coefficients in the Karhunen-Loève theorem — are random variables, and the representation basis depends on the process. The orthogonal basis functions used in this representation are determined by the covariance function of the process. If we regard a stochastic process as a random function F, that is, a process in which the function on the interval [a, b] takes the value F, then this theorem can be viewed as a random orthonormal expansion of F.

A centered random process {Xt}t ∈ [a, b] (where centered means that the expectations E(Xt) exist and equal zero for all values of the parameter t in [a, b]), satisfying a technical continuity condition, admits an expansion of the following form:

The Karhunen-Loève Theorem

where Zk — are mutually uncorrelated random variables and the functions ek — are continuous real-valued functions on [a, b], orthogonal in L² [a, b]. In the case of a non-centered process, an analogous expansion holds, obtained by expanding the mean function in the basis ek.

If the process The Karhunen-Loève Theorem is Gaussian, then the random variables Zk — are also Gaussian and independent. This result generalizes the Karhunen-Loève transform. An important example of a centered random process on the interval [0,1] is the Wiener process, and the Karhunen-Loève theorem can be used to obtain its canonical orthogonal representation. In this case the expansion consists of sinusoidal functions.

The expansions given above are also known as Karhunen-Loève expansions or decomposition (the empirical version, that is, with coefficients derived from the original numerical data), as principal component analysis, proper orthogonal decomposition, or the Hotelling transform.

Formulation

Let us state the result in terms of complex-valued stochastic processes. The results can be applied to real-valued processes without modification, recalling that the complex conjugate of a real number coincides with the number itself.

For random elements X and Y, the inner product is defined by the formula

The Karhunen-Loève Theorem

where * denotes the complex conjugation operation.

Second-order statistics

The inner product is well-defined if both The Karhunen-Loève Theorem and The Karhunen-Loève Theorem have finite second moments, or, equivalently, if they are both square-integrable. Note that the inner product is related to the covariance and correlation. In particular, for random variables with zero mean, the covariance and the inner product coincide. The autocovariance function The Karhunen-Loève Theorem

The Karhunen-Loève Theorem

The Karhunen-Loève Theorem

The Karhunen-Loève Theorem

The Karhunen-Loève Theorem

If the process {Xt}t is centered, then

The Karhunen-Loève Theorem

for all t. Thus the autocovariance KXX equals the autocorrelation RXX:

The Karhunen-Loève Theorem

Note that if {Xt}t is centered and t1, ≤ t2, …, ≤ tN are points on the interval [a, b], then it follows that

The Karhunen-Loève Theorem

Statement of the theorem

Theorem. Consider a centered random process The Karhunen-Loève Theorem, indexed by The Karhunen-Loève Theorem on the interval The Karhunen-Loève Theorem with covariance function The Karhunen-Loève Theorem. Suppose that the covariance function The Karhunen-Loève Theorem is jointly continuous in the variables The Karhunen-Loève Theorem. Then The Karhunen-Loève Theorem — is a positive-definite kernel, and by Mercer's theorem the integral operator The Karhunen-Loève Theorem on The Karhunen-Loève Theorem (close to Lebesgue measure on The Karhunen-Loève Theorem) has an orthonormal basis of eigenvectors. Let The Karhunen-Loève Theorem be the eigenvectors of The Karhunen-Loève Theorem corresponding to nonzero eigenvalues, and

The Karhunen-Loève Theorem

Then The Karhunen-Loève Theorem — are centered orthogonal random variables, and

The Karhunen-Loève Theorem

the series converges in mean square, and also uniformly in The Karhunen-Loève Theorem. Moreover

The Karhunen-Loève Theorem

where The Karhunen-Loève Theorem is the eigenvalue corresponding to the eigenvector The Karhunen-Loève Theorem.

Cauchy sums

In the statement of the theorem, the integral in the definition of The Karhunen-Loève Theorem can be understood as the mean limit of Cauchy sums of random variables

The Karhunen-Loève Theorem

where

The Karhunen-Loève Theorem

Special case: Gaussian distribution

Since the mean-square limit of jointly Gaussian random variables is Gaussian, and jointly Gaussian (centered) random variables are independent if and only if they are orthogonal, we may also conclude:

Theorem. The random variables The Karhunen-Loève Theorem have a Gaussian distribution and are independent if the original process {Xt}t is also Gaussian.

In the Gaussian case, since the random variables The Karhunen-Loève Theorem are independent, we can be certain that:

The Karhunen-Loève Theorem

almost surely.

Note that, generalizing Mercer's theorem, we can replace the interval The Karhunen-Loève Theorem with other compact spaces The Karhunen-Loève Theorem , and the Lebesgue measure on The Karhunen-Loève Theorem — with a Borel measure supported on The Karhunen-Loève Theorem.

Wiener process

The Wiener process in the theory of random processes — is a mathematical model of Brownian motion, or a continuous-time random walk. Here we define it as a centered Gaussian process B(t) with covariance function

The Karhunen-Loève Theorem

It is easy to see that the eigenvectors of the covariance are

The Karhunen-Loève Theorem

and the corresponding eigenvalues are

The Karhunen-Loève Theorem

This allows us to obtain the following representation of the Wiener process:

Theorem. There exists a sequence {Wi}i of independent Gaussian random variables with zero mean and unit variance such that

The Karhunen-Loève Theorem

The convergence is uniform in t in the L² norm, so that

The Karhunen-Loève Theorem

uniformly in t.

Applications

It has been suggested that the SETI project should use Karhunen-Loève transforms to detect signals with a very broad spectrum. Similarly, adaptive optics systems sometimes use Karhunen-Loève functions to reconstruct information about the wavefront phase. (Dai 1996, JOSA A).

See also

  • Principal component method
  • Kohonen neural network
  • Polynomial chaos (Eng.)

Comments

To leave a comment

If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Lectures and tutorial on "probabilistic processes"

Terms: probabilistic processes