Computer Science Technical Report

Similar documents
Recognizing Faces. Outline

Feature Reduction and Selection

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

Classifier Selection Based on Data Complexity Measures *

Machine Learning: Algorithms and Applications

Support Vector Machines

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Optimizing Document Scoring for Query Retrieval

Modular PCA Face Recognition Based on Weighted Average

Classifying Acoustic Transient Signals Using Artificial Intelligence

Collaboratively Regularized Nearest Points for Set Based Recognition

Announcements. Supervised Learning

UB at GeoCLEF Department of Geography Abstract

Appearance-based Statistical Methods for Face Recognition

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Mathematics 256 a course in differential equations for engineering students

A Binarization Algorithm specialized on Document Images and Photos

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Lecture 4: Principal components

TN348: Openlab Module - Colocalization

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Cluster Analysis of Electrical Behavior

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Lecture #15 Lecture Notes

Multi-stable Perception. Necker Cube

Competitive Sparse Representation Classification for Face Recognition

Problem Set 3 Solutions

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

X- Chart Using ANOM Approach

3D vector computer graphics

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

PCA Based Gait Segmentation

y and the total sum of

Detection of an Object by using Principal Component Analysis

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Wishing you all a Total Quality New Year!

Unsupervised Learning and Clustering

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Image Alignment CSC 767

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Two-Dimensional Supervised Discriminant Projection Method For Feature Extraction

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Programming in Fortran 90 : 2017/2018

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

General Regression and Representation Model for Face Recognition

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

Structure from Motion

Human Face Recognition Using Generalized. Kernel Fisher Discriminant

Online Detection and Classification of Moving Objects Using Progressively Improving Detectors

Brave New World Pseudocode Reference

Lecture 5: Multilayer Perceptrons

Pictures at an Exhibition

An Image Fusion Approach Based on Segmentation Region

Machine Learning 9. week

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

LEAST SQUARES. RANSAC. HOUGH TRANSFORM.

Three supervised learning methods on pen digits character recognition dataset

INF Repetition Anne Solberg INF

Parallel matrix-vector multiplication

Classification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

RECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE

Face Detection with Deep Learning

Orthogonal Complement Component Analysis for Positive Samples in SVM Based Relevance Feedback Image Retrieval

Correlative features for the classification of textural images

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

CS 534: Computer Vision Model Fitting

User Authentication Based On Behavioral Mouse Dynamics Biometrics

Related-Mode Attacks on CTR Encryption Mode

Improving Web Image Search using Meta Re-rankers

High Dimensional Data Clustering

USING GRAPHING SKILLS

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

Performance Evaluation of Information Retrieval Systems

Graph-based Clustering

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

S1 Note. Basis functions.

Face Recognition Based on SVM and 2DPCA

Integrated Expression-Invariant Face Recognition with Constrained Optical Flow

Optimal Workload-based Weighted Wavelet Synopses

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Support Vector Machines

Robust Face Recognition Using Eigen Faces and Karhunen-Loeve Algorithm

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

An efficient method to build panoramic image mosaics

AP PHYSICS B 2008 SCORING GUIDELINES

Edge Detection in Noisy Images Using the Support Vector Machines

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Biostatistics 615/815

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Reducing Frame Rate for Object Tracking

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE

Transcription:

Computer Scence echncal Report NLYSIS OF PCSED ND FISHER DISCRIMINNSED IMGE RECOGNIION LGORIHMS Wendy S. Yambor July echncal Report CS3 Computer Scence Department Colorado State Unversty Fort Collns, CO 853873 Phone: (97) 49579 Fa: (97) 49466 WWW: http://www.cs.colostate.edu

HESIS NLYSIS OF PCSED ND FISHER DISCRIMINNSED IMGE RECOGNIION LGORIHMS Submtted by Wendy S. Yambor Department of Computer Scence In Partal Fulfllment of the Requrements For the Degree of Master of Scence Colorado State Unversty Fort Collns, Colorado Summer

COLORDO SE UNIVERSIY July 6, WE HEREY RECOMMEND H HE HESIS PREPRED UNDER OUR SUPERVISION Y WENDY S. YMOR ENILED NLYSIS OF PCSED ND FISHER DISCRIMINNSED IMGE RECOGNIION LGORIHMS E CCEPED S FULFILLING IN PR REQUIREMENS FOR HE DEGREE OF MSER OF SCIENCE. Commttee on Graduate Work dvsor Codvsor Department Head

SRC OF HESIS NLYSIS OF PCSED ND FISHER DISCRIMINNSED IMGE RECOGNIION LGORIHMS One method of dentfyng mages s to measure the smlarty between mages. hs s accomplshed by usng measures such as the L norm, L norm, covarance, Mahalanobs dstance, and correlaton. hese smlarty measures can be calculated on the mages n ther orgnal space or on the mages projected nto a new space. I dscuss two alternatve spaces n whch these smlarty measures may be calculated, the subspace created by the egenvectors of the covarance matr of the tranng data and the subspace created by the Fsher bass vectors of the data. Varatons of these spaces wll be dscussed as well as the behavor of smlarty measures wthn these spaces. Eperments are presented comparng recognton rates for dfferent smlarty measures and spaces usng hand labeled magery from two domans: human face recognton and classfyng an mage as a cat or a dog. Wendy S. Yambor Computer Scence Department Colorado State Unversty Fort Collns, CO 853 Summer

cknowledgments I thank my commttee, Ross everdge, ruce Draper, Mcheal Krby, and dele Howe, for ther support and knowledge over the past two years. Every member of my commttee has been nvolved n some aspect of ths thess. It s through ther nterest and persuason that I ganed knowledge n ths feld. I thank Jonathon Phllps for provdng me wth the results and mages from the FERE evaluaton. Furthermore, I thank Jonathon for patently answerng numerous questons. v

able of Contents. Introducton. Prevous Work.. General lgorthm....3 Why Study hese Subspaces?. 3.4 Organzaton of Followng Sectons 4. Egenspace Projecton 5. Recognzng Images Usng Egenspace, utoral on Orgnal Method... 6. utoral for Snapshot Method of Egenspace Projecton.....3 Varatons. 4 3. Fsher Dscrmnants 5 3. Fsher Dscrmnants utoral (Orgnal Method).... 5 3. Fsher Dscrmnants utoral (Orthonormal ass Method)... 4. Varatons 9 4. Egenvector Selecton.. 9 4. Orderng Egenvectors by LkeImage Dfference.. 3 4.3 Smlarty & Dstance Measures.. 3 4.4 re smlarty measures the same nsde and outsde of egenspace?. 35 5. Eperments 43 5. Datasets 43 5.. he Cat & Dog Dataset 43 5.. he FERE Dataset. 44 5..3 he Restructured FERE Dataset 45 5. aggng and Combnng Smlarty Measures. 45 5.. ddng Dstance Measures... 46 5.. Dstance Measure ggregaton 48 5..3 Correlatng Dstance Metrcs 49 5.3 LkeImage Dfference on the FERE dataset.... 5 5.4 Cat & Dog Eperments... 54 5.5 FERE Eperments. 56 6. Concluson. 6 6. Eperment Summary..... 6 6. Future Work.. 66 ppend I 68 References 69 v

