Efficient reconstruction algorithms using shifted lattices

Authors:
Hamid Behmard
Affiliations:
Mathematics Department, Western Oregon University, Monmouth, OR
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 6
Cited 0

Irregular sampling and frames

Wavelets: a tutorial in theory and applications
A generalized sampling theorem for locally compact abelian groups

Mathematics of Computation
Analysis and recovery of multidimensional signals from irregular samples using nonlinear and iterative techniques

Signal Processing
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Computationally attractive reconstruction of bandlimited images from irregular samples

IEEE Transactions on Image Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this paper, we consider sampling theory for irregular sampling sets of minimal density which are structured. An efficient method for the reconstruction of band-limited discrete signals from sampling sets which are unions of shifted lattices is developed. These sets are not necessarily periodic. A signal can be reconstructed from its samples provided the sampling set and the spectrum of the signal satisfy certain compatibility conditions. While explicit reconstruction formulas for unions of sampling lattices are possible, it is more convenient to use a recursive algorithm. A numerical example utilizing nonperiodic sampling sets implemented in MATLAB is given. The theory and the related algorithm has been applied to speech and image processing examples.