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.

Recently, the internet has made the users able to transmit the digital media in the easiest manner. In spite of this facility of the internet, this may lead to several threats that are concerned with confidentiality of transferred media contents such as media authentication and integrity verification. For these reasons, data hiding methods and cryptography are used to protect the contents of digital media. In this paper, an enhanced method of image steganography combined with visual cryptography has been proposed. A secret logo (binary image) of size (128x128) is encrypted by applying (2 out 2 share) visual cryptography on it to generate two secret share. During the embedding process, a cover red, green, and blue (RGB) image of size (512

In this study, an analysis of re-using the JPEG lossy algorithm on the quality of satellite imagery is presented. The standard JPEG compression algorithm is adopted and applied using Irfan view program, the rang of JPEG quality that used is 50-100.Depending on the calculated satellite image quality variation, the maximum number of the re-use of the JPEG lossy algorithm adopted in this study is 50 times. The image quality degradation to the JPEG quality factor and the number of re-use of the JPEG algorithm to store the satellite image is analyzed.

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le

the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream

This study was aimed to reduce the amount of the sprayed solution lost during trees spraying.  At the same time, the concentration of the sprayed solution on the target (tree or bush) must be ensured and to find the best combination of treatments. Two factors controls the spraying process: (i) spraying speed (1.2 km/h, 2.4 km/h, 3.6 km/h), and (ii) the type of sensor. The test results showed a significant loss reduction percentage. It reached (6.05%, 5.39% and 2.05%) at the speed (1.2 km/h, 2.4 km/h, 3.6 km/h), respectively. It was noticed that when the speed becomes higher the loss becomes less accordingly. The interaction between the 3.6 km/h speed and the type of Ultrasonic sensor led to a decrease in the percentage of the spray

Ultrasound has been used as a diagnostic modality for many intraocular diseases, due its safety, low cost, real time and wide availability. Unfortunately, ultrasound images suffer from speckle artifact that are tissue dependent. In this work, we will offer a method to reduce speckle noise and improve ultrasound image to raise the human diagnostic performance. This method combined undecimated wavelet transform with a wavelet coefficient mapping function: where UDWT used to eliminate the noise and a wavelet coefficient mapping function used to enhance the contrast of denoised images obtained from the first component. This methods can be used not only as a means for improving visual quality of medical images but also as a preprocessing

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit