Computing the Discrete Fourier Transform on a Hexagonal Lattice
Journal of Mathematical Imaging and Vision
Comments on “Generalised finite Radon transform for N × N images”
Image and Vision Computing
Hi-index | 35.68 |
In this paper, representations of the two-dimensional (2-D) signals are presented that reduce the computation of 2-D discrete hexagonal Fourier transforms (2-D DHFTs). The representations are based on the concept of the covering that reveals the mathematical structure of the transforms. Specifically, a set of unitary paired transforms is derived that splits the 2-D DHFT into a number of smaller one-dimensional (1-D) DFTs. Examples for the 8×4 and 16×8 hexagonal lattices are described in detail. The number of multiplications required for computing the 8×4- and 16×8-point DHFTs are equal 20 and 136, respectively. In the general N⩾8 case, the number of multiplications required to compute the 2N×N-point DHFT by the paired transforms equals N2 (log N-1)+N