Jump to content

Refinable function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by HenningThielemann (talk | contribs) at 17:27, 29 March 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A refinable function is a function which fulfills the following self-similarity condition:

This condition is called refinement equation or two-scale equation.

Using the convolution * of a function with a discrete mask and the dilation operator you can write more concisely:

It means that the you obtain the function, again, if you convolve the function with a discrete mask and then scale it back. There is an obvious similarity to iterated_function_systems.

The operator Failed to parse (unknown function "\mapto"): {\displaystyle \phi\mapto D_{1/2} (a * \phi)} is linear. A refinable function is an eigenfunction of that operator. Its absolute value is not defined. That is, if is a refinable function, then for every the function is refinable, too.

These functions play a fundamental role in wavelet theory as scaling functions.

Properties

Values at integral points

Solve an eigenvector-eigenvalue problem.

Scalar products

Integral points of the autocorrelation of the function.

Smoothness

Villemoes machine