In present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.

In this paper, a literature survey was introduced to study of enhancing the hazy images , because most of the images captured in outdoor images have low contrast, color distortion, and limited visual because the weather conditions such as haze and that leads to decrease the quality of images capture. This study is of great importance in many applications such as surveillance, detection, remote sensing, aerial image, recognition, radar, etc. The published researches on haze removal are divided into several divisions, some of which depend on enhancement the image, some of which depend on the physical model of deformation, and some of them depend on the number of images used and are divided into single-image and multiple images dehazing model

The use of deep learning.

Research seeks to clarify the role of insurance companies to make great efforts for the success of the operation promotional products and to check it out for, there should be questions selling the company offers to salesmen producers and the latter projecting on the ground to serve customers and deal with them in style to earn satisfaction with.

        The method was used questionnaire and distributed through selected sample included producers in the company and the other sample Staff Planning and marketing researcher used the style gather the necessary information and subjected to analysis using statistical methods arithmetic, standard deviation and concluded search for a set of results which

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Deep Learning Techniques For Skull Stripping of Brain MR Images

The region-based association analysis has been proposed to capture the collective behavior of sets of variants by testing the association of each set instead of individual variants with the disease. Such an analysis typically involves a list of unphased multiple-locus genotypes with potentially sparse frequencies in cases and controls. To tackle the problem of the sparse distribution, a two-stage approach was proposed in literature: In the first stage, haplotypes are computationally inferred from genotypes, followed by a haplotype coclassification. In the second stage, the association analysis is performed on the inferred haplotype groups. If a haplotype is unevenly distributed between the case and control samples, this haplotype is labeled