A Theoretical Comparison among Recursive Algorithms for Fast Computation of Zernike Moments Using the Concept of Time Complexity

ISSN Print: 2161-1203
ISSN Online: 2161-1211
www.scirp.net/journal/ajcm
E-mail: [email protected]

Citations

"A Theoretical Comparison among Recursive Algorithms for Fast Computation of Zernike Moments Using the Concept of Time Complexity"
written by Nasrin Bastani, Alireza Vard, Mehdi Jabalameli, Vahid Bastani,
published by American Journal of Computational Mathematics, Vol.11 No.4, 2021

has been cited by the following article(s):

No relevant information.

[1]	A Fast Algorithm for the Decomposition of Functions Into Series of Zernike Polynomials 2024 IEEE 3rd International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE), 2024 DOI:10.1109/PIERE62470.2024.10805018