Introduction to Computer Vision using OpenCVDylan Seychell
This is an introductory deck to computer vision using OpenCV and Python, through examples. This presentation is a step by step codelab through the basic functions of OpenCV.
PCA, commonly referred to as the use of eigenfaces, is the technique pioneered by Kirby and Sirivich in 1988. With PCA, the Unknown and Known images must be the same size. The PCA approach is used to reduce the dimension of the data by means of data compression basics and reveals the most effective low dimensional structure of facial patterns. This reduction in dimensions removes information that is not useful and precisely decomposes the face structure into orthogonal (uncorrelated) components known as eigenfaces. Each face image may be represented as a weighted sum (feature vector) of the eigenfaces, which are stored in a 1D array. An Unknown image is compared against a Known image by measuring the distance between their respective feature vectors.
Face Recognition using PCA-Principal Component Analysis using MATLABSindhi Madhuri
It describes about a biometric technique to recognize people at a particular environment using MATLAB. It simply forms EIGENFACES and compares Principal components instead of each and every pixel of an image.
Introduction to Computer Vision using OpenCVDylan Seychell
This is an introductory deck to computer vision using OpenCV and Python, through examples. This presentation is a step by step codelab through the basic functions of OpenCV.
PCA, commonly referred to as the use of eigenfaces, is the technique pioneered by Kirby and Sirivich in 1988. With PCA, the Unknown and Known images must be the same size. The PCA approach is used to reduce the dimension of the data by means of data compression basics and reveals the most effective low dimensional structure of facial patterns. This reduction in dimensions removes information that is not useful and precisely decomposes the face structure into orthogonal (uncorrelated) components known as eigenfaces. Each face image may be represented as a weighted sum (feature vector) of the eigenfaces, which are stored in a 1D array. An Unknown image is compared against a Known image by measuring the distance between their respective feature vectors.
Face Recognition using PCA-Principal Component Analysis using MATLABSindhi Madhuri
It describes about a biometric technique to recognize people at a particular environment using MATLAB. It simply forms EIGENFACES and compares Principal components instead of each and every pixel of an image.
Volume rendering 3D volume data (medical CT scans) in Unity3D.
Covering the following topics:
- Raymarching
- Maximum Intensity Projection
- Direct Volume Rendering with compositing
- Isosurface rendering
- Transfer functions
- 2D Transfer Functions
- Slice rendering
Source code here: https://github.com/mlavik1/UnityVolumeRendering
This is the first part of the presentation series on one of the powerful open sources libraries, the opencv. this presentation is about the introduction, installation, some basic functions on images and some basic image processing on the images
Image Acquisition and Representation
A Simple Image Formation Model
Image Sampling and Quantization
Image Interpolation
Image quantization
Nearest Neighbor Interpolation
Lec12: Shape Models and Medical Image SegmentationUlaş Bağcı
ShapeModeling – M-reps
– Active Shape Models (ASM)
– Oriented Active Shape Models (OASM)
– Application in anatomy recognition and segmentation – Comparison of ASM and OASM
ActiveContour(Snake) • LevelSet • Applications Enhancement, Noise Reduction, and Signal Processing • MedicalImageRegistration • MedicalImageSegmentation • MedicalImageVisualization • Machine Learning in Medical Imaging • Shape Modeling/Analysis of Medical Images Deep Learning in Radiology Fuzzy Connectivity (FC) – Affinity functions • Absolute FC • Relative FC (and Iterative Relative FC) • Successful example applications of FC in medical imaging • Segmentation of Airway and Airway Walls using RFC based method Energy functional – Data and Smoothness terms • GraphCut – Min cut – Max Flow • ApplicationsinRadiologyImages
Here K means clustering method is being used to compress the images. The input is the number of color required in the output image which is same as the number of clusters. The output is the compressed image having prementioned number of colors
Computer vision has received great attention over the last two decades.
This research field is important not only in security-related software but also in the advanced interface between people and computers, advanced control methods, and many other areas.
Lec-17: Sparse Signal Processing & Applications [notes]
Sparse signal processing, recovery of sparse signal via L1 minimization. Applications including face recognition, coupled dictionary learning for image super-resolution.
Volume rendering 3D volume data (medical CT scans) in Unity3D.
Covering the following topics:
- Raymarching
- Maximum Intensity Projection
- Direct Volume Rendering with compositing
- Isosurface rendering
- Transfer functions
- 2D Transfer Functions
- Slice rendering
Source code here: https://github.com/mlavik1/UnityVolumeRendering
This is the first part of the presentation series on one of the powerful open sources libraries, the opencv. this presentation is about the introduction, installation, some basic functions on images and some basic image processing on the images
Image Acquisition and Representation
A Simple Image Formation Model
Image Sampling and Quantization
Image Interpolation
Image quantization
Nearest Neighbor Interpolation
Lec12: Shape Models and Medical Image SegmentationUlaş Bağcı
ShapeModeling – M-reps
– Active Shape Models (ASM)
– Oriented Active Shape Models (OASM)
– Application in anatomy recognition and segmentation – Comparison of ASM and OASM
ActiveContour(Snake) • LevelSet • Applications Enhancement, Noise Reduction, and Signal Processing • MedicalImageRegistration • MedicalImageSegmentation • MedicalImageVisualization • Machine Learning in Medical Imaging • Shape Modeling/Analysis of Medical Images Deep Learning in Radiology Fuzzy Connectivity (FC) – Affinity functions • Absolute FC • Relative FC (and Iterative Relative FC) • Successful example applications of FC in medical imaging • Segmentation of Airway and Airway Walls using RFC based method Energy functional – Data and Smoothness terms • GraphCut – Min cut – Max Flow • ApplicationsinRadiologyImages
Here K means clustering method is being used to compress the images. The input is the number of color required in the output image which is same as the number of clusters. The output is the compressed image having prementioned number of colors
Computer vision has received great attention over the last two decades.
This research field is important not only in security-related software but also in the advanced interface between people and computers, advanced control methods, and many other areas.
Lec-17: Sparse Signal Processing & Applications [notes]
Sparse signal processing, recovery of sparse signal via L1 minimization. Applications including face recognition, coupled dictionary learning for image super-resolution.
Image generation. Gaussian models for human faces, limits and relations with linear neural networks. Generative adversarial networks (GANs), generators, discrinators, adversarial loss and two player games. Convolutional GAN and image arithmetic. Super-resolution. Nearest-neighbor, bilinear and bicubic interpolation. Image sharpening. Linear inverse problems, Tikhonov and Total-Variation regularization. Super-Resolution CNN, VDSR, Fast SRCNN, SRGAN, perceptual, adversarial and content losses. Style transfer: Gatys model, content loss and style loss.
Lec-07: Feature Aggregation and Image Retrieval System [notes]
Image retrieval system performance metrics, precision, recall, true positive rate, false positive rate; Bag of Words (BoW) and VLAD aggregation.
Lec-16: Subspace/Transform Optimization
Address the non-linearity issues in appearance manifolds by having a piece-wise linear solution. Query driven local model learning, subspace indexing on Grassmann manifold, direct Newtonian method of subspace optimization on Grassmann manifold.
http://imatge-upc.github.io/telecombcn-2016-dlcv/
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of big annotated data and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which had been addressed until now with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks and Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles and applications of deep learning to computer vision problems, such as image classification, object detection or text captioning.
Content Based Image Retrieval Using Gray Level Co-Occurance Matrix with SVD a...ijcisjournal
In this paper, gray level co-occurrence matrix, gray level co-occurrence matrix with singular value
decomposition and local binary pattern are presented for content based image retrieval. Based upon the
feature vector parameters of energy, contrast, entropy and distance metrics such as Euclidean distance,
Canberra distance, Manhattan distance the retrieval efficiency, precision, and recall of the images are
calculated. The retrieval results of the proposed method are tested on Corel-1k database. The results after
being investigated shows a significant improvement in terms of average retrieval rate, average retrieval
precision and recall of different algorithms such as GLCM, GLCM & SVD, LBP with radius one and LBP
with radius two based on different distance metrics.
Multimodal Residual Networks for Visual QAJin-Hwa Kim
Deep neural networks continue to advance the state-of-the-art of image recognition tasks with various methods. However, applications of these methods to multimodality remain limited. We present Multimodal Residual Networks (MRN) for the multimodal residual learning of visual question-answering, which extends the idea of the deep residual learning. Unlike the deep residual learning, MRN effectively learns the joint representation from vision and language information. The main idea is to use element-wise multiplication for the joint residual mappings exploiting the residual learning of the attentional models in recent studies. Various alternative models introduced by multimodality are explored based on our study. We achieve the state-of-the-art results on the Visual QA dataset for both Open-Ended and Multiple-Choice tasks. Moreover, we introduce a novel method to visualize the attention effect of the joint representations for each learning block using back-propagation algorithm, even though the visual features are collapsed without spatial information.
In large scale visual pattern recognition applications, when the subject set is large the traditional linear models like PCA/LDA/LPP, become inadequate in capturing the non-linearity and local variations of visual appearance manifold. Kernelized solutions can alleviate the problem to certain degree, but faces a computational complexity challenge of solving eigen or QP problems of size n x n for number of training samples n. In this work, we developed a novel solution to this problem by applying a data partition first and obtain a rich set of local data patch models, then the hierarchical structure of this rich set of models are computed with subspace clustering on Grassmanian manifold, via a VQ like algorithm with data partition locality constraint. At query time, a probe image is projected to the data space partition first to obtain the probe model, and the optimal local model is computed by traversing the model hierarchical tree. Simulation results demonstrated the effectiveness of this solution in computational efficiency and recognition accuracy, with applications in large subject set face recognition and image retrieval.
[Bio]
Zhu Li is currently a Senior Staff Researcher and Media Analytics & Processing Group Lead with the Media Networking Lab, Core Networks Research, FutureWei (Huawei) Technology USA, at Bridgewater, New Jersey. He received his PhD in Electrical & Computer Engineering from Northwestern University, Evanston in 2004. He was an Assistant Professor with the Dept of Computing, The Hong Kong Polytechnic University from 2008 to 2010, and a Senior Research Engineer, Senior Staff Research Engineering, and then Principal Staff Research Engineer with the Multimedia Research Lab (MRL), Motorola Labs, Schaumburg, Illinois, from 2000 to 2008. His research interests include audio-visual analytics and machine learning with its application in large scale video repositories annotation, search and recommendation, as well as video adaptation, source-channel coding and distributed optimization issues of the wireless video networks. He has 21 issued or pending patents, 70+ publications in book chapters, journals, conference proceedings and standards contributions in these areas. He is an IEEE senior member, elected Vice Chair of the IEEE Multimedia Communication Technical Committee (MMTC) 2008~2010, co-editor for the Springer-Verlag book on "Intelligent Video Communication: Techniques and Applications". He served on numerous conference and workshop TPCs and was symposium co-chair at IEEE ICC'2008, and on Best Paper Award Committee for IEEE ICME 2010. He received the Best Poster Paper Award from IEEE Int'l Conf on Multimedia & Expo (ICME) at Toronto, 2006, and the Best Paper Award from IEEE Int'l Conf on Image Processing (ICIP) at San Antonio, 2007.
Introduction of info theory basis for image/video coding, especially, entropy, rate-distortion theory,
entropy coding, huffman coding, arithmetic coding
Invited talk at USTC and SJTU, discuss recent progress in object re-identification against very large repository, especially the problem of fast key point detection, feature repeatability prediction, aggregation, and object repository indexing and search.
Adaptive HTTP Streaming solutions are phasing
out traditional online video distribution solutions such as
progressive download. MPEG DASH is an open standardized
solution that has been developed to minimize solution
fragmentation and to ensure quick market adoption. However,
the openness of the standard loosens the grip of content providers
on the client behavior and may threaten the success of the whole
ecosystem. This paper proposes a content fingerprinting and
verification mechanism for restricting the client’s playback
behavior in such an open environment by using a very light
weight Eigen thumbnail appearance differential fingerprinting.
Simulation results demonstrate the effectiveness of the proposed
solution.
Keywords—MPEG DASH; Video Fingerprinting; Playback
Verification; Eigen Appearance;
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Lec14 eigenface and fisherface
1. Image Analysis & Retrieval
CS/EE 5590 Special Topics (Class Ids: 44873, 44874)
Fall 2016, M/W 4-5:15pm@Bloch 0012
Lec 14
Eigenface and Fisherface
Zhu Li
Dept of CSEE, UMKC
Office: FH560E, Email: lizhu@umkc.edu, Ph: x 2346.
http://l.web.umkc.edu/lizhu
Z. Li, Image Analysis & Retrv. 2016 p.1
2. Outline
Recap:
SVD
PCA
Face Recognition – direct learning from pixels
Eigenface
Fisherface
Summary
Z. Li, Image Analysis & Retrv. 2016 p.2
3. SVD – projection decomposition
for non square matrix: Amxn:
𝐴 = 𝑈Σ𝑉 𝑇
𝑉 𝑇
Σ
Z. Li, Image Analysis & Retrv. 2016 p.3
4. SVD as Signal Decomposition
The Singular Value Decomposition (SVD) of an nxm matrix A,
is,
Where the diagonal of S are the eigen values of AAT,
[𝜎1, 𝜎2, … , 𝜎 𝑛], called “singular values”
U are eigenvectors of AAT, and V are eigen vectors of ATA,
the outer product of uivi
T, are basis of A in reconstruction:
𝐴 = 𝑈𝑆𝑉 𝑇 =
𝑖
𝜎𝑖 𝑢𝑖 𝑣𝑖
𝑡
A(mxn) = U(mxm) S(mxn)
V(nxn)
The 1st order SVD approx. of A is:
𝜎1 ∗ 𝑈 : , 1 ∗ 𝑉 : , 1 𝑇
Z. Li, Image Analysis & Retrv. 2016 p.4
5. SVD approximation of an image
Very easy…
function [x]=svd_approx(x0, k)
dbg=0;
if dbg
x0= fix(100*randn(4,6));
k=2;
end
[u, s, v]=svd(x0);
[m, n]=size(s);
x = zeros(m, n);
sgm = diag(s);
for j=1:k
x = x + sgm(j)*u(:,j)*v(:,j)';
end
Z. Li, Image Analysis & Retrv. 2016 p.5
6. PCA- Principal Component Analysis
Formulation:
Find projections, that the information/energy of the data are
maximally preserved
Matlab: [A, s, eigv]=princomp(X);
max
𝑊
𝐸 𝑥 𝑇 𝑊 𝑇 𝑊𝑥 , 𝑠. 𝑡. , 𝑊 𝑇 𝑊 = 𝐼
Z. Li, Image Analysis & Retrv. 2016 p.6
7. PCAAlgorithm
Center the data:
X = X – repmat(mean(x), [n,
1]);
Principal component #1
points in the direction of the
largest variance
Each subsequent principal
component…
is orthogonal to the previous
ones, and
points in the directions of the
largest variance of the residual
subspace
Solved by finding Eigen
Vectors of the
Scatter/Covarinace matrix of
data:
S = cov(X); [A, eigv]=Eig(S)
Z. Li, Image Analysis & Retrv. 2016 p.7
8. Min Error Reconstruction Derivation of PCAAlgorithm
GOAL:
Z. Li, Image Analysis & Retrv. 2016 p.8
14. SIFT Embedding via PCA
Project SIFT to desired lower dimensional space
Matlab:
offs=gd_sift_offs(k-1)+1: gd_sift_offs(k);
sift = gd_sift_cdvs(offs,: );
x = sift*A1(:,1:kd)
% plot 3d
plot3(x(:,1), x(:,2), x(:,3), ‘.r’);
Z. Li, Image Analysis & Retrv. 2016 p.14
15. Outline
Recap:
SVD
PCA
Face Recognition – direct learning from pixels
Eigenface
Fisherface
Summary
Z. Li, Image Analysis & Retrv. 2016 p.15
16. The Face Recognition Problem
The Verification vs Identification Problem
= ?
= ?
Verification problem 1:1
Identification/Recognition problem 1:N
Z. Li, Image Analysis & Retrv. 2016 p.16
17. Holistic Approach: Treat Pixel Directly as features
1. Treat pixels as a vector
2. Recognize face by nearest neighbor
xy
T
k
k
k argmin
h
w
X in Rwxh
{Y1, Y2, Y3,…, Yn } in Rwxh
Z. Li, Image Analysis & Retrv. 2016 p.17
18. The space of all face images
• When viewed as vectors of pixel values, face images are extremely
high-dimensional
120x120 pixel image = 14400 dimensions
Slow and lots of storage
• But very few 14,400-dimensional vectors are valid face images
• We want to effectively model the subspace of face images
Z. Li, Image Analysis & Retrv. 2016 p.18
19. The space of all face images
• Eigenface idea: construct a low-dimensional linear
subspace that best explains the variation/scatter of
the face images
Z. Li, Image Analysis & Retrv. 2016 p.19
20. Principal Component Analysis (PCA)
• Given: N data points x1, … ,xN in Rd
• We want to find a new set of features that are linear
combinations of original ones:
u(xi) = uT(xi – µ)
• (µ: mean of data points)
• Choose unit vector u in Rd that captures the most data
variance
Z. Li, Image Analysis & Retrv. 2016 p.20
21. Principal Component Analysis
• Direction that maximizes the variance of the projected data:
Projection of data point
Covariance matrix of data
The direction that maximizes the variance is the eigenvector associated with the
largest eigenvalue of Σ
N
N
1/N
Maximize
subject to ||u||=1
Z. Li, Image Analysis & Retrv. 2016 p.21
22. Eigenfaces (PCA on face images)
1. Compute covariance matrix of face images
2. Compute the principal components (“eigenfaces”)
K eigenvectors with largest eigenvalues
3. Represent all face images in the dataset as linear
combinations of eigenfaces
Perform nearest neighbor on these coefficients
M. Turk and A. Pentland, Face Recognition using Eigenfaces, CVPR 1991
Z. Li, Image Analysis & Retrv. 2016 p.22
26. Representation and reconstruction
• Face x in “face space” coordinates:
• Reconstruction:
= +
µ + w1u1+w2u2+w3u3+w4u4+ …
=
^
x =
Z. Li, Image Analysis & Retrv. 2016 p.26
27. Matlab Implementation
Scaling the face image to thumbnail size
Justification: as long as human eye can recognize, that
contains sufficient info
Scale space characteristic response for face recognition
Compute the PCA over the vectorized face data
load faces-ids-n6680-m417-20x20.mat;
[A, s, lat]=princomp(faces);
h=20; w=20;
figure(30);
subplot(1,2,1); grid on; hold on; stem(lat, '.');
f_eng=lat.*lat;
subplot(1,2,2); grid on; hold on; plot(cumsum(f_eng)/sum(f_eng),
'.-');
Z. Li, Image Analysis & Retrv. 2016 p.27
28. Eigenface
Holistic approach: treat an hxw image as a point in Rhxw:
Face data set: 20x20 face icon images, 417 subjects, 6680 face images
Notice that all the face images are not filling up the R20x20 space:
Eigenface basis: imagesc(reshape(A1(:,1), [h, w]));
kd kd
eigval
Infopreservingratio
Z. Li, Image Analysis & Retrv. 2016 p.28
29. Eigenface Projections
Project face images to Eigenface space
Matlab: x=faces*A(:,1:kd)
eigf1
eigf2
eigf3
= 10.9* + 0.4* + 4.7*
Z. Li, Image Analysis & Retrv. 2016 p.29
30. Verification Performance
ROC of Eigen face kd=8, 12, 16
18 unique ids, 120 face images
Z. Li, Image Analysis & Retrv. 2016 p.30
32. Limitation of PCA
What PCA does best ?
Label agnostic data
compression/dimension reduction
Suppress noises
It is a linear rotation (note that
A*AT = I), minimum amount of
distortion to the data
Help classification (sort of)
What PCA can not
Can not fit data that is not linear
(can try kernelized PCA)
Does not taking labelling into
consideration (Fisherface !)
?
?
??
Z. Li, Image Analysis & Retrv. 2016 p.32
33. Outline
Recap:
SVD
PCA
Face Recognition – direct learning from pixels
Eigenface
Fisherface
Summary
Z. Li, Image Analysis & Retrv. 2016 p.33
34. Why is Face Recognition Hard?
Many faces of Madonna the bad girl…
Z. Li, Image Analysis & Retrv. 2016 p.34
35. • Identify similar faces (inter-class similarity)
• Accommodate intra-class variability due to:
• head pose
• illumination conditions
• expressions
• facial accessories
• aging effects
• Cartoon/sketch
Face Recognition Challenges
Z. Li, Image Analysis & Retrv. 2016 p.35
36. • Different persons may have very similar appearance
Twins Father and son
www.marykateandashley.com news.bbc.co.uk/hi/english/in_depth/americas/2000/us_el
ections
Inter-class similarities
Z. Li, Image Analysis & Retrv. 2016 p.36
37. • Faces with intra-subject variations in pose, illumination,
expression, accessories, color, occlusions, and brightness
Intra-Class Variations
Z. Li, Image Analysis & Retrv. 2016 p.37
38. P. Belhumeur, J. Hespanha, D. Kriegman, Eigenfaces vs. Fisherfaces: Recognition
Using Class Specific Linear Projection, PAMI, July 1997, pp. 711--720.
• An n-pixel image xRn
can be
projected to a low-dimensional
feature space yR
m
by
y = Wx
where W is an n by m matrix.
• Recognition is performed using
nearest neighbor in R
m
.
• How do we choose a good W?
Fisherface solution
Ref:
Z. Li, Image Analysis & Retrv. 2016 p.38
39. PCA & Fisher’s Linear Discriminant
• Between-class scatter
• Within-class scatter
• Total scatter
• Where
– c is the number of classes
– i is the mean of class i
– | i | is number of samples of i..
T
ii
c
i
iBS ))((
1
c
i x
T
ikikW
ik
xS
1
))((
WB
c
i x
T
kkT SSxS
ik
1
))((
1
2
1
2
Z. Li, Image Analysis & Retrv. 2016 p.39
40. Eigen vs Fisher Projection
• PCA (Eigenfaces)
Maximizes projected total scatter
• Fisher’s Linear Discriminant
Maximizes ratio of projected
between-class to projected
within-class scatter, solved by the
generalized Eigen problem:
WSWW T
T
W
PCA maxarg
WSW
WSW
W
W
T
B
T
W
fld maxarg
1
2
PCA
Fisher 𝑆 𝐵 𝑊 = 𝜆𝑆 𝑊 𝑊
Z. Li, Image Analysis & Retrv. 2016 p.40
41. A problem…
Compute Scatter matrix in I-dimensional space
We need at least d data points to compute a non-singular
scatter matrix.
E.g, d=3, we need at least 3 points, and, these points should
not be co-plane (gives rank 2, instead of 3).
In face recognition, d is number of pixels, say 20x20=400,
while number of training samples per class is small, say, nk =
10.
What shall we do ?
Z. Li, Image Analysis & Retrv. 2016 p.41
42. Computing the Fisher Projection Matrix
• The wi are orthonormal
• There are at most c-1 non-zero generalized Eigenvalues, so m <= c-1
• Rank of Sw is N-c, where N is the number of training samples (=10 in AT&T data set),
and c=40, so Sw can be singular and present numerical difficulty.
Z. Li, Image Analysis & Retrv. 2016 p.42
43. Dealing with Singularity of Sw
WWSWW
WWSWW
W
WSWW
WWW
PCAW
T
PCA
T
PCAB
T
PCA
T
W
fld
T
T
W
PCA
PCAfld
maxarg
maxarg
• Since SW is rank N-c, project
training set via PCA first to
subspace spanned by first N-c
principal components of the
training set.
• Apply FLD to N-c
dimensional subspace yielding
c-1 dimensional feature space.
• Fisher’s Linear Discriminant projects away the within-class variation
(lighting, expressions) found in training set.
• Fisher’s Linear Discriminant preserves the separability of the classes.
Z. Li, Image Analysis & Retrv. 2016 p.43
44. Experiment results on 417-6680 data set
Compute Eigenface model and Fisherface model
% Eigenface: A1
load faces-ids-n6680-m417-20x20.mat;
[A1, s, lat]=princomp(faces);
% Fisherface: A2
n_face = 600; n_subj = length(unique(ids(1:n_face)));
%eigenface kd
kd = 32; opt.Fisherface = 1;
[A2, lat]=LDA(ids(1:n_face), opt,
faces(1:n_face,:)*A1(:,1:kd));
% eigenface
x1 = faces*A1(:,1:kd);
f_dist1 = pdist2(x1, x1);
% fisherface
x2 = faces*A1(:,1:kd)*A2;
f_dist2 = pdist2(x2, x2);
Z. Li, Image Analysis & Retrv. 2016 p.44
45. Fisher vs Eigenface performance
Eigenface model: kd=32
Data set: 400 faces/58 subjects, 600 faces/86 subjects
Z. Li, Image Analysis & Retrv. 2016 p.45
46. Summary
PCA approach
Try to find an orthogonal rotation
s.t. the first k-dimensions of the
new subspace, captures most of
the info of the data
Agnostic to the label info
Matlab: [A, s,
eigv]=princomp(data);
LDA approach
Try to find projection that
maximizes the ratio of between
class scatter vs within class
scatter
Typically solved by apply PCA
first to avoid within class scatter
singularity
Utilizes label info
Matlab: [A, eigv]=LDA(label,
opt, data);
1
2
PCA
Fisher
Z. Li, Image Analysis & Retrv. 2016 p.46