The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) of finitelength signals over a set of uniformly-spaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e.,a nonuniform FT . Several papers have described fast approximations for the nonuniform FT based on interpolating an oversampled FFT. This paper presents an interpolation method for the nonuniform FT that is optimal in the min-max sense of minimizing the worst-case approximation error over all signals of unit norm. The proposed method easily generalizes to multidimensional signals. Numerical results show that the min-max approach provides substantially lower approximation errors than conventional interpolation methods. The min-max criterion is also useful for optimizing the parameters of interpolation kernels such as the Kaiser-Bessel function.

We consider a class of interpolation algorithms, including the least-squares optimal Yen interpolator, and we derive a closed-form expression for the interpolation error for interpolators of this type. The error depends on the eigenvalue distribution of a matrix which is specified for each set of sampling points. The error expression can be used to prove that the Yen interpolator is optimal. The implementation of the Yen algorithm suffers from numerical ill-conditioning, forcing the use of a regularized, approximate solution. We suggest a new, approximate solution, consisting of a sinc-kernel interpolator with specially chosen weighting coefficients. The newly designed sinc-kernel interpolator is compared with the usual sinc interpolator using Jacobian (area) weighting, through numerical simulations. We show that the sinc interpolator with Jacobian weighting works well only when the sampling is nearly uniform. The newly designed sinc-kernel interpolator is shown to perform better than ...

This paper describes efficient schemes for the computation of a large number of differentely scaled/oriented filtered versions of an image. We generalize the well-known steerable/scalable ("deformable") filter bank structure by imposing X-Y separability on the basis filters. The resulting systems, designed by an iterative projections technique, achieve substantial reduction of the computational cost. To reduce the memory requirement, we adopt a multirate implementation. The resulting structure, however, is not shift-invariant. We introduce a design criterion for multirate deformable structures that jointly controls the approximation error and the shift-variance. 1 Introduction Elementary visual structures such as lines, edges, texture, motion, are powerful "cues" to understand the structure of the outside world from its visual appearance (the image), and their identification is instrumental for almost any visual task. Classical image processing problems (enhancement, denoising) may al...

This paper also proposed another reconstruction method based on a direct approximation of the Fourier inversion formula using a twodimensional (2-D) trapezoidal rule. In addition, the possibility of reconstruction from a concentric-squares raster was discussed. Numerous simple interpolators have been tried in DF reconstruction with the results compared with CBP [33]. In [34] and [35], the concept of angular bandlimiting was used to interpolate the polar data onto a Cartesian grid. In [36], a DF reconstruction using bilinear interpolation for diffraction tomography provided image quality that was comparable to that produced by the CBP algorithm. Very good reconstruction quality was obtained in [37] and [38] using a spline interpolator, or a hybrid type of spline interpolator. The notion of "gridding" was introduced in [39] as a method of obtaining optimal inversion of Fourier data. An optimal gridding function was proposed, and successful results were obtained when applied to the tomographic reconstruction problem. In [40], several different gridding functions were tried for DF reconstruction, and the performances were compared. In [41, 42], the linogram reconstruction method was proposed as a form of DF reconstruction. The data collection grid in the linogram method is the same as in the concentric-squares sampling scheme. The inversion of the Fourier data in [41, 42] was accomplished by first applying the chirp-z transform in one direction and then computing FFTs in the other direction. In CT, many of these attempts at DF reconstruction have given a poorer result than the CBP algorithm, due to the error incurred in the process of the polar-to-Cartesian interpolation. The attraction of DF reconstruction, however, is that it is thought to require less computation than ...

This correspondence describes efficient schemes for the computation of a large number of differently scaled/oriented filtered versions of an image. We generalize the well-known steerable/scalable ("deformable") filter bank structure by imposing X-Y separability on the basis filters. The resulting systems, designed by an iterative projections technique, achieve substantial reduction of the computational cost.

... approximation error over traditional design techniques is obtained. Finally, the design of cascade systems is considered. Optimal designs for these systems are found to provide additional reduction in computational complexity.