Efficient computation of orthogonal moments by suppressing the factorial terms

被引:0
作者
Papakostas, G. A. [1 ]
Boutalis, Y. S. [1 ]
Karras, D. A. [2 ]
Mertzios, B. G. [3 ]
机构
[1] Democritus Univ Thrace, Dept Elect & Comp Engn, Xanthi 67100, Hellas, Greece
[2] Chalkis Inst Technol, Automat Dept, Chalkida, Greece
[3] Thessaloniki Inst Technol, Dept Automat, Lab Control Sys & Comp Intell, Thessaloniki, Greece
来源
IST 2006: PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL WORKSHOP ON IMAGING SYSTEMS AND TECHNIQUES | 2006年
关键词
Zernike moments; direct method; pattern classification; Stirling's approximation;
D O I
暂无
中图分类号
TB8 [摄影技术];
学科分类号
0804 ;
摘要
A Modified Direct Method for the computation of the Zernike moments is presented in this paper. The presence of many factorial terms, in the direct method for computing the Zernike moments, makes their computation process a very time consuming task. Although the computational power of the modern computers is impressively increasing, the calculation of the factorial of a big number is still an inaccurate numerical procedure. The main concept of the present paper is that, by using Stirling's Approximation formula for the factorial and by applying some suitable mathematical properties, a novel, factorial free direct method can be developer. The resulted moments are not equal to those computed by the original direct method, but they are a sufficiently accurate approximation of their. The proposed methodology is generic and can be successfully applied to any orthogonal moments having kernel moment functions consisted of factorial terms.
引用
收藏
页码:22 / +
页数:2
相关论文
共 26 条
[1]   Efficient algorithm for fast computation of Zernike moments [J].
Belkasim, SO ;
Ahmadi, M ;
Shridhar, M .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1996, 333B (04) :577-581
[2]   A comparative analysis of algorithms for fast computation of Zernike moments [J].
Chong, CW ;
Raveendran, P ;
Mukundan, R .
PATTERN RECOGNITION, 2003, 36 (03) :731-742
[3]  
CHONG CW, 2004, INFORM SCI, V159, P203
[4]   A novel algorithm for fast computation of Zernike moments [J].
Gu, J ;
Shu, HZ ;
Toumoulin, C ;
Luo, LM .
PATTERN RECOGNITION, 2002, 35 (12) :2905-2911
[5]   VISUAL-PATTERN RECOGNITION BY MOMENT INVARIANTS [J].
HU, M .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (02) :179-&
[6]   Invariant character recognition with Zernike and orthogonal Fourier-Mellin moments [J].
Kan, C ;
Srinath, MD .
PATTERN RECOGNITION, 2002, 35 (01) :143-154
[7]   INVARIANT IMAGE RECOGNITION BY ZERNIKE MOMENTS [J].
KHOTANZAD, A ;
HONG, YH .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1990, 12 (05) :489-497
[8]   CLASSIFICATION OF INVARIANT IMAGE REPRESENTATIONS USING A NEURAL NETWORK [J].
KHOTANZAD, A ;
LU, JH .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1990, 38 (06) :1028-1038
[9]   MATHEMATICAL PROPERTIES OF ZERNIKE POLYNOMIALS [J].
KINTNER, EC .
OPTICA ACTA, 1976, 23 (08) :679-680
[10]  
Knuth DE, 1997, ART COMPUTER PROGRAM