In this work a fragile watermarking scheme is presented. This scheme is applied to digital color images in spatial domain. The image is divided into blocks, and each block has its authentication mark embedded in it, we would be able to insure which parts of the image are authentic and which parts have been modified. This authentication carries out without need to exist the original image. The results show the quality of the watermarked image is remaining very good and the watermark survived some type of unintended modification such as familiar compression software like WINRAR and ZIP

Human skin detection, which usually performed before image processing, is the method of discovering skin-colored pixels and regions that may be of human faces or limbs in videos or photos. Many computer vision approaches have been developed for skin detection. A skin detector usually transforms a given pixel into a suitable color space and then uses a skin classifier to mark the pixel as a skin or a non-skin pixel. A skin classifier explains the decision boundary of the class of a skin color in the color space based on skin-colored pixels. The purpose of this research is to build a skin detection system that will distinguish between skin and non-skin pixels in colored still pictures. This performed by introducing a metric that measu

Although text document images authentication is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. Most previous researches in this field depend on insertion watermark in the document, the drawback in these techniques lie in the fact that changing pixel values in a binary document could introduce irregularities that are very visually noticeable. In this paper, a new method is proposed for object-based text document authentication, in which I propose a different approach where a text document is signed by shifting individual words slightly left or right from their original positions to make the center of gravity for each line fall in with the m

This article studies a comprehensive methods of edge detection and algorithms in digital images which is reflected a basic process in the field of image processing and analysis. The purpose of edge detection technique is discovering the borders that distinct diverse areas of an image, which donates to refining the understanding of the image contents and extracting structural information. The article starts by clarifying the idea of an edge and its importance in image analysis and studying the most noticeable edge detection methods utilized in this field, (e.g. Sobel, Prewitt, and Canny filters), besides other schemes based on distinguishing unexpected modifications in light intensity and color gradation. The research as well discuss

في هذا البحث نحاول تسليط الضوء على إحدى طرائق تقدير المعلمات الهيكلية لنماذج المعادلات الآنية الخطية والتي تزودنا بتقديرات متسقة تختلف أحيانا عن تلك التي نحصل عليها من أساليب الطرائق التقليدية الأخرى وفق الصيغة العامة لمقدرات K-CLASS. وهذه الطريقة تعرف بطريقة الإمكان الأعظم محدودة المعلومات "LIML" أو طريقة نسبة التباين الصغرى"LVR

          This study was done to evaluate a new technique to determine the presence of methamphetamine in the hair using nano bentonite-based adsorbent as the filler of extraction column. The state of the art of this study was based on the presence of silica in the nano bentonite that was assumed can interact with methamphetamine. The hair used was treated using methanol to extract the presence of methamphetamine, then it was continued by sonicating the hair sample. Qualitative analysis using Marquish reagent was performed to confirm the presence of methamphetamine in the isolate.The hair sample that has been taken in a different period confirmed that this current developing method can be used to analyzed methamphetamine. This m

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex