Emails have proliferated in our ever-increasing communication, collaboration and
information sharing. Unfortunately, one of the main abuses lacking complete benefits of
this service is email spam (or shortly spam). Spam can easily bewilder system because
of its availability and duplication, deceiving solicitations to obtain private information.
The research community has shown an increasing interest to set up, adapt, maintain and
tune several spam filtering techniques for dealing with emails and identifying spam and
exclude it automatically without the interference of the email user. The contribution of
this paper is twofold. Firstly, to present how spam filtering methodology can be
constructed based on the concep

Image compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eye

In this work, satellite images classification for Al Chabaish marshes and the area surrounding district in (Dhi Qar) province for years 1990,2000 and 2015 using two software programming (MATLAB 7.11 and ERDAS imagine 2014) is presented. Proposed supervised classification method (Modified Vector Quantization) using MATLAB software and supervised classification method (Maximum likelihood Classifier) using ERDAS imagine have been used, in order to get most accurate results and compare these methods. The changes that taken place in year 2000 comparing with 1990 and in year 2015 comparing with 2000 are calculated. The results from classification indicated that water and vegetation are decreased, while barren land, alluvial soil and shallow water

In this research, a group of gray texture images of the Brodatz database was studied by building the features database of the images using the gray level co-occurrence matrix (GLCM), where the distance between the pixels was one unit and for four angles (0, 45, 90, 135). The k-means classifier was used to classify the images into a group of classes, starting from two to eight classes, and for all angles used in the co-occurrence matrix. The distribution of the images on the classes was compared by comparing every two methods (projection of one class onto another where the distribution of images was uneven, with one category being the dominant one. The classification results were studied for all cases using the confusion matrix between every

In this research, a group of gray texture images of the Brodatz database was studied by building the features database of the images using the gray level co-occurrence matrix (GLCM), where the distance between the pixels was one unit and for four angles (0, 45, 90, 135). The k-means classifier was used to classify the images into a group of classes, starting from two to eight classes, and for all angles used in the co-occurrence matrix. The distribution of the images on the classes was compared by comparing every two methods (projection of one class onto another where the distribution of images was uneven, with one category being the dominant one. The classification results were studied for all cases using the confusion matrix between ev

The tasseled cap transformation (TCT) is a useful tool for compressing spectral data into a few bands associated with physical scene characteristics with minimal information loss. TCT was originally evolved from the Landsat multi-spectral scanner (MSS) launched in 1972 and is widely adapted to modern sensors. In this study, we derived the TCT coefficients for operational land imager (OLI) sensor on-board Landsat-8 acquired at 28 Sep.2013. A newly classification method is presented; the method is based on dividing the scatterplot between the Greenness and the Brightness of TCT into regions corresponding to their reflectance values. The results from this paper suggest that the TCT coefficient derived from the OLI bands at September is the

 An oil spill is a leakage of pipelines, vessels, oil rigs, or tankers that leads to the release of petroleum products into the marine environment or on land that happened naturally or due to human action, which resulted in severe damages and financial loss. Satellite imagery is one of the powerful tools currently utilized for capturing and getting vital information from the Earth's surface. But the complexity and the vast amount of data make it challenging and time-consuming for humans to process. However, with the advancement of deep learning techniques, the processes are now computerized for finding vital information using real-time satellite images. This paper applied three deep-learning algorithms for satellite image classification

     Recognizing cars is a highly difficult task due to the wide variety in the appearance of cars from the same car manufacturer. Therefore, the car logo is the most prominent indicator of the car manufacturer. The captured logo image suffers from several problems, such as a complex background, differences in size and shape, the appearance of noise, and lighting circumstances. To solve these problems, this paper presents an effective technique for extracting and recognizing a logo that identifies a car. Our proposed method includes four stages: First, we apply the k-medoids clustering method to extract the logo and remove the background and noise. Secondly, the logo image is converted to grayscale and also converted to a binary imag

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.