Lecture: Face Recognition Juan Carlos Niebles and Ranjay Krishna - - PowerPoint PPT Presentation

lecture face recognition
SMART_READER_LITE
LIVE PREVIEW

Lecture: Face Recognition Juan Carlos Niebles and Ranjay Krishna - - PowerPoint PPT Presentation

Face identification Lecture: Face Recognition Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab 05-Nov-2019 1 St Stanfor ord University CS 131 Roadmap Face identification Pixels Segments Images Videos Web


slide-1
SLIDE 1

Face identification

St Stanfor

  • rd University

05-Nov-2019 1

Lecture: Face Recognition

Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab

slide-2
SLIDE 2

Face identification

St Stanfor

  • rd University

05-Nov-2019 2

CS 131 Roadmap

Pixels Images

Convolutions Edges Descriptors

Segments

Resizing Segmentation Clustering Recognition Detection Machine learning

Videos

Motion Tracking

Web

Neural networks Convolutional neural networks

slide-3
SLIDE 3

Face identification

St Stanfor

  • rd University

05-Nov-2019 3

Let’s recap

  • A simple object recognition pipeline with kNN
  • PCA
slide-4
SLIDE 4

Face identification

St Stanfor

  • rd University

05-Nov-2019 4

Object recognition: a classification framework

  • Apply a prediction function to a feature representation of

the image to get the desired output:

f( ) = “apple” f( ) = “tomato” f( ) = “cow”

Slide credit: L. Lazebnik Dataset: ETH-80, by B. Leibe

slide-5
SLIDE 5

Face identification

St Stanfor

  • rd University

05-Nov-2019 5

A simple pipeline - Training

Training Images Image Features

slide-6
SLIDE 6

Face identification

St Stanfor

  • rd University

05-Nov-2019 6

A simple pipeline - Training

Training Labels Training Images Training Image Features

slide-7
SLIDE 7

Face identification

St Stanfor

  • rd University

05-Nov-2019 7

A simple pipeline - Training

Training Labels Training Images Training Image Features Learned Classifier

slide-8
SLIDE 8

Face identification

St Stanfor

  • rd University

05-Nov-2019 8

A simple pipeline - Training

Training Labels Training Images Training Image Features Image Features

Test Image

Learned Classifier

slide-9
SLIDE 9

Face identification

St Stanfor

  • rd University

05-Nov-2019 9

Prediction

A simple pipeline - Training

Training Labels Training Images Training Image Features Image Features

Test Image

Learned Classifier Learned Classifier

slide-10
SLIDE 10

Face identification

St Stanfor

  • rd University

05-Nov-2019 10

Prediction

A simple pipeline - Training

Training Labels Training Images Training Image Features Image Features

Test Image

Learned Classifier Learned Classifier

slide-11
SLIDE 11

Face identification

St Stanfor

  • rd University

05-Nov-2019 11

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

slide-12
SLIDE 12

Face identification

St Stanfor

  • rd University

05-Nov-2019 12

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-13
SLIDE 13

Face identification

St Stanfor

  • rd University

05-Nov-2019 13

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-14
SLIDE 14

Face identification

St Stanfor

  • rd University

05-Nov-2019 14

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-15
SLIDE 15

Face identification

St Stanfor

  • rd University

05-Nov-2019 15

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Local shape: shape context

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-16
SLIDE 16

Face identification

St Stanfor

  • rd University

05-Nov-2019 16

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Local shape: shape context

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-17
SLIDE 17

Face identification

St Stanfor

  • rd University

05-Nov-2019 17

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Local shape: shape context

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

Texture: Filter banks

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-18
SLIDE 18

Face identification

St Stanfor

  • rd University

05-Nov-2019 18

Image features

Input image

Color: Quantize RGB values

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Global shape: PCA space

Invariance? ? Translation ? Scale ? Rotation ? Occlusion

Local shape: shape context

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

Texture: Filter banks

Invariance? ? Translation ? Scale ? Rotation (in-planar) ? Occlusion

slide-19
SLIDE 19

Face identification

St Stanfor

  • rd University

05-Nov-2019 19

Prediction

A simple pipeline - Training

Training Labels Training Images Training Image Features Image Features

Test Image

Learned Classifier Learned Classifier

slide-20
SLIDE 20

Face identification

St Stanfor

  • rd University

05-Nov-2019 20

Classifiers: Nearest neighbor

Training examples from class 1 Training examples from class 2

Slide credit: L. Lazebnik

slide-21
SLIDE 21

Face identification

St Stanfor

  • rd University

05-Nov-2019 21

Prediction

A simple pipeline - Training

Training Labels Training Images Training Image Features Image Features

Test Image

Learned Classifier Learned Classifier

slide-22
SLIDE 22

Face identification

St Stanfor

  • rd University

05-Nov-2019 22

Classifiers: Nearest neighbor

Test example Training examples from class 1 Training examples from class 2

Slide credit: L. Lazebnik

slide-23
SLIDE 23

Face identification

St Stanfor

  • rd University

05-Nov-2019 23

Let’s recap

  • A simple object recognition pipeline with kNN
  • PCA
slide-24
SLIDE 24

Face identification

St Stanfor

  • rd University

05-Nov-2019 24

PCA compression: 144D -> 6D

slide-25
SLIDE 25

Face identification

St Stanfor

  • rd University

05-Nov-2019 25

2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12

6 most important eigenvectors

slide-26
SLIDE 26

Face identification

St Stanfor

  • rd University

05-Nov-2019 26

PCA compression: 144D ) 3D

slide-27
SLIDE 27

Face identification

St Stanfor

  • rd University

05-Nov-2019 27

2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12 2 4 6 8 10 12

3 most important eigenvectors

slide-28
SLIDE 28

Face identification

St Stanfor

  • rd University

05-Nov-2019 28

What we will learn today

  • Introduction to face recognition
  • The Eigenfaces Algorithm
  • Linear Discriminant Analysis (LDA)

Turk and Pentland, Eigenfaces for Recognition, Journal of Cognitive Neuroscience 3 (1): 71–86.

  • P. Belhumeur, J. Hespanha, and D. Kriegman. "Eigenfaces vs. Fisherfaces: Recognition

Using Class Specific Linear Projection". IEEE Transactions on pattern analysis and machine intelligence 19 (7): 711. 1997.

slide-29
SLIDE 29

Face identification

St Stanfor

  • rd University

05-Nov-2019 29

Courtesy of Johannes M. Zanker

“Faces” in the brain

slide-30
SLIDE 30

Face identification

St Stanfor

  • rd University

05-Nov-2019 30

“Faces” in the brain fusiform face area

Kanwisher, et al. 1997

slide-31
SLIDE 31

Face identification

St Stanfor

  • rd University

05-Nov-2019 31

Detection versus Recognition

Detection finds the faces in images Recognition recognizes WHO the person is

slide-32
SLIDE 32

Face identification

St Stanfor

  • rd University

05-Nov-2019 32

Face Recognition

  • Digital photography
slide-33
SLIDE 33

Face identification

St Stanfor

  • rd University

05-Nov-2019 33

Face Recognition

  • Digital photography
  • Surveillance
slide-34
SLIDE 34

Face identification

St Stanfor

  • rd University

05-Nov-2019 34

Face Recognition

  • Digital photography
  • Surveillance
  • Album organization
slide-35
SLIDE 35

Face identification

St Stanfor

  • rd University

05-Nov-2019 35

Face Recognition

  • Digital photography
  • Surveillance
  • Album organization
  • Person tracking/id.
slide-36
SLIDE 36

Face identification

St Stanfor

  • rd University

05-Nov-2019 36

Face Recognition

  • Digital photography
  • Surveillance
  • Album organization
  • Person tracking/id.
  • Emotions and expressions
slide-37
SLIDE 37

Face identification

St Stanfor

  • rd University

05-Nov-2019 37

Face Recognition

  • Digital photography
  • Surveillance
  • Album organization
  • Person tracking/id.
  • Emotions and expressions
  • Security/warfare
  • Tele-conferencing
  • Etc.
slide-38
SLIDE 38

Face identification

St Stanfor

  • rd University

05-Nov-2019 38

The Space of Faces

  • An image is a point in a high

dimensional space

– If represented in grayscale intensity, an N x M image is a point in RNM – E.g. 100x100 image = 10,000 dim

Slide credit: Chuck Dyer, Steve Seitz, Nishino

slide-39
SLIDE 39

Face identification

St Stanfor

  • rd University

05-Nov-2019 39

100x100 images can contain many things other than faces!

slide-40
SLIDE 40

Face identification

St Stanfor

  • rd University

05-Nov-2019 40

The Space of Faces

  • An image is a point in a high

dimensional space

– If represented in grayscale intensity, an N x M image is a point in RNM – E.g. 100x100 image = 10,000 dim

  • However, relatively few high

dimensional vectors correspond to valid face images

  • We want to effectively model the

subspace of face images

Slide credit: Chuck Dyer, Steve Seitz, Nishino

ɸ1

slide-41
SLIDE 41

Face identification

St Stanfor

  • rd University

05-Nov-2019 41

Where have we seen something like this before?

ɸ1

slide-42
SLIDE 42

Face identification

St Stanfor

  • rd University

05-Nov-2019 42

Image space Face space

  • Maximize the scatter of the training images in face space
  • Compute n-dim subspace such that the projection of the data points onto the

subspace has the largest variance among all n-dim subspaces.

slide-43
SLIDE 43

Face identification

St Stanfor

  • rd University

05-Nov-2019 43

  • So, compress them to a low-dimensional subspace that

captures key appearance characteristics of the visual DOFs.

Key Idea

  • USE PCA for estimating the sub-space

(dimensionality reduction)

  • Compare two faces by projecting the images into the subspace

and measuring the EUCLIDEAN distance between them.

slide-44
SLIDE 44

Face identification

St Stanfor

  • rd University

05-Nov-2019 44

What we will learn today

  • Introduction to face recognition
  • The Eigenfaces Algorithm
  • Linear Discriminant Analysis (LDA)

Turk and Pentland, Eigenfaces for Recognition, Journal of Cognitive Neuroscience 3 (1): 71–86.

  • P. Belhumeur, J. Hespanha, and D. Kriegman. "Eigenfaces vs. Fisherfaces: Recognition

Using Class Specific Linear Projection". IEEE Transactions on pattern analysis and machine intelligence 19 (7): 711. 1997.

slide-45
SLIDE 45

Face identification

St Stanfor

  • rd University

05-Nov-2019 45

Eigenfaces: key idea

  • Assume that most face images lie on a low-dimensional subspace determined by

the first k (k<<d) directions of maximum variance

  • Use PCA to determine the vectors or “eigenfaces” that span that subspace
  • Represent all face images in the dataset as linear combinations of eigenfaces
  • M. Turk and A. Pentland, Face Recognition using Eigenfaces, CVPR 1991
slide-46
SLIDE 46

Face identification

St Stanfor

  • rd University

05-Nov-2019 46

Training images: x1,…,xN

slide-47
SLIDE 47

Face identification

St Stanfor

  • rd University

05-Nov-2019 47

Top eigenvectors: ɸ1,…,ɸk

Mean: μ

slide-48
SLIDE 48

Face identification

St Stanfor

  • rd University

05-Nov-2019 48

Visualization of eigenfaces

Principal component (eigenvector) ɸk μ + 3σkɸk μ – 3σkɸk

slide-49
SLIDE 49

Face identification

St Stanfor

  • rd University

05-Nov-2019 49

Eigenface algorithm

  • Training
  • 1. Align training images x1, x2, …, xN
  • 2. Compute average face
  • 3. Compute the difference image (the centered data matrix)

Note that each image is formulated into a long vector!

µ = 1 N xi

slide-50
SLIDE 50

Face identification

St Stanfor

  • rd University

05-Nov-2019 50

Eigenface algorithm

4. Compute the covariance matrix 5. Compute the eigenvectors of the covariance matrix Σ 6. Compute each training image xi ‘s projections as 7. Visualize the estimated training face xi

xi → xi

c ⋅φ1, xi c ⋅φ2,..., xi c ⋅φK

( ) ≡ a1,a2, ...,aK

( )

xi ≈ µ + a1φ1 + a2φ2 +...+ aKφK

slide-51
SLIDE 51

Face identification

St Stanfor

  • rd University

05-Nov-2019 51

Eigenface algorithm

6. Compute each training image xi ‘s projections as 7. Visualize the reconstructed training face xi

xi → xi

c ⋅φ1, xi c ⋅φ2,..., xi c ⋅φK

( ) ≡ a1,a2, ...,aK

( )

xi ≈ µ + a1φ1 + a2φ2 +...+ aKφK

a1φ1 a2φ2 aKφK ...

Reconstructed training face

𝑦"

slide-52
SLIDE 52

Face identification

St Stanfor

  • rd University

05-Nov-2019 52

Eigenvalues (variance along eigenvectors)

slide-53
SLIDE 53

Face identification

St Stanfor

  • rd University

05-Nov-2019 53

  • Only selecting the top K eigenfaces à reduces the dimensionality.
  • Fewer eigenfaces result in more information loss, and hence less

discrimination between faces.

Reconstruction and Errors

K = 4 K = 200 K = 400

slide-54
SLIDE 54

Face identification

St Stanfor

  • rd University

05-Nov-2019 54

Eigenface algorithm

  • Testing

1. Take query image t 2. Project into eigenface space and compute projection 3. Compare projection w with all N training projections

  • Simple comparison metric: Euclidean
  • Simple decision: K-Nearest Neighbor

