The Matching and Mosaic of the satellite imagery play an essential role in many remote sensing and image processing projects. These techniques must be required in a particular step in the project, such as remotely change detection applications and the study of large regions of interest. The matching and mosaic methods depend on many image parameters such as pixel values in the two or more images, projection system associated with the header files, and spatial resolutions, where many of these methods construct the matching and mosaic manually. In this research, georeference techniques were used to overcome the image matching task in semi automotive method. The decision about the quality of the technique can be considered i

As result of exposure in low light-level are images with only a small number of
photons. Only the pixels in which arrive the photopulse have an intensity value
different from zero. This paper presents an easy and fast procedure for simulating
low light-level images by taking a standard well illuminated image as a reference.
The images so obtained are composed by a few illuminated pixels on a dark
background. When the number of illuminated pixels is less than 0.01% of the total
pixels number it is difficult to identify the original object.

The tagged search (The aesthetic images in Mohammed Thanoun graphic) four chapters, Chapter I was concerned the statement of the research problem, the research importance and it’s needed, the goal of research in identifying the aesthetic images in the graphic of the artist's, the research limits, and identifying the most important terms, chapter II came with theoretical framework and included three chapters: chapter I was interested in the aesthetic concept. chapter II is the image aesthetic in the graphic, and chapter III is the artist experience, Chapter III specializes in research procedures: community, sample, curriculum, tool, and sample analysis. Chapter IV ended with results, including: dynamic research sample illustrated of the

      The Matching and Mosaic of the satellite imagery play an essential role in many remote sensing and image processing projects. These techniques must be required in a particular step in the project, such as remotely change detection applications and the study of large regions of interest. The matching and mosaic methods depend on many image parameters such as pixel values in the two or more images, projection system associated with the header files, and spatial resolutions, where many of these methods construct the matching and mosaic manually. In this research, georeference techniques were used to overcome the image matching task in semi automotive method. The decision about the quality of the technique can be considered if the

     Digital images are open to several manipulations and dropped cost of compact  cameras and mobile phones due to the robust image editing tools. Image credibility is therefore become doubtful, particularly where photos have power, for instance, news reports and insurance claims in a criminal court. Images forensic methods therefore measure the integrity of image  by apply different highly technical methods established in literatures. The present work deals with copy move forgery images of Media Integration and Communication Center Forgery (MICC-F2000) dataset for detecting and revealing the areas that have been tampered portion in the image, the image is sectioned into non overlapping blocks using Simple

Two molecular imprinted polymer (MIP) membranes for Levofloxacin (LEV) were prepared based on PVC matrix. The imprinted polymers were prepared by polymerization of styrene (STY) as monomer, N,N methylene di acrylamide as a cross linker ,benzoyl peroxide (BPO) as an initiator and levofloxacin as a template. Di methyl adepate (DMA) and acetophenone (AOPH) were used as plasticizers , the molecular imprinted membranes and the non molecular imprinted membranes were prepared.  The slopes and detection limits of the liquid electrodes ranged from -21.96 – -19.38 mV/decade and 2×10^-4M- 4×10^-4M, and Its response time was around 1 minute, respectively. The liquid  electrodes were packed with 0.1 M standar

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with