This paper introduced an algorithm for lossless image compression to compress natural and medical images. It is based on utilizing various casual fixed predictors of one or two dimension to get rid of the correlation or spatial redundancy embedded between image pixel values then a recursive polynomial model of a linear base is used.

The experimental results of the proposed compression method are promising in terms of preserving the details and the quality of the reconstructed images as well improving the compression ratio as compared with the extracted results of a traditional linear predicting coding system.

We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T-ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied. Abstract We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T- ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied.

The current research aims at detecting Brain Dominance Learning Styles distinguished
and ordinary secondary school students (males and females).The researcher adopted Torrance
measure, known as ‘the style of your learning and thinking to measure Brain Dominance
Learning Styles’, the codified version of Joseph Qitami (1986); picture (a). The researcher
verified the standard properties of tool. The final application sample was 352 distinguished
and ordinary students; 176 distinguished male and female students and 176 ordinary male and
female students at the scientific fifth level of secondary school from schools in the province of
Baghdad, AL- KarKh Education Directorates in the First and Second . and who have been

A simple straightforward mathematical method has been developed to cluster grid nodes on a boundary segment of an arbitrary geometry that can be fitted by a relevant polynomial. The method of solution is accomplished in two steps. At the first step, the length of the boundary segment is evaluated by using the mean value theorem, then grids are clustered as desired, using relevant linear clustering functions. At the second step, as the coordinates cell nodes have been computed and the incremental distance between each two nodes has been evaluated, the original coordinate of each node is then computed utilizing the same fitted polynomial with the mean value theorem but reversibly.

The method is utilized to predict

The deep learning algorithm has recently achieved a lot of success, especially in the field of computer vision. This research aims to describe the classification method applied to the dataset of multiple types of images (Synthetic Aperture Radar (SAR) images and non-SAR images). In such a classification, transfer learning was used followed by fine-tuning methods. Besides, pre-trained architectures were used on the known image database ImageNet. The model VGG16 was indeed used as a feature extractor and a new classifier was trained based on extracted features.The input data mainly focused on the dataset consist of five classes including the SAR images class (houses) and the non-SAR images classes (Cats, Dogs, Horses, and Humans). The Conv

In this paper, we have employed a computation of three technique to reduce the computational complexity and bit rate for compressed image. These techniques are bit plane coding based on two absolute values, vector quantization VQ technique using Cache codebook and Weber's low condition. The experimental results show that the proposed techniques achieve reduce the storage size of bit plane and low computational complexity.

A special methodology for adding a watermark for colored (RGB) image is formed and adding the wavelet transform as a tool during this paper. The watermark is added into two components. The primary one is by taking the key that contain associate eight range from (0...7) every range in it determines the actual bit position in specific component of canopy image. If that bit is analogous to the bit in watermark, (0) are hold on within the Least Significant Bit (LSB) of the watermarked image; otherwise (1) are hold on. The other is that it will add multiple secret keys victimization shift and rotate operations. The watermark is embedded redundantly over all extracted blocks in image to extend image protection. This embedding is completed with