. Introducton wo mage recognton systems are eamned, egenspace projecton and Fsher dscrmnants. Each of these systems eamnes mages n a subspace. he egenvectors of the covarance matr of the tranng data create the egenspace. he bass vectors calculated by Fsher dscrmnants create the Fsher dscrmnants subspace. Varatons of these subspaces are eamned. he frst varaton s the selecton of vectors used to create the subspaces. he second varaton s the measurement used to calculate the dfference between mages projected nto these subspaces. Eperments are performed to test hypotheses regardng the relatve performance of subspace and dfference measures. Nether egenspace projecton nor Fsher dscrmnants are new deas. oth have been eamned by researches for many years. It s the work of these researches that has helped to revolutonze mage recognton and brng face recognton to the pont where t s now usable n ndustry.. Prevous Work Projectng mages nto egenspace s a standard procedure for many appearancebased object recognton algorthms. basc eplanaton of egenspace projecton s provded by []. Mchael Krby was the frst to ntroduce the dea of the lowdmensonal characterzaton of faces. Eamples of hs use of egenspace projecton can be found n [7,8,6]. urk & Pentland worked wth egenspace projecton for face recognton [].

More recently Shree Nayar used egenspace projecton to dentfy objects usng a turntable to vew objects at dfferent angles as eplaned n []. R.. Fsher developed Fsher s lnear dscrmnant n the 93 s [5]. Not untl recently have Fsher dscrmnants been utlzed for object recognton. n eplanaton of Fsher dscrmnants can be found n [4]. Swets and Weng used Fsher dscrmnants to cluster mages for the purpose of dentfcaton n 996 [8,9,3]. elhumeur, Hespanha, and Kregman also used Fsher dscrmnants to dentfy faces, by tranng and testng wth several faces under dfferent lghtng [].. General lgorthm n mage may be vewed as a vector of pels where the value of each entry n the vector s the grayscale value of the correspondng pel. For eample, an 88 mage may be unwrapped and treated as a vector of length 64. he mage s sad to st n Ndmensonal space, where N s the number of pels (and the length of the vector). hs vector representaton of the mage s consdered to be the orgnal space of the mage. he orgnal space of an mage s just one of nfntely many spaces n whch the mage can be eamned. wo specfc subspaces are the subspace created by the egenvectors of the covarance matr of the tranng data and the bass vectors calculated by Fsher dscrmnants. he majorty of subspaces, ncludng egenspace, do not optmze dscrmnaton characterstcs. Egenspace optmzes varance among the mages. he

ecepton to ths statement s Fsher dscrmnants, whch does optmze dscrmnaton characterstcs. lthough some of the detals may vary, there s a basc algorthm for dentfyng mages by projectng them nto a subspace. Frst one selects a subspace on whch to project the mages. Once ths subspace s selected, all tranng mages are projected nto ths subspace. Net each test mage s projected nto ths subspace. Each test mage s compared to all the tranng mages by a smlarty or dstance measure, the tranng mage found to be most smlar or closest to the test mage s used to dentfy the test mage..3 Why Study hese Subspaces? Projectng mages nto subspaces has been studed for many years as dscussed n the prevous work secton. he research nto these subspaces has helped to revolutonze mage recognton algorthms, specfcally face recognton. When studyng these subspaces an nterestng queston arses: under what condtons does projectng an mage nto a subspace mprove performance. he answer to ths queston s not an easy one. What specfc subspace (f any at all) mproves performance depends on the specfc problem. Furthermore, varatons wthn the subspace also effect performance. For eample, the selecton of vectors to create the subspace and measures to decde whch mages are a closest match, both effect performance. 3

.4 Organzaton of Followng Sectons I dscuss two alternatve spaces commonly used to dentfy mages. In chapter, I dscuss egenspaces. Egenspace projecton, also know as KarhunenLoeve (KL) and Prncpal Component nalyss (PC), projects mages nto a subspace such that the frst orthogonal dmenson of ths subspace captures the greatest amount of varance among the mages and the last dmenson of ths subspace captures the least amount of varance among the mages. wo methods of creatng an egenspace are eamned, the orgnal method and a method desgned for hghresoluton mages know as the snapshot method. In chapter 3, Fsher dscrmnants s dscussed. Fsher dscrmnants project mages such that mages of the same class are close to each other whle mages of dfferent classes are far apart. wo methods of calculatng Fsher dscrmnants are eamned. One method s the orgnal method and the other method frst projects the mages nto an orthonormal bass defnng a subspace spanned by the tranng set. Once mages are projected nto one of these spaces, a smlarty measure s used to decde whch mages are closest matches. Chapter 4 dscusses varatons of these two methods, such as methods of selectng specfc egenvectors to create the subspace and smlarty measures. In chapter 5, I dscuss eperments performed on both these methods on two datasets. he frst dataset s the Cat & Dog dataset, whch was developed at Colorado State Unversty. he second dataset s the FERE dataset, whch was made avalable to me by Jonathan Phllps at the Natonal Insttute of Standard and echnology [,,3]. 4

. Egenspace Projecton Egenspace s calculated by dentfyng the egenvectors of the covarance matr derved from a set of tranng mages. he egenvectors correspondng to nonzero egenvalues of the covarance matr form an orthonormal bass that rotates and/or reflects the mages n the Ndmensonal space. Specfcally, each mage s stored n a vector of sze N. [ ]... () he mages are mean centered by subtractng the mean mage from each mage vector. N P m, where m P () hese vectors are combned, sdebysde, to create a data matr of sze NP (where P s the number of mages). P [... ] X (3) he data matr X s multpled by ts transpose to calculate the covarance matr. Ω XX (4) hs covarance matr has up to P egenvectors assocated wth nonzero egenvalues, assumng P<N. he egenvectors are sorted, hgh to low, accordng to ther assocated egenvalues. he egenvector assocated wth the largest egenvalue s the egenvector he bar notaton here s slghtly nonstandard, but s ntended to suggest the relatonshp to the mean. complete glossary of symbols appears n ppend I. 5

that fnds the greatest varance n the mages. he egenvector assocated wth the second largest egenvalue s the egenvector that fnds the second most varance n the mages. hs trend contnues untl the smallest egenvalue s assocated wth the egenvector that fnds the least varance n the mages.. Recognzng Images Usng Egenspace, utoral on Orgnal Method Identfyng mages through egenspace projecton takes three basc steps. Frst the egenspace must be created usng tranng mages. Net, the tranng mages are projected nto the egenspace. Fnally, the test mages are dentfed by projectng them nto the egenspace and comparng them to the projected tranng mages.. Create Egenspace he followng steps create an egenspace.. Center data: Each of the tranng mages must be centered. Subtractng the mean mage from each of the tranng mages centers the tranng mages as shown n equaton (). he mean mage s a column vector such that each entry s the mean of all correspondng pels of the tranng mages.. Create data matr: Once the tranng mages are centered, they are combned nto a data matr of sze NP, where P s the number of tranng mages and each column s a sngle mage as shown n equaton (3). 3. Create covarance matr: he data matr s multpled by ts transpose to create a covarance matr as shown n equaton (4). 6

