Ten lectures on wavelets
Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Discrete spline filters for multiresolutions and wavelets of l2
SIAM Journal on Mathematical Analysis
Efficient numerical methods in non-uniform sampling theory
Numerische Mathematik
Numerical analysis of the non-uniform sampling problem
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
Fast Local Reconstruction Methods for Nonuniform Sampling in Shift-Invariant Spaces
SIAM Journal on Matrix Analysis and Applications
Nonideal sampling and interpolation from noisy observations in shift-invariant spaces
IEEE Transactions on Signal Processing
A sampling theorem for shift-invariant subspace
IEEE Transactions on Signal Processing
Irregular sampling for spline wavelet subspaces
IEEE Transactions on Information Theory
A pyramid approach to subpixel registration based on intensity
IEEE Transactions on Image Processing
MOMS: maximal-order interpolation of minimal support
IEEE Transactions on Image Processing
Efficient energies and algorithms for parametric snakes
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Reconstruction of nonuniformly sampled images in spline spaces
IEEE Transactions on Image Processing
Enlargement or reduction of digital images with minimum loss of information
IEEE Transactions on Image Processing
Optimized Compact-Support Interpolation Kernels
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
We propose a new approach for signal reconstruction from non-uniform samples, without any constraint on their locations. We look for a function that minimizes a classical regularized least-squares criterion, but with the additional constraint that the solution lies in a chosen linear shift-invariant space-typically, a spline space. In comparison with a pure variational treatment involving radial basis functions, our approach is resolution dependent; an important feature for many applications. Moreover, the solution can be computed exactly by a fast non-iterative algorithm, that exploits at best the particular structure of the problem.