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
Tue Aug 10 2021
Journal Name
Design Engineering
Lossy Image Compression Using Hybrid Deep Learning Autoencoder Based On kmean Clusteri
...Show More Authors

Image compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eye

... Show More
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
Solving Whitham-Broer-Kaup-Like Equations Numerically by using Hybrid Differential Transform Method and Finite Differences Method
...Show More Authors

This paper aims to propose a hybrid approach of two powerful methods, namely the differential transform and finite difference methods, to obtain the solution of the coupled Whitham-Broer-Kaup-Like equations which arises in shallow-water wave theory. The capability of the method to such problems is verified by taking different parameters and initial conditions. The numerical simulations are depicted in 2D and 3D graphs. It is shown that the used approach returns accurate solutions for this type of problems in comparison with the analytic ones.

View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Clarivate 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 (27)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Sun Feb 03 2019
Journal Name
Iraqi Journal Of Physics
Microscopic effective charges and quadrupole moments of sd-shell and sd-pf cross-shell nuclei with Z≥13
...Show More Authors

View Publication Preview PDF
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 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
Sun Jan 01 2017
Journal Name
Ieee Access
On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order
...Show More Authors

View Publication
Scopus (52)
Crossref (54)
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 (1)
Scopus Clarivate Crossref
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 (6)
Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Telkomnika (telecommunication Computing Electronics And Control)
Dorsal hand veins features extraction and recognition by correlation coefficient
...Show More Authors

View Publication
Scopus (5)
Crossref (1)
Scopus Crossref