1438
6, JUNE 2002
Efficient Algorithms for Computing the 2-D
Hexagonal Fourier Transforms
Artyom M. Grigoryan, Member, IEEE
Abstract—In this paper, representations of the two-dimensional
(2-D) signals are presented that reduce the computation of 2-D dis-
crete hexagonal Fourier transforms (2-D DHFTs). The represen-
tations are based on the concept of the covering that reveals the
mathematical structure of the transforms. Specifically, a set of uni-
tary 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 gen-
eral 8 case, the number of multiplications required to com-
pute the 2 -point DHFT by the paired transforms equals
2 (log 1) + .
Index Terms—Fast 2-D discrete Fourier transform, hexagonal
lattices, paired transforms.
I. INTRODUCTION
M ULTIDIMENSIONAL signal and image processing re-
lates traditionally to the rectangular method of image
sampling, but, as it is known, the most efficient lattices (grids)
for image sampling are not rectangular. Hexagonal lattices be-
come important for many problems in image processing [1]–[4].
Sampling two-dimensional (2-D) isotropic functions on hexag-
onal lattices is significantly more efficient than sampling on
rectangular lattices [5]. Circularly bandlimited hexagonal im-
ages require 13.4% less sampling points than square images.
The research in [6]–[8] shows that the vision system relates
best to the regular hexagonal tessellation, which has a lower
number of neighbors than the rectangular lattice. Hexagonal lat-
tices are useful in the microscopic magnetic films because many
real magnetic materials have hexagonal structure [9], [10].
Although the 2-D discrete Fourier transform (DFT) and other
unitary transforms are widely used in signal and image pro-
cessing, little attention has been given to developing fast algo-
rithms that are specifically tailored for the hexagonal lattices
[12]–[16]. The complexity of the 2-D DFT on hexagonal lat-
tices is due to the fact that the transform is not separable, and
the kernel of the transform has a more complex form than in the
rectangular 2-D DFT case.
The purpose of the present paper is to describe a method
of vector representation of 2-D signals for analyzing the 2-D
discrete Fourier transforms on hexagonal lattices. This method
Manuscript received February 7, 2001; revised February 12, 2002. The asso-
ciate editor coordinating the review of this paper and approving it for publication
was Dr. Alle-Jan van der Veen.
The author is with the Department of Electrical and Computer Engineering,
The University of Texas at San Antonio, San Antonio, TX 78249-0669 USA
(e-mail: amgrigoryan@utsa.edu).
Publisher Item Identifier S 1053-587X(02)04401-X.
1053-587X/02$17.00 © 2002 IEEE
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO.
generalizes the known vector (or tensor) method of computation
of the 2-D DFT [18], [20] defined on rectangular lattices. When
the transform orders both equal a power of two, 2-D signals
and images are represented in the form of the 1-D signals, and
that representation is performed by the paired transform without
multiplication operations. The set of 1-D signals can be pro-
cessed separately, whether the application is for computing the
discrete Fourier spectrum or for linear filtering [21]. The paired
transform yields a splitting of the 2-D DFT by a small number
of short 1-D DFTs, as in the case of the traditional rectangular
lattice. This fact allows us to achieve a minimal number of mul-
tiplications for computing the 2-D DHFT compared with other
known methods.
The rest of the paper is organized in the following way. Sec-
tion II presents the concept of a covering that reveals the 2-D
unitary transform and the concept of a splitting of the transform.
Sections III and IV describe the vector and paired representa-
tions of 2-D signals for the Fourier transform defined on the rect-
angular lattice. Section V describes new vector and paired rep-
resentations for the 2-D discrete Fourier transform on hexagonal
lattices. Hexagonal lattices with fundamental periods
and are considered for the case ( ). All the
2-D DHFTs considered in the following are written in a novel
form that allows us to formulate the common properties of the
transforms and to find the splitting of the transforms using the
same techniques in the rectangular case.
II. COVERING REVEALING 2-D TRANSFORMS
In this section, we consider how to split a 2-D discrete unitary
transform by a specific covering of the frequency domain. To
further simplify the discussion, we describe the case of an
DFT. However, the concepts discussed are not limited to an
DFT; they apply to a unitary transform of arbitrary order.
Given a natural number , let be the square lattice
(1)
The designation : is used to denote as an integer
that runs from 0 to . Let be the -point 2-D
discrete Fourier transform (DFT) whose image on an
sequence is defined as
(2)
where .
GRIGORYAN: EFFICIENT ALGORITHMS FOR COMPUTING THE 2-D HEXAGONAL FOURIER TRANSFORMS 1439

Let be a totality of subsets of . Then, is called

a covering of if the union of subsets coincides with . A
covering of is called irreducible if any totality of subsets
obtained from by throwing away an element does not
cover . If, in addition, all sets are mutually disjoint, then
is called a partition of .
Suppose is an irreducible covering of . We are
interested in constructing such coverings for which the fol-
lowing property holds. Any 2-D sequence defined on can
be represented as a set of 1-D sequences such that the 1-D
DFT of each coincides with the 2-D DFT of at samples of
the corresponding set . As an example, Fig. 1 shows a transfor-
mation of a 3 3-point sequence into four 1-D sequences
, , whose DFTs define the 2-D DFT of at sam-
ples of sets that completely fill . It is assumed that such
a transformation exists. 2
Fig. 1. Diagram of 3 3-point sequence f transformation into four signals
f ; f ; f , and f , whose 1-D DFTs define the 2-D DFT of f .
In the general case, the concept of splitting a 2-D unitary
transform by the covering is defined in the following way. and denote via the corresponding quantities
We use the notation for the restriction of a
sequence on and for the cardinality of . (6)
Definition 1: A 2-D unitary transform is said to be
revealed by the covering if, for each , there exists a 1-D
unitary transform and a sequence such that The set , if it is not empty, is the set of points
along a maximum of parallel straight lines at an angle
(3) of to the horizontal axis. The equations for
the lines are
This condition is briefly written as . The set of the
1-D transforms ; is called a -splitting of the
transform by the covering and is denoted by ; (7)
. We define the set of 1-D sequences to be the
-representation of with respect to .
in the square domain .
III. VECTOR REPRESENTATION OF THE 2-D DFT In the 3-D space, if we identify the opposite sides of bound-
In this section, we construct a covering of the lattice aries of the square , then we can consider as a tore and
that reveals the 2-D DFT and consider the -representation of the 2-D lattice as a net traced on the tore. The straight lines
relative to the Fourier transform. of (7) will compose a closed spiral on the tore. The sums
We define the following subsets (cyclic groups) of : , which are calculated on parallel spirals , :
, will represent values of the Radon transform [22] of
the 2-D sequence written on the discrete net on the tore. These
sums will determine the 2-D DFT of at net points that are sit-
uated on a spiral that passes through the initial point of the net
(4)
and makes an angle with the spirals .
where and for . This property is well known in computerized tomography as
Elements of the subset lie on parallel lines at an angle the theorem of projections [23].
of to the horizontal axis. The number is Given a sample , the collection of subsets ,
determined as follows. If or , then . For : , is a partition of . Therefore, the following
other cases, let and be the smallest integers satisfying, property is valid for spectral components of the 2-D DFT:
respectively, the relations and . Then,
when , and when . (8)
Let be an irreducible covering of the lattice that is com-
posed of subsets (4). For instance, the totality of four subsets
The 2-D DFT of at points of the subset is determined
covers (in Fig. 1, these subsets
by the corresponding 1-D sequence
are respectively denoted as , ), and the totality of six
subsets covers . The (9)
covering reveals the 2-D DFT. To show that, we define in
the sets which we define to be an image-signal of length [20]. The
set of image-signals , , is the -representation of the
(5) 2-D sequence with respect to the 2-D DFT.
1440 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 6, JUNE 2002

Fig. 2. (a) Clock image. (b) Image-signal corresponding to the set T . (c) Absolute value of the 1-D DFT of the image-signal (zero component is shifted to the
center). (d) Arrangement of values of the 1-D DFT in the 2-D DFT of the image.

For instance, if and , then all values We define the -representation of with respect to the 2-D
in equations can be written in the DFT to be the vector (or tensor) representation of [19]. In the
form of the following matrix: case, when , the covering can be taken as

(11)

Therefore, the splitting set of the -point DFT by the

covering consists of -point DFTs

Therefore, the image-signal of is defined as follows: (12)

In the general case, the multiplicative complexity of the 2-D

(10) DFT in the vector representation is determined completely by
the summary complexity of -point DFTs.

IV. TWO-DIMENSIONAL DFT PAIRED REPRESENTATION

Fig. 2 illustrates the clock image 256 256, along with the
image-signal of length 256 in (b), the 1-D DFT over this
image-signal in (c), and samples of the subset
at which the 2-D DFT of the image will be filled by the 1-D DFT
in (d). In general, if the sequence is real, then each component
is real and can be considered to be the amplitude or
weight of the and waves with the frequency .
We now consider a concept of the 2-D paired transform,
which is a transform that can be used effectively to split the 2-D
DFT into a number of short 2-D DFTs. For that, we determine
the characteristic functions of the sets
if
(13)
otherwise.
GRIGORYAN: EFFICIENT ALGORITHMS FOR COMPUTING THE 2-D HEXAGONAL FOURIER TRANSFORMS 1441

Definition 2: Given a sample and integer The transform : ; is called

, the function a paired transform [19]. The paired transform does not require
multiplications. Therefore, according to (17) and (18), the
(14) number of multiplications with twiddle factors required to
is called a two-paired (or paired) function [18]. compute the 2-D DFT by the paired transform equals
We denote by the coefficient of the representation of
by the paired function (20)

where we consider to be the number of trivial multi-

plications with 1 and . Estimating the number of multiplica-
(15) tions in (19), we use the fact that the -point DFT requires
We consider and construct a unitary transform based on multiplications for [18].
the paired functions. There exists a certain set of triples such At samples of subset , the 2-D DFT is completely de-
that the set of the paired functions ; termined by the -point sequence
is a complete set. This fact can be derived from properties
of the 2-D DFT. Indeed, let us consider the following subsets
of sets : where the integer is defined by the simple equation
. Indeed, and if is not
divisible by . Therefore, each -point DFT in the right side
(16)
of (18) represents itself the -point DFT.
We now can construct a partition of . Ac-
The set of image signals , , corresponds to
cording to (11), the totality ;
the representation of with respect to the 2-D DFT. Another
is a covering of , where the set of generators
name for the representation is the paired representation of
[18], [20]. The summary length of all image-signals equals .
.
Property 1:
V. TWO-DIMENSIONAL DFT ON THE HEXAGONAL LATTICE
1) The totality of subsets
In our formulations, we have used the fact that the 2-D Fourier
transform and sequence are given at knots of the rectangular
lattice considered to be the fundamental period of the trans-
(17) form. In this section, we generalize concepts of the vector and
paired representations for 2-D Fourier transforms with funda-
is the partition of that reveals the transform . mental periods that are hexagonal lattices.
2) The system ; is a com- Let us first consider the problem of splitting the 2-D DFT
plete set of paired functions, where into a set of short 1-D transforms when samples of both the
2-D sequence and the transform are arranged on the
hexagonal lattice

Property 2: Let be a sample of . Then, the fol- (21)

lowing holds. where , for all
1) For : : . It is clear that the traditional row–column
method cannot be applied directly for fast computing values
.
(18)
We consider the hexagonal lattice of size

