Embed Doc
Copy Link
Readcast
Collections

CommentGo Back

Download

Dealing with Inaccurate Face Detection forAutomatic Gender Recognition with PartiallyOccluded Faces



Yasmina Andreu, Pedro Garc´ıa-Sevilla, and Ram´on A. Mollineda

Dpto. Lenguajes y Sistemas Inform´aticosUniversidad Jaume I. Castell´on de la Plana, Spain

{

yandreu,pgarcia,mollined

}

@uji.es

Abstract.

Gender recognition problem has not been extensively stud-ied in situations where the face cannot be accurately detected and it alsocan be partially occluded. In this contribution, a comparison of severalcharacterisation methods of the face is presented and they are evaluatedin four diﬀerent experiments that simulate the previous scenario. Two of the characterisation techniques are based on histograms, LBP and localcontrast values, and the other one is a new kind of features, called Rank-ing Labels, that provide spatial information. Experiments have provedRanking Labels description is the most reliable in inaccurate situations.

1 Introduction

Over the past decades, a great number of papers have been published in the faceanalysis area. Most of them dealt with face recognition[1,2]and face detection[3,4,5,6]problems. However, automatic gender classification has recently becomean important issue in this area. Gender recognition has applications in severalfields, such as, in demographic data collection, and it also could be an interestingstarting point for other face image processes.According to recent papers [3,4], face detection tasks obtain quite impressiveresults, although they do not reach 100% accuracy in all situations. Moreover,faces could be occluded by pieces of cloth, such as, scarves or glasses. Conse-quently, we will focus on the gender recognition problem when the face is notaccurately detected and only a partial view of the face is available.In this paper, we compare several characterization techniques in order to findout which one performs better with the previous restrictions. All these techniquesconsider a set of

windows over each face image. A feature vector isextracted from each individual window in order to characterize the face. Thetechniques used are: a well-know method based on Local Binary Patterns (LBPs)which have achieved good results in the face recognition task[2], a description



This work was partially funded by Projects Consolider Ingenio 2010 CSD2007-00018,DPI2006-15542, and AYA2008-05965-C04-04 from the Spanish Ministry of Scienceand Innovation, and P1-1B2007-60 from the Fundaci´o Caixa Castell´o-Bancaixa.

E. Bayro-Corrochano and J.-O. Eklundh (Eds.): CIARP 2009, LNCS 5856, pp. 749–757,2009.c



Springer-Verlag Berlin Heidelberg 2009

750 Y. Andreu, P. Garc´ıa-Sevilla, and R.A. Mollineda

based on Local Contrast Histograms (LCH) which can be used independently ortogether with the LBP [7]and the features proposed by the authors that havebeen speciﬁcally designed to keep not only the contrast information but also thepositional information of each pixel inside its window [8].The rest of the paper is organized as follows: the face descriptions used areintroduced in Section2; in Section3,the experimental set-up is described in detail; in Section4, the results are shown and discussed. Finally, our conclusionsare given in Section5.

2 Face Descriptions

This section presents all the face characterization methods used in the experi-ments, including our features called Ranking Labels.All the face descriptions use a window that scans the face image to obtainthe feature vectors that will characterize the corresponding face. Two of thecharacterization methods considered are based on histograms computed overthe image window (LBP and LCH) while the other method assigns a label toeach pixel in the window in such a way that it keeps the information about theposition of the pixels inside it.

2.1 Local Binary Patterns

The LBP operator was originally deﬁned to characterize textures. It uses a binarynumber (or its equivalent in the decimal system) to characterize each pixel of theimage. In the most basic version, to obtain this number, a 3

3 neighborhoodaround each pixel is considered. Then, all neighbors are given a value 1 if theyare brighter than the central pixel or value 0 otherwise. The numbers assigned toeach neighbor are read sequentially in the clockwise direction to form the binarynumber which characterize the central pixel. The texture patch in a window isdescribed by the histogram of the LBP values of all the pixels inside it.To deal with textures at different scales, the LBP was extended to use neigh-borhoods of different radii. The local neighborhood is defined as a set of samplingpoints spaced in a circle centered at the pixel to be labeled. A bilinear interpo-lation is used when a sample point does not fall in the center of a pixel. Inthe following, the notation LBP

P,R

will be used to refer to LBP that uses aneighborhood with P sample points on a circle of radius R.The LBP operator can be improved by using the so-called uniform LBP[9].The uniform patterns have at most two one-to-zero or zero-to-one transitionsin the circular binary code. The amount of uniform LBP (LBP

), when a 8-neighborhood is considered, is 58. However, a histogram of 59 bins is obtainedfrom each window, since the non-uniform patterns are accumulated into a singlebin. Although the number of patterns is signiﬁcantly reduced from 256 to 58;it was observed that the uniform patterns provide the majority of patterns,sometimes over 90%, of texture [10].The LBP operator gives more signiﬁcance to some neighbors than to others,which makes the representation sensitive to rotation. In order to obtain a LBP

Dealing with Inaccurate Face Detection for Automatic Gender Recognition 751

Fig.1.

Example of the extraction process of Ranking Labels

rotationally invariant[9], all possible binary numbers that can be obtained bystarting the sequence from all neighbors in turn are considered. Then the smallestof the constructed numbers is chosen. In case the face is slightly inclined in theimage, the rotation invariant uniform LBP (LBP

ri,u

) is supposed to provide amore accurate description of the face. As the quantity of LBP

ri,u

is 9 in thiscase, a histogram of 10 bins describes each window.

2.2 Local Contrast Histograms

When computing the LBPs the information about the contrast in the windowis lost. Therefore, local contrast histograms (LCH) can be used as an alterna-tive feature set or combined together with LBPs in order to complement theircharacterization[7].To compute the local contrast value of a pixel, a neighborhood is deﬁned ina similar way as for LBP. Then the average of the grey level values of thoseneighbors that are brighter than the central pixel is subtracted from the averageof the grey level values of the darker ones. Finally, all the local contrast valuesare accumulated in a histogram to obtain the LCH

P,R

. This notation means thatthe neighborhood used has P sample points on a circle of radius R. In order tohave the same number of features as for the LBPs, when the neighborhood usedhas 8 samples points and its radius is 1 the LCH has 10 bins, whereas if theradius is 2 a 59-bin histogram is obtained.

2.3 Ranking Labels

In this description method a vector of ranking labels characterizes each window.For a

window the values of the pixels within the window are substituted bytheir ranking positions. In other words, the grey level of each pixel is replaced bya numeric label that represents its position in the sorted list in ascending orderof all grey levels within the window. This provides a more robust feature vectorwhile keeping the positional information of each pixel inside the correspondingwindow. This characterization process is shown in Fig.1(see [8] for more detail).