Balanced Binary Tree Schemes for Computing Zernike Radial Polynomials

DOI10.1109/ACCESS.2023.3312717arXiv2212.02495MaRDI QIDQ6419618FDOQ6419618

Authors: Hongyan Zhang, Yu Zhou, Zhi-Qiang Feng 

Publication date: 2 December 2022

Abstract: Zernike radial polynomials play a significant role in application areas such as optics design, imaging systems, and image processing systems. Currently, there are two kinds of numerical schemes for computing the Zernike radial polynomials automatically with computer programs: one is based on the definition in which the factorial operations may lead to the overflow problem and the high order derivatives are troublesome, and the other is based on recursion which is either unstable or with high computational complexity. In this paper, our emphasis is focused on exploring the balanced binary tree (BBT) schemes for computing Zernike radial polynomials: firstly we established an elegant formulae for computation; secondly we proposed the recursive and iterative algorithms based-on BBT; thirdly we analyzed the computational complexity of the algorithms rigorously; finally we verified and validated the performance of BBT schemes by testing the running time. Theoretic analysis shows that the computational complexity of BBT recursive algorithm and iterative algorithm are exponential and quadratic respectively, which coincides with the running time test very well. Experiments show that the time consumption is about $1sim10$ microseconds with different computation platforms for the BBT iterative algorithm (BBTIA), which is stable and efficient for realtime applications.

This page was built for publication: Balanced Binary Tree Schemes for Computing Zernike Radial Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419618)