An Algorithm for Computation of Radial-Harmonic-Fourier Moments

Abstract:

A fast algorithm for the computation of radial- harmonic-fourier moments (RHFM) is presented in this paper. This algorithm is based on some properties of the radial- harmonic-fourier (RHF) basis functions. As RHF basis functions have specific symmetry or anti-symmetry about the x-axis, the y-axis, the origin, and the straight line of y=x, we can compute one eighth range of the RHF basis functions instead of the whole. Both theoretical analysis and experimental testing show that the fast algorithm makes the time of the computation shorter than the direct method.

• Periodical: Advanced Materials Research (Volume 142)
• Pages: 284-288
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.142.284
• Online since: October 2010
• Authors: Yong Jing Jiang, Zi Liang Ping
• Keywords: Basis Functions, Fast Algorithm, Radial-Harmonic-Fourier Moments

References

[1] M. K. Hu: Visual Pattern recognition by moment invariants, IRE Trands. Inf. Theory IT-8 (1962) 179-187.

[2] M.R. Teague: J. Opt. Soc. Am. Vol. 70 (1980), pp.920-930.

[3] S. O. Belkasim: Patter Recognition Vol. 24 (1991) No. 12, pp.1117-1138.

[4] A. Khotanzad, J.H. Lu: IEEE Trans. Acoust., Speech Signal Process Vol. 38 (1990) No. 6, p.1028–1038.

[5] H. S. Kim, H. -K. Lee: IEEE Transactions on Circuits and Systems for Video Technology Vol. 13 (2003) No. 8, pp.766-775.

[6] H. P. Ren, Z.L. Ping, Wurigen, Y.L. Sheng: J. Opt. Soc. Am. A Vol. 20 (2003) No. 4, pp.631-637.

[7] Ziliang Ping, Haiping Ren: Pattern recognition Vol. 40 (2007), pp.1245-1254.

[8] Sun-kyoo Hwang: Pattern Recognition Vol. 39 (2006), p.2065-(2076).