By Topic

A Hybrid Algorithm of Fast and Accurate Computing Jacobi-Fourier Moments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bo Fu ; Hubei Univ. of Technol., Wuhan ; Xiu-Xiang Fan ; Xi-Lin Zhao ; Jin Liu
more authors

Jacobi-Fourier moments are useful tools in pattern recognition and image analysis due to their perfect feature capability and high noise resistance. However, direct computation of these moments is very expensive, limiting their use as feature descriptors especially at high orders. The existing methods by employing quantized polar coordinate systems not only save the computational time, but also reduce the accuracy of the moments. In this paper, we propose a hybrid algorithm, which re-organize Jacobi-Fourier moments with any order and repetition as a linear combination of generalized Fourier-Mellin moments, to calculate Jacobi-Fourier moments at high orders fast and accurately. First, arbitrary precision arithmetic is employed to preserve accuracy. Second, the property of symmetry is applied to the generalized Fourier-Mellin moments to reduce their computational cost. Third, the recursive relations of Jacobi polynomial coefficients are used to speed up their computation. Experimental results reveal that the proposed method is more efficient than the other methods.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:4 )

Date of Conference:

19-22 Aug. 2007