4. Compute the egenvalues and egenvectors: he egenvalues and correspondng egenvectors are computed for the covarance matr. Ω V ΛV (5) here V s the set of egenvectors assocated wth the egenvalues Λ. 5. Order egenvectors: Order the egenvectors v V accordng to ther correspondng egenvalues λ Λ from hgh to low. Keep only the egenvectors assocated wth nonzero egenvalues. hs matr of egenvectors s the egenspace V, where each column of V s an egenvector.. Project tranng mages [ v v... ] V (6) Each of the centered tranng mages ( ) s projected nto the egenspace. o project an mage nto the egenspace, calculate the dot product of the mage wth each of the ordered egenvectors. v P ~ V (7) herefore, the dot product of the mage and the frst egenvector wll be the frst value n the new vector. he new vector of the projected mage wll contan as many values as egenvectors. 3. Identfy test mages Each test mage s frst mean centered by subtractng the mean mage, and s then projected nto the same egenspace defned by V. y p y m, where m P (8) and 7

~ y V y (9) he projected test mage s compared to every projected tranng mage and the tranng mage that s found to be closest to the test mage s used to dentfy the tranng mage. he mages can be compared usng any number of smlarty measures; the most common s the L norm. I wll dscuss the dfferent smlarty measures n secton 4.3. he followng s an eample of dentfyng mages through egenspace projecton. Let the four mages n Fgure be tranng mages and let the addtonal mage n Fgure be a test mage. he four tranng mages and the mean mage are: 5 9 48 5 33 38 55 7 9 4 55 8 47 7 55 3 96 35 34 3 59 44 43 57 6 4 55 3 4 55 55 49 55 35 7.5 76.5 35.5 48.5 m 7.5 46. 7.5 5.5 7. he centered mages are: 53.5 5.5 84.5.75 5.5 8. 7.5 49.5 47. 6.5 4.5 8.5 6.75 9.5..5 49.5 68. 3 4.5 4.5.5 6.5 3.5. 5.75 48.5 56. 4 83.5 46.5 9.5 6.75 7.5 9..75 9.49.5 65. 8

Fgure. Four tranng mages and one test mage. Combne all the centered tranng mages nto one data matr: 53.5 5.5 84.5.75 Χ 5.5 8. 7.5 49.5 47. 6.5 4.5 8.5 6.75 9.5..5 49.5 68. 4.5 4.5.5 6.5 3.5. 5.75 48.5 56. 83.5 46.5 9.5 6.75 7.5 9..75 49.5 65. Calculate the covarance matr: Ω ΧΧ 3657 3639 39 778 34 3 4 485 36446 3639 6747 955 345 585 34 83 87 9574 39 955 37587 996 47 88 4563 97 5888 778 345 997 363 747 78 53 38 476 34 585 47 746.5 869 364 645.5 637 83 3 34 88 78 364 5 77 396 7 4 83 4563 53 645 77 56569 99 6937 485 87 97 37 637 396 99 943 88 36446 9574 5888 476 83 7 6937 88 37794 he ordered nonzero egenvectors of the covarance matr and the correspondng egenvalues are: 9

v.356.79.48.3.35.9.56.96.4 v.55.489.44.48.5.4..49.43 v 3.64.347.39.64..78.585.4.39 λ 535 λ 5696 λ 3 78 he egenspace s defned by the projecton matr V.356.79.48.3.35.9.56.96.4.55.489.44.48.5.4..49.43.64.347.39.64..78.585.4.39 he four centered tranng mages projected nto egenspace are: ~ V 3.9 7.3 96.57 ~ V 65.9 98.9 47.45 ~ 3 3 V 9.76 5.9 46.4 ~ 4 4 V 39.4 6.88 95.6 he test mage vewed as a vector and the centered test mage are:

y 44 44 46 44 4 55 y 5.5 67.5 88.5.5 6.5 3.5 49.5 68 he projected test mage s: ~ y V y 66.65 8.75 5.6 he L norms are 96, 8, 58 and 449 of the test mage, 3 and y and the tranng mages 4 respectvely. y comparng the L norms, the second tranng mage s found to be closest to the test mage y, therefore the test mage belongng to the same class of mages as the second tranng mage orgnal mages, one sees mage y s most lke. y s dentfed as,. y vewng the. utoral for Snapshot Method of Egenspace Projecton he method outlned above can lead to etremely large covarance matrces. For eample, mages of sze 6464 combne to create a data matr of sze 496P and a covarance matr of sze 496496. hs s a problem because calculatng the covarance matr and the egenvectors/egenvalues of the covarance s computatonally demandng. It s known that for a NM matr the mamum number of nonzero egenvectors the matr can have s mn(n,m) [6,7,]. Snce the number of tranng

mages ( P ) s usually less than the number of pels ( N ), the most egenvectors/egenvalues that can be found are P. common theorem n lnear algebra states that the egenvalues of X X and X X are the same. Furthermore, the egenvectors of X X are the same as the egenvectors of X X multpled by the matr X and normalzed [6,7,]. Usng ths theorem, the Snapshot method can be used to create the egenspace from a PP matr rather than a NN covarance matr. he followng steps should be followed.. Center data: (Same as orgnal method). Create data matr: (Same as orgnal method) 3. Create covarance matr: he data matr s transpose s multpled by the data matr to create a covarance matr. Ω X X () 4. Compute the egenvalues and egenvectors of O : he egenvalues and correspondng egenvectors are computed for Ω. 5. Compute the egenvectors of egenvectors. Dvde the egenvectors by ther norm. Ω V Λ V () X X V ˆ XV () : Multply the data matr by the v vˆ vˆ (3) 6. Order egenvectors: (Same as orgnal method)

he followng s the same eample as used prevously, but the egenspace s calculated usng the Snapshot method. he same tranng and test mages wll be used as shown n Fgure. he revsed covarance matr s: Ω Χ 337 3 Χ 33998 5 3 867 594 434 33998 594 777 44 55 434 44 39888 he ordered egenvectors and correspondng nonzero egenvalues of the revsed covarance matr are: v.63.679.586.355 v.5.437.559.475 v 3.64.34.36.63 λ 535 λ 5696 λ 3 78 he data matr multpled by the egenvectors are: v ˆ 39.5734 9.8 87.96.435 3.699 3.45 9.448 6.8 57.593 v ˆ 4.3 9.995 9.98.777 3.655.78 5.98.75 97.366 vˆ3 39.787 5.38 46.675 9.59 33.493.75 88.3 6.533 58.978 elow are the normalzed egenvectors. Note that they are the same egenvectors that were calculated usng the orgnal method. 3

v.356.79.48.3.35.9.56.96.4 v.55.489.44.48.5.4..49.43 v 3.64.347.39.64..78.585.4.39.3 Varatons Centerng the mages by subtractng the mean mage s one common method of modfyng the orgnal mages. nother varant s to subtract the mean of each mage from all of the pel values for that mage []. hs varaton smplfes the correlaton calculaton, snce the mages are already mean subtracted. Yet another varaton s to normalze each mage by dvdng each pel value by the norm of the mage, so that the vector has a length of one []. hs varaton smplfes the covarance calculaton to a dot product. n mage cannot be both centered and normalzed, snce these actons counteract the one another. ut an mage can be centered and mean subtracted or mean subtracted and normalzed. For all my work, I use only centered mages. 4

