A new class of Zernike moments for computer vision applications

  • Authors:

  • G. A. Papakostas;Y. S. Boutalis;D. A. Karras;B. G. Mertzios

  • Affiliations:

  • Democritus University of Thrace, Department of Electrical and Computer Engineering, 67100 Xanthi, Greece;Democritus University of Thrace, Department of Electrical and Computer Engineering, 67100 Xanthi, Greece;Chalkis Institute of Technology, Automation Department, Chalkida, Greece;Thessaloniki Institute of Technology, Department of Automation, Laboratory of Control Sys. and Comp. Intell., Thessaloniki, Greece

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.07

Visualization

Abstract

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 developed. The resulted moments are not equal to those computed by the original direct method, but they are a sufficiently accurate approximation of them. Besides, their variability does not affect their ability to describe uniquely and distinguish the objects they represent. This is verified by pattern recognition simulation examples.