scholarly journals Peer Review #3 of "Discrete two dimensional Fourier transform in polar coordinates part II: numerical computation and approximation of the continuous transform (v0.1)"

Author(s):  
H Feichtinger
2020 ◽  
Vol 6 ◽  
pp. e257
Author(s):  
Xueyang Yao ◽  
Natalie Baddour

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D Discrete Fourier Transform (DFT) in polar coordinates. The theory of the actual manipulated quantities was shown, including the standard set of shift, modulation, multiplication, and convolution rules. In this second part of the series, we address the computational aspects of the 2D DFT in polar coordinates. Specifically, we demonstrate how the decomposition of the 2D DFT as a DFT, Discrete Hankel Transform and inverse DFT sequence can be exploited for coding. We also demonstrate how the proposed 2D DFT can be used to approximate the continuous forward and inverse Fourier transform in polar coordinates in the same manner that the 1D DFT can be used to approximate its continuous counterpart.


Author(s):  
Xueyang Yao ◽  
Natalie Baddour

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. The theory of the actual manipulated quantities was shown, including the standard set of shift, modulation, multiplication, and convolution rules. In this second part of the series, we address the computational aspects of the 2D DFT in polar coordinates. Specifically, we demonstrate how the decomposition of the 2D DFT as a DFT, Discrete Hankel Transform (DHT) and inverse DFT sequence can be exploited for efficient code. We also demonstrate how the proposed 2D DFT can be used to approximate the continuous forward and inverse Fourier transform in polar coordinates in the same manner that the 1D DFT can be used to approximate its continuous counterpart.


Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1928
Author(s):  
Zhen-Wei Li ◽  
Wen-Biao Gao ◽  
Bing-Zhao Li

In this paper, the solvability of a class of convolution equations is discussed by using two-dimensional (2D) fractional Fourier transform (FRFT) in polar coordinates. Firstly, we generalize the 2D FRFT to the polar coordinates setting. The relationship between 2D FRFT and fractional Hankel transform (FRHT) is derived. Secondly, the spatial shift and multiplication theorems for 2D FRFT are proposed by using this relationship. Thirdly, in order to analyze the solvability of the convolution equations, a novel convolution operator for 2D FRFT is proposed, and the corresponding convolution theorem is investigated. Finally, based on the proposed theorems, the solvability of the convolution equations is studied.


Author(s):  
Natalie Baddour

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In this paper, we propose and evaluate the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. This discrete theory is shown to arise from discretization schemes that have been previously employed with the 1D DFT and the discrete Hankel Transform (DHT). The proposed transform possesses orthogonality properties, which leads to invertibility of the transform. In the first part of this two-part paper, the theory of the actual manipulated quantities is shown, including the standard set of shift, modulation, multiplication, and convolution rules. Parseval and modified Parseval relationships are shown, depending on which choice of kernel is used. Similar to its continuous counterpart, the 2D DFT in polar coordinates is shown to consist of a 1D DFT, DHT and 1D inverse DFT.


Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 698 ◽  
Author(s):  
Baddour

The theory of the continuous two-dimensional (2D) Fourier transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In this paper, we propose and evaluate the theory of the 2D discrete Fourier transform (DFT) in polar coordinates. This discrete theory is shown to arise from discretization schemes that have been previously employed with the 1D DFT and the discrete Hankel transform (DHT). The proposed transform possesses orthogonality properties, which leads to invertibility of the transform. In the first part of this two-part paper, the theory of the actual manipulated quantities is shown, including the standard set of shift, modulation, multiplication, and convolution rules. Parseval and modified Parseval relationships are shown, depending on which choice of kernel is used. Similar to its continuous counterpart, the 2D DFT in polar coordinates is shown to consist of a 1D DFT, DHT and 1D inverse DFT.


Author(s):  
L. Reimer ◽  
R. Oelgeklaus

Quantitative electron energy-loss spectroscopy (EELS) needs a correction for the limited collection aperture α and a deconvolution of recorded spectra for eliminating the influence of multiple inelastic scattering. Reversely, it is of interest to calculate the influence of multiple scattering on EELS. The distribution f(w,θ,z) of scattered electrons as a function of energy loss w, scattering angle θ and reduced specimen thickness z=t/Λ (Λ=total mean-free-path) can either be recorded by angular-resolved EELS or calculated by a convolution of a normalized single-scattering function ϕ(w,θ). For rotational symmetry in angle (amorphous or polycrystalline specimens) this can be realised by the following sequence of operations :(1)where the two-dimensional distribution in angle is reduced to a one-dimensional function by a projection P, T is a two-dimensional Fourier transform in angle θ and energy loss w and the exponent -1 indicates a deprojection and inverse Fourier transform, respectively.


Sign in / Sign up

Export Citation Format

Share Document