Abstract
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 language | English |
|---|---|
| Title of host publication | Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 |
| Editors | J.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar |
| Pages | 785-788 |
| Number of pages | 4 |
| Publication status | Published - 2002 |
| Externally published | Yes |
| Event | Joint Conference on Information Sciences 2002 - Research Triange Park, United States of America Duration: 8 Mar 2002 → 13 Mar 2002 Conference number: 6th |
Publication series
| Name | Proceedings of the Joint Conference on Information Sciences |
|---|---|
| Volume | 6 |
Conference
| Conference | Joint Conference on Information Sciences 2002 |
|---|---|
| Abbreviated title | JCIS 2002 |
| Country/Territory | United States of America |
| City | Research Triange Park |
| Period | 8/03/02 → 13/03/02 |