This work implements the face recognition system based on two stages, the first stage is feature extraction stage and the second stage is the classification stage. The feature extraction stage consists of Self-Organizing Maps (SOM) in a hierarchical format in conjunction with Gabor Filters and local image sampling. Different types of SOM’s were used and a comparison between the results from these SOM’s was given.

The next stage is the classification stage, and consists of self-organizing map neural network; the goal of this stage is to find the similar image to the input image. The proposal method algorithm implemented by using C++ packages, this work is successful classifier for a face database consist of 20

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

The research aims to determine the mix of production optimization in the case of several conflicting objectives to be achieved at the same time, therefore, discussions dealt with the concept of programming goals and entrances to be resolved and dealt with the general formula for the programming model the goals and finally determine the mix of production optimization using a programming model targets to the default case.

This study focused on spectral clustering (SC) and three-constraint affinity matrix spectral clustering (3CAM-SC) to determine the number of clusters and the membership of the clusters of the COST 2100 channel model (C2CM) multipath dataset simultaneously. Various multipath clustering approaches solve only the number of clusters without taking into consideration the membership of clusters. The problem of giving only the number of clusters is that there is no assurance that the membership of the multipath clusters is accurate even though the number of clusters is correct. SC and 3CAM-SC aimed to solve this problem by determining the membership of the clusters. The cluster and the cluster count were then computed through the cluster-wise J

Abstract

The aim of the present work is to control of metal buried corrosion by alteration the media method. This method depended on the characteristics of each media. The corrosion rates in different media (soil, sand, porcelanite stone and gravel) for specimens of low carbon steel were measured by two methods weight loss method and polarization method, weight loss measured by buried specimens in these medias separately for 90 days. The polarization method includes preparing of specimen and salt solutions have electrical resistivity equivalent electrical resistivity of these media. The corrosion rate of two method results in (soil > sand> porcelainte stone> gravel). The lower corrosion rate happene

The population has been trying to use clean energy instead of combustion. The choice was to use liquefied petroleum gas (LPG) for domestic use, especially for cooking due to its advantages as a light gas, a lower cost, and clean energy. Residential complexes are supplied with liquefied petroleum gas for each housing unit, transported by pipes from LPG tanks to the equipment. This research aims to simulate the design and performance design of the LPG system in the building that is applied to a residential complex in Baghdad taken as a study case with eight buildings. The building has 11 floors, and each floor has four apartments. The design in this study has been done in two parts, part one is the design of an LPG system for one building, an

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a