Font Size: a A A

Optimal sampling of the discrete Fourier transform

Posted on:2003-06-30Degree:Ph.DType:Dissertation
University:University of California, BerkeleyCandidate:Calef, Brandoch HughFull Text:PDF
GTID:1468390011485010Subject:Mathematics
Abstract/Summary:
Suppose we wish to reconstruct a signal or image given samples of its discrete Fourier transform. The quality of the reconstruction depends upon the choice of samples. Given the sampling locations, a set containing the support of the image, a bound on the measurement error, and the region of interest to be reconstructed, one can calculate an error bound for the reconstruction. By minimizing this bound with respect to the choice of sampling locations, the optimal sampling scheme is identified.; We pursue three minimization strategies. First, traditional combinatorial optimization procedures are explored and a branch-and-probability-bound procedure in the spirit of Zhigljavsky's global optimization technique is proposed. Then approximation methods suggested by the formulation of the error bound are derived. Finally, we look for situations in which the optimal sampling scheme may be produced without a search.
Keywords/Search Tags:Optimal sampling, Bound
Related items