The discrete Fourier transform for golden angle linogram sampling

DOI10.1088/1361-6420/AB44EEMaRDI QIDQ4973552zbMATH OpenOpenAlexFDO

Authors Elias Salomão Helou, Marcelo V. W. Zibetti, Leon Axel, Kai Tobias Block, Ravinder R. Regatte, Gabor T. Herman

Publication date 28 November 2019

Published in Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

error estimatestomographydiscrete Fourier transformmagnetic resonance imaginglinogramgolden anglenon-equidistant sampling

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Sampling theory in information and communication theory (94A20)

Abstract: Estimation of the Discrete-Time Fourier Transform (DTFT) at points of a finite domain arises in many imaging applications. A new approach to this task, the Golden Angle Linogram Fourier Domain (GALFD), is presented, together with a computationally fast and accurate tool, named Golden Angle Linogram Evaluation (GALE), for approximating the DTFT at points of a GALFD. A GALFD resembles a Linogram Fourier Domain (LFD), which is efficient and accurate. A limitation of linograms is that embedding an LFD into a larger one requires many extra points, at least doubling the domain's cardinality. The GALFD, on the other hand, allows for incremental inclusion of relatively few data points. Approximation error bounds and floating point operations counts are presented to show that GALE computes accurately and efficiently the DTFT at the points of a GALFD. The ability to extend the data collection in small increments is beneficial in applications such as Magnetic Resonance Imaging. Experiments for simulated and for real-world data are presented to substantiate the theoretical claims. The mathematical analysis, algorithms, and software developed in the paper are equally suitable to other angular distributions of rays and therefore we bring the benefits of linograms to arbitrary radial patterns.

Recommendations

• Sampling the Fourier transform along radial lines
• Sampling and discretization of the linear canonical transform
• Sampling and Discrete Linear Canonical Transforms
• Sampling in the linear canonical transform domain
• Sampling for the V-line transform with vertex on a circle
• Sampling theorem based Fourier-Legendre transform
• Sampling theorem and discrete Fourier transform on the hyperboloid
• Sampling properties of the discrete Radon transform
• Sampling of linear canonical transformed signals
• Discrete Fourier inversion of linear inhomogeneity

Cites work

• scientific article; zbMATH DE number 4001918 (Why is no real title available?)
• scientific article; zbMATH DE number 1373505 (Why is no real title available?)
• A Framework for Discrete Integral Transformations I—The Pseudopolar Fourier Transform
• A new linogram algorithm for computerized tomography
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fundamentals of Computerized Tomography
• Image Reconstruction From Finite Number of Projections: Method of Transferring Geometry
• Mathematical methods in image reconstruction
• Non-equispaced fast Fourier transforms with applications to tomography
• Nonuniform fast fourier transforms using min-max interpolation
• Principle of Superposition by Direction Images
• Solution of the problem on image reconstruction in computed tomography
• Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms

Cited in

(2)

• Sampling for the V-line transform with vertex on a circle
• Determining angular frequency from images of rotating objects via a generalized fast Fourier transform

This page was built for publication: The discrete Fourier transform for golden angle linogram sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973552)