Efficient computation of Zernike and Pseudo-Zernike moments for pattern classification applications |
| |
Authors: | G A Papakostas Y S Boutalis D A Karras B G Mertzios |
| |
Affiliation: | 1.Department of Electrical and Computer Engineering,Democritus University of Thrace,Xanthi,Hellas;2.Automation Department Chalkida,Chalkis Institute of Technology,Chalkida,Hellas |
| |
Abstract: | Two novel algorithms for the fast computation of the Zernike and Pseudo-Zernike moments are presented in this paper. The proposed
algorithms are very useful, particularly in the case of using the computed moments, as discriminative features in pattern
classification applications, where the computation of single moments of several orders is required. The derivation of the
algorithms is based on the elimination of the factorial computations, by computing recursively the fractional terms of the
orthogonal polynomials being used. The newly introduced algorithms are compared to the direct methods, which are the only
methods that permit the computation of single moments of any order. The computational complexity of the proposed method is
O(p
2) in multiplications, with p being the moment order, while the corresponding complexity of the direct method is O(p
3). Appropriate experiments justify the superiority of the proposed recursive algorithms over the direct ones, establishing
them as alternative to the original algorithms, for the fast computation of the Zernike and Pseudo-Zernike moments. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|