This paper deals with polynomial Hermite splines. In the first part, we provide a simple and fast procedure to compute refinement mask of B-splines any order in case general scaling factor. Our is solely derived from reproduction properties satisfied by splines it does not require explicit construction or evaluation basis functions. The second part discusses factorization B-spline masks terms a...

Pseudo-splines constitute a new class of refinable functions with B-splines, interpolatory refinable functions and refinable functions with orthonormal shifts as special examples. Pseudo-splines were first introduced by Daubechies, Han, Ron and Shen in [Framelets: MRA-based constructions of wavelet frames, Appl. Comput. Harmon. Anal. 14(1) (2003), 1–46] and Selenick in [Smooth wavelet tight fra...

In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a B-spline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to rederive the main results of the classical theory—including some new extensions for fractional orders—in a se...

In this article we investigate the optimal design problem for some wavelet regression models. Wavelets are very flexible in modeling complex relations, and optimal designs are appealing as a means of increasing the experimental precision. In contrast to the designs for the Haar wavelet regression model (Herzberg and Traves 1994; Oyet and Wiens 2000), the I-optimal designs we construct are diffe...

In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a B-spline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to rederive the main results of the classical theory—including some new extensions for fractional orders—in a se...

We present a general framework for the design and efficient implementation of various types of running (or over-sampled) wavelet transforms (RWT) using polynomial splines. Unlike previous techniques, the proposed algorithms are not necessarily restricted to scales that are powers of two; yet they all achieve the lowest possible complexity : 0(N) per scale, where N is signal length. In particula...

We propose a new framework to extract the activity-related component in the BOLD functional Magnetic Resonance Imaging (fMRI) signal. As opposed to traditional fMRI signal analysis techniques, we do not impose any prior knowledge of the event timing. Instead, our basic assumption is that the activation pattern is a sequence of short and sparsely-distributed stimuli, as is the case in slow event...

Starting from any two compactly supported refinable functions in L2(R) with dilation factor d, we show that it is always possible to construct 2d wavelet functions with compact support such that they generate a pair of dual d-wavelet frames in L2(R). Moreover, the number of vanishing moments of each of these wavelet frames is equal to the approximation order of the dual MRA; this is the highest...

Zero crossings or extrema of a wavelet transform constitute important signatures for signal analysis with the advantage of great simplicity. In this paper, we introduce a fast frequency-estimation method based on zero-crossing counting in the transform domain of a family of differential spline wavelets. The resolution and order of the vanishing moments of the chosen wavelets have a close relati...