A new approach to fast calculation of moments of 3-D gray level images

Fast computation of three-dimensional (3-D) moments is an important and pragmatic problem. In this paper, we propose a new algorithm together with suitable systolic structure for the fast computation of 3-D moments, extending our method for fast computation of 2-D moments. A scalable systolic structure, consisting of adders and latches, fully exploits parallelism of the network architecture and is very suitable for hardware implementation. Our new method, which also dispenses with the need for multiplication, is suitable for both binary images and gray level images. We also extend our method to efficient computation of k-dimensional ( k-D) moments ( k > 3).