A fast algorithm for computing Chebyshev-Fourier moments

Yongjing Jiang, Ziliang Ping, Lai-bin Gao · 2010

In this paper, the invariant orthogonal moments, Chebyshev-Fourier moments (CHFMs), and the computation of CHFMs are introduced. With the specific symmetrical or anti-symmetrical properties of the Chebyshev-Fourier (CHF) basis functions, a fast algorithm for computing the CHFMs is given. Both theoretical analysis and experimental testing show that the fast algorithm makes the time for computing the CHFMs shorter than the direct method.

Read the paper · More papers on PaperTik