Decomposition and reconstruction of multidimensional signals using polyharmonic pre-wavelets

In this paper, we build a multidimensional wavelet decomposition based on polyharmonic B-splines. The pre-wavelets are polyharmonic splines and so not tensor products of univariate wavelets. Explicit construction of the filters specified by the classical dyadic scaling relations is given and the decay of the functions and the filters is shown. We then design the decomposition/recomposition algorithm by means of downsampling/upsampling and convolution products.     

On the construction of wavelets on a bounded interval

This paper presents a general approach to a multiresolution analysis and wavelet spaces on the interval [–1, 1]. Our method is based on the Chebyshev transform, corresponding shifts and the discrete cosine transformation (DCT). For the wavelet analysis of given functions, efficient decomposition and reconstruction algorithms are proposed using fast DCT-algorithms. As examples for scaling functions and wavelets, polynomials and transformed splines are considered.     

Multiwavelet approximation methods for pseudodifferential equations on curves. Stability and convergence analysis

We develop a stability and convergence analysis of Galerkin–Petrov schemes based on a general setting of multiresolution generated by several refinable functions for the numerical solution of pseudodifferential equations on smooth closed curves. Particular realizations of such a multiresolution analysis are trial spaces generated by biorthogonal wavelets or by splines with multiple knots. The main result presents necessary and sufficient conditions for the stability of the numerical method in terms of the principal symbol of the pseudodifferential operator and the Fourier transforms of the generating multiscaling functions as well as of the test functionals. Moreover, optimal convergence rates for the approximate solutions in a range of Sobolev spaces are established. This revised version was published online in June 2006 with corrections to the Cover Date.     

Using the refinement equation for the construction of pre-wavelets III: Elliptic splines

The purpose of this paper is to provide multiresolution analysis, stationary subdivision and pre-wavelet decomposition onL ²(R ^d ) based on a general class of functions which includes polyharmonic B-splines.The work of this author has been partially supported by a DARPA grant.The work of this author has been partially supported by Fondo Nacional de Ciencia y Technologia under Grant 880/89.     

Generalized cardinal B-splines: Stability, linear independence, and appropriate scaling matrices

Generalized cardinal B-splines are defined as convolution products of characteristic functions of self-affine lattice tiles with respect to a given integer scaling matrix. By construction, these generalized splines are refinable functions with respect to the scaling matrix and therefore they can be used to define a multiresolution analysis and to construct a wavelet basis. In this paper, we study the stability and linear independence properties of the integer translates of these generalized spline functions. Moreover, we give a characterization of the scaling matrices to which the construction of the generalized spline functions can be applied.     

Transfinite Thin Plate Spline Interpolation

Duchon’s method of thin plate splines defines a polyharmonic interpolant to scattered data values as the minimizer of a certain integral functional. For transfinite interpolation, i.e., interpolation of continuous data prescribed on curves or hypersurfaces, Kounchev has developed the method of polysplines, which are piecewise polyharmonic functions of fixed smoothness across the given hypersurfaces and satisfy some boundary conditions. Recently, Bejancu has introduced boundary conditions of Beppo–Levi type to construct a semicardinal model for polyspline interpolation to data on an infinite set of parallel hyperplanes. The present paper proves that, for periodic data on a finite set of parallel hyperplanes, the polyspline interpolant satisfying Beppo–Levi boundary conditions is in fact a thin plate spline, i.e., it minimizes a Duchon type functional. The construction and variational characterization of the Beppo–Levi polysplines are based on the analysis of a new class of univariate exponential ℒ-splines satisfying adjoint natural end conditions.     

R~2上带奇异性的非线性多重调和方程的正整解

该文以 Schauder- Tychonoff不动点定理为工具 ,建立了一类平面上带奇异性的非线性多重调和方程的正的径向对称整体解的存在性定理 ,并给出了解的有关性质 ,所得的结果丰富和发展文 [1 - 4]的结果     

Two-Level Additive Schwarz Methods Using Rough Polyharmonic Splines-Based Coarse Spaces

This paper introduces a domain decomposition preconditioner for elliptic equations with rough coefficients. The coarse space of the domain decomposition method is constructed via the so-called rough polyharmonic splines (RPS for short). As an approximation space of the elliptic problem, RPS is known to recover the quasi-optimal convergence rate and attain the quasi-optimal localization property. The authors lay out the formulation of the RPS based domain decomposition preconditioner, and numerically verify the performance boost of this method through several examples.     

Multiresolution exponential B-splines and singularly perturbed boundary problem

The paper considers how cardinal exponential B-splines can be applied in solving singularly perturbed boundary problems. The exponential nature and the multiresolution property of these splines are essential for an accurate simulation of a singular behavior of some differential equation solutions. Based on the knowledge that the most of exponential B-spline properties coincide with those of polynomial splines (smoothness, compact support, positivity, partition of unity, reconstruction of polynomials, recursion for derivatives), one novel algorithm is proposed. It merges two well known approaches for solving such problems, fitted operator and fitted mesh methods. The exponential B-spline basis is adapted for an interval because a considered problem is solved on a bounded domain.      

The refinability of step functions

