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

          The primary objective of this paper is to improve a biometric authentication and classification model using the ear as a distinct part of the face since it is unchanged with time and unaffected by facial expressions. The proposed model is a new scenario for enhancing ear recognition accuracy via modifying the AdaBoost algorithm to optimize adaptive learning. To overcome the limitation of image illumination, occlusion, and problems of image registration, the Scale-invariant feature transform technique was used to extract features. Various consecutive phases were used to improve classification accuracy. These phases are image acquisition, preprocessing, filtering, smoothing, and feature extraction. To assess the proposed

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the