Advisor : Dr. Hsu Presenter : Jia-Hao Yang Author : X Tan, S Chen, ZH Zhou, F Zhang

transcript

1Intelligent Database Systems Lab

國立雲林科技大學National Yunlin University of Science and Technology

Recognizing Partially Occluded, Expression Variant Faces from Single Training Image per

Person with SOM and soft kNN Ensemble

Advisor : Dr. HsuPresenter : Jia-Hao Yang

Author :X Tan, S Chen, ZH Zhou, F Zhang

N.Y.U.S.T.

Motivation Object Architecture Introduction The propose method Experiments Conclusion Opinion

N.Y.U.S.T.

I. M.Motivation In many real-world applications only one

training image per person is available. The test images may be partially occluded or

may vary in expressions.

N.Y.U.S.T.

I. M.Object

This paper using the SOM to learn the subspace that represented each individual.

And then it uses a soft k nearest neighbor (soft k-NN) ensemble method to identify the unlabelled subjects.

N.Y.U.S.T.

I. M.Architecture Although template-based methods have

become one of the main techniques, a large training data set is not always possible in many real world tasks.

Beside above problem, there exist other problems, such as occlusion and expression.

N.Y.U.S.T.

I. M.Architecture (cont.) This paper extends Martinez’s work using SO

M and soft kNN and then it achieves high performance.

The procedure is as follows:─ Localization─ The use of SOM

The Single SOM-face Strategy The Multiple SOM-face Strategy

─ Identification

N.Y.U.S.T.

I. M.Architecture (cont.) Finally, this paper have conducted various

experiments to verify the performance of the proposed method.

N.Y.U.S.T.

I. M.Introduction Face Recognition Technology (FRT) has a vari

ety of potential applications in many aspect.

N.Y.U.S.T.

I. M.Introduction (cont.) However, the general face recognition problem

is still unsolved due to its inherent complexity.

To overcome this problem is to Search one or more face subspaces of the face to lower the influence of the variations.

N.Y.U.S.T.

I. M.Introduction (cont.) Most template-based FRT assume that

multiple images per person are available for training.

But a large training data set is not always possible in many real world tasks.

N.Y.U.S.T.

I. M.The Proposed Method A. Localizing the face image:

─ the original image is divided into M(=l/d) sub-blocks with equal size, where l and d are the dimensionalities of the whole image and each sub-block.

ImageLocalization Images

N.Y.U.S.T.

I. M. The Proposed Method (cont.) B. The use of SOM

─ The SOM is chosen for several reasons as follows: It is efficient and suitable for high dimensional process Its algorithm is more robust to initialization than any other The trained SOM map are similar to input sub-blocks.

SOMProjection

ImageLocalization

Soft kNNEnsembleDecision Images Results

N.Y.U.S.T.

I. M.The Proposed Method (cont.)─ The Single SOM-face Strategy

Step1: according to: Partition all the sub-blocks into Voronoi regions

Setp2: average : Setp3: Smooth :

─ The multiple SOM-face Strategy new image be presented to the system, denoted as

Then a separate small SOM map for the face will be trained using the above SOM algorithm.

N.Y.U.S.T.

I. M.The Proposed Method (cont.) C. Identification

Given C classes, to decide which class the test face x belongs to, we first divide the test face into M sub-blocks.

and then project those sub-blocks onto the trained SOM maps.

Arranging it in increasing order :

normalization :

Finally, the label can be obtained :

N.Y.U.S.T.

I. M.Experiments On the AR database (variations in Facial

Expressions)─ the neutral expressions images of the 100 individuals

were used for training, while the smile, anger and scream images were used for testing.

N.Y.U.S.T.

I. M.Experiments (cont.)

N.Y.U.S.T.

I. M.Experiments (cont.)

N.Y.U.S.T.

I. M.Experiments (cont.) On the AR database (variations in partially occluded)

─ Simulated occlusion The number of the training data is same, while the smiling,

angry and screaming images with simulated partial occlusions were used for testing.

N.Y.U.S.T.

I. M.Experiments (cont.) We can find that half face occlusion does not h

arm the performance except the occlusion of upper face (see Fig.8b).

Because the lower half, included the mouth and cheeks, which can be easily affected by most facial expression variation.

N.Y.U.S.T.

I. M.Experiments (cont.)─ Real occlusion

the neutral expression images of the 100 individuals were used for training, while the occluded images were used for testing.

N.Y.U.S.T.

I. M.Experiments (cont.) It is interesting to note that the occlusion of the

eyes area led to better recognition results because the scarf occluded each face irregularly.

N.Y.U.S.T.

I. M.Experiments (cont.) To simulate the occlusion, we randomly localized a s

quare of size pxp (5<p<50) pixels in each of the four testing image.

N.Y.U.S.T.

I. M.Experiments (cont.) On the FERET database

─ Experiment 1 the performance of the two SOM-face based algorithms on the

subset was evaluated and was compared with other two method’s.

N.Y.U.S.T.

I. M.Experiments (cont.)─ Experiment 2

choosing an appreciate k-value for the soft k-NN classifier.

N.Y.U.S.T.

The effect of different sub-block sizes is studied.

N.Y.U.S.T.

To investigate the incremental learning capability of the MSOM strategy, experiment was conducted using different gallery sizes.

N.Y.U.S.T.

we repeated one of the simulated occlusion experiments done on the AR dataset .

N.Y.U.S.T.

I. M.Conclusion This paper introduce the “SOM-face” to address the problem o

f face recognition with one training image per person and has several advantages over some of the previous methods.

It attributes these advantages to the seamless connection between the three parts of the method.

SOMImage

N.Y.U.S.T.

I. M.Conclusion (cont.) But the proposed method assumes that

occluded is known in advance. This paper shows that this paradigm works

well in the scenario of face recognition with one training image per person.

N.Y.U.S.T.

I. M.Opinion Advantage

Advisor : Dr. Hsu Presenter : Jia-Hao Yang Author : X Tan, S Chen, ZH Zhou, F Zhang

Documents