Inproceedings,

The fast Zernike moments

.
Proceedings of the 37th International Conference on Computers and Industrial Engineering, (2007)

Abstract

Zernike moments are important digital image descriptors used in various application aspects starting from industrial inspection to web based image retrieval. Dozens of fast algorithms have been proposed for manipulating the computation of Zernike moments. This paper proves that real time computation of Zernike moments can be achieved via geometric moments without the need to compute Zernike polynomials. What makes the algorithm extremely fast is that geometric moments can be computed without any multiplications. This work suggests a method that is nearly 70 times faster from the best known methods. The symmetry based Zernike moment computation comes in the second place in the computational savings but is still too slow compared to Zernike moment computation based on geometric moments.

Tags

Users

  • @cocus

Comments and Reviews