represent websites link support of human communicate and cohesion of cultures different depending on their languages and their environments around, it was the evolution of one of the most important means of communication of services for electronic networks, the Internet active role in containing the world Bbodqh science and knowledge to Taatlaqah cultures from which derives its intellectual and cognitive cupboards continuity and as a link language for each those environmental Altdadat, linguistic, religious, political, economic . We all know that these electronic means difficult promise ring intellectual and mental connectivity for the masses polarized without being of the image as an element Kravekaa supporter of the electronic media an

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.

In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.

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

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

Generally, direct measurement of soil compression index (Cc) is expensive and time-consuming. To save time and effort, indirect methods to obtain Cc may be an inexpensive option. Usually, the indirect methods are based on a correlation between some easier measuring descriptive variables such as liquid limit, soil density, and natural water content. This study used the ANFIS and regression methods to obtain Cc indirectly. To achieve the aim of this investigation, 177 undisturbed samples were collected from the cohesive soil in Sulaymaniyah Governorate in Iraq. Results of this study indicated that ANFIS models over-performed the Regression method in estimating Cc with R² of 0.66 and 0.48 for both ANFIS and Regre

Concealing the existence of secret hidden message inside a cover object is known as steganography, which is a powerful technique. We can provide a secret communication between sender and receiver using Steganography. In this paper, the main goal is for hiding secret message into the pixels using Least Significant Bit (LSB) of blue sector of the cover image. Therefore, the objective is by mapping technique presenting a model for hiding text in an image. In the model for proposing the secret message, convert text to binary also the covering (image) is divided into its three original colors, Red, Green and Blue (RGB) , use the Blue sector convert it to binary,  hide two bits from the message in  two bits of the least significant b

Media plays an important role in shaping the mental image of their audiences for individuals, groups and organizations, States and peoples. It is the window through which overlooks the masses on events and issues, and in the light of their exposure to these means are their opinions and impressions.

Despite the importance of direct experiences in shaping opinions, drawing pictures and impressions, it is inevitable to rely on these means as individuals can not engage in direct experiences with thousands of events, issues and topics that concern their community and other societies.

There is no doubt that media is of great importance at the present time, because of its significant impact in the management of the course of pol

In this study, a chaotic method is proposed that generates S-boxes similar to AES S-boxes with the help of a private key belonging to

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the produ