Fast spectral algorithms for invariant pattern recognition and image matching based on modular invariants
E. V. Labunets, Valery Labunets, M. Assonov, Reiner Lenz · 2002
We propose a new algorithm, which needs almost no multiplication. We propose using modular arithmetic of the finite Galois field GF(Q) to map geometrical moments calculation to a fast Fourier-Mellin-Galois transform, which reduces the computational complexity from /spl Oscr/(N/sub 4/) to /spl Oscr/(N/sub 2/ log/sub 2/ N). We illustrate the performance of the method by some classification and matching experiments.