Fast computation of three-dimensional (3-D) moments is an important and pra
gmatic problem. In this paper, we propose a new algorithm together with sui
table systolic structure for the fast computation of 3-D moments, extending
our method for fast computation of 2-D moments. A scalable systolic struct
ure, consisting of adders and latches, fully exploits parallelism of the ne
twork architecture and is very suitable for hardware implementation. Our ne
w method, which also dispenses with the need for multiplication, is suitabl
e for both binary images and gray level images. We also extend our method t
o efficient computation of k-dimensional (k-D) moments (k > 3). (C) 2000 El
sevier Science B.V. All rights reserved.