High order interpolation and differentiation using B-splines
Journal of Computational Physics
Digital time-delay beamforming with interpolated signals
Signal Processing
An adaptive cubic convolution image interpolation approach
Machine Graphics & Vision International Journal
Image interpolation using consistent neighborhood correlations
ISTASC'05 Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation
On texture and image interpolation using Markov models
Image Communication
Two-direction poly-scale refinability
Computers & Mathematics with Applications
Continuous time domain properties of causal cubic splines
Signal Processing
On the role of exponential splines in image interpolation
IEEE Transactions on Image Processing
Efficient implementation of image interpolation as an inverse problem
Digital Signal Processing
Quasi-interpolation by means of filter-banks
IEEE Transactions on Signal Processing
A stochastic model-based approach to image and texture interpolation
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Super-resolution with sparse mixing estimators
IEEE Transactions on Image Processing
GPU-efficient recursive filtering and summed-area tables
Proceedings of the 2011 SIGGRAPH Asia Conference
Exponential splines and minimal-support bases for curve representation
Computer Aided Geometric Design
Reconstruction from non-uniform samples: A direct, variational approach in shift-invariant spaces
Digital Signal Processing
Hi-index | 0.02 |
We consider the problem of interpolating a signal using a linear combination of shifted versions of a compactly-supported basis function φ(z). We first give the expression for the cases of φ that have minimal support for a given accuracy (also known as “approximation order”). This class of functions, which we call maximal-order-minimal-support functions (MOMS) is made of linear combinations of the B-spline of the same order and of its derivatives. We provide an explicit form of the MOMS that maximizes the approximation accuracy when the step-size is small enough. We compute the sampling gain obtained by using these optimal basis functions over the splines of the same order. We show that it is already substantial for small orders and that it further increases with the approximation order L. When L is large, this sampling gain becomes linear; more specifically, its exact asymptotic expression is 2/(πe)L. Since the optimal functions are continuous, but not differentiable, for even orders, and even only piecewise continuous for odd orders, our result implies that regularity has little to do with approximating performance. These theoretical findings are corroborated by experimental evidence that involves compounded rotations of images