# Face Recognition using Principle Component Analysis

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Face Recognition using Principle Component Analysis Kyungnam Kim Department of Computer Science University of Maryland, College Park MD 20742, USA Summary This is the summary of the basic idea about PCA and the papers about the face recognition using PCA. 1. Introduction The Principal Component Analysis (PCA) is one of the most successful techniques that have been used in image recognition and compression. PCA is a statistical method under the broad title of factor analysis. The purpose of PCA is to reduce the large dimensionality of the data space (observed variables) to the smaller intrinsic dimensionality of feature space (independent variables), which are needed to describe the data economically. This is the case when there is a strong correlation between observed variables. The jobs which PCA can do are prediction, redundancy removal, feature extraction, data compression, etc. Because PCA is a classical technique which can do something in the linear domain, applications having linear models are suitable, such as signal processing, image processing, system and control theory, communications, etc. Face recognition has many applicable areas. Moreover, it can be categorized into face identification, face classification, or sex determination. The most useful applications contain crowd surveillance, video content indexing, personal identification (ex. driver s licence), mug shots matching, entrance security, etc. The main idea of using PCA for face recognition is to express the large 1-D vector of pixels constructed from 2-D facial image into the compact principal components of the feature space. This can be called eigenspace projection. Eigenspace is calculated by identifying the eigenvectors of the covariance matrix derived from a set of facial images(vectors). The details are described in the following section. Section 2 describes mathematical formulation of PCA. More details about face recognition by PCA are given in Section 3. Implementation and some results are shown in Section 4. Finally, I present critical reviews in Section 5. 1

2 2. Mathematics of PCA A 2-D facial image can be represented as 1-D vector by concatenating each row (or column) into a long thin vector. Let s suppose we have M vectors of size N (= rows of image columns of image) representing a set of sampled images. p j s represent the pixel values. x i = [p 1... p N ] T, i = 1,..., M (1) The images are mean centered by subtracting the mean image from each image vector. Let m represent the mean image. m = 1 M x i (2) M And let w i be defined as mean centered image i=1 w i = x i m (3) Our goal is to find a set of e i s which have the largest possible projection onto each of the w i s. We wish to find a set of M orthonormal vectors e i for which the quantity λ i = 1 M M (e T i w n ) 2 (4) n=1 is maximized with the orthonormality constraint e T l e k = δ lk (5) It has been shown that the e i s and λ i s are given by the eigenvectors and eigenvalues of the covariance matrix C = W W T (6) where W is a matrix composed of the column vectors w i placed side by side. The size of C is N N which could be enormous. For example, images of size create the covariance matrix of size It is not practical to solve for the eigenvectors of C directly. A common theorem in linear algebra states that the vectors e i and scalars λ i can be obtained by solving for the eigenvectors and eigenvalues of the M M matrix W T W. Let d i and µ i be the eigenvectors and eigenvalues of W T W, respectively. By multiplying left to both sides by W W T W d i = µ i d i (7) W W T (W d i ) = µ i (W d i ) (8) which means that the first M 1 eigenvectors e i and eigenvalues λ i of W W T are given by W d i and µ i, respectively. W d i needs to be normalized in order to be equal to e i. Since we only sum up a finite number of image vectors, M, the rank of the covariance matrix cannot exceed M 1 (The 1 come from the subtraction of the mean vector m). 2

3 The eigenvectors corresponding to nonzero eigenvalues of the covariance matrix produce an orthonormal basis for the subspace within which most image data can be represented with a small amount of error. The eigenvectors are sorted from high to low according to their corresponding eigenvalues. The eigenvector associated with the largest eigenvalue is one that reflects the greatest variance in the image. That is, the smallest eigenvalue is associated with the eigenvector that finds the least variance. They decrease in exponential fashion, meaning that the roughly 90% of the total variance is contained in the first 5% to 10% of the dimensions. A facial image can be projected onto M ( M) dimensions by computing Ω = [v 1 v 2... v M ] T (9) where v i = e T i w i. v i is the i th coordinate of the facial image in the new space, which came to be the principal component. The vectors e i are also images, so called, eigenimages, or eigenfaces in our case, which was first named by [1]. They can be viewed as images and indeed look like faces. So, Ω describes the contribution of each eigenface in representing the facial image by treating the eigenfaces as a basis set for facial images. The simplest method for determining which face class provides the best description of an input facial image is to find the face class k that minimizes the Euclidean distance ɛ k = (Ω Ω k ) (10) where Ω k is a vector describing the k th face class. If ɛ k is less than some predefined threshold θ ɛ, a face is classified as belonging to the class k. 3. Face recognition Once the eigenfaces have been computed, several types of decision can be made depending on the application. What we call face recognition is a broad term which may be further specified to one of following tasks: identification where the labels of individuals must be obtained, recognition of a person, where it must be decided if the individual has already been seen, categorization where the face must be assigned to a certain class. PCA computes the basis of a space which is represented by its training vectors. These basis vectors, actually eigenvectors, computed by PCA are in the direction of the largest variance of the training vectors. As it has been said earlier, we call them eigenfaces. Each eigenface can be viewed a feature. When a particular face is projected onto the face space, its vector into the face space describe the importance of each of those features in the face. The face is expressed in the face space by its eigenface coefficients (or weights). We can handle a large input vector, facial image, only by taking its small weight vector in the face space. This means that we can reconstruct the original face with some error, since the dimensionality of the image space is much larger than that of face space. In this report, let s consider face identification only. Each face in the training set is transformed into the face space and its components are stored in memory. The face space has to be populated 3

4 with these known faces. An input face is given to the system, and then it is projected onto the face space. The system computes its distance from all the stored faces. However, two issues should be carefully considered: 1. What if the image presented to the system is not a face? 2. What if the face presented to the system has not already learned, i.e., not stored as a known face? The first defect is easily avoided since the first eigenface is a good face filter which can test whether each image is highly correlated with itself. The images with a low correlation can be rejected. Or these two issues are altogether addressed by categorizing following four different regions: 1. Near face space and near stored face = known faces 2. Near face space but not near a known face = unknown faces 3. Distant from face space and near a face class = non-faces 4. Distant from face space and not near a known class = non-faces Since a face is well represented by the face space, its reconstruction should be similar to the original, hence the reconstruction error will be small. Non-face images will have a large reconstruction error which is larger than some threshold θ r. The distance ɛ k determines whether the input face is near a known face. 4. Implementation and Results There is a well-known face database which can be downloadable from the AT&T Laboratories, Cambridge at It contains ten different images of each of 40 distinct subjects. For some subjects, the images were taken at different times, varying the lighting, facial expressions (open/closed eyes, smiling/not smiling) and facial details (glasses/no glasses). All the images were taken against a dark homogeneous background with the subjects in an upright, frontal position (with tolerance for some side movement). An experiment with a subset of the database, which only contains 12 subject s images, has been performed to ensure how well the eigenface system can identify each individual s face. Please note that this experiment is not exhaustive for the database. The system has been implemented by MATLAB. 10 subjects are selected as training set and other 2 subjects are the part of test set, which should be classified as unknown faces. There are 5 additional test images, each of which is the known face. I also appended 2 non-face images to test whether it can detect them correctly. Figure 3 shows the eigenface images which are originally the eigenvectors e i of the covariance matrix at Eq.6. The first eigenface account for the maximal variation of the training vectors. The 10 original training images and their reconstructed versions are depicted in Figure 1 and 2. The result was very successful given the test images in Figure 4. Every test image was correctly classified. When two unknown faces in Figure 5 are input to the system, the ɛ s at Eq. 10 are larger than the predefined threshold. In the case of two non-face images in Figure 5, the reconstruction errors were larger than the reconstruction threshold, then they are not considered as face images. The MATLAB source codes are attached to the appendix in the end of this summary. 4

5 Figure 1: Original training images Figure 2: Reconstructed images of training images- they are almost same as their original images 1 th 2 th 3 th 4 th 5 th 6 th 7 th 8 th 9 th 10 th Figure 3: Eigenface - The first eigenface account for the maximal variation of the training vectors, and the second one accounts for the second maximal variation, etc. t1 r1 t3 r3 t6 r6 t8 r8 t9 r9 Figure 4: Test images - the number corresponds the order of the set of original training images in Figure 1. r* means the reconstructed image 5

6 t11 r11 t12 r12 t13 r13 t14 r14 Figure 5: Unknown face and Non-face images - t11 and t12 are unknown faces. t13 and t14 are non-faces. r** means the reconstructed image 5. Critical Reviews In order to examine more carefully how well the idea works, I did much extensive and exhaustive experiments with different sets of training images. These are done by some criteria not considered by the authors. For the accuracy of the experiments, the training set should not overlapped the test set. The size of the training set was increased, i.e., 1st configuration - 10 subjects each of whom has 8 images (totally 80 images), 2nd configuration - 20 subject each of whom has 8 images (totally 160 images),... up to 40 subjects which is the maximum number of subject in the given database. The results showed me that the system gave correct identification for the known faces which is trained by the system. The noticeable fact is that the bigger the size of training set is, the less the reconstruction errors are. This is because there are more basis vectors (eigenvectors) to express the given data (faces + non-faces) in the feature space. But this makes the non-faces have less reconstruction error - this is undesirable case. Differentiating whether it is a known face or unknown is kind of hard problem. Deciding appropriate threshold θ ɛ in Eq.10 is not easy because there is no noticeable difference between the minimum of ɛ of known faces and those of unknown faces. The details are given in the additional paper Evaluation and Analysis. As mentioned in Section 2, A facial image can be projected onto much smaller M ( M) dimensions. The experiment told me that the identification of known faces is quite good, which is comparable to the case of larger dimensions of M. That it, we can express the face image data in much smaller dimensions with the help of some prominent basis vectors, which in fact reflect maximum variability. Please see Evaluation and Analysis for the results. I would like to enumerate some limitations of the algorithm, which I found from the experiments and careful considerations. 1. The face image should be normalized and frontal-view 2. The system is an auto-associative memory (p.153 in [2]). It is harmful to be overfitted. 3. Training is very computationally intensive. 4. It is hard to decide suitable thresholds - It is kind of Art! 5. The suggested methods to deal with unknown faces and non-faces are not good enough to differentiate them from known faces Here are some significant questions raised by the articles and also by myself. 6

7 How many eigenvectors (eigenfaces) are required to recover an original face by some percent of the total? Are the images of the same subject projected onto similar (near) points in the feature space? Is there any idea to decide the threshold automatically? Is there another tool to do similar things as PCA do? I discussed how I might approach some of above limitations and questions in the additional paper My suggestion. The eigenface system to perform face recognition gave me the basic idea of PCA and more extensive study of the course material. Although the face recognition results were acceptable, the system only using eigenfaces might not be applicable as a real system. It need to be more robust and to have other discriminant features. References [1] M.A. Turk and A.P. Pentland, Face Recognition Using Eigenfaces, IEEE Conf. on Computer Vision and Pattern Recognition, pp , [2] K. I. Diamantaras and S. Y. Kung, Principal Component Neural Networks: Theory and Applications, John Wiley & Sons,Inc., [3] Alex Pentland, Baback Moghaddam, and Thad Starner, View-Based and Modular Eigenspaces for Face Recognition, IEEE Conf. on Computer Vision and Pattern Recognition, MIT Media Laboratory Tech. Report No

### Adaptive Face Recognition System from Myanmar NRC Card

Adaptive Face Recognition System from Myanmar NRC Card Ei Phyo Wai University of Computer Studies, Yangon, Myanmar Myint Myint Sein University of Computer Studies, Yangon, Myanmar ABSTRACT Biometrics is

### Object Recognition and Template Matching

Object Recognition and Template Matching Template Matching A template is a small image (sub-image) The goal is to find occurrences of this template in a larger image That is, you want to find matches of

### Face Recognition using SIFT Features

Face Recognition using SIFT Features Mohamed Aly CNS186 Term Project Winter 2006 Abstract Face recognition has many important practical applications, like surveillance and access control.

### Image Compression Effects on Face Recognition for Images with Reduction in Size

Image Compression Effects on Face Recognition for Images with Reduction in Size Padmaja.V.K Jawaharlal Nehru Technological University, Anantapur Giri Prasad, PhD. B. Chandrasekhar, PhD. ABSTRACT In this

### CHAPTER 5 SENDER AUTHENTICATION USING FACE BIOMETRICS

74 CHAPTER 5 SENDER AUTHENTICATION USING FACE BIOMETRICS 5.1 INTRODUCTION Face recognition has become very popular in recent years, and is used in many biometric-based security systems. Face recognition

### Computer Vision Based Employee Activities Analysis

Volume 03 Issue 05, September 2014 Computer Vision Based Employee Activities Analysis Md. Zahangir Alom, Nabil Tahmidul Karim, Shovon Paulinus Rozario *, Md. Rezwanul Hoque, Md. Rumman Bin Ashraf, Saikat

### Principal Component Analysis Application to images

Principal Component Analysis Application to images Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception http://cmp.felk.cvut.cz/

### EE 368 Project: Face Detection in Color Images

EE 368 Project: Face Detection in Color Images Wenmiao Lu and Shaohua Sun Department of Electrical Engineering Stanford University May 26, 2003 Abstract We present in this report an approach to automatic

### The Implementation of Face Security for Authentication Implemented on Mobile Phone

The Implementation of Face Security for Authentication Implemented on Mobile Phone Emir Kremić *, Abdulhamit Subaşi * * Faculty of Engineering and Information Technology, International Burch University,

### Automatic Facial Occlusion Detection and Removal

Automatic Facial Occlusion Detection and Removal Naeem Ashfaq Chaudhry October 18, 2012 Master s Thesis in Computing Science, 30 credits Supervisor at CS-UmU: Niclas Börlin Examiner: Frank Drewes Umeå

### Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com

### HUMAN FACE DETECTION AND RECOGNITION

HUMAN FACE DETECTION AND RECOGNITION A THESIS SUBMITTED IN PARALLEL FULFULMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor in Technology In Electronics and Communication Engineering by K Krishan Kumar

### November 28 th, Carlos Guestrin. Lower dimensional projections

PCA Machine Learning 070/578 Carlos Guestrin Carnegie Mellon University November 28 th, 2007 Lower dimensional projections Rather than picking a subset of the features, we can new features that are combinations

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### Face Recognition Based on PCA Algorithm Using Simulink in Matlab

Face Recognition Based on PCA Algorithm Using Simulink in Matlab Dinesh Kumar 1, Rajni 2. 1 Mtech scholar department of ECE DCRUST Murthal Sonipat Haryana, 2 Assistant Prof. Department of ECE DCRUST Murthal

### PCA to Eigenfaces. CS 510 Lecture #16 March 23 th A 9 dimensional PCA example

PCA to Eigenfaces CS 510 Lecture #16 March 23 th 2015 A 9 dimensional PCA example is dark around the edges and bright in the middle. is light with dark vertical bars. is light with dark horizontal bars.

### Face Detection Using Color Thresholding, and Eigenimage Template Matching Diedrick Marius, Sumita Pennathur, and Klint Rose

Face Detection Using Color Thresholding, and Eigenimage Template Matching Diedrick Marius, Sumita Pennathur, and Klint Rose 1. Introduction The goal of this project is to take a color digital image with

### Orthogonal Diagonalization of Symmetric Matrices

MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

### Component Ordering in Independent Component Analysis Based on Data Power

Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals

### Principal components analysis

