In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

The rapid development of telemedicine services and the requirements for exchanging medical information between physicians, consultants, and health institutions have made the protection of patients’ information an important priority for any future e-health system. The protection of medical information, including the cover (i.e. medical image), has a specificity that slightly differs from the requirements for protecting other information. It is necessary to preserve the cover greatly due to its importance on the reception side as medical staff use this information to provide a diagnosis to save a patient's life. If the cover is tampered with, this leads to failure in achieving the goal of telemedicine. Therefore, this work provides an in

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

The study aims mainly to evaluate the performance of Sharq Dijila water treatment plant in removing turbidity for the period of 1-4-2001 to 31-3-2004. Daily data for turbidity of raw, clarified, filtered, and supplied water were analyzed. The results of the study showed that there is a wide variation in turbidity levels of raw water fluctuating between 10-1000 NTU with mean value of 41.3 NTU. Turbidity values of the clarified water varied between 1.4-77 NTU. Based on the turbidity value of 10 NTU and 20 NTU (the design maximum turbidity) the readings gave an acceptable percentage of 32.4% and 86% respectively. The turbidity of filtered water ranged between 0.2-4.5 NTU which are completely in compliance with Iraqi and WHO standards. In ac

With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and

University libraries seek to evaluate their performance in order to correct their path and adjust it in the right direction. Therefore, they use (performance indicators), which are a tool used by institutions to evaluate the weaknesses and strengths in their work and the reasons for failure to achieve some goals sometimes. They convert (goals, procedures and actions) into a formula that can be measured mathematically, which contributes to the library determining the gap between its current performance and what those libraries are supposed to be on, clarifying the path that the library is following, controlling the risks that may befall it, and thus enhancing the process of continuous improvement to avoid areas of failure and weakness becaus

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

The aim of this research is to test the relationship of influence and correlation between strategic performance and its five dimensions (financial dimension, after internal processes, after internal customer satisfaction, after learning and growth, environmental and social dimension), by adopting international indicators in agricultural projects To determine the extent of the differences between the research variable and its dimensions, and then try to come out with a number of recommendations that contribute to the evaluation of agricultural projects and their performance by diagnosing and treating deviations, and based on the importance of the research topic in agricultural institutions. Institutions of the Environment and Soci