Fast Computation of Hahn Polynomials for High Order Moments

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Fast Computation of Hahn Polynomials for High Order Moments

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Fast Computation of Hahn Polynomials for High Order Moments

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

<a href="/cs/project/GA21-03921S" target="_blank" >GA21-03921S: Inverzní problémy ve zpracování obrazu</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Access

ISSN

2169-3536

e-ISSN

2169-3536

Svazek periodika

10

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

48719-48732

Kód UT WoS článku

000795507300001

EID výsledku v databázi Scopus

2-s2.0-85129655037