CS229 Lecture notes Andrew Ng Part XI Principal components analysis In our discussion of factor analysis, we gave a way to model data x R n as approximately lying in some k-dimension subspace, where k

### Feature Extraction and Selection. More Info == Better Performance? Curse of Dimensionality. Feature Space. High-Dimensional Spaces

More Info == Better Performance? Feature Extraction and Selection APR Course, Delft, The Netherlands Marco Loog Feature Space Curse of Dimensionality A p-dimensional space, in which each dimension is a

### Data Clustering. Dec 2nd, 2013 Kyrylo Bessonov

Data Clustering Dec 2nd, 2013 Kyrylo Bessonov Talk outline Introduction to clustering Types of clustering Supervised Unsupervised Similarity measures Main clustering algorithms k-means Hierarchical Main

### SYMMETRIC EIGENFACES MILI I. SHAH

SYMMETRIC EIGENFACES MILI I. SHAH Abstract. Over the years, mathematicians and computer scientists have produced an extensive body of work in the area of facial analysis. Several facial analysis algorithms

### Supervised Feature Selection & Unsupervised Dimensionality Reduction

Supervised Feature Selection & Unsupervised Dimensionality Reduction Feature Subset Selection Supervised: class labels are given Select a subset of the problem features Why? Redundant features much or

### A secure face tracking system

International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 10 (2014), pp. 959-964 International Research Publications House http://www. irphouse.com A secure face tracking

### Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data

CMPE 59H Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data Term Project Report Fatma Güney, Kübra Kalkan 1/15/2013 Keywords: Non-linear

### Mood Detection: Implementing a facial expression recognition system

Mood Detection: Implementing a facial expression recognition system Neeraj Agrawal, Rob Cosgriff and Ritvik Mudur 1. Introduction Facial expressions play a significant role in human dialogue. As a result,

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Subspace Analysis and Optimization for AAM Based Face Alignment

Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China zhaoming1999@zju.edu.cn Stan Z. Li Microsoft

### An Application of Linear Algebra to Image Compression

An Application of Linear Algebra to Image Compression Paul Dostert July 2, 2009 1 / 16 Image Compression There are hundreds of ways to compress images. Some basic ways use singular value decomposition

### Automatic Pixel Selection for Optimizing Facial Expression Recognition using Eigenfaces

Automatic Pixel Selection for Optimizing Facial Expression Recognition using Eigenfaces Lehrstuhl für Mustererkennung, Universität Erlangen-Nürnberg, Martensstraße 3, 91058 Erlangen, Germany, {frank,noeth}@informatik.uni-erlangen.de

### Review: Vector space

Math 2F Linear Algebra Lecture 13 1 Basis and dimensions Slide 1 Review: Subspace of a vector space. (Sec. 4.1) Linear combinations, l.d., l.i. vectors. (Sec. 4.3) Dimension and Base of a vector space.

### Facial Feature Extraction and Principal Component Analysis for Face Detection in Color Images

Facial Feature Extraction and Principal Component Analysis for Face Detection in Color Images Abstract. A hybrid technique based on facial feature extraction and Principal Component Analysis (PCA) is presented

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### Mathematical Model Based Total Security System with Qualitative and Quantitative Data of Human

Int Jr of Mathematics Sciences & Applications Vol3, No1, January-June 2013 Copyright Mind Reader Publications ISSN No: 2230-9888 wwwjournalshubcom Mathematical Model Based Total Security System with Qualitative

### Efficient Attendance Management: A Face Recognition Approach

Efficient Attendance Management: A Face Recognition Approach Badal J. Deshmukh, Sudhir M. Kharad Abstract Taking student attendance in a classroom has always been a tedious task faultfinders. It is completely

### CSE 494 CSE/CBS 598 (Fall 2007): Numerical Linear Algebra for Data Exploration Clustering Instructor: Jieping Ye

CSE 494 CSE/CBS 598 Fall 2007: Numerical Linear Algebra for Data Exploration Clustering Instructor: Jieping Ye 1 Introduction One important method for data compression and classification is to organize