Refinable functions have been widely investigated because of their importance in wavelet theory and multiresolution analysis, as well as because of intrinsic interest. Problems involving refinability can be challenging and interesting problems in mathematics. Several papers have investigated refinability of splines and other classes of functions. The purpose of this paper is to develop necessary and sufficient conditions for the refinability of the class of step functions on the real line taking complex values.

     

R^2上带奇异性的非线性多重调和方程的正整解

该文以Schauder-Tychonoff不动点定理为工具，建立了一类平面上带奇异性的非线性 多重调和方程的正的径向对称整体解的存在性定理，并给出了解的有关性质，所得的结果丰 富和发展文[1][4]的结果。     

关于具局部插值性质的样条

引言 插值样条作为逼近工具有许多优点,但也受到一些限制。例如大部分样条都只限于多项式样条。又如样条插值带有整体性,即一插值点上的任何变化将波及整个样条的所有各点。此外高阶样条的计算较复杂。 本文给出一种新的构造样条的方法,它将不限于多项式样条,并且主要是它具有局部插值性,即这种样条在一个子区间上的值只与其邻近的几个插值点有关。我们称这种样条为局部插值样条。 与通常的多项式样条相比,局部样条的计算比较简单,并且一个插值点上的数值变动只影响其邻近的局部范围。     

An upper bound on the approximation power of principal shift-invariant spaces

An upper bound on theL _p-approximation power (1 ≤p ≤ ∞) provided by principal shift-invariant spaces is derived with only very mild assumptions on the generator. It applies to both stationary and nonstationary ladders, and is shown to apply to spaces generated by (exponential) box splines, polyharmonic splines, multiquadrics, and Gauss kernel.     

The construction of wavelets from generalized conjugate mirror filters in

The classical constructions of wavelets and scaling functions from conjugate mirror filters are extended to settings that lack multiresolution analyses. Using analogues of the classical filter conditions, generalized mirror filters are defined in the context of a generalized notion of multiresolution analysis. Scaling functions are constructed from these filters using an infinite matrix product. From these scaling functions, non-MRA wavelets are built, including one whose Fourier transform is infinitely differentiable on an arbitrarily large interval.     

A multiresolution analysis for tensor-product splines using weighted spline wavelets

We construct biorthogonal spline wavelets for periodic splines which extend the notion of “lazy” wavelets for linear functions (where the wavelets are simply a subset of the scaling functions) to splines of higher degree. We then use the lifting scheme in order to improve the approximation properties with respect to a norm induced by a weighted inner product with a piecewise constant weight function. Using the lifted wavelets we define a multiresolution analysis of tensor-product spline functions and apply it to image compression of black-and-white images. By performing-as a model problem-image compression with black-and-white images, we demonstrate that the use of a weight function allows to adapt the norm to the specific problem.     

Designing Multiresolution Analysis-type Wavelets and Their Fast Algorithms

Often, the Dyadic Wavelet Transform is performed and implemented with the Daubechies wavelets, the Battle-Lemarie wavelets, or the splines wavelets, whereas in continuous-time wavelet decomposition a much larger variety of mother wavelets is used. Maintaining the dyadic time-frequency sampling and the recursive pyramidal computational structure, we present various methods for constructing wavelets ψ_wanted, with some desired shape and properties and which are associated with semi-orthogonal multiresolution analyses. We explain in detail how to design any desired wavelet, starting from any given multiresolution analysis. We also explicitly derive the formulae of the filter bank structure that implements the designed wavelet. We illustrate these wavelet design techniques with examples that we have programmed with Matlab routines.     

Normal Multiresolution Approximation of Curves

A multiresolution analysis of a curve is normal if each wavelet detail vector with respect to a certain subdivision scheme lies in the local normal direction. In this paper we study properties such as regularity, convergence, and stability of a normal multiresolution analysis. In particular, we show that these properties critically depend on the underlying subdivision scheme and that, in general, the convergence of normal multiresolution approximations equals the convergence of the underlying subdivision scheme.     

拟α- 伪样条及其性质

通过增加参数ω, 本文给出了一类新面具, 即拟α- 伪样条. 当ω = 0 时, 拟0- 伪样条就是伪样条, 拟1/2- 伪样条就是对偶伪样条. 对特殊的ω ≠ 0, 本文给出了拟α- 伪样条的稳定性、正则性、渐近分析和逼近阶等性质. 相关结果表明拟α- 伪样条具有与伪样条以及对偶伪样条类似的性质. 同时,结果表明只要支撑区间稍长时, 加细函数将具有更好的光滑性.     

Sobolev空间上多尺度分析的性质

对Sobolev空间上多尺度分析的性质进行了探讨,给出了稠密性条件的一个特征刻划。     

Interpolating Cubic Spline Wavelet Packet on Arbitrary Partitions

In many applications, the splines on an arbitrary partition are very useful. In this paper, a spline wavelet structure is created in the way that it provides a multiresolution approximation of the spline subspaces with arbitrary partition in the space of continuous functions on a finite interval. Based on the wavelet basis and the wavelet packet in this structure, a multi-level interpolation method is developed for decomposing a function into wavelet series and reconstructing it from its wavelet representation.