Refinable function

Refinable function

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)=2cdotsum_{k=0}^{N-1} h_kcdotvarphi(2cdot 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=2cdot 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 varphimapsto 2cdot 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 ccdotvarphi 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 varphi 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 a be the minimum index and b be the maximum indexof non-zero elements of h, then one obtains:egin{pmatrix}varphi(a)\varphi(a+1)\vdots\varphi(b)end{pmatrix}=egin{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}cdotegin{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:Qvarphi = T_h cdot Qvarphi.

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.

Values at dyadic points

From the values at integral points you can derive the values at dyadic points,i.e. points of the form kcdot 2^{-j}, with kinmathbb{Z} and jinmathbb{N}.:varphi = D_{1/2} (2cdot (h * varphi)):D_2 varphi = 2cdot (h * varphi):Q(D_2 varphi) = Q(2cdot (h * varphi)) = 2cdot (h * Qvarphi)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+1varphi) = 2cdot (h * Q(D_{2^j}varphi))

Convolution

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

calar 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 angle = langle varphi * psi^*, T_kdelta angle = (varphi*psi^*)(k)where psi^* is the adjoint of psi with respect to convolution,i.e. psi^* is the flipped and complex conjugated version of psi,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.

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 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 andq represents a fractal component, which reduces smoothness again.Now the Sobolev exponent is roughlythe order of b minus logarithm of the spectral radius of T_{q*q^*}.

Generalization

The concept of refinable functions can be generalized to functions of more than one variable,that is functions from R^d o R.The most simple generalization is about tensor products.If varphi and psi are refinable with respect to h and g, respectively, then varphiotimespsiis refinable with respect to hotimes 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|cdotsum_{kin^d} h_kcdotvarphi(Mcdot x-k)

:varphi=|det M|cdot D_{M^{-1 (h * varphi)

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.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… …   Wikipedia

  • De Rham curve — In mathematics, a de Rham curve is a certain type of fractal curve named in honor of Georges de Rham. The Cantor function, Césaro curve, Minkowski s question mark function, the Lévy C curve, the blancmange curve and the Koch curve are all special …   Wikipedia

  • Transfer matrix — The transfer matrix is a formulation in terms of a block Toeplitz matrix of the two scale equation, which characterizes refinable functions. Refinable functions play an important role in wavelet theory and finite element theory.For the mask h,… …   Wikipedia

  • Orthogonal wavelet — An orthogonal wavelet is a wavelet where the associated wavelet transform is orthogonal. That is the inverse wavelet transform is the adjoint of the wavelet transform. If this condition is weakened you may end up with biorthogonal wavelets.… …   Wikipedia

  • Resultant — In mathematics, the resultant of two monic polynomials P and Q over a field k is defined as the product:mathrm{res}(P,Q) = prod {(x,y):,P(x)=0,, Q(y)=0} (x y),,of the differences of their roots, where x and y take on values in the algebraic… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”