In modern times face recognition is one of the vital sides for computer vision. This is due to many reasons involving availability and accessibility of technologies and commercial applications. Face recognition in a brief statement is robotically recognizing a person from an image or video frame. In this paper, an efficient face recognition algorithm is proposed based on the benefit of wavelet decomposition to extract the most important and distractive features for the face and Eigen face method to classify faces according to the minimum distance with feature vectors. Faces94 data base is used to test the method. An excellent recognition with minimum computation time is obtained with accuracy reaches to 100% and recognition time decrease

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

The influx of Arab Qahtani and Nizari tribes continued to the countries of Baluchistan and the Levant in pre-Islamic times until the Levant became open to the Arab-Islamic tide during the first century AH. The Islamic Orient until the early Islamic Arab Army reached the western borders of China. What we will see in the folds of the search.

     In this work, we present the notion of sp[γ,γ^(* ) ]-open set,  sp[γ,γ^(* ) ]-closed, and sp[γ,γ^(* ) ]-closure such that several properties are obtained. By using this concept, we define a new type of spaces named sp[γ,γ^(* ) ]-compact space.

      Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J₂, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.

The purpose of this research is to find the estimator of the average proportion of defectives based on attribute samples. That have been curtailed either with rejection of a lot finding the kth defective or with acceptance on finding the kth non defective.

The MLE (Maximum likelihood estimator) is derived. And also the ASN in Single Curtailed Sampling has been derived and we obtain a simplified Formula All the Notations needed are explained.