3. Fsher Dscrmnants Fsher dscrmnants group mages of the same class and separates mages of dfferent classes. Images are projected from Ndmensonal space (where N s the number of pels n the mage) to C dmensonal space (where C s the number of classes of mages). For eample, consder two sets of ponts n dmensonal space that are projected onto a sngle lne (Fgure a). Dependng on the drecton of the lne, the ponts can ether be med together (Fgure b) or separated (Fgure c). Fsher dscrmnants fnd the lne that best separates the ponts. o dentfy a test mage, the projected test mage s compared to each projected tranng mage, and the test mage s dentfed as the closest tranng mage. 3. Fsher Dscrmnants utoral (Orgnal Method) s wth egenspace projecton, tranng mages are projected nto a subspace. he test mages are projected nto the same subspace and dentfed usng a smlarty measure. What dffers s how the subspace s calculated. Followng are the steps to follow to fnd the Fsher dscrmnants for a set of mages.. Calculate the wthn class scatter matr: he wthn class scatter matr measures the amount of scatter between tems n the same class. For the th class, a scatter matr ( S ) s calculated as the sum of the covarance matrces of the centered mages n that class. 5

Fgure. (a) Ponts n dmensonal space. (b) Ponts med when projected onto a lne. (c) Ponts separated when projected onto a lne. where S ( m )( m ) (4) X m s the mean of the mages n the class. he wthn class scatter matr ( S W ) s the sum of all the scatter matrces. C S W S (5) where C s the number of classes.. Calculate the between class scatter matr: he between class scatter matr ( S ) measures the amount of scatter between classes. It s calculated as the sum of the covarance matrces of the dfference between the total mean and the mean of each class. C S n ( m m)( m m) (6) where n s the number of mages n the class, class and m s the mean of all the mages. m s the mean of the mages n the 6

3. Solve the generalzed egenvalue problem: Solve for the generalzed egenvectors (V ) and egenvalues ( Λ ) of the wthn class and between class scatter matrces. S V ΛS V (7) W 4. Keep frst Cl egenvectors: Sort the egenvectors by ther assocated egenvalues from hgh to low and keep the frst C egenvectors. hese egenvectors form the Fsher bass vectors. 5. Project mages onto Fsher bass vectors: Project all the orgnal (.e. not centered) mages onto the Fsher bass vectors by calculatng the dot product of the mage wth each of the Fsher bass vectors. he orgnal mages are projected onto ths lne because these are the ponts that the lne has been created to dscrmnate, not the centered mages. Followng s an eample of calculatng the Fsher dscrmnants for a set of mages. Let the twelve mages n Fgure 3 be tranng mages. here are two classes; mages 6 are n the frst class and mages 7 are n the second class. he tranng mages vewed as vectors are: 96 88 46 8 45 35 5 48 6 34 36 35 3 3 44 5 55 54 3 4 5 59 44 4 44 55 44 8 6 9 5 43 5 8 36 5 57 48 35 34 5 6 3 34 47 49 6 48 5 5 3 4 4 7 44 7

8 Fgure 3. welve tranng mages. 54 55 33 3 45 5 5 4 37 5 7 5 9 37 37 43 37 88 34 94 55 8 55 8 4 55 5 36 9 46 38 47 3 55 3 4 53 38 5 5 5 55 34 35 55 49 55 55 4 3 55 9 8 7 he scatter matrces are:.46.6.8.4.3.48.3.8.77.6.68..8.56.7.3..83.8..46.9.7.8.6.63.69.4.8.9.55.8..6.9.39.3.56.7.8.55...5.6.48.7.8...79.6.7.4.3.3.6.6..6.4.5.9.8..63.9.5.73.5.83.59.77.83.69.39.6.4.9.59 3.8 S

9.8.56.3.84..4.59.5..56.84..3.49..44.9.7.3..94.7.54...59.79.84.3.7.79.47.6.6.34.36..49.54.47.3.8.5.45.64.4...6.8.4.8.6.8.59.44..6.5.8.8.4.7.5.9.59.34.45.6.4.74.5..7.79.36.64.8.7.5.63 S he wthn class scatter matr s: + 3.8.3.85.7.3.7.36..98.3.5...7.6.4.8.66.85. 4.4.5.6.6.5..9.7..5.33..37..4.76.3.7.6..85.9.5.5.3.7.6.6.37.9.3.34.88..36.4.5..5.34.4.9.8..8..4.5.88.9.57.8.98.66.9.76.3..8.8 4.44 S S S W he mean of each class and the total mean are: 36.7 4.5 7.7 4.58 3.33 46. 3.75 35.4 8.7 34. 43..83 46.67 9.33 48.33. 44.67 34.5 38.33 4. 3.5 36.5 45.33 43.67 7.5 6.7.83 m m m

he between class scatter matr s: S.8.38.5.3.7.6.7.7.3.38.387.8.5.84..7.96.47.5.8.3...4.4.75..3.5...6..3.47..7.84..6.34.3.4.6.6.6..4..3.5.5...7.7.4.3.4.5.6.7..7.96.75.47.6..7..44.3.47...6...44. Snce there are two classes, only one egenvector s kept. he nonzero egenvector and correspondng egenvalue of S V λs V are: W v.8.5.48.59.4..8.3. λ 9.45 he values of the mages projected onto the frst egenvector are shown n able. Fgure 4 shows a plot of the ponts; clearly llustratng the separaton between the two classes. 3. Fsher Dscrmnants utoral (Orthonormal ass Method) wo problems arse when usng Fsher dscrmnants. Frst, the matrces needed for computaton are very large, causng slow computaton tme and possble problems wth

able. he values of the mages projected onto the frst egenvector. 3 4 5 6 7 8 9 Class 59 55 56 56 54 57 Class 44 43 45 4 49 4 Fgure 4. Plot of the mages projected onto Fsher bass vectors. numerc precson. Second, snce there are fewer tranng mages than pels, the data matr s rank defcent. It s possble to solve the egenvectors and egenvalues of a rank defcent matr by usng a generalze sngular value decomposton routne, but a smpler soluton ests. smpler soluton s to project the data matr of tranng mages nto an orthonormal bass of sze PP (where P s the number of tranng mages). hs projecton produces a data matr of full rank that s much smaller and therefore decreases computaton tme. he projecton also preserves nformaton so the fnal outcome of Fsher dscrmnants s not affected. Followng are the steps to follow to fnd the Fsher dscrmnants of a set of mages by frst projectng the mages nto any orthonormal bass.. Compute means: Compute the mean of the mages n each class( m )and the total mean of all mages ( m ).. Center the mages n each class: Subtract the mean of each class from the mages n that class. X, X X, ˆ m (8)

3. Center the class means: Subtract the total mean from the class means. mˆ m m (9) 4. Create a data matr: Combne the all mages, sdebysde, nto one data matr. 5. Fnd an orthonormal bass for ths data matr: hs can be accomplshed by usng a QR Orthogonaltrangular decomposton or by calculatng the full set of egenvectors of the covarance matr of the tranng data. Let the orthonormal bass be U. 6. Project all centered mages nto the orthonormal bass: Create vectors that are the dot product of the mage and the vectors n the orthonormal bass. ~ U ˆ () 7. Project the centered means nto the orthonormal bass: m ~ U mˆ () 8. Calculate the wthn class scatter matr: he wthn class scatter matr measures the amount of scatter between tems wthn the same class. For the th class a scatter matr ( S ) s calculated as the sum of the covarance matrces of the projected centered mages for that class. S ~ ~ () X he wthn class scatter matr ( S W ) s the sum of all the scatter matrces. C S W S (3) where C s the number of classes.

