scholarly journals Face Identification on Login Security Using Algorithm Combination of Viola-Jones and Cosine Similarity

2020 ◽  
Vol 4 (1) ◽  
pp. 203-211
Author(s):  
FADHILLAH AZMI ◽  
Amir Saleh ◽  
N P Dharshinni

Data security by using an alphanumeric combination password is no longer used, so it needs to be added security that is difficult to be manipulated by certain people. One type of security is the type of biometrics technology using face recognition which has different characteristics by combining the Viola-Jones algorithm to detect facial features, GLCM (Gray Level Co-occurrence Matrix) for extracting the texture characteristics of an image, and Cosine Similarity for the measurement of the proximity of the data (image matching). The image will be detected using the Viola-Jones algorithm to get face, eyes, nose, and mouth. The image detection results will be calculated the value of the texture characteristics with the GLCM (Gray Level Cooccurrence Matrix) algorithm. Image matching using cosine similarity will determine or match the data stored in the database with new image input until identification results are obtained. The results obtained in this study get the level of accuracy of the identification of the three algorithms by 77.20% with the amount of data that was correctly identified as many as 386 out of 500 images.Keywords: Security, face recognition, Viola-Jones, Cosine Similarity.

2019 ◽  
Vol 90 (7-8) ◽  
pp. 776-796 ◽  
Author(s):  
Feng Li ◽  
Lina Yuan ◽  
Kun Zhang ◽  
Wenqing Li

A new texture-feature description operator, called the multidirectional binary patterns (MDBP) operator, is proposed in this paper. The operator can extract the detailed distribution of textures in local regions by comparing the differences in the gray levels between neighboring pixels. Moreover, the texture expression ability is enhanced by focusing on the texture features in the linear neighborhood of the image in multiple directions. The MDBP operator was modified by introducing a “uniform” pattern to reduce the grayscale values in the image. Combining the “uniform” MDBP operator and the gray-level co-occurrence matrix, an unpatterned fabric-defect detection scheme is proposed, including texture-feature extraction and detection stages. In the first stage, the multidirectional texture-feature matrix of a nondefective fabric image is extracted, and then the detection threshold is determined based on the similarity between the feature matrices. In the second stage, the defect is detected with the detection threshold. The proposed method is adapted to various grayscale textile images with different characteristics and is robust to a wide variety of image-processing operations. In addition, it is invariant to grayscale changes, performs well when representing textures and detecting defects and has lower computational complexity than other methods.


Author(s):  
Abdelkrim Latreche ◽  
Kadda Benyahia

Electronic mail has become one of the most popular and frequently used channels for personal and professional online communication. Despite its benefits, e-mail faces a major security problem, which is the daily reception of a large number of unsolicited electronic messages, known as “spam emails.” Today, most electronic mail systems have simple spam filtering mechanisms based on text spam filtering technologies. To circumvent these filters, spammers are introducing new techniques of embedding spam messages in the image attached to the mail. In this article, the authors propose a new method for spam image filtering. The proposed system can distinguish between legitimate images from spam images based on the texture characteristics of the image attached to an email. From each image, around 20 characteristics can be extracted from the gray level co-occurrence matrix (GLCM). Then, to classify the images as spam or ham, the authors use a new metaheuristic nature-inspired model for building classifiers based on the social worker bees and enhanced nearest-centroid classification method.


2018 ◽  
Vol 26 (10) ◽  
pp. 131-139 ◽  
Author(s):  
Manar Abdulkaream Al-Abaji ◽  
Meaad Mohammed Salih

The process of data dimension reduction plays an important role in any  face recognition system because many of these data are repetitive and irrelevant and this cause a problem in applications of data mining and learning the machine. The main purpose is to improve the performance of recognition by eliminating repetitive features.           In this research, a number of data reduction techniques were used like: Principal Component Analysis, Gray-Level Co-occurrence Matrix and Discrete Wavelet Transform for extracting the most important features from the images of persons. A different number of training and testing images were used to compare the performance of each of the techniques above in the recognition process. Euclidean distance scale was used to get results.  


2012 ◽  
Vol 31 (6) ◽  
pp. 1628-1630
Author(s):  
Jia-jia OU ◽  
Bi-ye CAI ◽  
Bing XIONG ◽  
Feng LI

2019 ◽  
Vol 13 (2) ◽  
pp. 136-141 ◽  
Author(s):  
Abhisek Sethy ◽  
Prashanta Kumar Patra ◽  
Deepak Ranjan Nayak

Background: In the past decades, handwritten character recognition has received considerable attention from researchers across the globe because of its wide range of applications in daily life. From the literature, it has been observed that there is limited study on various handwritten Indian scripts and Odia is one of them. We revised some of the patents relating to handwritten character recognition. Methods: This paper deals with the development of an automatic recognition system for offline handwritten Odia character recognition. In this case, prior to feature extraction from images, preprocessing has been done on the character images. For feature extraction, first the gray level co-occurrence matrix (GLCM) is computed from all the sub-bands of two-dimensional discrete wavelet transform (2D DWT) and thereafter, feature descriptors such as energy, entropy, correlation, homogeneity, and contrast are calculated from GLCMs which are termed as the primary feature vector. In order to further reduce the feature space and generate more relevant features, principal component analysis (PCA) has been employed. Because of the several salient features of random forest (RF) and K- nearest neighbor (K-NN), they have become a significant choice in pattern classification tasks and therefore, both RF and K-NN are separately applied in this study for segregation of character images. Results: All the experiments were performed on a system having specification as windows 8, 64-bit operating system, and Intel (R) i7 – 4770 CPU @ 3.40 GHz. Simulations were conducted through Matlab2014a on a standard database named as NIT Rourkela Odia Database. Conclusion: The proposed system has been validated on a standard database. The simulation results based on 10-fold cross-validation scenario demonstrate that the proposed system earns better accuracy than the existing methods while requiring least number of features. The recognition rate using RF and K-NN classifier is found to be 94.6% and 96.4% respectively.


Sign in / Sign up

Export Citation Format

Share Document