A. Nikitin - Post-graduate Student, P.G. Demidov Yaroslavl State University. E-mail: anatolynikitinyar@gmail.com
V. Khryashchev - Ph.D. (Eng.), Associate Professor, P.G. Demidov Yaroslavl State University. E-mail: vhr@yandex.ru
A. Priorov - Dr.Sc. (Eng.), Associate Professor, P.G. Demidov Yaroslavl State University. E-mail: andcat@yandex.ru
D. Matveevy - Post-graduate Student, P.G. Demidov Yaroslavl State University. E-mail: dcslab@uniyar.ac.ru

Face recognition is an actual task which has many potential applications for automatically identifying or verifying a person from a digital image or from a video data in security systems. Face recognition process consist of two stages: face detection and face identification. The modern face recognition algorithms extract facial features from an image and compare them with features from the images saved in database. Up to now, many algorithms have been applied for face recognition. They were based on geometric features extraction, facial keypoints detection, Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Local Binary Patterns (LBP), a set of Gabor filters, Discrete Cosine Transform (DCT) etc. Due to its discriminative power and computational simplicity LBP methodology has become one of the most popular approaches for texture classification and face recognition. Image noise might significantly lower accuracy of face detection system based on simple 8-bit LBP features. Unfortunately, we cannot simple expand the neighborhood of each pixel which uses for computing LBP, because the code size increases exponentially with the number of neighborhood pixels. That is why we introduce Local Quantized Patterns (LQP) uses vocabulary to translate a long length binary pattern into a label of the cluster which includes this pattern. We use k-means clustering as a method of dividing all probable binary patterns into k clusters and creating vocabulary. We divide the face image into cells. Therefore over the cell we compute the histogram of the frequency of each «label of the cluster» occurring for each pixel. Then we concatenate histograms of all cells and get the feature vector for the face image. We compared and contrasted the proposed algorithm based on LQP with algorithms based on LBP, PCA and LDA. Comparative study on the AT&T Face Database and our own Russian persons database showed that the developed algorithm can reduce the number of recognition errors by 1.5-2 times compared to similar algorithm. Trained recognition algorithm based LQP able to work with video in real time. The main disadvantage of the proposed algorithm is significantly more time needed for training compared with the considered approach.