9. Calculate the between class scatter matr: he between class scatter matr ( S ) measures the amount scatter between classes. It s calculated as the sum of the covarance matrces of the projected centered means of the classes, weghted by the number of mages n each class. S C n m ~ m ~ (4) where n s the number of mages n the class.. Solve the generalzed egenvalue problem: Solve for the generalzed egenvectors (V ) and egenvalues ( Λ ) of the wthn class and between class scatter matrces. S V λs V (5) W. Keep the frst Cl egenvectors: Sort the egenvectors by ther assocated egenvalues from hgh to low and keep the frst C egenvectors. hese are the Fsher bass vectors.. Project mages onto egenvectors: Project all the rotated orgnal (.e. Not centered) mages onto the Fsher bass vectors. Frst project the orgnal mages nto the orthonormal bass, and then project these projected mages onto the Fsher bass vectors. he orgnal rotated mages are projected onto ths lne because these are the ponts that the lne has been created to dscrmnate, not the centered mages. he same eample as before wll be calculated usng the orthonormal bass. Let the twelve mages n Fgure 3 be tranng mages. he tranng mages vewed as vectors, the means of each class and the total mean are the same as n the prevous eample. 3

4 he centered mages are: 5.67 5. 9.5 3.5 5.33 8.33.5 4.7 6.7 ˆ.67 9. 7.5 5.5 9.67.33 4.5 5.7 3.7 ˆ 8.67 8. 3.5 7.5.33.33 7.5.7 3.83 ˆ 4.33 7. 4.5.5 5.33 8.67 5.5.83 4.7 ˆ 8.33 6. 8.5 8.5.33.33 8.5.7 33.83 ˆ.33 5..5 7.5 3.67.67 6.5 8.83 5.83 ˆ 6 5 4 3...7 4.67.67 3.33 5. 6.33.5 ˆ 3. 8. 5.7 4.33.33.33 7..67.5 ˆ 46. 9. 7.83 8.33 8.67 6.67. 3.67 9.5 ˆ 6. 7. 3.83.67 8.67.33..33.5 ˆ 6.. 6.7 4.33 9.33.67 5..33.5 ˆ.. 7.7 8.33 9.33 6.67 4..67.5 ˆ 9 8 7 he centered class means are:.7.5 5.33 5.8 3..33 3.75 9.5 6.33 ˆ.7.5 5.33 5.8 3..33 3.75 9.5 6.33 ˆ m m

5 he orthonormal bass calculated by egenspace projecton s:.4.6.7..3..77.36.7.6.46.3.8.3.67.5.5.4.3.48....6.8.7.8.4.6.55.66.7..38..9..6.33.6.4..5.39..6..5.44.55....7.46.37.5.4.3.6.6.3.3.5.3.45.9.44.39.34.9.5..4.38.6.7.3.5.8.35 U he centered mages projected nto the orthonormal bass are:.5 6. 3.35 5.54 5. 9.96 7.3 33.9.34 ~.58.6.6 5.75 6..4.89.47.6 ~.47. 3.36.87 7.86 5.99 4.7 6.4.47 ~.5 4.9 5.7.89 4.4 8.87 9.95.3 35.9 ~. 3.89.93 4.9.4 4.5 5.3 7.65 3.66 ~.4.67.56 8.46 3.3.44.5 3.39 3.7 ~ 6 5 4 3.8 5.59 8.96.6.63.33 3. 7.59 6. ~.99 4.3.44.83.4. 3.68.4.7 ~.33.3. 8.9.66.89 38.76 8.9 3.9 ~.98 4.8 4.5 4.35.6. 5.7.5 9.4 ~.77.94 4.8 4.6 6.7.7.6 3.8 6.7 ~.6 5.6 9.43 7.3 3.78.7 8.5 3.5 7.79 ~ 9 8 7

6 he centered means projected nto the orthonormal bass are: 68.88 4.3 5.6 34.87..83 33.76 5.5 7.87 ~ 68.88 4.3 5.6 34.87..83 33.76 5.5 7.87 ~ m m he wthn class scatter matr s:.4.9.47.95.7.86 3.59 5.59 6.5 S W Notce that the wthn class scatter matr s a dagonal matr and the values along the dagonal are the egenvalues assocated wth the egenvectors used to create the orthonormal bass. hs occurs because the mages are projected nto ths orthonormal bass before calculatng the wthn class scatter matr. herefore each projected mage s orthogonal to all other projected mages. he between class scatter matr s:

S...5.8.3.5.4.6....3...4.3.4.7.5.3.3.76.4.4.7.7.47.8..76.5.45.78.56.9.54.3..4.45.8.4..6.8.5.4.4.78.4.4.7.8.48.4.3.7.56..7.3..35.6.4.7.9.6.8..3.55..7.47.54.8.48.35.55.95 Snce there are two classes, only one egenvector s kept. he nonzero egenvector and correspondng egenvalue of S V λs V are: W v.7.5.5.3.63.96.83.3.996 λ 9.449 he values of the rotated mages projected onto the frst egenvector are shown n able. Fgure 5 shows a plot of the ponts; you can clearly see the separaton between the two classes. 7

able. he values of the mages projected onto the frst egenvector. 3 4 5 6 7 8 9 Class 59 55 56 56 54 57 Class 44 43 45 4 49 4 Fgure 5. Plot of the mages projected onto Fsher bass vectors. 8

4. Varatons 4. Egenvector Selecton Untl ths pont, when creatng a subspace usng egenspace projecton we use all egenvectors assocated wth nonzero egenvalues. he computaton tme of egenspace projecton s drectly proportonal to the number of egenvectors used to create the egenspace. herefore by removng some porton of the egenvectors computaton tme s decrease. Furthermore, by removng addtonal egenvectors that do not contrbute to the classfcaton of the mage, performance can be mproved. Many varatons of egenvector selecton have been consdered; I wll dscuss fve. hese may be appled ether alone or as part of Fsher dscrmnants.. Standard egenspace projecton: ll egenvectors correspondng to nonzero egenvalues are used to create the subspace.. Remove the last 4% of the egenvectors: Snce the egenvectors are sorted by the correspondng descendng egenvalues, ths method removes the egenvectors that fnd the least amount of varance among the mages. Specfcally, 4% of the egenvectors that fnd the least amount of varance are removed []. 3. Energy dmenson: Rather than use a standard cutoff for all subspaces, ths method uses the mnmum number of egenvectors to guarantee that energy (e) s greater than 9

