Fast Local Reconstruction Methods for Nonuniform Sampling in Shift-Invariant Spaces
نویسندگان
چکیده
Abstract. We present a new method for the fast reconstruction of a function f from its samples f(xj) under the assumption that f belongs to a shift invariant space V (φ). If the generator φ has compact support, then the reconstruction is local quite in contrast to methods based on band-limited functions. Using frame theoretic arguments, we show that the matrix of the corresponding linear system of equations is a positive-definite banded matrix. This special structure makes possible the fast local reconstruction algorithm in O(SJ) operations, where J is the number of samples and S is the support length of the generator φ. Further optimization can be achieved by means of data segmentation. Ample numerical simulation is provided.
منابع مشابه
Nonuniform Sampling and Reconstruction in Shift-Invariant Spaces
This article discusses modern techniques for nonuniform sampling and reconstruction of functions in shift-invariant spaces. It is a survey as well as a research paper and provides a unified framework for uniform and nonuniform sampling and reconstruction in shiftinvariant spaces by bringing together wavelet theory, frame theory, reproducing kernel Hilbert spaces, approximation theory, amalgam s...
متن کاملLocal reconstruction for sampling in shift-invariant spaces
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we will consider the local reconstruction problem for signals in a shiftinvariant space. In particular, we consider finding sampling sets X such that signals in a shift-invariant space can be locally reconstructed from ...
متن کاملNON-UNIFORM SAMPLING IN MULTIPLY GENERATED SHIFT-INVARIANT SUBSPACES OF Lp(IR)
Given the samples {f(xj) : j ∈ J} of a function f belonging to a shift invariant subspace of Lp(IR), we give a fast reconstruction algorithm that allows the exact reconstruction of f , as long as the sampling set X = {xj : j ∈ J} is sufficiently dense.
متن کاملNon - Uniform Sampling in Multiplygenerated Shift - Invariant Subspaces
Given the samples ff(x j) : j 2 J g of a function f belonging to a shift invariant subspace of L p (IR d), we give a fast reconstruction algorithm that allows the exact reconstruction of f , as long as the sampling set X = fx j : j 2 J g is suuciently dense.
متن کاملNon-uniform Sampling in Shift-invariant Spaces
This article discusses modern techniques for non-uniform sampling and reconstruction of functions in shift-invariant spaces. The reconstruction of a function or signal or image f from its non-uniform samples f(xj) is a common task in many applications in data or signal or image processing. The non-uniformity of the sampling set is often a fact of life and prevents the use of the standard method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 24 شماره
صفحات -
تاریخ انتشار 2003