An efficient algorithm for fast computation of Zernike moments

Chee Way Chong, R. Mukundan, P. Raveendran

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

9 Citations (Scopus)


The study of an efficient algorithm for the computation of Zernike moments was presented. The two-stage recursive algorithm was introduced in order to reduce the complex computation involved in Zernike radial polynomials. The proposed algorithm eliminated the need of factorial functions evaluation. The understudied algorithm also enabled the derivation of lower order radial polynomials from the high order polynomials, without computing the details of each radial polynomial.

Original languageEnglish
Title of host publicationProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Number of pages4
Publication statusPublished - 2002
Externally publishedYes
EventJoint Conference on Information Sciences 2002 - Research Triange Park, United States of America
Duration: 8 Mar 200213 Mar 2002
Conference number: 6th

Publication series

NameProceedings of the Joint Conference on Information Sciences


ConferenceJoint Conference on Information Sciences 2002
Abbreviated titleJCIS 2002
Country/TerritoryUnited States of America
CityResearch Triange Park

Cite this