Fast Computation of Hahn Polynomials for High Order Moments
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00565460" target="_blank" >RIV/67985556:_____/22:00565460 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/9764684" target="_blank" >https://ieeexplore.ieee.org/document/9764684</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ACCESS.2022.3170893" target="_blank" >10.1109/ACCESS.2022.3170893</a>
Alternative languages
Result language
angličtina
Original language name
Fast Computation of Hahn Polynomials for High Order Moments
Original language description
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 (alpha and beta). 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 alpha and beta, and polynomial sizes.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering
Result continuities
Project
<a href="/en/project/GA21-03921S" target="_blank" >GA21-03921S: Inverse problems in image processing</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Access
ISSN
2169-3536
e-ISSN
2169-3536
Volume of the periodical
10
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
48719-48732
UT code for WoS article
000795507300001
EID of the result in the Scopus database
2-s2.0-85129655037