Mahmmod, BM, Abdulhussain, SH, Suk, T and Hussain, A (2022) Fast Computation of Hahn Polynomials for High Order Moments. IEEE Access.

Preview

Text Fast Computation of Hahn Polynomials for High Order Moments.pdf - Published Version Available under License Creative Commons Attribution. Download (3MB) | Preview

Abstract

Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as object representation; however, they suffer from the problem of numerical instability when the moment order becomes large. In this paper, an operative method to compute the Hahn orthogonal basis is proposed and applied to high orders. This paper developed a new mathematical model for computing the initial value of the DHP and for different values of DHP parameters (α and β). In addition, the proposed method is composed of two recurrence algorithms with an adaptive threshold to stabilize the generation of the DHP coefficients. It is compared with state-of-the-art algorithms in terms of computational cost and the maximum size that can be correctly generated. The experimental results show that the proposed algorithm performs better in both parameters for wide ranges of parameter values α and β, and polynomial sizes.

Item Type:	Article
Uncontrolled Keywords:	08 Information and Computing Sciences; 09 Engineering; 10 Technology
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > TA Engineering (General). Civil engineering (General)
Divisions:	Computer Science & Mathematics
Publisher:	Institute of Electrical and Electronics Engineers (IEEE)
SWORD Depositor:	A Symplectic
Date Deposited:	06 May 2022 09:30
Last Modified:	20 May 2022 11:45
DOI or ID number:	10.1109/ACCESS.2022.3170893
URI:	https://researchonline.ljmu.ac.uk/id/eprint/16767

View Item