Abstract
Wavelet expansions are a powerful tool for constructing adaptive approximations. For this reason, they find applications in a variety of fields, from signal processing to approximation theory. Wavelets are usually derived from refinable functions, which are the solution of a recursive functional equation called the refinement equation. The analytical expression of refinable functions is known in only a few cases, so if we need to evaluate refinable functions we can make use only of the refinement equation. This is also true for the evaluation of their derivatives and integrals. In this paper, we detail a procedure for computing integrals of wavelet products exactly, up to machine precision. The efficient and accurate evaluation of these integrals is particularly required for the computation of the connection coefficients in the wavelet Galerkin method. We show the effectiveness of the procedure by evaluating the integrals of pseudo-splines.
Keywords:
wavelet; refinable function; refinement mask; pseudo-spline; wavelet Galerkin method; connection coefficients MSC:
65T60; 65N30
1. Introduction
A refinable function is defined recursively through a functional equation usually called refinement or scaling equation. In its general form, the refinement equation can be written as [1,2]
where the compactly supported real sequence , , is the refinement mask associated with and with being the dilation matrix. It is known that if
then there exists a unique distribution solution to the refinement equation such that , where denotes the Fourier transform of the function [1,3].
Refinable functions are the building blocks for the construction of wavelets. In fact, a wavelet can be derived by a refinable function as
where is the wavelet mask, which can be designed in order to obtain W satisfying prescribed properties [2,4,5,6,7].
Refinable functions and wavelets find applications in several fields. In signal and image processing, they are a well-established tool for constructing filter banks for denoising, compression, feature extractions, to name a few applications [5,6]. In geometric modeling, refinable functions give rise to efficient algorithms for constructing surfaces of arbitrary topology, with applications in industrial design, computer graphics, 3D animation [8,9]. In approximation theory, the refinement functions are used to create nested sequences of approximation spaces that can be used to construct adaptive approximations of operators for the solution of differential problems [10,11,12,13,14].
The analytic expression of refinable functions and associated wavelets is available in only a very few cases. However, they can be evaluated exactly, up to machine precision, at the M-adic points , , using recursively Equations (1) and (3), provided that the values on the integers , , are given. It is well known that the values on the integers of a refinable function and its derivatives can be obtained by solving an eigenvalue/eigenvector problem for a matrix whose entries depend only on the mask [5,15]. The aim of this paper is to describe in detail how to construct this matrix and how to obtain the values of the refinable function and its derivatives from the eigenvectors. Interestingly, the integrals of the product of refinable functions can also be evaluated exactly, up to machine precision, by solving an eigenvalue/eigenvector problem that depends only on the mask [15]. We will show how to construct the eigenvalue problem for these integrals and give some examples. Since a wavelet is a linear combination of the translates of a refinable function (see (3)), integrals of product of wavelets can be easily derived from integrals of refinable functions. We want to emphasize that the exact evaluation of integrals of refinable functions and wavelets is especially important when using adaptive wavelet methods for the solution of differential problems, for instance, for the evaluation of the connection coefficients in the wavelet Galerkin method.
The paper is organized as follows. In Section 2, we recall some basic facts about refinable functions and subdivision schemes. A subdivision scheme is a recursive algorithm constructed from the refinement mask, whose properties are closely related to the properties of the associated refinable function. In this section, we also show how to construct the eigenvalue/eigenvector problem for the exact evaluation of the values of a refinable function and of its derivatives on the integers. The core of the paper is Section 3 where we detail the procedure for the exact evaluation of integrals of products of refinable functions and of their derivatives. As an illustrative example, in Section 4, this procedure is applied to evaluate integrals of pseudo-splines. Finally, in Section 5, we discuss results and conclusions.
2. Materials and Methods
2.1. Refinable Functions and Subdivision Schemes
For the sake of simplicity, we consider the case of dyadic and isotropic dilation factor, i.e., , where E is the identity matrix. Let us denote by the refinable function associated with the mask . satisfies the refinement equation
where the refinement mask is a compactly supported real sequence. For details, we refer the reader to the monographs [4,5,6].
The existence of a unique solution to (4), as well as its properties, depend on the properties of the mask . We recall that a necessary condition for the existence of a unique solution to the refinement Equation (4) with is that the mask fulfills the basic sum rules [3]
Moreover, if is compactly supported, is compactly supported, too, with , where denotes the convex hull of its argument. In the following, we will assume that is a compactly supported and continuous refinable function.
The existence of a unique with can be related to the convergence of the associated subdivision scheme, which is defined through the refinement mask as follows [3,9].
Let be the subdivision operator acting on a sequence as
The subdivision scheme is the recursive application of the subdivision operator starting from an initial sequence , i.e.,
The subdivision scheme is convergent if for any bounded sequence there exists a uniformly continuous limit function satisfying
with for at least a starting sequence. If the subdivision scheme is convergent, there exists a unique refinable function solution to (4) that coincides with the limit function obtained when using the sequence as starting sequence, i.e.,
where , , with .
On the other hand, if is -stable, i.e., the stability estimate
holds for some positive constant C independent of , then the subdivision scheme is convergent [3].
Assuming that , by differentiating (4), we obtain the refinement equation for the partial derivatives , , i.e.,
where
Derivatives of Univariate Refinable Functions
In the univariate case (), the sum rules (5) imply that the mask symbol, i.e., the z-transform
can be factorized as , where the difference symbol
is a Laurent polynomial such that . It can be shown [3,9] that if is -stable, then the subdivision scheme associated with the difference mask is convergent and the first derivative of can be easily evaluated by the backward finite difference of , i.e.,
More generally, if is -stable, the symbol can be factorized as , , and is convergent [3], then the higher derivatives of can be easily evaluated as
where the backward finite difference operator is defined recursively as
2.2. The Eigenvalue/Eigenvector Problem for Refinable Functions
When the mask is compactly supported on , the refinable Equation (4) evaluated on the integers , gives rise to the following eigenvalue/eigenvector problem
where denotes the set of integers where [5,15]. Analogously, the partial derivatives of satisfy the eigenvalue/eigenvector problem
Defining the sequence , the eigenvalue/eigenvector problems (18) and (19) can be written as
where the matrix A has entries .
The eigenvalues can be simple or not, depending on the value of and on the properties of the mask . For instance, when , the eigenvalue 1 is simple. Moreover, if the subdivision scheme is convergent, then the eigenvector is the unique sequence satisfying [15]
In the univariate case () also the eigenvalues , , are simple. In this case, the convergence of the subdivision scheme ensures that the sequence is the unique sequence satisfying (20) such that
In the multivariate case (), the eigenvalues , , may not be simple so that the corresponding eigenvectors are not unique. If satisfies the stability estimate (10), then is the unique sequence that satisfies both the eigenvalue/eigenvector problem (20) and the conditions
The Eigenvalue/Eigenvector Problem for Bivariate Refinable Functions ()
Assuming the mask is compactly supported in , the eigenvalue/eigenvector problem becomes
where
3. Exact Evaluation of Integrals of Refinable Functions
In this section, we are interested in the exact evaluation of integrals of type
where and , , with . We assume satisfies the stability condition (10) and is a compactly supported mask. When , the above integrals can be written as
where is the characteristic function of the interval . Since is also a refinable function, at the end, we have to evaluate the integrals of products of integer translates and dilates of refinable functions and their derivatives over the whole . We first consider the case .
Let us define the function
We note that the values , , i.e., the values of on the integers, coincide with the integrals (28) for and . It turns out that is a -variate refinable function with refinement mask [15]
where and
is the mask of the characteristic function. Since the mask is compactly supported, the mask is compactly supported too, and so is . Thus, the integrals for can be evaluated by solving the eigenvalue/eigenvector problem (24) for the mask . If is a stable refinable function, the solution to the eigenvector problem is unique [15].
For the integrals involving derivatives of refinable functions, we notice that
so that the integrals are the entries of the eigenvector corresponding to the eigenvalue . Unfortunately, for , the uniqueness of the eigenvector is not guaranteed nor can it be retrieved by imposing conditions (23).
Provided that the symbol
can be factorized as
an easy way to evaluate the integrals (32) is to substitute the derivatives , by the finite difference Formula (16). If the difference symbols
are associated with a convergent subdivision scheme, Equation (16) gives
where and are the refinable functions associated with the difference masks
respectively. Since
is a refinable function, the values on the integers , , can be obtained by solving the eigenvalue/eigenvector problem (24) with mask
In conclusion,
When , we can use the change of the integration variable and the refinement equation for into the integrals (28) to obtain
where are the coefficients of the mask associated with (see (31)). Using repeatedly the refinement equation for in the above equation, we obtain
where . Thus, the integrals (28) can be expressed as a sum of integrals with .
3.1. Integrals of Univariate Refinable Functions on Finite Intervals
In this section, we focus on the evaluation of the integrals
where is a finite interval with dyadic rational length and is a stable univariate refinable function associated with the compactly supported mask
Without loss of generality, we can assume .
If or , by the change of integration variable , it is easy to show that . Thus, except for the multiplicative factor , the integrals are the values on the integers of the function
It is well known [5,15] that is a refinable function with mask
so that its values on the integers are the entries of the unique eigenvector corresponding to the eigenvalue 1 of the matrix and such that .
If both and are not contained in , we can write the integral as
where is the characteristic function of the interval .
Using (42) we obtain
where and is the refinement mask of . Thus, it is sufficient to evaluate the integrals
which are non-zero only when .
3.2. Integrals of Derivatives of Univariate Refinable Funcions
For integrals involving the first derivative , i.e.,
we notice that they are the values on the integers of the partial derivative (see (29)).
Assuming and substituting the differentiation formula (15) in Equation (52), we obtain
where is the bivariate refinable function associated with the mask
and is the univariate refinable function associated with the difference mask . At the end, the integrals (52) can be evaluated by solving the eigenvalue/eigenvector problem (24) for and taking the backward finite difference of the unique eigenvector corresponding to the eigenvalue 1.
Analogously, the integrals
can be evaluated by solving the eigenvalue/eigenvector problem (24) with mask
and taking the backward finite difference of the unique eigenvector corresponding to the eigenvalue 1.
4. Examples
As an example, we evaluate the integrals of the translates of the pseudo-splines, a family of compactly supported refinable functions which contains some well-known refinable functions as special cases. The pseudo-splines of type I were introduced in [16]. Their symbol is defined as
It depends on the two integer parameters with . The pseudo-splines of type I are compactly supported on and belong to . When , the symbol coincides with the symbol associated with the cardinal B-splines, while coincides with the symbol of the Daubechies family [4]. The cardinal B-spline is a piecewise polynomial of degree with breakpoints on the integers. It is non-negative in its support , it is centrally symmetric and it is refinable with mask [17]
The pseudo-spline is the Daubechies refinable function of order m and is orthogonal and nonsymmetric. The mask coefficients do not have an explicit expression except for . Their values computed up to order can be found in [4].
In [18], the authors considered the pseudo-splines of type II, which are the autocorrelation of the pseudo-splines of type I. Their symbol is
The pseudo-splines of type II are symmetric, compactly supported on and belong to . When , the symbol coincides with the symbol associated with the cardinal B-splines of degree , while coincides with the symbol of the symmetric interpolatory schemes introduced in [19]. The latter are associated with the interpolatory symmetric refinable functions , which are compactly supported on . We recall that interpolatory means that for all integers except for when its value is 1. In particular, the symbol
corresponds to the mask of the four-point scheme
In the pseudo-spline family, only the cardinal B-splines have a known analytic form [20] and therefore, in order to evaluate integrals of products of refinable functions for , the procedure described in the previous section must be evoked. Here, we evaluate the integrals of the pseudo-splines for and for . Starting from the values on the integers, we can use recursively the refinement equation to evaluate the pseudo-splines at the dyadic points (see Figure 1 where ).
Figure 1.
(a) The pseudo-spline of type I . (b) The orthogonal pseudo-spline . (c) The interpolatory pseudo-spline . (d) The pseudo-spline of type II .
In Table 1 and Table 2, the values of the integrals , , and , , evaluated up to machine precision, are listed.
Table 1.
The values of the integrals evaluated up to machine precision.
Table 2.
The values of the integrals evaluated up to machine precision.
In Table 3 and Table 4, the values of the integrals , , and , , evaluated up to machine precision, are listed.
Table 3.
The values of the integrals evaluated up to machine precision.
Table 4.
The values of the integrals evaluated up to machine precision.
In Table 5 and Table 6, the values of the integrals , , , and , , , evaluated up to machine precision, are listed. Since the pseudo-splines are centrally symmetric, the integrals for can be obtained by the symmetry properties
Table 5.
The values of the integrals evaluated up to machine precision.
Table 6.
The values of the integrals evaluated up to machine precision.
In Table 7 and Table 8, the values of the integrals , , , and , , , evaluated up to machine precision, are shown. Also in this case, the integrals for can be obtained by symmetry.
Table 7.
The values of the integrals evaluated up to machine precision.
Table 8.
The values of the integrals evaluated up to machine precision.
We notice that all the computations were performed in Matlab (version 2022b). The eigenvalue/eigenvector problem was solved with the function eig.
5. Conclusions
Except for the seminal paper by Dahmen and Micchelli [15], the literature is scarce in terms of papers dealing with methods for the exact evaluation of the connection coefficients involving refinable functions and wavelets. In [21], a similar reasoning is used to evaluate the connection coefficients of a wavelet Galerkin method but the evaluation of integrals involving derivatives of wavelets is a little cumbersome since the authors do not take advantage of the differentiation rule (40). In [22], the authors describe a method derived from [23] for the exact evaluation of the integrals (27). The drawback of the proposed method is that it gives rise to a linear system for which the existence and uniqueness of the solution are not guaranteed. Moreover, nothing is said about integrals involving boundary functions. On the other hand, since refinable functions can only be calculated on the dyadic points, for evaluating the integrals with quadrature rules, the Newton–Cotes formula should be employed, having the dyadic points as nodes. However, to obtain an accurate approximation, these formulas require a large number of nodes which would produce a loss of accuracy in the values of the refinable functions as they are calculated through the recursive use of Equation (4).
Instead, our approach, which follows directly from [15], allows to evaluate the integrals of both refinable functions and their derivatives by solving an eigenvalue/eigenvector problem that involves only the refinement masks. The conditions (23), which guarantee the existence and uniqueness of the solution, can be easily imposed while, in the case of integrals of derivatives, the use of the differentiation rule (40) avoids the difficulty of imposing further conditions.
The examples in Section 4 show the effectiveness of the method in evaluating integrals of refinable functions whose explicit expressions is not known.
As a final remark, we note that the same procedure can be used to evaluate integrals of multivariate refinable functions and wavelets with any dilation matrix M, while a generalization to integrals involving multiwavelets can be found in [24].
Author Contributions
Conceptualization, F.P.; methodology, F.P., C.S. and E.P.; validation, E.P.; writing—review and editing, F.P., C.S. and E.P.; supervision, F.P. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Not applicable.
Acknowledgments
The authors are members of the INdAM Research Group GNCS.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Han, B.; Jia, R.Q. Multivariate refinement equations and convergence of subdivision schemes. SIAM J. Math. Anal. 1998, 29, 1177–1199. [Google Scholar] [CrossRef]
- Jia, R.Q.; Micchelli, C.A. Using the refinement equation for the construction of pre-wavelets V: Extensibility of trigonometric polynomials. Computing 1992, 48, 61–72. [Google Scholar] [CrossRef]
- Cavaretta, A.S.; Dahmen, W.; Micchelli, C.A. Stationary Subdivision; American Mathematical Soc.: Providence, RI, USA, 1991; Volume 453. [Google Scholar]
- Daubechies, I. Ten Lectures on Wavelets; SIAM: Philadelphia, PA, USA, 1992. [Google Scholar]
- Strang, G.; Nguyen, T. Wavelets and Filter Banks; Wellesley-Cambridge Press: Cambridge, UK, 1996. [Google Scholar]
- Mallat, S. A Wavelet tour of Signal Processing. The Sparse Way; Academic Press Burlington: Burlington, NJ, USA, 2009. [Google Scholar]
- Han, B. Symmetry property and construction of wavelets with a general dilation matrix. Linear Algebra Its Appl. 2002, 353, 207–225. [Google Scholar] [CrossRef]
- Conti, C.; Dyn, N. Non-stationary subdivision schemes: State of the art and perspectives. In Proceedings of the International Conference Approximation Theory XVI. Nashville, Nashville, Tennessee, 19–22 May 2019; Springer: Berlin/Heidelberg, Germany, 2021; pp. 39–71. [Google Scholar]
- Dyn, N.; Levin, D. Subdivision schemes in geometric modelling. Acta Numer. 2002, 11, 73–144. [Google Scholar] [CrossRef]
- Cohen, A. Numerical Analysis of Wavelet Methods; Elsevier: Amsterdam, The Netherlands, 2003. [Google Scholar]
- Dahmen, W.; Prößdorf, S.; Schneider, R. Wavelet approximation methods for pseudodifferential equations II: Stability and convergence. Math. Z. 1994, 215, 583–620. [Google Scholar] [CrossRef]
- Dahmen, W. Wavelet and multiscale methods for operator equations. Acta Numer. 1997, 6, 55–228. [Google Scholar] [CrossRef]
- Dahmen, W.; Micchelli, C.A. Biorthogonal wavelet expansions. Constr. Approx. 1997, 13, 293–328. [Google Scholar] [CrossRef]
- Stevenson, R. Adaptive wavelet methods for solving operator equations: An overview. In Multiscale, Nonlinear and Adaptive Approximation; Springer: Berlin/Heidelberg, Germany, 2009; pp. 543–597. [Google Scholar]
- Dahmen, W.; Micchelli, C.A. Using the refinement equation for evaluating integrals of wavelets. SIAM J. Numer. Anal. 1993, 30, 507–537. [Google Scholar] [CrossRef]
- Daubechies, I.; Han, B.; Ron, A.; Shen, Z. Framelets: MRA-based constructions of wavelet frames. Appl. Comput. Harmon. Anal. 2003, 14, 1–46. [Google Scholar] [CrossRef]
- Chui, C.K. An Introduction to Wavelets; Academic Press: Cambridge, MA, USA, 1992. [Google Scholar]
- Dong, B.; Shen, Z. Pseudo-splines, wavelets and framelets. Appl. Comput. Harmon. Anal. 2007, 22, 78–104. [Google Scholar] [CrossRef]
- Deslauriers, G.; Dubuc, S. Symmetric iterative interpolation processes. In Constructive Approximation; Springer: Berlin/Heidelberg, Germany, 1989; pp. 49–68. [Google Scholar]
- Schumaker, L.L. Spline Functions: Basic Theory; Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
- Chen, M.Q.; Hwang, C.; Shih, Y.P. The computation of wavelet-Galerkin approximation on a bounded interval. Int. J. Numer. Methods Eng. 1996, 39, 2921–2944. [Google Scholar] [CrossRef]
- Lin, E.; Zhou, X. Connection coefficients on an interval and wavelet solutions of Burgers equation. J. Comput. Appl. Math. 2001, 135, 63–78. [Google Scholar] [CrossRef]
- Latto, A.; Resniko, H.L.; Tenenbaum, E. The evaluation of connection coefficients of compactly supported wavelets. In Proceedings of the French–USA Workshop on Wavelets and Turbulence; Maday, Y., Ed.; Princeton University: Princeton, NJ, USA; Springer: Berlin, Germany, 1992. [Google Scholar]
- Han, B.; Michelle, M. Wavelets on intervals derived from arbitrary compactly supported biorthogonal multiwavelets. Appl. Comput. Harmon. Anal. 2021, 53, 270–331. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).