Direct inversion of the three-dimensional pseudo-polar Fourier transform
From MaRDI portal
Publication:2800441
Abstract: The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other non-uniform sampling geometries is that the transformation, which samples the Fourier transform on the pseudo-polar grid, can be inverted using a fast and stable algorithm. For other sampling geometries, even if the non-equally spaced Fourier transform can be inverted, the only known algorithms are iterative. The convergence speed of these algorithms as well as their accuracy are difficult to control, as they depend both on the sampling geometry as well as on the unknown reconstructed object. In this paper, we present a direct inversion algorithm for the three-dimensional pseudo-polar Fourier transform. The algorithm is based only on one-dimensional resampling operations, and is shown to be significantly faster than existing iterative inversion algorithms.
Recommendations
- A Framework for Discrete Integral Transformations I—The Pseudopolar Fourier Transform
- Fast and accurate polar Fourier transform
- scientific article; zbMATH DE number 1373505
- On the computation of the polar FFT
- Fast Inversion of the Radon Transform Using Log-polar Coordinates and Partial Back-Projections
Cites work
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 4120318 (Why is no real title available?)
- scientific article; zbMATH DE number 3451988 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 274379 (Why is no real title available?)
- 3-D symmetry detection and analysis using the pseudo-polar Fourier transform
- 3D Fourier based discrete Radon transform.
- A Framework for Discrete Integral Transformations I—The Pseudopolar Fourier Transform
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A Superfast Toeplitz Solver with Improved Numerical Stability
- A new polar Fourier transform for computer-aided tomography and spotlight synthetic aperture radar
- Accelerating the Nonuniform Fast Fourier Transform
- Development and Optimization of Regularized Tomographic Reconstruction Algorithms Utilizing Equally-Sloped Tomography
- Digital Shearlet Transforms
- Efficient numerical methods in non-uniform sampling theory
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Fast Fourier Transforms for Nonequispaced Data
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Fast and accurate polar Fourier transform
- Nonuniform fast fourier transforms using min-max interpolation
- On the computation of the polar FFT
- On the fast Fourier transform of functions with singularities
- Reconstruction Algorithms in Irregular Sampling
- Retrieving articulated 3-D models using medial surfaces
- ShearLab: A Rational Design of a Digital Parabolic Scaling Algorithm
- The curvelet transform for image denoising
- The mathematics of computerized tomography
Cited in
(3)
This page was built for publication: Direct inversion of the three-dimensional pseudo-polar Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800441)