Approximation order is an important feature of all wavelets. It implies that polynomials up to degree p−1 are in the space spanned by the scaling function(s). In the scalar case, the scalar sum rules determine the approximation order or the left eigenvectors of the infinite down-sampled convolution matrix H determine the combinations of scaling functions required to produce the desired polynomial. For multi-wavelets the condition for approximation order is similar to the conditions in the scalar case. Generalized left eigenvectors of the matrix Hf; a finite portion of H determines the combinations of scaling functions that produce the desired superfunction from which polynomials of desired degree can be reproduced. The superfunctions in this work are taken to be B-splines. However, any refinable function can serve as the superfunction. The condition of approximation order is derived and new, symmetric, compactly supported and orthogonal multi-wavelets with approximation orders one, two, three and four are constructed.
Field of Research
080106 Image Processing
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.