Preferred Language
Articles
/
eBb0BIcBVTCNdQwCjS0l
Fast and accurate computation of high‐order Tchebichef polynomials
...Show More Authors

Scopus Clarivate Crossref
View Publication
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (32)
Crossref (28)
Scopus Clarivate 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 (29)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Thu Aug 13 2020
Journal Name
Journal Of Imaging
On Computational Aspects of Krawtchouk Polynomials for High Orders
...Show More Authors

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

... Show More
View Publication Preview PDF
Scopus (29)
Crossref (27)
Scopus Clarivate Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Baghdad Science Journal
Accurate Four-Step Hybrid Block Method for Solving Higher-Order Initial Value Problems
...Show More Authors

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Ain Shams Engineering Journal
Performance enhancement of high degree Charlier polynomials using multithreaded algorithm
...Show More Authors

View Publication
Scopus (1)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Aug 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Audio compression using transforms and high order entropy encoding
...Show More Authors

<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low &amp; multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.

... Show More
View Publication Preview PDF
Scopus (10)
Crossref (4)
Scopus Crossref
Publication Date
Wed Jan 01 2014
Journal Name
Lap Lambert Academic Publishing
High Order Tow Point Boundary Value Problems And Its Applications
...Show More Authors

The aim of this book is to present a method for solving high order ordinary differential equations with two point boundary condition of the different kind, we propose semi-analytic technique using two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, we discussion the existence and uniqueness of solutions and many examples are presented to demonstrate the applicability, accuracy and efficiency of the methods by compared with conventional method .i.e. VIDM , Septic B-Spline , , NIM , HPM, Haar wavelets on one hand and to confirm the order convergence on the other

... Show More
View Publication
Publication Date
Sat Jan 01 2022
Journal Name
Ieee Transactions On Robotics
Lidar-Level Localization With Radar? The CFEAR Approach to Accurate, Fast, and Robust Large-Scale Radar Odometry in Diverse Environments
...Show More Authors

View Publication
Scopus (31)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Mon Dec 05 2022
Journal Name
Baghdad Science Journal
Analysis of Fuel Burnup and Transmutations at High Burnup of Sodium Fast Breeder Reactor
...Show More Authors

In this paper, the Monte Carlo N-Particle extended  computer code (MCNP) were used to design a model of the European Sodium-cooled Fast Reactor. The multiplication factor, conversion factor, delayed neutrons fraction, doppler constant, control rod worth, sodium void worth, masses for major heavy nuclei, radial and axial power distribution at high burnup are studied. The results show that the reactor breeds fissile isotopes with a conversion ratio of 0.994 at fuel burnup 70 (GWd/T), and minor actinides are buildup inside the reactor core. The study aims to check the efficiency of the model on the calculation of the neutronic parameters of the core at high burnup.

View Publication Preview PDF
Scopus Crossref