- Refinable function
In
mathematics , in the area ofwavelet analysis, a refinable function is a function which fulfills some kind of self-similarity. A function is called refinable with respect to the mask if: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 you can write more concisely::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 toiterated function systems andde Rham curve s.The operator 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
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 shall have finite supportand the function values at integer arguments are wanted,then the two scale equation becomes a system of
simultaneous linear equations .Let be the minimum index and be the maximum indexof non-zero elements of , then one obtains:.Using the discretization operator, call it here, and the
transfer matrix of , named , this can be written concisely as:.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 has the eigenvalue 1.Values at dyadic points
From the values at integral points you can derive the values at dyadic points,i.e. points of the form , with and .:::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 .By replacing iteratedly by you get the values at all finer scales.:Convolution
If is refinable with respect to ,and is refinable with respect to ,then is refinable with respect to .
calar products
Computing the scalar products of two refinable functions and their translates can be broken down to the two above properties.Let be the translation operator. It holds:where is the adjoint of with respect to
convolution ,i.e. is the flipped andcomplex conjugate d version of ,i.e. .Because of the above property, is refinable with respect to ,and its values at integral arguments can be computed as eigenvectors of the transfer matrix.
moothness
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 machineone can compute the smoothness of refinable functions in terms of Sobolev exponents.
In a first step the refinement mask is divided into a filter , which is a power of the smoothness factor (this is a binomial mask) and a rest .Roughly spoken, the binomial mask makes smoothness and represents a fractal component, which reduces smoothness again.Now the Sobolev exponent is roughlythe order of minus
logarithm of thespectral radius of .Generalization
The concept of refinable functions can be generalized to functions of more than one variable,that is functions from .The most simple generalization is about
tensor product s.If and are refinable with respect to and , respectively, then is refinable with respect to .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 of integers.In order to let the scheme work, the absolute values of all eigenvalues of must be larger than one.(Maybe it also suffices that .)
Formally the two-scale equation does not change very much::
:
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.
* Lars Villemoes: [http://www.math.kth.se/~larsv/paper3.ps.Z Sobolev regularity of wavelets and stability of iterated filter banks]
Wikimedia Foundation. 2010.