where the components

Just this lattice, and not the hexagonal lattice of size
, is the fundamental period of the 2-D discrete hexagonal
2) The -point DFT is split by partition into Fourier transform (DHFT) given in (21). Indeed, for any integers
short DFTs, namely, -point DFTs, and , the following relations between spectral components
-point DFTs, , and six two-point DFTs. hold:
3) For computing the -point DFT by the paired trans-
forms, it is enough to fulfill (22)
(19)
The considered 2-D DHFT is a periodic transform with period
operations of multiplications, and . . We denote this transform by and consider the
1442 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 6, JUNE 2002

sequence as a -point sequence de- for a certain set of points . Then, for a subset
fined (or extended) on . Hereinafter, we will adhere to , we have the following.
this notation a)
if is odd, is even
if and are even (29)
(23) if is odd.
We now describe two coverings of the fundamental period b) The image-signal that corresponds to the subset
that reveal the 2-D DHFT for the case has the following form:
and . For that, we define the following subsets of samples
on the hexagonal lattice
if is odd is even

(24)
if and are even (30)
where

Example 1: For , we consider the samples if is odd

equal (1, 1) and (1, 2). For the corresponding subsets
[ if , , and
of , we have
are odd].
We define the - representation of to be the vector repre-
sentation of with respect to the 2-D DHFT.
Proof: Equation (27) can be written as

(31)

where the summation is performed only for integers . The

The first subset consists of 16 samples because , and right member of (31) itself represents the -point DFT.
is the smallest integer for which From the construction of sets and that are given in (24)
. and (25), it follows that if is odd and is even, then
For each fixed triple , where , and
and integer , we determine, on the for . Therefore, for
hexagonal lattice , the set and the right side of (31) itself
represents the -point DFT , which leads to the validity
of (29) and (30) for odd and even .
(25) For the case when and are even numbers, we have
and the quantity and

(26) with
(32)
Therefore, on the right side of (31), we have
The following statement follows from (25) and (26).
Theorem 1: Let be an arbitrary sample of
; then

(27) which is the -point DFT. At last, for the case when is
odd, and all sets (25) are nonempty.
The theorem is proved.
for an arbitrary integer .
As an example, Fig. 3 illustrates the clock image 512 256
The index varies from 0 through with step 1/4. The
written on the hexagonal lattice , along with the image-
next theorem follows from (27) and shows a way to split the 2-D
signal of length 512 in (b), the 512-point DFT of the
DHFT.
image-signal in (c), and samples of subset
Theorem 2: Let be an irreducible covering of com-
at which the 2-D DHFT of the image will be filled by the 512-
posed of the subsets (24), i.e.,
point DFT in (d). In this example, , , ,
(28) , , and .
GRIGORYAN: EFFICIENT ALGORITHMS FOR COMPUTING THE 2-D HEXAGONAL FOURIER TRANSFORMS 1443

2
Fig. 3. (a) Clock image 512 256 with the hexagonal lattice X 2
written on the rectangular lattice 1024 256. (b) Image-signal f of length 512.
(c) Absolute value of the 512-point DFT over the image-signal (zero component is shifted to the center). (d) Samples of subset T at which the 2-D DHFT
of the image will be filled on X by the 512-point DFT.

where

Fig. 4. Diagram for transferring (a) the clock-image 256 2 256 of

Fig. 2(a) to (b) the hexagonal lattice 512 2 256 and extending (c) the
image to the rectangular lattice 1024 2 256. The interpolation of samples
is performed by cross 3 2 3, such that a = (1 + 6 + 6 + 5)=4 = 4:5,
b = (1 + 6 + 3 + 5)=4 = 3:75, and c = (2 + 3 + 3 + 4)=4 = 3.

Samples of the hexagonal lattice 512 256 have been placed

on a rectangular lattice 1024 256 in a way shown in Fig. 4(b).
The image is extended at all other samples by computing means
of the image at nearest samples of the hexagonal lattice [see
Fig. 4(c)].
Example 2: For the hexagonal lattice , the covering
can be taken as
These subsets have intersections at samples that are underlined
above. The 8 4-point DHFT at samples of subsets ,
1444 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 6, JUNE 2002

, and is determined by the 16, 16, and eight- calculate the -point DHFT is estimated as
point DFTs, respectively. To calculate the DHFT at samples of . Considering the estimate
these subsets, it is enough to calculate one 16-point DFT of the for , we obtain
sequence and one incomplete 16-point DFT of the se-
quence . The latter DFT is calculated only for spectral (35)
components with odd samples. It can be therefore reduced to
the eight-point DFT (which requires six additional multiplica- The repeated calculations of the 2-D DHFT at all samples of
tions with the twiddle factors). One incomplete eight-point DFT intersections of subsets can be removed similar to
of the sequence is needed to calculate spectral compo- the considered above case.
nents only at odd samples. This transform can be reduced to the The -representation also holds for the case when samples
four-point DFT and requires two additional multiplications. of a 2-D sequence are arranged on the hexagonal lattice and
We now consider the remaining part of the covering, which samples of the Fourier image are on the rectangular lattice, or
contains even samples (0, 2), (2, 2), (4, 2), and (6, 2). In the case vice versa. For these cases, is enough to suppose, respectively,
, the following equality holds: that or in all formulae given above.

A. Paired Representation
It has been shown previously that is revealed by the
irreducible covering of the hexagonal lattice .
The following statement holds.
Theorem 3: Let be an arbitrary sample of
(33) . Then, for an arbitrary integer , the following relation
is valid:
where : , and : . The sequence
is defined on the hexagon lattice as follows:
(36)
where

(37)

for numbers : such that are integers.

To construct the representation of with respect to the
transform , we define the following subsets of sets (24):
for numbers and : .
Therefore, for : and : ,
the set of values itself represents an incomplete
-point DHFT whose spectral components with sam- (38)
ples , : are not calculated. We denote this
transform by and the number of multiplication opera- Example 3: Let us consider the hexagonal lattice .
tions required to compute this transform by . Then, for samples and (1, 2), we have
In the case, we obtain the following split-
ting: of the 8 4-point DHFT. The
number of the required multiplications can be estimated as

.
In the case , we can take the following covering of the Due to Theorem 2, the following statement holds.
lattice Theorem 4: Let be a partition of that consists of
subsets (38), i.e.,

(39)
(34)
for a certain set of samples . Then, for every subset
where is a subset of that contains all even sam- , the following relations are valid.
ples, except the first column
a)
if is odd, is even
The -point DHFT can be therefore reduced to if and are even
-point DFTs, -point DFTs, and one incomplete if is odd.
-point DHFT. The number of multiplications required to (40)
GRIGORYAN: EFFICIENT ALGORITHMS FOR COMPUTING THE 2-D HEXAGONAL FOURIER TRANSFORMS 1445

b) The corresponding element of the -representation of One can see that the subsets of the decomposition of these three
with respect to the 2-D DHFT has the following form: sets are disjoint or coincide. From the decomposition of the first
set , we can see that this set and two subsets
and are needed to fill the lattice . To calculate the
8 4-point DHFT at points of these three sets, it is required
to calculate two eight-point DFTs, two four-point DFTs, one
if is odd is even two-point DFT, and two one-point DFTs. Therefore, the fol-
lowing splitting of the 8 4-point DHFT holds:
.
(41) Since the paired transform is fulfilled without multiplications,
the multiplicative complexity of the 8 4-point DHFT is esti-
if and are even mated as
. It should be noted for compar-
ison with the rectangular case that the 8 4-point DFT
is split by the covering ,
. The corresponding splitting ;
if is odd , requires
multiplications.
We define the representation of to be the paired rep- Example 5: Let us construct a partition of the hexagonal
resentation of with respect to the 2-D DHFT. lattice . We first consider the covering
Proof: It follows directly from (36) that