a threshold. typcal threshold s.9. he energy of the th egenvector s the rato of the sum of the frst egenvalues over the sum of all the egenvalues [7] e j k j λ λ j j (3) 4. Stretchng dmenson: nother method of selectng egenvectors based on the nformaton provded by the egenvalues s to calculate the stretch (s) of an egenvector. he stretch of the th egenvector s the rato of the th egenvalue ( λ ) over the mamum egenvalue ( λ ) [7]. common threshold for the stretchng dmenson s.. λ s (3) λ 5. Removng the frst egenvector: he prevous three methods assume that the nformaton n the last egenvectors work aganst classfcaton. hs method assumes that nformaton n the frst egenvector works aganst classfcaton. For eample, lghtng causes consderable varaton n otherwse dentcal mages. Hence, ths method removes the frst egenvector []. Fgure 6 shows the values for energy and stretchng on the FERE dataset. 4. Orderng Egenvectors by LkeImage Dfference Ideally, two mages of the same person should project to the same pont n egenspace. ny dfference between the ponts s unwanted varaton. On the other hand, two mages of dfferent subjects should project to ponts that are as wdely separated as possble. o 3

Images Correctly Classfed 9 8 7 6 5 4 3 e67.7% e55.4% e73.79% s.964 e4.76% s.3 e8.4% e77.64% s.555 s.738 e85.% e88.5% e9.9% e97.5% e.% e94.56% e99.3% s.933 s.46 s.6 s.35 s.7 s.35 s.3 s. s.84 5 3 4 5 75 5 3 4 5 Number of Egenvectors Fgure 6. Eample of Energy (e) and Stretchng (s) dmenson of a specfc dataset. capture ths ntuton and use t to order egenvectors, we defne a lkemage dfference (ω ) for each of the k egenvectors []. o defne ω, we wll work wth pars of mages of the same people projected nto egenspace. Let X be tranng mages and Y mages of the correspondng people n the test set ordered such that as follows: j X and y j Y are mages of the same person. Defne ω δ k ω where λ j δ j y j (8) 3

When a dfference between mages that ought to match s large relatve to the varance for the dmenson λ then ω s large. Conversely, when the dfference between mages that ought to match s small relatve to the varance, ω s small. Snce the goal s to select egenvectors that brng smlar mages close to each other, we rank the egenvectors n order of ascendng ω and remove some number of the last egenvectors. 4.3 Smlarty & Dstance Measures Once mages are projected nto a subspace, there s the task of determnng whch mages are most lke one another. here are two ways n general to determne how alke mages are. One s to measure the dstance between the mages n Ndmensonal space. he second way s to measure how smlar two mages are. When measurng dstance, one wshes to mnmze dstance, so two mages that are alke produce a small dstance. When measurng smlarty, one wshes to mamze smlarty, so that two lke mages produce a hgh smlarty value. here are many possble smlarty and dstance measures; I wll dscuss fve. L norm: he L norm s also known as the cty block norm or the sum norm. It sums up the absolute dfference between pels[6,]. he L norm of an mage and an mage s: N L (, ) (9) he L norm s a dstance measure. Fgure 7 shows the L dstance between two vectors. 3

L norm: he L norm s also known as the Eucldean norm or the Eucldean dstance when ts square root s calculated. It sums up the squared dfference between pels [6,,7]. he L norm of an mage and an mage s: N (, ) ( ) L (3) he L norm s a dstance measure. Fgure 7 shows the L dstance between two vectors. Covarance: Covarance s also known as the angle measure. It calculates the angle between two normalzed vectors. akng the dot product of the normalzed vectors performs ths calculaton [,7]. he covarance between mages and s: cov(, ) (3) Covarance s a smlarty measure. y negatng the covarance value, t becomes a dstance measure []. Fgure 7 shows the covarance between two vectors. Mahalanobs dstance: he Mahalanobs dstance calculates the product of the pels and the egenvalue of a specfc dmenson and sums all these products []. he Mahalanobs dstance between an mage and an mage s: N Mah(, ) C (3) 33

Fgure 7. L dstance, L dstance and covarance between two vectors Fgure 8. wo mages wth a negatve correlaton and two that correlate well where C (33) λ Mahalanobs dstance s a dstance measure. Correlaton: Correlaton measures the rate of change between the pels of two mages. It produces a value rangng from to, where a value of ndcates the mages are oppostes of each other and a value of ndcates that the mages are dentcal [7]. he correlaton between an mage and an mage s: corr(, ) N ( µ )( σ σ µ ) (34) where µ s the mean of and σ s the standard devaton of. Fgure 8 shows an eample of two mages wth a negatve correlaton and two that correlate well. 34

4.4 re Smlarty Measures the Same Insde and Outsde of Egenspace? n egenspace consstng of all egenvectors assocated wth nonzero egenvalues s an orthonormal bass. n orthonormal bass s a set of vectors where the dot product of any two dstnct vectors s zero and the length of every vector s one. Orthonormal bases have the property that any mage that was used to create the orthonormal bass can be projected nto the full orthonormal bass wth no loss of nformaton. hs means that the mage can be projected nto the orthonormal bass and then converted back to the orgnal mage. For eample, let U be an orthonormal bass and let be an mage used to create U. hen U, where s the mage projected nto U. can be recovered by multplyng by U, U. Gven the fact that no nformaton s lost when projectng specfc mages nto an orthonormal bass, do the values of the smlarty measures change? he answer s that t depends on the smlarty measure. he L norm and correlaton produce dfferent values n the two spaces. Mahalanobs dstance s typcally only used n conjuncton wth egenspace. he L norm and covarance do produce the same value n both spaces; I wll prove ths. heorem 4.: he L norm produces the same value on a par of unprojected vectors and on a par of projected vectors. L (, ) L ( U, U ) (35) 35

