The study aims to study the geographical distribution of electricpower plants in Iraq, except the governorates of Kurdistan Region (Dohuk, Erbil, Sulaymaniyah) due to lack of data.

In order to reach the goal of the research was based on some mathematical equations and statistical methods to determine how the geographical distribution of these stations (gas, hydropower, steam, diesel) within the provinces and the concentration of them as well as the possibility of the classification of power plants in Iraq to facilitate understanding of distribution in a scientific manner is characterized by objectively.

The most important results of the research are that there are a number of factors that led to the irregular distribution

Natural gas and oil are one of the mainstays of the global economy. However, many issues surround the pipelines that transport these resources, including aging infrastructure, environmental impacts, and vulnerability to sabotage operations. Such issues can result in leakages in these pipelines, requiring significant effort to detect and pinpoint their locations. The objective of this project is to develop and implement a method for detecting oil spills caused by leaking oil pipelines using aerial images captured by a drone equipped with a Raspberry Pi 4. Using the message queuing telemetry transport Internet of Things (MQTT IoT) protocol, the acquired images and the global positioning system (GPS) coordinates of the images' acquisition are

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

     Recognizing cars is a highly difficult task due to the wide variety in the appearance of cars from the same car manufacturer. Therefore, the car logo is the most prominent indicator of the car manufacturer. The captured logo image suffers from several problems, such as a complex background, differences in size and shape, the appearance of noise, and lighting circumstances. To solve these problems, this paper presents an effective technique for extracting and recognizing a logo that identifies a car. Our proposed method includes four stages: First, we apply the k-medoids clustering method to extract the logo and remove the background and noise. Secondly, the logo image is converted to grayscale and also converted to a binary imag

     One major problem facing some environments, such as insurance companies and government institutions, is when a massive amount of documents has to be processed every day. Thus, an automatic stamp recognition system is necessary. The extraction and recognition of a general stamp is not a simple task because it may have various shapes, sizes, backgrounds, patterns, and colors. Moreover, the stamp can be printed on documents with bad quality and rotation with various angles. Our proposed method presents a new approach for the preprocessing and recognition of color stamp images. It consists of four stages, which are stamp extraction, preprocessing, feature extraction, and matching. Stamp extraction is achieved to isol

The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

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

Face recognition is one of the most applications interesting in computer vision and pattern recognition fields. This is for many reasons; the most important of them are the availability and easy access by sensors. Face recognition system can be a sub-system of many applications. In this paper, an efficient face recognition algorithm is proposed based on the accuracy of Gabor filter for feature extraction and computing the Eigen faces. In this work, efficient compressed feature vector approach is proposed. This compression for feature vector gives a good recognition rate reaches to 100% and reduced the complexity of computing Eigen faces. Faces94 data base was used to test method.