Fast Computation of Hahn Polynomials for High Order Moments
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...
Main Authors: | Basheera M. Mahmmod, Sadiq H. Abdulhussain, Tomas Suk, Abir Hussain |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9764684/ |
Similar Items
-
Bivariate Hahn moments for image reconstruction
by: Wu Haiyong, et al.
Published: (2014-06-01) -
Stable Calculation of Discrete Hahn Functions
by: Albertus C. den Brinker
Published: (2022-02-01) -
On the Orthogonality of q-Classical Polynomials of the Hahn Class
by: Renato Álvarez-Nodarse, et al.
Published: (2012-07-01) -
On Fractional Symmetric Hahn Calculus
by: Nichaphat Patanarapeelert, et al.
Published: (2019-09-01) -
On fractional Hahn calculus
by: Tanapat Brikshavana, et al.
Published: (2017-11-01)