(note: this “K” refers to the k-NN algorithm, is different from the previous K’s referring to the # of principal components)

t → (t −µ)⋅φ1, (t −µ)⋅φ2,..., (t −µ)⋅φK

( ) ≡ w1,w2,...,wK ( )

slide-55
SLIDE 55

Face identification

St Stanfor

  • rd University

05-Nov-2019 56

Shortcomings

  • Requires carefully controlled data:

–All faces centered in frame –Same size –Some sensitivity to angle

  • Alternative:

–“Learn” one set of PCA vectors for each angle –Use the one with lowest error

  • Method is completely knowledge free

–(sometimes this is good!) –Doesn’t know that faces are wrapped around 3D objects (heads) –Makes no effort to preserve class distinctions

slide-56
SLIDE 56

Face identification

St Stanfor

  • rd University

05-Nov-2019 57

Summary for Eigenface

Pros

  • Non-iterative, globally optimal solution

Limitations

  • PCA projection is optimal for reconstruction from a low

dimensional basis, but may NOT be optimal for discrimination… Is there a better dimensionality reduction?

slide-57
SLIDE 57

Face identification

St Stanfor

  • rd University

05-Nov-2019 58

Besides face recognitions, we can also do Facial expression recognition

slide-58
SLIDE 58

Face identification

St Stanfor

  • rd University

05-Nov-2019 59

Happiness subspace (method A)

slide-59
SLIDE 59

Face identification

St Stanfor

  • rd University

05-Nov-2019 60

Disgust subspace (method A)

slide-60
SLIDE 60

Face identification

St Stanfor

  • rd University

05-Nov-2019 61

Facial Expression Recognition Movies (method A)

slide-61
SLIDE 61

Face identification

St Stanfor

  • rd University

05-Nov-2019 62

What we will learn today

  • Introduction to face recognition
  • The Eigenfaces Algorithm
  • Linear Discriminant Analysis (LDA)

Turk and Pentland, Eigenfaces for Recognition, Journal of Cognitive Neuroscience 3 (1): 71–86.

  • P. Belhumeur, J. Hespanha, and D. Kriegman. "Eigenfaces vs. Fisherfaces: Recognition

Using Class Specific Linear Projection". IEEE Transactions on pattern analysis and machine intelligence 19 (7): 711. 1997.

slide-62
SLIDE 62

Face identification

St Stanfor

  • rd University

05-Nov-2019 63

Which direction will is the first principle component?

slide-63
SLIDE 63

Face identification

St Stanfor

  • rd University

05-Nov-2019 64

Fischer’s Linear Discriminant Analysis

  • Goal: find the best separation between two classes

Slide inspired by N. Vasconcelos

slide-64
SLIDE 64

Face identification

St Stanfor

  • rd University

05-Nov-2019 65

Difference between PCA and LDA

  • PCA preserves maximum variance
  • LDA preserves discrimination

– Find projection that maximizes scatter between classes and minimizes scatter within classes

slide-65
SLIDE 65

Face identification

St Stanfor

  • rd University

05-Nov-2019 66

Illustration of the Projection

Poor Projection

x1 x2 x1 x2

  • Using two classes as example:

Good

slide-66
SLIDE 66

Face identification

St Stanfor

  • rd University

05-Nov-2019 67

Basic intuition: PCA vs. LDA

slide-67
SLIDE 67

Face identification

St Stanfor

  • rd University

05-Nov-2019 68

LDA with 2 variables

  • We want to learn a projection W such that the projection converts all the

points from x to a new space (For this example, assume m == 1):

  • Let the per class means be:
  • And the per class covariance matrices be:
  • We want a projection that maximizes:

𝑨 = 𝑥&𝑦

slide-68
SLIDE 68

Face identification

St Stanfor

  • rd University

05-Nov-2019 69

Fischer’s Linear Discriminant Analysis

Slide inspired by N. Vasconcelos

Between class scatter Within class scatter

slide-69
SLIDE 69

Face identification

St Stanfor

  • rd University

05-Nov-2019 70

LDA with 2 variables

The following objective function: Can be written as

slide-70
SLIDE 70

Face identification

St Stanfor

  • rd University

05-Nov-2019 71

LDA with 2 variables

  • We can write the between class scatter as:
  • Also, the within class scatter becomes:

Slide inspired by N. Vasconcelos

slide-71
SLIDE 71

Face identification

St Stanfor

  • rd University

05-Nov-2019 72

LDA with 2 variables

  • We can plug in these scatter values to our objective function:
  • And our objective becomes:

Slide inspired by N. Vasconcelos

slide-72
SLIDE 72

Face identification

St Stanfor

  • rd University

05-Nov-2019 73

LDA with 2 variables

  • The scatter variables

Slide inspired by N. Vasconcelos

slide-73
SLIDE 73

Face identification

St Stanfor

  • rd University

05-Nov-2019 74

2

S

1

S

B

S

2 1

S S SW + =

x1 x2

Within class scatter Between class scatter

Visualization

slide-74
SLIDE 74

Face identification

St Stanfor

  • rd University

05-Nov-2019 75

Linear Discriminant Analysis (LDA)

  • Maximizing the ratio
  • Is equivalent to maximizing the numerator while keeping the

denominator constant, i.e.

  • And can be accomplished using Lagrange multipliers, where

we define the Lagrangian as

  • And maximize with respect to both w and λ

Slide inspired by N. Vasconcelos

slide-75
SLIDE 75

Face identification

St Stanfor

  • rd University

05-Nov-2019 76

Linear Discriminant Analysis (LDA)

  • Setting the gradient of

With respect to w to zeros we get

  • r
  • This is a generalized eigenvalue problem
  • The solution is easy when

exists

Slide inspired by N. Vasconcelos

slide-76
SLIDE 76

Face identification

St Stanfor

  • rd University

05-Nov-2019 77

Linear Discriminant Analysis (LDA)

  • In this case
  • And using the definition of SB
  • Assuming that (μ1-μ0)Tw=α is a scalar, this can be written as
  • and since we don’t care about the magnitude of w

Slide inspired by N. Vasconcelos

slide-77
SLIDE 77

Face identification

St Stanfor

  • rd University

05-Nov-2019 78

LDA with N variables and C classes

slide-78
SLIDE 78

Face identification

St Stanfor

  • rd University

05-Nov-2019 79

Variables

  • N Sample images:
  • C classes:
  • Average of each class:
  • Average of all data:

{ }

N

x x , ,

1 !

å =

= N k k

x N

1

1 µ

å =

Î

i k

x k i i

x N

c

µ 1

slide-79
SLIDE 79

Face identification

St Stanfor

  • rd University

05-Nov-2019 80

Scatter Matrices

  • Scatter of class i:

å

=

=

c i i W

S S

1

  • Within class scatter:
  • Between class scatter:

( )( )

T i k x i k i

x x S

i k

µ µ

c

  • = å

Î

𝑇( = )

"*+ ,

)

  • ."

(𝜈" − 𝜈-)(𝜈" − 𝜈-)&

slide-80
SLIDE 80

Face identification

St Stanfor

  • rd University

05-Nov-2019 81

Mathematical Formulation

  • Recall that we want to learn a projection W

such that the projection converts all the points from x to a new space z:

  • After projection:

– Between class scatter – Within class scatter

  • So, the objective becomes:

W S W S

B T B =

~ W S W S

W T W =

~

W S W W S W S S W

W T B T W B

  • pt

W W

max arg ~ ~ max arg = =

𝑨 = 𝑥&𝑦

slide-81
SLIDE 81

Face identification

St Stanfor

  • rd University

05-Nov-2019 82

Mathematical Formulation

  • Solve generalized eigenvector problem:

W S W W S W W

W T B T

  • pt

W

max arg =

m i w S w S

i W i i B

, , 1 ! = = l

slide-82
SLIDE 82

Face identification

St Stanfor

  • rd University

05-Nov-2019 83

Mathematical Formulation

  • Solution: Generalized Eigenvectors
  • Rank of Wopt is limited

– Rank(SB) <= |C|-1 – Rank(SW) <= N-C

m i w S w S

i W i i B

, , 1 ! = = l

slide-83
SLIDE 83

Face identification

St Stanfor

  • rd University

05-Nov-2019 84

PCA vs. LDA

  • Eigenfaces exploit the max scatter of the training images in

face space

  • Fisherfaces attempt to maximise the between class scatter,

while minimising the within class scatter.

slide-84
SLIDE 84

Face identification

St Stanfor

  • rd University

05-Nov-2019 85

Basic intuition: PCA vs. LDA

slide-85
SLIDE 85

Face identification

St Stanfor

  • rd University

05-Nov-2019 86

Results: Eigenface vs. Fisherface

  • Variation in Facial Expression, Eyewear, and Lighting
  • Input: 160 images of 16 people
  • Train: 159 images
  • Test:

1 image

With glasses Without glasses 3 Lighting conditions 5 expressions

slide-86
SLIDE 86

Face identification

St Stanfor

  • rd University

05-Nov-2019 87

Eigenface vs. Fisherface

slide-87
SLIDE 87

Face identification

St Stanfor

  • rd University

05-Nov-2019 88

What we have learned today

  • Introduction to face recognition
  • The Eigenfaces Algorithm
  • Linear Discriminant Analysis (LDA)

Turk and Pentland, Eigenfaces for Recognition, Journal of Cognitive Neuroscience 3 (1): 71–86.

  • P. Belhumeur, J. Hespanha, and D. Kriegman. "Eigenfaces vs. Fisherfaces: Recognition

Using Class Specific Linear Projection". IEEE Transactions on pattern analysis and machine intelligence 19 (7): 711. 1997.