Fast Computation by Subdivision of Multidimensional Splines and Their Applications

Abstract

We present theory and algorithms for fast explicit computations of uni- and multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The algorithms use the forward and the inverse Fast Fourier transform (FFT). The implementation is as fast as FFT computation. The algorithms are based on binary and ternary subdivision of splines. Interpolating and smoothing splines are used for a sample rate convertor such as resolution upsampling of discrete-time signals and digital images and restoration of decimated images that were contaminated by noise. The performance of the rate conversion based spline is compared with the performance of the rate conversion by prolate spheroidal wave functions.