An analysis on the realisation of two-dimensional image moments

Presents an analysis and evaluation of the original approach and other realization techniques for computing two-dimensional image moments. In the original approach pixels are divided into blocks and a simple table look-up technique is used for the major part of the realization. The 80386 assembly language, the C-language, and a T800 transputer system have been used to evaluate the new approach and other techniques. It is found that the current approach gives superior performance over other algorithms. In particular, the current approach is 1 to 10 times faster than other approaches for serial realization, whereas a speed-up of 6 to 7 is achievable for parallel realization using seven transputers connected in the tree topology. In some cases, superlinear speed-up is also observed, which shows the superior quality of the new approach.<<ETX>>

[1]  Keping Chen Efficient parallel algorithms for the computation of two-dimensional image moments , 1990, Pattern Recognit..

[2]  Paul J. Zsombor-Murray,et al.  Fast algorithm for the computation of moment invariants , 1987, Pattern Recognit..

[3]  M. Hatamian,et al.  Moment calculations by digital filters , 1984, AT&T Bell Laboratories Technical Journal.

[4]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.