### Introduction to Matrix Algebra

Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

### MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

### Chapter 6. Orthogonality

6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

### Fibonacci Numbers Modulo p

Fibonacci Numbers Modulo p Brian Lawrence April 14, 2014 Abstract The Fibonacci numbers are ubiquitous in nature and a basic object of study in number theory. A fundamental question about the Fibonacci

### BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES

BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 123 CHAPTER 7 BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 7.1 Introduction Even though using SVM presents

### Polygonal Approximation of Closed Curves across Multiple Views

Polygonal Approximation of Closed Curves across Multiple Views M. Pawan Kumar Saurabh Goyal C. V. Jawahar P. J. Narayanan Centre for Visual Information Technology International Institute of Information

### ( ) which must be a vector

MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

### These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

### ME128 Computer-Aided Mechanical Design Course Notes Introduction to Design Optimization

ME128 Computer-ided Mechanical Design Course Notes Introduction to Design Optimization 2. OPTIMIZTION Design optimization is rooted as a basic problem for design engineers. It is, of course, a rare situation

### The Classical Linear Regression Model

The Classical Linear Regression Model 1 September 2004 A. A brief review of some basic concepts associated with vector random variables Let y denote an n x l vector of random variables, i.e., y = (y 1,

### Feature Extraction by Neural Network Nonlinear Mapping for Pattern Classification

Lerner et al.:feature Extraction by NN Nonlinear Mapping 1 Feature Extraction by Neural Network Nonlinear Mapping for Pattern Classification B. Lerner, H. Guterman, M. Aladjem, and I. Dinstein Department

### Review Jeopardy. Blue vs. Orange. Review Jeopardy

Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round \$200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?

### Non-negative Matrix Factorization (NMF) in Semi-supervised Learning Reducing Dimension and Maintaining Meaning

Non-negative Matrix Factorization (NMF) in Semi-supervised Learning Reducing Dimension and Maintaining Meaning SAMSI 10 May 2013 Outline Introduction to NMF Applications Motivations NMF as a middle step

### Quick Reference Guide to Linear Algebra in Quantum Mechanics

Quick Reference Guide to Linear Algebra in Quantum Mechanics Scott N. Walck September 2, 2014 Contents 1 Complex Numbers 2 1.1 Introduction............................ 2 1.2 Real Numbers...........................

### 7 - Linear Transformations

7 - Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure

### Dimensionality Reduction: Principal Components Analysis

Dimensionality Reduction: Principal Components Analysis In data mining one often encounters situations where there are a large number of variables in the database. In such situations it is very likely

### Bayesian Classification

CS 650: Computer Vision Bryan S. Morse BYU Computer Science Statistical Basis Training: Class-Conditional Probabilities Suppose that we measure features for a large training set taken from class ω i. Each

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

### Cheng Soon Ong & Christfried Webers. Canberra February June 2016

c Cheng Soon Ong & Christfried Webers Research Group and College of Engineering and Computer Science Canberra February June (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 31 c Part I

### LABELING IN VIDEO DATABASES. School of Electrical and Computer Engineering. 1285 Electrical Engineering Building. in the video database.

FACE DETECTION FOR PSEUDO-SEMANTIC LABELING IN VIDEO DATABASES Alberto Albiol Departamento de Comunicaciones Universidad Politçecnica de Valencia Valencia, Spain email: alalbiol@dcom.upv.es Charles A.

### A Introduction to Matrix Algebra and Principal Components Analysis

A Introduction to Matrix Algebra and Principal Components Analysis Multivariate Methods in Education ERSH 8350 Lecture #2 August 24, 2011 ERSH 8350: Lecture 2 Today s Class An introduction to matrix algebra

### Markov chains and Markov Random Fields (MRFs)

Markov chains and Markov Random Fields (MRFs) 1 Why Markov Models We discuss Markov models now. This is the simplest statistical model in which we don t assume that all variables are independent; we assume

### A Survey on Outlier Detection Techniques for Credit Card Fraud Detection

IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. VI (Mar-Apr. 2014), PP 44-48 A Survey on Outlier Detection Techniques for Credit Card Fraud

### T-61.3050 : Email Classification as Spam or Ham using Naive Bayes Classifier. Santosh Tirunagari : 245577

T-61.3050 : Email Classification as Spam or Ham using Naive Bayes Classifier Santosh Tirunagari : 245577 January 20, 2011 Abstract This term project gives a solution how to classify an email as spam or

### Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree of PhD of Engineering in Informatics

INTERNATIONAL BLACK SEA UNIVERSITY COMPUTER TECHNOLOGIES AND ENGINEERING FACULTY ELABORATION OF AN ALGORITHM OF DETECTING TESTS DIMENSIONALITY Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree

### Math 215 Exam #1 Practice Problem Solutions

Math 5 Exam # Practice Problem Solutions For each of the following statements, say whether it is true or false If the statement is true, prove it If false, give a counterexample (a) If A is a matrix such

### APPM4720/5720: Fast algorithms for big data. Gunnar Martinsson The University of Colorado at Boulder

APPM4720/5720: Fast algorithms for big data Gunnar Martinsson The University of Colorado at Boulder Course objectives: The purpose of this course is to teach efficient algorithms for processing very large

### Optimizing Eigenfaces by Face Masks for Facial Expression Recognition

C. Frank and E. Nöth, CAIP 2003, Springer-Verlag, (pp. 646 654). Optimizing Eigenfaces by Face Masks for Facial Expression Recognition Lehrstuhl für Mustererkennung, Universität Erlangen-Nürnberg, Martensstraße

### ADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB. Sohail A. Dianat. Rochester Institute of Technology, New York, U.S.A. Eli S.

ADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB Sohail A. Dianat Rochester Institute of Technology, New York, U.S.A. Eli S. Saber Rochester Institute of Technology, New York, U.S.A. (g) CRC Press Taylor

### Additional Topics in Linear Algebra Supplementary Material for Math 540. Joseph H. Silverman

Additional Topics in Linear Algebra Supplementary Material for Math 540 Joseph H Silverman E-mail address: jhs@mathbrownedu Mathematics Department, Box 1917 Brown University, Providence, RI 02912 USA Contents

### 1111: Linear Algebra I

1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 3 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 3 1 / 12 Vector product and volumes Theorem. For three 3D vectors u, v, and w,

### Machine Learning and Pattern Recognition Logistic Regression

Machine Learning and Pattern Recognition Logistic Regression Course Lecturer:Amos J Storkey Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh Crichton Street,

### Introduction to General and Generalized Linear Models

Introduction to General and Generalized Linear Models General Linear Models - part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby

### Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

### ORF 523 Lecture 8 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 8, 2016

ORF 523 Lecture 8 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 8, 2016 When in doubt on the accuracy of these notes, please cross check with the instructor s

### Principal Components. Sample StatFolio: pca.sgp

Principal Components Summary The Principal Components procedure is designed to extract k principal components from a set of p quantitative variables X. The principal components are defined as the set of

### 4.9 Markov matrices. DEFINITION 4.3 A real n n matrix A = [a ij ] is called a Markov matrix, or row stochastic matrix if. (i) a ij 0 for 1 i, j n;

49 Markov matrices DEFINITION 43 A real n n matrix A = [a ij ] is called a Markov matrix, or row stochastic matrix if (i) a ij 0 for 1 i, j n; (ii) a ij = 1 for 1 i n Remark: (ii) is equivalent to AJ n

### Lecture 9: Continuous

CSC2515 Fall 2007 Introduction to Machine Learning Lecture 9: Continuous Latent Variable Models 1 Example: continuous underlying variables What are the intrinsic latent dimensions in these two datasets?

### Access control: adaptation and real time implantation of a face recognition method.

Access control: adaptation and real time implantation of a face recognition method. J. Mitéran, J.P. Zimmer, F. Yang, M. Paindavoine. Laboratory Le2i, University of Burgundy, Aile des Sciences de l'ingénieur,

### 3.4. Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes

Solving Simultaneous Linear Equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.

### AUTOMATIC THEFT SECURITY SYSTEM (SMART SURVEILLANCE CAMERA)

AUTOMATIC THEFT SECURITY SYSTEM (SMART SURVEILLANCE CAMERA) Veena G.S 1, Chandrika Prasad 2 and Khaleel K 3 Department of Computer Science and Engineering, M.S.R.I.T,Bangalore, Karnataka veenags@msrit.edu

### Tensor Methods for Machine Learning, Computer Vision, and Computer Graphics

Tensor Methods for Machine Learning, Computer Vision, and Computer Graphics Part I: Factorizations and Statistical Modeling/Inference Amnon Shashua School of Computer Science & Eng. The Hebrew University

### Text Analytics (Text Mining)

CSE 6242 / CX 4242 Apr 3, 2014 Text Analytics (Text Mining) LSI (uses SVD), Visualization Duen Horng (Polo) Chau Georgia Tech Some lectures are partly based on materials by Professors Guy Lebanon, Jeffrey

### Nonlinear Iterative Partial Least Squares Method

Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for

### Preliminaries of linear algebra

Preliminaries of linear algebra (for the Automatic Control course) Matteo Rubagotti March 3, 2011 This note sums up the preliminary definitions and concepts of linear algebra needed for the resolution

### Block designs/1. 1 Background

Block designs 1 Background In a typical experiment, we have a set Ω of experimental units or plots, and (after some preparation) we make a measurement on each plot (for example, the yield of the plot).

### 1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

### 3.4. Solving simultaneous linear equations. Introduction. Prerequisites. Learning Outcomes

Solving simultaneous linear equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.

### THEORY OF SIMPLEX METHOD

Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize

### Index Terms: Face Recognition, Face Detection, Monitoring, Attendance System, and System Access Control.

Modern Technique Of Lecture Attendance Using Face Recognition. Shreya Nallawar, Neha Giri, Neeraj Deshbhratar, Shamal Sane, Trupti Gautre, Avinash Bansod Bapurao Deshmukh College Of Engineering, Sewagram,

### A Spectral Clustering Approach to Validating Sensors via Their Peers in Distributed Sensor Networks

A Spectral Clustering Approach to Validating Sensors via Their Peers in Distributed Sensor Networks H. T. Kung Dario Vlah {htk, dario}@eecs.harvard.edu Harvard School of Engineering and Applied Sciences

### Solution based on matrix technique Rewrite. ) = 8x 2 1 4x 1x 2 + 5x x1 2x 2 2x 1 + 5x 2

8.2 Quadratic Forms Example 1 Consider the function q(x 1, x 2 ) = 8x 2 1 4x 1x 2 + 5x 2 2 Determine whether q(0, 0) is the global minimum. Solution based on matrix technique Rewrite q( x1 x 2 = x1 ) =

### Optimizing Eigenfaces by Face Masks for Facial Expression Recognition

Optimizing Eigenfaces by Face Masks for Facial Expression Recognition Lehrstuhl für Mustererkennung, Universität Erlangen-Nürnberg, Martensstraße 3, 91058 Erlangen, Germany, frank@informatik.uni-erlangen.de,noeth@informatik.uni-erlangen.de,

### A Comparison of Photometric Normalisation Algorithms for Face Verification

A Comparison of Photometric Normalisation Algorithms for Face Verification James Short, Josef Kittler and Kieron Messer Centre for Vision, Speech and Signal Processing University of Surrey Guildford, Surrey,

### Linear Model Selection and Regularization

Linear Model Selection and Regularization Recall the linear model Y = β 0 + β 1 X 1 + + β p X p + ɛ. In the lectures that follow, we consider some approaches for extending the linear model framework. In