2022
DOI: 10.1109/access.2022.3170893
|View full text |Cite
|
Sign up to set email alerts
|

Fast Computation of Hahn Polynomials for High Order Moments

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 mod… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
35
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(35 citation statements)
references
References 31 publications
0
35
0
Order By: Relevance
“…These transforms include Discrete Hahn Polynomials (DHPs) which has been used for efficient feature extraction in image processing. The work done in [13] addressed some shortcomings and proposed efficient Hahn orthogonal basis to be deployed for higher orders. Similarly, other classes of orthogonal polynomial have also shown promising results in representing higher order signals in orthogonal basis for efficient feature extraction.…”
Section: A Sparsitymentioning
confidence: 99%
“…These transforms include Discrete Hahn Polynomials (DHPs) which has been used for efficient feature extraction in image processing. The work done in [13] addressed some shortcomings and proposed efficient Hahn orthogonal basis to be deployed for higher orders. Similarly, other classes of orthogonal polynomial have also shown promising results in representing higher order signals in orthogonal basis for efficient feature extraction.…”
Section: A Sparsitymentioning
confidence: 99%
“…[28] Fractional Fourier transform is also widely used for image encryption for many years [29,30]. Use of Krawtchouk polynomials [31], Meixner polynomials [32], Hahn polynomials [33] and Charlier polynomials [34] are being recently used by researchers nowadays for feature extraction from images.…”
Section: Introductionmentioning
confidence: 99%
“…For low-quality underwater original images, the traditional semantic segmentation methods have poor segmentation results because they cannot deal with complex underwater environment information [ 8 , 9 ]. To solve the above problems and improve the semantic segmentation effect of underwater images, this paper proposes a new encoder-decoder network structure for the semantic segmentation of underwater images.…”
Section: Introductionmentioning
confidence: 99%