Veuillez utiliser cette adresse pour citer ce document : http://dspace.univ-bouira.dz:8080/jspui/handle/123456789/6226
Affichage complet
Élément Dublin CoreValeurLangue
dc.contributor.authorBenzaoui, Amir-
dc.date.accessioned2019-11-12T09:11:51Z-
dc.date.available2019-11-12T09:11:51Z-
dc.date.issued2014-12-19-
dc.identifier.citationJournal of Control Engineering and Applied Informaticsen_US
dc.identifier.urihttp://dspace.univ-bouira.dz:8080/jspui/handle/123456789/6226-
dc.description.abstractIn this study of a biometric system, Improved One Dimensional Local Binary Patterns (I1DLBP) are developed and tested for use in face analysis, description and recognition. The extraction of facial features is based on the principal that the human visual system combines local and global features to differentiate between people. The proposed method starts by decomposing the facial image into several blocks with different resolutions. Each block is then projected in one dimensional space, and the developed descriptor is applied on each projected block. Finally, Principal Component Analysis (PCA) is used to reduce the dimensionalities of the concatenated vectors from each block and to keep only the relevant information. The K-nearest neighbors (KNN) algorithm is used as a classifier. Experiments were carried out under varying conditions of occlusion, rotation, and facial expressions, using the ORL and AR databases. Results show that the developed feature extraction approach can effectively describe the micro characteristics of the human face and that it outperforms well-known and classical feature extraction descriptors.en_US
dc.language.isoenen_US
dc.publisheruniversity bouiraen_US
dc.titleFace Analysis, Description and Recognition using Improved Local Binary Patterns in One Dimensional Spaceen_US
dc.typeArticleen_US
Collection(s) :Articles

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
2169-5348-1-PB (2).pdf547,43 kBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.