An efficient algorithm for fast computation of orthogonal Fourier-Mellin moments

Bo Fu; Jianzhong Zhou; Jiqun Wen

doi:10.1117/12.657965

4 January 2006 An efficient algorithm for fast computation of orthogonal Fourier-Mellin moments

Bo Fu, Jianzhong Zhou, Jiqun Wen

Proceedings Volume 5985, International Conference on Space Information Technology; 59853A (2006) https://doi.org/10.1117/12.657965
Event: International Conference on Space information Technology, 2005, Wuhan, China

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.

Citation Download Citation

Bo Fu, Jianzhong Zhou, and Jiqun Wen "An efficient algorithm for fast computation of orthogonal Fourier-Mellin moments", Proc. SPIE 5985, International Conference on Space Information Technology, 59853A (4 January 2006); https://doi.org/10.1117/12.657965

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available