M. Al-Rawi. Proceedings of the 37th International Conference on Computers and
Industrial Engineering, (2007)
Аннотация
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.
%0 Conference Paper
%1 Al-Rawi2007
%A Al-Rawi, Mohammed
%B Proceedings of the 37th International Conference on Computers and
Industrial Engineering
%D 2007
%K Computational Zernike algorithms complexity, digital fast filter, image, moments, symmetry,
%T The fast Zernike moments
%X 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.
@inproceedings{Al-Rawi2007,
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.},
added-at = {2011-03-27T19:35:34.000+0200},
author = {Al-Rawi, Mohammed},
biburl = {https://www.bibsonomy.org/bibtex/2b89c676160840199539e4de3d30903c6/cocus},
bookeditor = {M. H. Elwany and A. B. Eltawil},
booktitle = {Proceedings of the 37th International Conference on Computers and
Industrial Engineering},
file = {:./fastzernike2007.pdf:PDF},
interhash = {904424defbda55f3ac86438aab103bc8},
intrahash = {b89c676160840199539e4de3d30903c6},
keywords = {Computational Zernike algorithms complexity, digital fast filter, image, moments, symmetry,},
owner = {CK},
review = {Achtung, klingt unglaubwürdig, habs aber noch nicht wirklich gelesen},
timestamp = {2011-03-27T19:35:35.000+0200},
title = {The fast Zernike moments},
titleaddon = {October 20--23, 2007},
venue = {Alexandria, Egypt},
year = 2007
}