Preferred Language
Articles
/
zhYEBYcBVTCNdQwCIi1e
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 application in more realistic noise environments. Therefore, finding a feasible and accurate handwritten numeral recognition method that is accurate in the more practical noisy environment is crucial. To this end, this paper proposes a new scheme for handwritten numeral recognition using Hybrid orthogonal polynomials. Gradient and smoothed features are extracted using the hybrid orthogonal polynomial. To reduce the complexity of feature extraction, the embedded image kernel technique has been adopted. In addition, support vector machine is used to classify the extracted features for the different numerals. The proposed scheme is evaluated under three different numeral recognition datasets: Roman, Arabic, and Devanagari. We compare the accuracy of the proposed numeral recognition method with the accuracy achieved by the state-of-the-art recognition methods. In addition, we compare the proposed method with the most updated method of a convolutional neural network. The results show that the proposed method achieves almost the highest recognition accuracy in comparison with the existing recognition methods in all the scenarios considered. Importantly, the results demonstrate that the proposed method is robust against the noise distortion and outperforms the convolutional neural network considerably, which signifies the feasibility and the effectiveness of the proposed approach in comparison to the state-of-the-art recognition methods under both clean noise and more realistic noise environments.

Scopus Clarivate Crossref
View Publication
Publication Date
Fri May 16 2014
Journal Name
International Journal Of Computer Applications
Design and Implementation of Real Time Face Recognition System (RTFRS)
...Show More Authors

View Publication
Crossref (7)
Crossref
Publication Date
Thu Dec 01 2022
Journal Name
Journal Of Energy Storage
A hybrid solidification enhancement in a latent-heat storage system with nanoparticles, porous foam, and fin-aided foam strips
...Show More Authors

Scopus (32)
Crossref (25)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2024
Journal Name
Baghdad Science Journal
Bernoulli Polynomials Method for Solving Integral Equations with Singular Kernel
...Show More Authors

هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Mon Mar 01 2021
Journal Name
Iop Conference Series: Materials Science And Engineering
An efficient multistage CBIR based on Squared Krawtchouk-Tchebichef polynomials
...Show More Authors
Abstract<p>Image databases are increasing exponentially because of rapid developments in social networking and digital technologies. To search these databases, an efficient search technique is required. CBIR is considered one of these techniques. This paper presents a multistage CBIR to address the computational cost issues while reasonably preserving accuracy. In the presented work, the first stage acts as a filter that passes images to the next stage based on SKTP, which is the first time used in the CBIR domain. While in the second stage, LBP and Canny edge detectors are employed for extracting texture and shape features from the query image and images in the newly constructed database. The p</p> ... Show More
View Publication
Crossref (4)
Crossref
Publication Date
Sat Apr 01 2023
Journal Name
Baghdad Science Journal
Some K-Banhatti Polynomials of First Dominating David Derived Networks
...Show More Authors

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

View Publication Preview PDF
Scopus (3)
Scopus Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Ieee Access
On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order
...Show More Authors

View Publication
Scopus (55)
Crossref (55)
Scopus Clarivate Crossref
Publication Date
Tue Jun 04 2024
Journal Name
Computation
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
...Show More Authors

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

... Show More
View Publication
Scopus (4)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Thu Jan 11 2024
Journal Name
Tropical Journal Of Pharmaceutical Research
Application of Taguchi orthogonal array in optimization of the synthesis and crystallinity of metal organic framework 5 (MOF 5)
...Show More Authors

Purpose: To use the L25 Taguchi orthogonal array for optimizing the three main solvothermal parameters that affect the synthesis of metal-organic frameworks-5 (MOF-5). Methods: The L25 Taguchi methodology was used to study various parameters that affect the degree of crystallinity (DOC) of MOF-5. The parameters comprised temperature of synthesis, duration of synthesis, and ratio of the solvent, N,N-dimethyl formamide (DMF) to reactants. For each parameter, the volume of DMF was varied while keeping the weight of reactants constant. The weights of 1,4-benzodicarboxylate (BDC) and Zn(NO3)2.6H2O used were 0.390 g and 2.166 g, respectively. For each parameter investigated, five different levels were used. The MOF-5 samples were synthesi

... Show More
View Publication
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Tue Nov 07 2023
Journal Name
Innovative Infrastructure Solutions
Enhancing load-bearing performance of hybrid recycled aggregate concrete-filled columns using SBR, steel fibers and polypropylene fibers
...Show More Authors

View Publication
Scopus (5)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2022
Journal Name
International Middle Eastern Simulation And Modelling Conference 2022, Mesm 2022,
MECHANICS OF COMPOSITE PLATE STRUCTURE REINFORCED WITH HYBRID NANO MATERIALS USING ARTIFICIAL NEURAL NETWORK
...Show More Authors

Scopus (1)
Scopus