There are many images you need to large Khoznah space With the continued evolution of storage technology for computers, there is a need nailed required to reduce Alkhoznip space for pictures and image compression in a good way, the conversion method Alamueja

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.

   In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n Ï• αω      where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI

In this paper, the Decomposition method was used to find approximation solutions for a system of linear Fredholm integral equations of the second kind. In this method the solution of a functional equations is considered as the sum of an infinite series usually converging to the solution, and Adomian decomposition method for solving linear and nonlinear integral equations. Finally, numerical examples are prepared to illustrate these considerations.

Imaging by Ultrasound (US) is an accurate and useful modality for the assessment of gestational age (GA), estimation fetal weight, and monitoring the fetal growth during pregnancy, is a routine part of prenatal care, and that can greatly impact obstetric management. Estimation of GA is important in obstetric care, making appropriate management decisions requires accurate appraisal of GA. Accurate GA estimation may assist obstetricians in appropriately counseling women who are at risk of a preterm delivery about likely neonatal outcomes, and it is essential in the evaluation of the fetal growth and detection of intrauterine growth restriction. There are many formulas are used to estimate fetal GA in the world, but it's not specify fo

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to