Share Email Print
cover

Proceedings Paper

An efficient algorithm for fast computation of orthogonal Fourier-Mellin moments
Author(s): Bo Fu; Jianzhong Zhou; Jiqun Wen
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Orthogonal Fourier-Mellin moments have better feature extraction capabilities and are more robust to image noise than the classical Zernike moments. However, orthogonal Fourier-Mellin moments have not been widely used as features in pattern recognition due to the computational complexity of the orthogonal Fourier-Mellin radial polynomials. This paper analyzes the deficiencies of the existing methods, and introduces an efficient recursive algorithm to compute the orthogonal Fourier-Mellin moments. The algorithm consists of a recurrence relation for Mellin orthogonal radial polynomials, which derived from the Jacobi polynomials for fast computation of orthogonal Fourier-Mellin moments. An experiment using binary image is designed to test the performance of the algorithm. The experimental result demonstrates that the computational speed of orthogonal Fourier-Mellin moments has been adequately improved over the present methods.

Paper Details

Date Published: 5 January 2006
PDF: 6 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 59853A (5 January 2006); doi: 10.1117/12.657965
Show Author Affiliations
Bo Fu, Huazhong Univ. of Science and Technology (China)
Jianzhong Zhou, Huazhong Univ. of Science and Technology (China)
Jiqun Wen, Wuhan High Voltage Institute (China)


Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology

© SPIE. Terms of Use
Back to Top