Direct inversion of the three-dimensional pseudo-polar Fourier transform

DOI10.1137/15M1031916zbMATH Open1416.65566arXiv1507.06174MaRDI QIDQ2800441FDOQ2800441

Authors: Gil Shabat, Yoel Shkolnisky, Amir Averbuch 

Publication date: 15 April 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1507.06174

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

zbMATH Keywords

Radon transformToeplitz matricespolar Fourier transform3D pseudo-polar Fourier transformunequally spaced FFT

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Radon transform (44A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• ShearLab: A Rational Design of a Digital Parabolic Scaling Algorithm
• Title not available (Why is that?)
• The curvelet transform for image denoising
• The mathematics of computerized tomography
• On the fast Fourier transform of functions with singularities
• Fast Fourier Transforms for Nonequispaced Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• A Superfast Toeplitz Solver with Improved Numerical Stability
• Accelerating the Nonuniform Fast Fourier Transform
• A Superfast Algorithm for Toeplitz Systems of Linear Equations
• Reconstruction Algorithms in Irregular Sampling
• Development and Optimization of Regularized Tomographic Reconstruction Algorithms Utilizing Equally-Sloped Tomography
• Fast and accurate polar Fourier transform
• Nonuniform fast fourier transforms using min-max interpolation
• Efficient numerical methods in non-uniform sampling theory
• Title not available (Why is that?)
• 3D Fourier based discrete Radon transform.
• 3-D symmetry detection and analysis using the pseudo-polar Fourier transform
• On the computation of the polar FFT
• A Framework for Discrete Integral Transformations I—The Pseudopolar Fourier Transform
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Retrieving articulated 3-D models using medial surfaces
• A new polar Fourier transform for computer-aided tomography and spotlight synthetic aperture radar
• Title not available (Why is that?)
• Digital Shearlet Transforms

Cited In (3)

• On the computation of the polar FFT
• Fast and accurate polar Fourier transform
• Direct inversion of the nonequispaced fast Fourier transform

Uses Software

• ShearLab

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)