Preferred Language
Articles
/
7hYLBYcBVTCNdQwCPS3Z
A New Separable Moments Based on Tchebichef-Krawtchouk Polynomials
...Show More Authors

Scopus Clarivate Crossref
View Publication
Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

... Show More
View Publication
Scopus (35)
Crossref (32)
Scopus Clarivate Crossref
Publication Date
Mon Apr 15 2019
Journal Name
Proceedings Of The International Conference On Information And Communication Technology
A steganography based on orthogonal moments
...Show More Authors

View Publication
Scopus (30)
Crossref (24)
Scopus Clarivate Crossref
Publication Date
Sun Sep 11 2022
Journal Name
Concurrency And Computation: Practice And Experience
Fast and accurate computation of high‐order Tchebichef polynomials
...Show More Authors

View Publication
Scopus (31)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Fri Mar 12 2021
Journal Name
Sensors
A Robust Handwritten Numeral Recognition Using Hybrid Orthogonal Polynomials and Moments
...Show More Authors

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a

... Show More
View Publication
Scopus (38)
Crossref (38)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2022
Journal Name
Ieee Access
Fast Computation of Hahn Polynomials for High Order Moments
...Show More Authors

View Publication
Scopus (41)
Crossref (41)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Ieee Access
Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials
...Show More Authors

View Publication
Scopus (6)
Crossref (4)
Scopus Crossref
Publication Date
Mon May 15 2017
Journal Name
International Journal Of Image And Data Fusion
Image edge detection operators based on orthogonal polynomials
...Show More Authors

View Publication
Scopus (33)
Crossref (10)
Scopus Crossref
Publication Date
Fri Jul 01 2011
Journal Name
Engineering And Technology Journal
Off-Line Arabic Signature Recognition Based on Invariant Moments Properties
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Mathematics
Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments
...Show More Authors

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

... Show More
View Publication
Scopus (34)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Mon Jan 09 2023
Journal Name
2023 15th International Conference On Developments In Esystems Engineering (dese)
Low-Distortion MMSE Estimator for Speech Enhancement Based on Hahn Moments
...Show More Authors

View Publication
Scopus (3)
Crossref (2)
Scopus Crossref