Preferred Language
Articles
/
kxb6BIcBVTCNdQwCjS17
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 image datasets, ORL and FEI. Different state-of-the-art face recognition methods were compared with the proposed method in order to evaluate its accuracy. We demonstrate that the proposed method achieves the highest recognition rate in different considered scenarios. Based on the obtained results, it can be seen that the proposed method is robust against noise and significantly outperforms previous approaches in terms of speed.

Scopus Clarivate Crossref
View Publication
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function
...Show More Authors

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Engineering
Data Aggregation in Wireless Sensor Networks Using Modified Voronoi Fuzzy Clustering Algorithm
...Show More Authors

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

... Show More
View Publication Preview PDF
Publication Date
Sun Aug 01 2021
Journal Name
Telkomnika (telecommunication Computing Electronics And Control)
Online 3D path planning for Tri-copter drone using GWO-IBA algorithm
...Show More Authors

View Publication
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Tue Jan 30 2024
Journal Name
Iraqi Journal Of Science
Parallel Particle Swarm Optimization Algorithm for Identifying Complex Communities in Biological Networks
...Show More Authors

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Wed Jan 15 2003
Journal Name
كلية الترا ث الجامعة
Estimating an Exponentiated Expanded Power Function Distribution Using an Artificial Intelligence Algorithm
...Show More Authors

The distribution of the expanded exponentiated power function EEPF with four parameters, was presented by the exponentiated expanded method using the expanded distribution of the power function, This method is characterized by obtaining a new distribution belonging to the exponential family, as we obtained the survival rate and failure rate function for this distribution, Some mathematical properties were found, then we used the developed least squares method to estimate the parameters using the genetic algorithm, and a Monte Carlo simulation study was conducted to evaluate the performance of estimations of possibility using the Genetic algorithm GA.

Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
An Evolutionary Algorithm for Task scheduling Problem in the Cloud-Fog environment
...Show More Authors
Abstract<p>The rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme</p> ... Show More
View Publication
Scopus (15)
Crossref (3)
Scopus Crossref
Publication Date
Sat Dec 31 2016
Journal Name
Al-kindy College Medical Journal
A Comparison of Sagittal Sections of Short T1inversion Recovery and T2 Weighted Fast Spin Echo Magnetic Resonance Sequences for Detection of Multiple Sclerosis Spinal Cord Lesions
...Show More Authors

Background: Multiple sclerosis is a chronic autoimmune inflammatory demyelinating disease of the central nervous system of unknown etiology. Different techniques and magnetic resonance image sequences are widely used and compared to each other to improve the detection of multiple sclerosis lesions in the spinal cord. Objective: To evaluate the ability of MRI short tau inversion recovery sequences in improvementof multiple sclerosis spinal cord lesion detection when compared to T2 weighted image sequences. Type of the study: A retrospective study. Methods: this study conducted from 15thAugust 2013 to 30thJune 2014 at Baghdad teaching hospital. 22 clinically definite MS patients with clinical features suggestive of spinal cord involvement,

... Show More
View Publication Preview PDF
Publication Date
Tue Jan 10 2017
Journal Name
International Journal Of Dynamics And Control
On local approximation-based adaptive control with applications to robotic manipulators and biped robots
...Show More Authors

View Publication
Scopus (10)
Crossref (7)
Scopus Crossref
Publication Date
Fri Jul 01 2016
Journal Name
International Journal Of Modern Trends In Engineering And Research (ijmter)
An image processing oriented optical mark reader based on modify multi-connect architecture (MMCA)
...Show More Authors

Optical Mark Recognition (OMR) is the technology of electronically extracting intended data from marked fields, such as squareand bubbles fields, on printed forms. OMR technology is particularly useful for applications in which large numbers of hand-filled forms need to be processed quickly and with a great degree of accuracy. The technique is particularly popular with schools and universities for the reading in of multiple choice exam papers. This paper proposed OMRbased on Modify Multi-Connect Architecture (MMCA) associative memory, its work in two phases: training phase and recognition phase. The proposed method was also able to detect more than one or no selected choice. Among 800 test samples with 8 types of grid answer sheets and tota

... Show More
Preview PDF