FG Mohammed, HM Al-Dabbas, Iraqi journal of science, 2018 - Cited by 6

In petroleum reservoir engineering, history matching refers to the calibration process in which a reservoir simulation model is validated through matching simulation outputs with the measurement of observed data. A traditional history matching technique is performed manually by engineering in which the most uncertain observed parameters are changed until a satisfactory match is obtained between the generated model and historical information. This study focuses on step by step and trial and error history matching of the Mishrif reservoir to constrain the appropriate simulated model. Up to 1 January 2021, Buzurgan Oilfield, which has eighty-five producers and sixteen injectors and has been under production for 45 years when it started

In information security, fingerprint verification is one of the most common recent approaches for verifying human identity through a distinctive pattern. The verification process works by comparing a pair of fingerprint templates and identifying the similarity/matching among them. Several research studies have utilized different techniques for the matching process such as fuzzy vault and image filtering approaches. Yet, these approaches are still suffering from the imprecise articulation of the biometrics’ interesting patterns. The emergence of deep learning architectures such as the Convolutional Neural Network (CNN) has been extensively used for image processing and object detection tasks and showed an outstanding performance compare

In this paper, a handwritten digit classification system is proposed based on the Discrete Wavelet Transform and Spike Neural Network. The system consists of three stages. The first stage is for preprocessing the data and the second stage is for feature extraction, which is based on Discrete Wavelet Transform (DWT). The third stage is for classification and is based on a Spiking Neural Network (SNN). To evaluate the system, two standard databases are used: the MADBase database and the MNIST database. The proposed system achieved a high classification accuracy rate with 99.1% for the MADBase database and 99.9% for the MNIST database

In this paper, a compression system with high synthetic architect is introduced, it is based on wavelet transform, polynomial representation and quadtree coding. The bio-orthogonal (tap 9/7) wavelet transform is used to decompose the image signal, and 2D polynomial representation is utilized to prune the existing high scale variation of image signal. Quantization with quadtree coding are followed by shift coding are applied to compress the detail band and the residue part of approximation subband. The test results indicate that the introduced system is simple and fast and it leads to better compression gain in comparison with the case of using first order polynomial approximation.

The differential protection of power transformers appears to be more difficult than any type of protection for any other part or element in a power system. Such difficulties arise from the existence of the magnetizing inrush phenomenon. Therefore, it is necessary to recognize between inrush current and the current arise from internal faults. In this paper, two approaches based on wavelet packet transform (WPT) and S-transform (ST) are applied to recognize different types of currents following in the transformer. In WPT approach, the selection of optimal mother wavelet and the optimal number of resolution is carried out using minimum description length (MDL) criteria before taking the decision for the extraction features from the WPT tree

Image compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre