A Simulated Fast Hexagonal Fourier Transform

Innchyn HER; Chin-Chung HUANG; Rong-Da HSIEH

A Simulated Fast Hexagonal Fourier Transform

Innchyn HER, Chin-Chung HUANG, Rong-Da HSIEH

Full Text Views

0

Cite this

Summary :

Many applications of digital image processing require the evaluation of fast Fourier transforms. Therefore, for the more conventional rectangular grid image systems, FFT algorithms have been largely developed so far. For users of hexagonal grid image systems, unfortunately, life is less easier since they generally have to write the hexagonal FFT codes by themselves. This complexity tends to hinder the development and use of the hexagonal imaging system. In this short paper, we propose, without a mathematical proof, a method to simulate hexagonal FFTs based on the relations between the two grid systems. And this is done with only the use of regular rectangular FFT schemes. By this method, a hexagonally sampled image can be easily transformed via the many FFT programs available in the market.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.7 pp.1804-1809

Publication Date: 2004/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Image

Cite this

Copy

Innchyn HER, Chin-Chung HUANG, Rong-Da HSIEH, "A Simulated Fast Hexagonal Fourier Transform" in IEICE TRANSACTIONS on Fundamentals, vol. E87-A, no. 7, pp. 1804-1809, July 2004, doi: .
Abstract: Many applications of digital image processing require the evaluation of fast Fourier transforms. Therefore, for the more conventional rectangular grid image systems, FFT algorithms have been largely developed so far. For users of hexagonal grid image systems, unfortunately, life is less easier since they generally have to write the hexagonal FFT codes by themselves. This complexity tends to hinder the development and use of the hexagonal imaging system. In this short paper, we propose, without a mathematical proof, a method to simulate hexagonal FFTs based on the relations between the two grid systems. And this is done with only the use of regular rectangular FFT schemes. By this method, a hexagonally sampled image can be easily transformed via the many FFT programs available in the market.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_7_1804/_p

Copy

@ARTICLE{e87-a_7_1804,
author={Innchyn HER, Chin-Chung HUANG, Rong-Da HSIEH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Simulated Fast Hexagonal Fourier Transform},
year={2004},
volume={E87-A},
number={7},
pages={1804-1809},
abstract={Many applications of digital image processing require the evaluation of fast Fourier transforms. Therefore, for the more conventional rectangular grid image systems, FFT algorithms have been largely developed so far. For users of hexagonal grid image systems, unfortunately, life is less easier since they generally have to write the hexagonal FFT codes by themselves. This complexity tends to hinder the development and use of the hexagonal imaging system. In this short paper, we propose, without a mathematical proof, a method to simulate hexagonal FFTs based on the relations between the two grid systems. And this is done with only the use of regular rectangular FFT schemes. By this method, a hexagonally sampled image can be easily transformed via the many FFT programs available in the market.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - A Simulated Fast Hexagonal Fourier Transform
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1804
EP - 1809
AU - Innchyn HER
AU - Chin-Chung HUANG
AU - Rong-Da HSIEH
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2004
AB - Many applications of digital image processing require the evaluation of fast Fourier transforms. Therefore, for the more conventional rectangular grid image systems, FFT algorithms have been largely developed so far. For users of hexagonal grid image systems, unfortunately, life is less easier since they generally have to write the hexagonal FFT codes by themselves. This complexity tends to hinder the development and use of the hexagonal imaging system. In this short paper, we propose, without a mathematical proof, a method to simulate hexagonal FFTs based on the relations between the two grid systems. And this is done with only the use of regular rectangular FFT schemes. By this method, a hexagonally sampled image can be easily transformed via the many FFT programs available in the market.
ER -