36 Proof: Let U be an orthonormal bass. Let be a vector such that U. Let be a vector such that U. Now the L norm of s defned n equaton (3) and s the same as: ) ( ) ( (36) he L norm of ) ( s defned as: ), ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ), ( L UU UU UU UU U U U U U U U U L N N Hence, the L norm produces the same value on unprojected vectors and on projected vectors. heorem 4.: Covarance produces the same value on a par of unprojected vectors and on a par of projected vectors. ), cov( ), cov( U U (37) Proof: Let U be an orthonormal bass. Let be a vector such that U and U. Let be a vector such that U and U. he covarance of and s defned n equaton (3) and the covarance of and s defned as: ( ) ( ) U U U U U U U U U ), cov( (38) It s known that U, so

cov(, ) (39) U U y theorem 4. U and U. So, cov(, ) cov(, ) (4) Hence, covarance produces the same value on unprojected vectors and on projected vectors. I wll llustrate how each measure behaves wth an eample. Consder two vectors, 7 5, 5. Project these two ponts nto the orthonormal bass 4.733.6594.659 U.689.3837.6854..3499.6465.6779 U U.733.689.3499.733.689.3499.6594.3837.6465.6594.3837.6465.659 5.973.6854 5 3.8453.6779 4.4497.659 7 8.769.6854 5.44.6779.3 Fgure 9 shows ponts,, and. L norm: he L norm produces the same value on unprojected vectors and on projected vectors. Eamne the eample. 37

Fgure 9. Plot of ponts,, and. he L norm of L ( ) 36 + + 4 4 he L norm of L ( ) s: ( ) ( 7) + ( 5 5) + ( 4 ) s: ( ) ( 5.973 8.769) + ( 3.8453 (.44)) + ((.4497) (.3) ).3876 + 7.555 +.573 4. hs eample shows that for ths specfc case they are the same, and the above proof covers the general case. 38

Covarance: Covarance produces the same value on unprojected vectors and on projected vectors. Eamne the same eample. he covarance between and s: cov(, ) 7 7 5 5 5 5.543.796 4 4.775.566 7 6.487 8.838.67.65 5 5.796.65 [.543.775.67].566.6989 he covarance between and s: cov(, ).8.987.5933.59.694.38 4 5.973 8.769 3.8453.44.4497.3 5.973 8.769 3.8453.4497.44.3 5.973 8.769 3.8453.44.4497.3 6.487 8.838.987.38 [.8.5933.694].59.6989 hs eample shows that for ths specfc case they are the same and the above proof covers the general case. L norm: he L norm does not produce the same value on unprojected vectors and on projected vectors. Intutvely, two ponts that are located dagonal to each other wll 39

produce a larger L dstance than the same ponts rotated to be horzontal to each other. hs can be proven by an eample. he L norm of s: L ( ) 7 + 5 5 + 4 6 + + 8 he L norm of 5.973 8.769 + s: L ( ) 3.8453 (.44) 3.597 + 5.493 +.393 9.83 + (.4497) (.3) s you can see, these two norms are not the same; hence the L norm does not produce the same value on unprojected vectors and on projected vectors. Correlaton: Correlaton does not produce the same value on unprojected vectors and on projected vectors. Intutvely, Correlaton s effected by the mean of the mages. s mages are rotated ther mean changes, therefore ther correlaton changes. hs can be proven by an eample. he correlaton between and s: µ 3.3333, µ 4.6667, σ.87,.566 σ 4

N ( )( (, ) µ µ corr σ σ ( 3.3333)( 7 4.6667) ( 5 3.3333)( 5 4.6667) ( 4 3.3333)( 4.6667) + +.87 *.566.87 *.566 (.3333) *.3333 +.6667 *.3333 +.6667 *.6667.87 *.566 5.4444 +.5556 +.7778 6.6667.76 5.387 5.387 he correlaton between and s: ) µ.8643, µ.3675, σ.9485, σ.87 *.566 5.53. N ( )( (, ) µ µ corr σ σ ( 5.973.8643)( 8.769.3675) ( 3.8453.864)(.44.3675).9485*5.53 (.4497.8643)(.3.3675) +.9485*5.53.333*6.3494 +.98*.9485*5.53 + 8.549 4.88 + 3.6998 6.38 9.6559.53 6.38 + ) ( 3.775) + ( 3.34).9485*5.53 *.5779 hese two correlatons are not the same; hence the correlaton does not produce the same value on an unprojected vector and on a projected vector. Mahalanobs dstance: ypcally the Mahalanobs dstance s calculated on vectors projected nto egenspace, snce t uses the egenvalues to weght the contrbuton along each as. o llustrate Mahalanobs dstance as measured n egenspace, I wll calculate the Mahalanobs dstance between the projected vectors and. C λ 53.345.3788.88 4

3.666 + C λ 5.696 5.66 C Mah(, ) C N λ 3.559.75 3 (.668) +.88.688.976.93 (5.973*8.769 *.88) + (3.8453*.44*.976) + (.4497*.3*.93) 4

5. Eperments I performed four eperments, each on one of two datasets. he frst eperment combnes smlarty measures n an attempt to mprove performance. he second eperment tests whether performance mproves when egenvectors are ordered by lkemage dfference n egenspace projecton. he thrd eperment compares many varatons of egenspace projecton and Fsher dscrmnants on the Cat & Dog dataset. he fourth eperment compares several varatons of egenspace projecton and Fsher dscrmnants on the FERE dataset. 5. Datasets he Cat & Dog dataset and the FERE dataset are used for the eperments. he FERE dataset s restructured for some of the eperments. 5.. he Cat & Dog Dataset he Cat & Dog dataset was created by Mark Stevens and s avalable through the Computer Vson group at Colorado State Unversty. he orgnal dataset of, 6464 pel, grayscale mages conssted of 5 cat mages and 5 golden retrever mages. I collected 5 addtonal cat mages and 5 addtonal mages of dfferent types of dogs. Each mage shows the anmal s head and s taken drectly facng the anmal s face. Fgure shows eample mages from the Cat & Dog dataset. hs s a class classfcaton problem, snce each of the test mages s ether a cat or a dog. 43

Fgure. Sample mages from the Cat & Dog dataset Fgure. Sample mages from the FERE dataset 5.. he FERE Dataset Jonathan Phllps at the Natonal Insttute of Standards and echnology made the FERE dataset avalable to our department [,,3]. he FERE database contans mages of 96 ndvduals, wth up to 5 dfferent mages captured for each ndvdual. he mages are separated nto two sets: gallery mages and probes mages. Gallery mages are mages wth known labels, whle probe mages are matched to gallery mages for dentfcaton. he database s broken nto four categores: F: wo mages were taken of an ndvdual, one after the other. One mage s of the ndvdual wth a neutral facal epresson, whle the other s of the ndvdual wth a dfferent epresson. One of the mages s placed nto the gallery fle whle the other s used as a probe. In ths category, the gallery contans 96 mages, and the probe set has 95 mages. 44

Duplcate I: he only restrcton of ths category s that the gallery and probe mages are dfferent. he mages could have been taken on the same day or ½ years apart. In ths category, the gallery conssts of the same 96 mages as the F gallery whle the probe set contans 7 mages. fc: Images n the probe set are taken wth a dfferent camera and under dfferent lghtng than the mages n the gallery set. he gallery contans the same 96 mages as the F & Duplcate I galleres, whle the probe set contans 94 mages. Duplcate II: Images n the probe set were taken at least year after the mages n the gallery. he gallery contans 864 mages, whle the probe set has 34 mages. Fgure shows eample mages from the FERE dataset. 5..3 he Restructured FERE Dataset I restructured a porton of the FERE dataset so that there are four mages for each of 6 ndvduals. wo of the pctures are taken on the same day, where one pcture s of the ndvdual wth a neutral facal epresson and the other s wth a dfferent epresson. he other two pctures are taken on a dfferent day wth the same characterstcs. he purpose of ths restructurng s to create a dataset wth more than one tranng mage of each ndvdual to allow testng of Fsher dscrmnants. 5. aggng and Combnng Smlarty Measures Dfferent smlarty measures have been dscussed, but up untl ths pont they have been eamned separately. I wll now eamne combnng some of the smlarty measures 45

together n the hopes of mprovng performance. he followng four smlarty measures are eamned: L norm (9), the L norm (3), covarance (3), and the Mahalanobs dstance (3). I test both smple combnatons of the dstance measures and baggng the results of two or more measures usng a votng scheme [,3,9]. 5.. ddng Dstance Measures smple way to combne dstance measures s to add them. In other words, the dstance between two mages s defned as the sum S of the dstances accordng to two or more tradtonal measures: S ( a,..., ah ) a +... + a h (4) Usng S, all combnatons of base metrcs ( L, L, covarance, Mahalonobs) are used to select the nearest gallery mage to each probe mage. he percentage of mages correctly recognzed usng each combnaton on the Duplcate I probe set, s shown n able 5, along wth the recognton rates for the base measures themselves. Of the four base measures, there appears to be a sgnfcant mprovement wth the Mahalanobs dstance. On the surface, 4% seems much better than 33%, 34% or 35%. he best performance of any combned measure s 43% for the S( L, Mahalanobs) and S( L,covarance, Mahalanobs) combnatons. Whle hgher, the dfference does not appear sgnfcant. I used McNemar s test, whch smplfes to the sgn test [,4], to calculate the sgnfcance of dfferences n these results. he McNemar s test calculates how often one algorthm succeeds whle the other algorthm fals. I formulated the followng hypotheses to test sgnfcant dfference n the prevous results. 46

able 3. Results of McNemar s test among base measures. lgorthms lgorthm Success/Success Success/Falure Falure/Success P< L L 9 34.38 L ngle 4 39 3.38 L Mahalanobs 33 85. L ngle 4 5.6 L Mahalanobs 4 5 9. ngle Mahalanobs 5 8. able 4. Results of McNemar s test of the S( L, Mahalanobs) and S( L,covarance, Mahalanobs) combnatons compared to the Mahalanobs dstance lgorthms lgorthm Success/Success Success/Falure Falure/Success P< Mahalanobs S(L +Mahalanobs) 8 3 6.388 Mahalanobs S (L, ng, Mah) 8 5 9.34. Of the four base measures, Mahalanobs dstance outperforms all others, 4% versus 33%, 34% or 35%.. he performance of any combned measures s not statstcally better than the performance of the base measures. 43% for the S( L, Mahalanobs) and S( L,covarance, Mahalanobs) combnatons versus 4% for Mahalanobs dstance. able 3 shows the results of McNemar s test performed for each par of base measures. Note that Mahalanobs dstance always fals less often than the other smlarty measures, ndcated by P <.. Yet, no other measure s found to be dfferent. able 4 shows the results of McNemar s test of the S( L, Mahalanobs) and S( L,covarance, Mahalanobs) combnatons compared to the Mahalanobs dstance. Here no sgnfcant dfference s found between these algorthms, ndcatng that when they do dffer on a partcular mage each s equally lkely to dentfy the mage correctly. 47

able 5. Results of addng smlarty measures Classfer Duplcate I L.35 L.33 Covarance.34 Mahalanobs.4 S (L, L ).35 S (L, Covarance).39 S (L, Mahalanobs).43 able 6. Results of baggng smlarty measures Classfer Dup I F L.35.77 L.33.7 Cov.34.7 Mah.4.74 aggng.37.75 aggng (best 5).38.78 aggng (Weghted).38.77 S (L, Covarance).33 S (L, Mahalanobs).4 S (ngle, Covarance).4 S (L, L, Covarance).35 S (L, L, Mahalanobs).4 S (L, Cov, Mah).43 S (L, Cov, Mah).4 S (L, L,Cov, Mah).4 Interestngly, the performance of the combned measures s never less than the performance of ther components evaluated separately. For eample, the performance of S( L, L ) s 35%; ths s better than the performance of L (33%) and the same as L (35%). hese results suggest that L and L are dentfyng the same mages correctly; hence combnng measures does not dentfy any addtonal mages correctly. 5.. Dstance Measure ggregaton he eperment above tested only a smple summaton of dstance measures; one can magne many weghtng schemes for combnng dstance measures that mght outperform smple summaton. Rather than search the space of possble dstance measure combnatons, however, I took a cue from recent work n machne learnng that suggests the best way to combne multple estmators s to apply each estmator ndependently and combne the results by votng [,3,9]. 48

For face recognton, ths mples that each dstance measure s allowed to vote for the mage that t beleves s the closest match for a probe. he mage wth the most votes s chosen as the matchng gallery mage. Votng s performed three dfferent ways. aggng: Each classfer s gven one vote as eplaned above. aggng, best of 5: Each classfer votes for the fve gallery mages that most closely match the probe mage. aggng, weghted: Classfers cast fve votes for the closest gallery mage, four votes for the second closest gallery mage, and so on, castng just one vote for the ffth closest mage. able 6 shows the performance of votng for the Duplcate I and F probe sets. On the Duplcate I data, Mahalanobs dstance alone does better than any of the bagged classfers: 4% versus 37% and 38%. On the smpler F probe set, the best performance for a separate classfer s 77% (for L ), and the best performance for the bagged classfers s 78%. he McNemar s test confrms that ths s not a sgnfcant mprovement. In the net secton, I eplore one possble eplanaton for ths lack of mprovement when usng baggng. 5..3 Correlatng Dstance Metrcs s descrbed n [], the falure of votng to mprove performance suggests that the four dstance measures share the same bas. o test ths theory, I correlate the dstances calculated by the four measures over the Duplcate I probe set. Snce each measure s 49

defned over a dfferent range, Spearman rank correlaton s used [4]. For each probe mage, the gallery mages are ranked by ncreasng dstance to the probe. hs s done for each par of dstance measures. he result s two rank vectors, one for each dstance measure. Spearman s Rank Correlaton s the correlaton coeffcent for these two vectors. able 7 shows the average correlaton scores. L, covarance and Mahalanobs all correlate very closely to each other, although L correlates less well to covarance and Mahalanobs. hs suggests that there mght be some advantage to combnng L wth covarance or Mahalanobs, but that no combnaton of L, covarance or Mahalanobs s very promsng. hs s consstent wth the scores n able 5, whch show that the combnatons S( L, covarance) and S( L, Mahalanobs) outperform these classfers ndvdually. I also constructed a lst of mages n the F probe set that were grossly msclassfed, n the sense that the matchng gallery mage s not one of the ten closest mages accordng to one or more dstance measures. total of 79 mages are poorly dentfed by at least one dstance measure. able 8 shows the number of mages that are poorly dentfed by all four dstance measures, three dstance measures, two dstance measures, and just one dstance measure. hs table shows that there s shared bas among the classfers, n that they seem to make gross mstakes on the same mages. On the other hand, the errors do not overlap 5

able 7. Correlaton between smlarty measures. L L cov Mah L.4657.38873.38749 L.4657.65479.498865 cov.38873.65479.58534 Mah.38749.498865.58534 able 8. Number of mages smlarly dentfed poorly Images commonly poorly dentfed # of mages out of 79 % mages by 4 classfers 46 5.7 by 3 classfers 48 6.8 by classfers 34 8.99 by classfer 5 8.9 completely, suggestng that some mprovement mght stll be acheved by some combnaton of these dstance measures. 5.3 LkeImage Dfference on the FERE dataset In order to test the performance of lkemage orderng of egenvectors compared to orderng by correspondng egenvalue, I performed two eperments. he frst eperment s on the orgnal FERE dataset and compares results to those of Moon & Phllps. he second eperment s on the restructured dataset, where trals are run and tranng/test data s clearly separated. For each of the 95 probe/gallery matches n the F probe set of the orgnal FERE dataset, I calculate the dfference between the probe and gallery mage n egenspace. hese dfferences are summed together and then dvded by the egenvalue to calculate the lkemage dfference. he smaller ths number s, the better the egenvector should be at matchng mages. he top N egenvalues are selected accordng to the lkemage dfference measure, and the F probe set s reevaluated usng the L norm. Fgure shows the performance scores of the reordered egenvalues compared to the performance of the egenvalues ordered by egenvalue, as performed by Moon & Phllps. able 9 shows the number of mages correctly dentfed by each orderng method and the results 5