Abstract:

In order to effectively apply pseudo-Zernike moments to the image analysis and the pattern recognition, an improved approach to the fast computation of pseudo-Zernike moments, which uses Clenshaw recurrence formula to implement the fast computation of pseudo-Zernike moment polynomial summation, is proposed to reduce the computational complexity of the traditional approaches. Preliminary experimental results demonstrate that the proposed approach costs less CPU time than the traditional methods in terms of computing special-order moments, and that it is of a recognition rate 5% more than that of the traditional principal component analysis method in terms of extracting and recognizing face features, with an average extraction time of 1.2 s.

Key words: image recognition, orthogonal moments, pseudo-Zernike moments, fast algorithm