A computationally inexpensive algorithm for signal interpolation using B-spline functions is presented in this work. Speciically, the convolution between the B-spline coeecients and the B-spline function itself, widely acknowledged as the most costly aspect of B-spline interpolation, is reformulated such that it is directly amenable to implementation at a much lower computational cost (16.25% o...

This paper generalizes the classical cubic spline with the construction of the cubic spline coalescence hidden variable fractal interpolation function (CHFIF) through its moments, i.e. its second derivative at the mesh points. The second derivative of a cubic spline CHFIF is a typical fractal function that is self-affine or non-self-affine depending on the parameters of the generalized iterated...

References: Prautzsch, H., 1984. Degree elevation of B-spline curves. CAGD 18 (12) Prautzsch, H., Piper, B., 1991. A fast algorithm to raise the degree of B-spline curves. CAGD 8 (4) Pigel, L., Tiller, W., 1994. Software-engineering approach to degree elevation of B-spline curves. CAD 26 (1) Liu, W., 1997. A simple, efficient degree raising algorithm for B-spline curves. CAGD 14 (7) Huang, Q.-X...

A prescription for constructing dictionaries for cardinal spline spaces on a compact interval is provided. It is proved that such spaces can be spanned by dictionaries which are built by translating a prototype B-spline function of fixed support into the knots of the required cardinal spline space. This implies that cardinal spline spaces on a compact interval can be spanned by dictionaries of ...

In this paper, a generalised spline filter, that has a unified description for both the linear spline filter and the nonlinear robust spline filter, is proposed. Based on the M-estimation theory, the general spline filter model can be solved by using an Iterated Reweighted Least Squared method which is also general for both the linear and nonlinear spline filter. The algorithm has been verified...

In this paper we consider polynomial splines with equidistant nodes which may grow as O|x|. We present an integral representation of such splines with a distribution kernel where exponential splines are used as basic functions. By this means we characterize splines possessing the property that translations of any such spline form a basis of corresponding spline space. It is shown that any such ...

Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering decision problems for shapes bounded by spline curves. As a first step in addressing these problems, this paper treats translational spline covering for planar, uniform, cubic B-splines. Inner and outer polygonal approxim...

Hierarchical B-spline networks consist of multiple B-spline networks assembled in different level or cascade architecture. To identify the hierarchical B-spline networks and select important input features for each sub-B-spline network automatically, a predefined instruction/operator set was used. The structures of hierarchical B-spline networks were created and evolved by using Probabilistic I...