0576213 - ÚTIA 2024 RIV AU eng J - Článek v odborném periodiku
Mahmmod, B. M. - Abdulhussain, S. H. - Suk, Tomáš - Alsabah, M. - Hussain, A.
Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials.
IEEE Access. Roč. 11, č. 1 (2023), s. 110502-110521. ISSN 2169-3536. E-ISSN 2169-3536
Grant CEP: GA ČR GA21-03921S
Grant ostatní: AV ČR(CZ) StrategieAV21/1
Institucionální podpora: RVO:67985556
Klíčová slova: Racah polynomials * Recurrence formulas * Stabilizing condition * Improved stabilization * Orthogonal moments
Obor OECD: Electrical and electronic engineering
Impakt faktor: 3.4, rok: 2023
Způsob publikování: Open access
http://library.utia.cas.cz/separaty/2023/ZOI/suk-0576213.pdf https://ieeexplore.ieee.org/document/10271275

Discrete Racah polynomials (DRPs) are highly efficient orthogonal polynomials widely used in various scientific fields for signal representation. They find applications in disciplines like image processing and computer vision. Racah polynomials were originally introduced by Wilson and later modified by Zhu to be orthogonal on a discrete set of samples. However, when the degree of the polynomial is high, it encounters numerical instability issues. In this paper, we propose a novel algorithm called Improved Stabilization (ImSt) for computing DRP coefficients. The algorithm partitions the DRP plane into asymmetric parts based on the polynomial size and DRP parameters. We have optimized the use of stabilizing conditions in these partitions. To compute the initial values, we employ the logarithmic gamma function along with a new formula. This combination enables us to compute the initial values efficiently for a wide range of DRP parameter values and large polynomial sizes. Additionally, we have derived a symmetry relation for the case when the Racah polynomial parameters are zero ($a=0$, $\alpha=0$, $ta=0$). This symmetry makes the Racah polynomials symmetric, and we present a different algorithm for this specific scenario. We have demonstrated that the ImSt algorithm works for a broader range of parameters and higher degrees compared to existing algorithms. A comprehensive comparison between ImSt and the existing algorithms has been conducted, considering the maximum polynomial degree, computation time, restriction error analysis, and reconstruction error. The results of the comparison indicate that ImSt outperforms the existing algorithms for various values of Racah polynomial parameters.
Trvalý link: https://hdl.handle.net/11104/0346080