Refinable function

From Wikipedia, the free encyclopedia

In mathematics, in the area of wavelet analysis, a refinable function is a function which fulfills some kind of self-similarity. A function $\varphi$ is called refinable with respect to the mask $h$ if

$\varphi(x)=2\cdot\sum_{k=0}^{N-1} h_k\cdot\varphi(2\cdot x-k)$

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

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

$\varphi=2\cdot D_{1/2} (h * \varphi)$

It means that 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 and de Rham curves.

The operator $\varphi\mapsto 2\cdot D_{1/2} (h * \varphi)$ is linear. A refinable function is an eigenfunction of that operator. Its absolute value is not defined. That is, if $\varphi$ is a refinable function, then for every $c$ the function $c\cdot\varphi$ is refinable, too.

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

1 Properties
2 Generalization
3 References

[edit] Properties

[edit] Values at integral points

A refinable function is defined only implicitly. It may also be that there are several functions which are refinable with respect to the same mask. If $\varphi$ shall have finite support and the function values at integer arguments are wanted, then the two scale equation becomes a system of simultaneous linear equations.

Let $a$ be the minimum index and $b$ be the maximum index of non-zero elements of $h$ , then one obtains

$\begin{pmatrix} \varphi(a)\\ \varphi(a+1)\\ \vdots\\ \varphi(b) \end{pmatrix} = \begin{pmatrix} h_{a } & & & & & \\ h_{a+2} & h_{a+1} & h_{a } & & & \\ h_{a+4} & h_{a+3} & h_{a+2} & h_{a+1} & h_{a } & \\ \ddots & \ddots & \ddots & \ddots & \ddots & \ddots \\ & h_{b } & h_{b-1} & h_{b-2} & h_{b-3} & h_{b-4} \\ & & & h_{b } & h_{b-1} & h_{b-2} \\ & & & & & h_{b } \end{pmatrix} \cdot \begin{pmatrix} \varphi(a)\\ \varphi(a+1)\\ \vdots\\ \varphi(b) \end{pmatrix}$ .

Using the discretization operator, call it $Q$ here, and the transfer matrix of $h$ , named $T h$ , this can be written concisely as

$Q\varphi = T_h \cdot Q\varphi$ .

This is again a fixed-point equation. But this one can now be considered as an eigenvector-eigenvalue problem. That is, a finitely supported refinable function exists only (but not necessarily), if $T h$ has the eigenvalue 1.

[edit] Values at dyadic points

From the values at integral points you can derive the values at dyadic points, i.e. points of the form $k\cdot 2^{-j}$ , with $k\in\mathbb{Z}$ and $j\in\mathbb{N}$ .

$\varphi = D_{1/2} (2\cdot (h * \varphi))$

$D_2 \varphi = 2\cdot (h * \varphi)$

$Q(D_2 \varphi) = Q(2\cdot (h * \varphi)) = 2\cdot (h * Q\varphi)$

The star denotes the convolution of a discrete filter with a function. With this step you can compute the values at points of the form $\frac{k}{2}$ . By replacing iteratedly $\varphi$ by $D_2 \varphi$ you get the values at all finer scales.

$Q(D_{2^{j+1}}\varphi) = 2\cdot (h * Q(D_{2^j}\varphi))$

[edit] Convolution

If $\varphi$ is refinable with respect to $h$ , and $ψ$ is refinable with respect to $g$ , then $\varphi*\psi$ is refinable with respect to $h * g$ .

[edit] Scalar products

Computing the scalar products of two refinable functions and their translates can be broken down to the two above properties. Let $T$ be the translation operator. It holds

$\langle \varphi, T_k \psi\rangle = \langle \varphi * \psi^*, T_k\delta\rangle = (\varphi*\psi^*)(k)$

where $ψ *$ is the adjoint of $ψ$ with respect to convolution, i.e. $ψ *$ is the flipped and complex conjugated version of $ψ$ , i.e. $\psi^*(t) = \overline{\psi(-t)}$ .

Because of the above property, $\varphi*\psi^*$ is refinable with respect to $h * g *$ , and its values at integral arguments can be computed as eigenvectors of the transfer matrix.

[edit] Smoothness

A refinable function usually has a fractal shape. The design of continuous or smooth refinable functions is not obvious. Before dealing with forcing smoothness it is necessary to measure smoothness of refinable functions. Using the Villemoes machine one can compute the smoothness of refinable functions in terms of Sobolev exponents.

In a first step the refinement mask $h$ is divided into a filter $b$ , which is a power of the smoothness factor $(1,1)$ (this is a binomial mask) and a rest $q$ . Roughly spoken, the binomial mask $b$ makes smoothness and $q$ represents a fractal component, which reduces smoothness again. Now the Sobolev exponent is roughly the order of $b$ minus logarithm of the spectral radius of $T_{q*q^*}$ .

[edit] Generalization

The concept of refinable functions can be generalized to functions of more than one variable, that is functions from $\R^d \to \R$ . The most simple generalization is about tensor products. If $\varphi$ and $ψ$ are refinable with respect to $h$ and $g$ , respectively, then $\varphi\otimes\psi$ is refinable with respect to $h\otimes g$ .

The scheme can be generalized even more to different scaling factors with respect to different dimensions or even to mixing data between dimensions. Instead of scaling by scalar factor like 2 the signal the coordinates are transformed by a matrix $M$ of integers. In order to let the scheme work, the absolute values of all eigenvalues of $M$ must be larger than one. (Maybe it also suffices that $| det M | > 1$ .)

Formally the two-scale equation does not change very much:

$\varphi(x)=|\det M|\cdot\sum_{k\in\Z^d} h_k\cdot\varphi(M\cdot x-k)$

$\varphi=|\det M|\cdot D_{M^{-1}} (h * \varphi)$

[edit] References

Wolfgang Dahmen and Charles A. Micchelli: Using the refinement equation for evaluating integrals of wavelets. SIAM Journal Numerical Analysis, 30:507--537, 1993.

Marc A. Berger and Yang Wang: Multidimensional two-scale dilation equations. In Charles K. Chui, editor, Wavelets: A Tutorial in Theory and Applications, volume 2 of Wavelet Analysis and its Applications, chapter IV, pages 295--323. Academic Press, Inc., 1992.