Abstract
Moments of images are widely used in pattern recognition, because in suitable form they can be made invariant to variations in translation, rotation and size. However the computation of discrete moments by their definition requires many multiplications which limits the speed of computation. In this paper we express the moments as a linear combination of higher order prefix sums, obtained by iterating the prefix sum computation on previous prefix sums, starting with the original function values. Thus the p′th moment \(m_p = \sum\nolimits_{x = 1}^N {} x^p f(x)\) can be computed by O (N · p) additions followed by p multiply-adds. The prefix summations can be realized in time O(N) using p + 1 simple adders, and in time O(p log N) using parallel prefix computation and O(N) adders. The prefix sums can also be used in the computation of two-dimensional moments for any intensity function f(x,y). Using a simple bit-serial addition architecture, it is sufficient with 13 full adders and some shift registers to realize the 10 order 3 image moment computations \((m_{00} ,m_{01} ,m_{10} ,m_{02} ,m_{20} ,m_{12} ,m_{21} ,m_{03} ,m_{30} )\) for a 512 × 512 size image at the TV rate. In 1986 Hatamian published a computationally equivalent algorithm, based on a cascade of filters performing the summations. Our recursive derivation allows for explicit expressions and recursive equations for the coefficients used in the final moment calculation. Thus a number of alternative forms for the moment computation can be derived, based on different sets of prefix sums. It is also shown that similar expressions can be obtained for the moments introduced by Liao and Pawlak in 1996, forming better approximations to the exact geometric moments, at no extra computational cost.
Similar content being viewed by others
References
M.K. Hu, “Visual Pattern Recognition by Moment Invariants,” IRE Trans. Inf. Theory, vol. IT-8, 1962, pp. 179–187.
A.P. Reeves, “A Parallel Mesh Moment Computer,” in Proc. 6th ICPR, Oct. 1982, pp. 465–467.
A.P. Reeve, “Parallel Algorithms for Real-Time Image Processing,” in Multicomputers and Image Processing, Algorithms and Programs, New York: Academic Press, 1982, pp. 7–18.
M. Hatamian, “A Real Time Two-Dimensional Moment Generation Algorithm and its Single Chip Implementation,” IEEE Trans. ASSP, vol. 34, no.3, 1986, pp. 546–553.
M.F. Zakaria, L.J. Vroomen, P.J.A. Zoombar-Murray, and J.M.H.M. van Kessel, “Fast Algorithm for Computation of Moment Invariants,” Pattern Recognition, vol. 20, 1987, pp. 634–643.
K. Chen, “Efficient Parallel Algorithms for the Computation of Two-Dimensional image Moments,” Pattern Recognition, vol. 23, 1990, pp. 109–119.
W.E. Batchelor, W. Liu, R. Cavin, and S. Chen, “A Bit Level Systolic Array for Real-Time Two-Dimensional Moment Generation,” in Systolic Array Processor, J. McCanny et al. (Eds)., 1989, pp. 449–458.
B. Bamieh and R.J.P. De Figueiredo, “A General Moment-Invariants/Attributed-Graph Method for Three Dimensional Object Recognition from a Single Image,” IEEE J. Robotics Automation, vol. 2, 1986, pp. 31–41.
N.J.C. Strachan, P. Nesvadba, and A.R. Allen, “A Method for Working Out the Moments of a Polygon Using an Integration Technique,” Pattern Recognition Lett., vol. 11, 1990, pp. 351–354.
B.-C. Li and J. Shen, “Fast Computation of Moment Invariants,” Pattern Recognition, vol. 24, no.8, 1991, pp. 807–813.
X.Y. Jiang and H. Bunke, “Simple and Fast Computation of Moments,” Pattern Recognition, vol. 24, no.8, 1991, pp. 801–806.
S.X. Liao and M. Pawlak, “On Image Analysis by Moments,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no.3, 1996, pp. 252–265.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhou, F., Kornerup, P. Computing Moments by Prefix Sums. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 25, 5–17 (2000). https://doi.org/10.1023/A:1008163918289
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1008163918289