A common approach to the color image compression was started by transform
the red, green, and blue or (RGB) color model to a desire color model, then applying
compression techniques, and finally retransform the results into RGB model In this
paper, a new color image compression method based on multilevel block truncation
coding (MBTC) and vector quantization is presented. By exploiting human visual
system response for color, bit allocation process is implemented to distribute the bits
for encoding in more effective away.
To improve the performance efficiency of vector quantization (VQ),
modifications have been implemented. To combines the simple computational and
edge preservation properties of MBTC with high compression ratio and good
subjective performance of modified VQ, a hybrid MBTC- modified VQ color image
compression method is presented. The analysis results have indicated the
performance of the suggested method is better, where the constructed images are less
distorted and compressed with higher factor(59:1).
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
This paper presents a proposed method for (CBIR) from using Discrete Cosine Transform with Kekre Wavelet Transform (DCT/KWT), and Daubechies Wavelet Transform with Kekre Wavelet Transform (D4/KWT) to extract features for Distributed Database system where clients/server as a Star topology, client send the query image and server (which has the database) make all the work and then send the retrieval images to the client. A comparison between these two approaches: first DCT compare with DCT/KWT and second D4 compare with D4/KWT are made. The work experimented over the image database of 200 images of 4 categories and the performance of image retrieval with respect to two similarity measures namely Euclidian distance (ED) and sum of absolute diff
... Show MoreThis paper presents a modified training method for Recurrent Neural Networks. This method depends on the Non linear Auto Regressive (NARX) model with Modified Wavelet Function as activation function (MSLOG) in the hidden layer. The modified model is known as Modified Recurrent Neural (MRN). It is used for identification Forward dynamics of four Degrees of Freedom (4-DOF) Selective Compliance Assembly Robot Arm (SCARA) manipulator robot. This model is also used in the design of Direct Inverse Control (DIC). This method is compared with Recurrent Neural Networks that used Sigmoid activation function (RS) in the hidden layer and Recurrent Neural Networks with Wavelet activation function (RW). Simulation results shows that the MRN model is bett
... Show MoreThis study concerns the removal of a trihydrate antibiotic (Amoxicillin) from synthetically contaminated water by adsorption on modified bentonite. The bentonite was modified using hexadecyl trimethyl ammonium bromide (HTAB), which turned it from a hydrophilic to a hydrophobic material. The effects of different parameters were studied in batch experiments. These parameters were contact time, solution pH, agitation speed, initial concentration (C0) of the contaminant, and adsorbent dosage. Maximum removal of amoxicillin (93 %) was achieved at contact time = 240 min, pH = 10, agitation speed = 200 rpm, initial concentration = 30 ppm, and adsorbent dosage = 3 g bentonite per 1L of pollutant solution. The characterization of the adsorbent, modi
... Show MoreHiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a
... Show MoreIn this paper, two new simple, fast and efficient block matching algorithms are introduced, both methods begins blocks matching process from the image center block and moves across the blocks toward image boundaries. With each block, its motion vector is initialized using linear prediction that depending on the motion vectors of its neighbor blocks that are already scanned and their motion vectors are assessed. Also, a hybrid mechanism is introduced, it depends on mixing the proposed two predictive mechanisms with Exhaustive Search (ES) mechanism in order to gain matching accuracy near or similar to ES but with Search Time ST less than 80% of the ES. Also, it offers more control capability to reduce the search errors. The experimental tests
... Show MoreImage capturing in most still and motion digital cameras employs a charge coupled device covered with a monolithic array of color filters such that each pixel samples only one color band. Interpolation is necessary to restore the missing color samples in the resulting mosaic, this process referred to as demosaicking.
This paper gives an overview of demosaicking, presents few
methods proposed in the  
... Show More