(42)

and the statements of this theorem hold because of the property The first four sets contain 32 elements each, the next two subsets
given in (32). contain 16 elements each, and contain eight
The partition can be constructed from the covering be- elements each, and the last four subsets contain four
cause each set can be divided by subsets . elements each. The -point DHFT is split into four 32-point
Example 4: To construct a partition of the hexagonal lat- DFTs, two 16-point DFTs, two eight-point DFTs, and four four-
tice , we first consider the set that is divided as point DFTs. To remove the redundancy of calculations that are
follows: due to the intersections between sets of the covering ,
we consider the following decompositions of sets:

The set is divided by the following subsets:

After removing all subsets that are not underlined above, we

and the set is divided as obtain the following partition of :

(43)
The cardinalities of the subsets of equal 16, 8, 4, 16, 8,
16, 16, 8, 4, 2, 1, 1, 8, 4, 2, 4, 2, 1, 2, 1, 2, and 2, respectively.
1446 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 6, JUNE 2002

Therefore, the splitting of the 16 8-point DHFT by the parti- The number of multiplications required to compute the
tion is -point DHFT at knots of the first part of the hexagonal
lattice is estimated as the half of , i.e., about
. Indeed, each subset (ex-
cept the one-point ones, such as and ) has an equal
number of points in both the parts of the lattice. This estimate
is comparative with the estimate given in (19) for the
-point DFT. Denoting , we can write from (45)
that multiplication op-
Taking into account the multiplications with twiddle factors re- erations are required to compute DHFT at samples of the part
quired to compute the paired representation of [see (41)], we . As a result, the proposed algorithm uses, on the average,
estimate the number of multiplications required to compute the about multiplication operations per sample on
16 8-point DHFT as the part .
For comparison, we consider the estimate
. obtained in [16] for computing the
To construct the partition for the general case, we 2-D DHFT by the radix-7 decimation-in-space algorithm,
can use the covering of the form (34) or take the covering when . Taking the number of hexagonal pixels
equal , we can see that the proposed paired method uses
multiplication operations per sample.
In the part of the lattice consisting of pixels that lie on the
hierarchical structure of the hexagonal aggregates, the radix-7
Each subset can be divided as algorithm uses such multiplication
operations per sample, i.e., at least ten times more operations
than the proposed algorithm does.
It should also be noted that in the rectangular case, the com-
After decomposing subsets and finding their putation of the -point DFT by means of the paired trans-
equivalent parts, we obtain a set of subsets that compose forms requires about multiplication
a partition of the hexagonal lattice . This partition operations. This estimate is comparative with the number of op-
yields a splitting of the 2-D DHFT into a set of 1-D DFTs. On erations counted in (45).
the hexagonal lattice , the paired functions are defined It is necessary to note that similar calculations hold for the
as , where 2-D DHFT considered in the form of [1]
are characteristic functions of sets .
The paired transform is defined by the following complete set (46)
of paired functions:
This discrete transform is defined on the hexagonal lattice,
which is constructed in a way different from the lattice con-
where sets are defined as sets of for sidered in (23). Indeed, for the last case, one can say that the
which . hexagonal lattice is constructed by the broken lines
The splitting of the -point 2-D DHFT by the paired
transform is

where : , as illustrated in Fig. 5(a) for .

When considering the 2-D DHFT of the form (46), the hexag-
onal lattice is constructed by the straight parallel lines

(44)

where [see Fig. 5(b)]. The points of this lattice

The number of multiplications required to compute the
-point DHFT is estimated as follows:
are arranged vertically by 3/2 times more compactly than in the
first lattice.
Let be a 2-D sequence given on the hexagonal lattice that is
determined by the straight lines . We can write the cor-
responding 2-D DHFT with spectral components on the hexag-
onal lattice in the form similar to (23)

(45)
(47)
GRIGORYAN: EFFICIENT ALGORITHMS FOR COMPUTING THE 2-D HEXAGONAL FOURIER TRANSFORMS 1447

Fig. 5. Hexagonal lattices of sizes (a) 8 2 4 and (b) 12 2 4 composed,

respectively, by broken lines and parallel straight lines.

where the following notations are used: Fig. 6. Construction of the hexagonal lattice 32 2 16 by sinusoids s .

, . That is, we consider condi-

tionally that and . The compute the -point DHFT by the paired transforms
summation by in (47) is performing from 0 through , equals shows the advances of using the
and the right member in (47) itself represents the periodic se- paired transforms for splitting the 2-D DHFT.
quence with period . We obtain the -point
DHFT, where the fundamental period is the hexagonal
ACKNOWLEDGMENT
lattice of size . The given notation of the 2-D DHFT
is identical to the notation considered in (23). The method of The author would like to thank the Associate Editor
achieving a splitting of the -point DHFT into a set of Dr. A. J. van der Veen and reviewers for their very helpful
1-D DFTs is similar to the -point DHFT case. suggestions and valuable comments.
For both the 2-D DHFTs, we have the general expression
REFERENCES
[1] D. E. Dudgeon and R. M. Mersereau, Signal Processing. Englewood
Cliffs, NJ: Prentice-Hall, 1984.
[2] R. C. Gonzalez and R. E. Wood, Digital Image Processing. Reading,
(48) MA: Addison-Wesley, 1992.
[3] R. C. Staunton, “Hexagonal sampling in image processing,” Adv. Imag.
where we have the following. Electron Phys., vol. 107, pp. 231–307, 1999.
1) and , [4] R. M. Mersereau, “The processing of hexagonally sampled two-dimen-
for the -point DHFT. sional signals,” Proc. IEEE, vol. 67, pp. 930–949, June 1979.
[5] D. P. Petersen and D. Middleton, “Sampling and reconstruction of wave-
2) and and N
number-limited functions in -dimensional Euclidean spaces,” Inform.
for the -point DHFT. Contr., vol. 5, pp. 279–323, 1962.
[6] D. H. Hubel, Eye, Brain, and Vision. New York: Sci. Amer., 1988.
Before concluding, we note that hexagonal lattices and cor- [7] A. L. Nel, “Hexagonal image processing,” in Proc. Southern African
responding 2-D DHFTs of type (48) can be constructed in dif- Conf. Commun. Signal Process., 1989, pp. 109–113.
ferent ways. For instance, we can construct a hexagonal lat- [8] A. B. Watson and A. J. Ahumada, Jr., “A hexagonal orthogonal-oriented
pyramid as a model of image representation in visual cortex,” IEEE
tice that is formed by the following family of curves Trans. Biomed. Eng., vol. 36, pp. 97–106, Jan. 1989.
in the continuous domain : [9] M. Mansuripur and R. Giles, “Demagnetizing fields computation for
, , where . As an dynamic simulation of the magnetization reversal process,” IEEE Trans.
Magn., vol. 24, pp. 23–27, Jan. 1988.
example, Fig. 6 illustrates the arrangement of such curves [10] R. C. Giles, P. R. Kotiuga, and M. Mansuripur, “Parallel micromagnetic
and knots . The 2-D DHFT defined on the hexag- simulations using Fourier methods on a regular hexagonal lattice,” IEEE
Trans. Magn., vol. 27, pp. 3815–3818, Sept. 1991.
onal lattice is the -point transform, which is [11] G. E. Rivard, “Direct fast Fourier transform of bivariate functions,” IEEE
described by (48), wherein , , Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 250–252,
and . 1977.
[12] R. M. Mersereau, “A two-dimensional FFT for hexagonally sampled
data,” in Digital Signal Processing, V. Cappellini and A. G. Constan-
VI. CONCLUSION tinides, Eds. New York: Academic, 1980, pp. 93–101.
[13] M. R. Mersereau and T. C. Speake, “A unified treatment of
The vector and paired representations of the 2-D signals Cooley–Tukey algorithms for the evaluation of the multidimen-
and images have been presented, to compute the 2-D discrete sional DFT,” IEEE Trans. Acoust., Speech, Signal Processing, vol.
ASSP-29, pp. 1011–1018, Oct. 1981.
hexagonal Fourier transforms (2-D DHFTs) on the hexagonal [14] A. Guessoum and R. M. Mersereau, “Fast algorithms for the multidi-
lattices. The representations are based on the concept of the mensional discrete Fourier transform,” IEEE Trans. Acoust., Speech,
Signal Processing, vol. ASSP–34, pp. 937–943, Sept. 1986.
covering that reveals the mathematical structure of the trans- [15] I. Her, “Geometric transformations on the hexagonal grid,” IEEE Trans.
forms. The fact that the number of multiplications required to Image Processing, vol. 4, pp. 1213–1222, Sept. 1995.
1448
[16] J. L. Zapata and G. X. Ritter, “Fast Fourier transform for hexagonal ag-
gregates,” J. Math. Imag. Vis., vol. 12, no. 3, pp. 183–197, June 2000.
[17] H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms,
2nd ed. Berlin, Heidelberg, Germany: Springer-Verlag, 1982.
[18] A. M. Grigoryan, “Algorithm of computation of the discrete Fourier
transform with arbitrary orders,” Vichislit. Matem. i Mat. Fiziki, vol. 30,
no. 10, pp. 1576–1581, 1991.
[19] A. M. Grigoryan and M. M. Grigoryan, “Tensor representation of the
two-dimensional discrete Fourier transform and new orthogonal func-
tions,” Avtometria, no. 1, pp. 21–27, 1986.
[20] A. M. Grigoryan, “2-D and 1-D multi-paired transforms: Fre-
quency-time type wavelets,” IEEE Trans. Signal Processing, vol. 49,
pp. 344–353, Feb. 2001.
[21] A. M. Grigoryan, S. S. Agaian, and E. R. Dougherty, “Splitting of the
2-D convolution: Optimal linear filtration,” in Proc. ICICS Second Int.
Conf. Inform., Commun. Signal Process., Singapore, Dec. 1999.
[22] J. Radon, “On the determination of function from their integrals along
certain manifolds,” Ber. Saechs. Akad. Wiss, Leipzig, Math. Phys. Kl.,
vol. 69, pp. 262–277, 1917.
[23] T. G. Herman, Image Reconstruction From Projections. The Fundamen-
tals of Computerized Tomography. New York: Academic, 1980.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 6, JUNE 2002
Artyom M. Grigoryan (M’99) received the M.S. degrees in mathematics from
Yerevan State University, Yerevan, Armenia, USSR, in 1978, in imaging science
from Moscow Institute of Physics and Technology, Moscow, Russia, USSR, in
1980, and in electrical engineering from Texas A&M University, College Sta-
tion, in 1999. He received the Ph.D. degree in mathematics and physics from
Yerevan State University in 1990.
From 1990 to 1996, he was a Senior Researcher with the Department of Signal
and Image Processing, Institute for Problems of Informatics and Automation,
Yerevan State University, National Academy Science of Armenia. From 1996
to 2000, he was a Research Engineer with the Department of Electrical Engi-
neering, Texas A&M University. In December 2000, he joined the College of
Engineering, University of Texas at San Antonio, where he is currently an As-
sistant Professor. He holds one patent for developing an algorithm of automated
3-D fluorescent in situ hybridization spot counting. He is the author of 60 pa-
pers, specializing in the design of robust filter design, theory of fast one- and
multidimensional unitary transforms, and processing biomedical images.