Globally Maximizing Locally Minimizing unsupervised discriminant projection with applications to face and palm biometrics PAMI 2007 Bo Yang 2/25/2019.

Slides:



Advertisements
Similar presentations
Feature Selection as Relevant Information Encoding Naftali Tishby School of Computer Science and Engineering The Hebrew University, Jerusalem, Israel NIPS.
Advertisements

Linear discriminant analysis (LDA) Katarina Berta
Component Analysis (Review)
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction Keywords: Dimensionality reduction, manifold learning, subspace learning,
Dimension reduction (1)
AGE ESTIMATION: A CLASSIFICATION PROBLEM HANDE ALEMDAR, BERNA ALTINEL, NEŞE ALYÜZ, SERHAN DANİŞ.
Face Recognition Under Varying Illumination Erald VUÇINI Vienna University of Technology Muhittin GÖKMEN Istanbul Technical University Eduard GRÖLLER Vienna.
Principal Component Analysis
CS 790Q Biometrics Face Recognition Using Dimensionality Reduction PCA and LDA M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
Ch. 10: Linear Discriminant Analysis (LDA) based on slides from
Comparing Kernel-based Learning Methods for Face Recognition Zhiguo Li
Review Rong Jin. Comparison of Different Classification Models  The goal of all classifiers Predicating class label y for an input x Estimate p(y|x)
A PCA-based feature extraction method for face recognition — Adaptively weighted sub-pattern PCA (Aw-SpPCA) Group members: Keren Tan Weiming Chen Rong.
Radial Basis Function Networks
嵌入式視覺 Pattern Recognition for Embedded Vision Template matching Statistical / Structural Pattern Recognition Neural networks.
1 Graph Embedding (GE) & Marginal Fisher Analysis (MFA) 吳沛勳 劉冠成 韓仁智
BrainStorming 樊艳波 Outline Several papers on icml15 & cvpr15 PALM Information Theory Learning.
ratio percent Write fractions as percents and percents as fractions.
IEEE TRANSSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Transfer Learning Task. Problem Identification Dataset : A Year: 2000 Features: 48 Training Model ‘M’ Testing 98.6% Training Model ‘M’ Testing 97% Dataset.
A Two-level Pose Estimation Framework Using Majority Voting of Gabor Wavelets and Bunch Graph Analysis J. Wu, J. M. Pedersen, D. Putthividhya, D. Norgaard,
ECE 8443 – Pattern Recognition LECTURE 10: HETEROSCEDASTIC LINEAR DISCRIMINANT ANALYSIS AND INDEPENDENT COMPONENT ANALYSIS Objectives: Generalization of.
Transductive Regression Piloted by Inter-Manifold Relations.
Face Recognition: An Introduction
Local Fisher Discriminant Analysis for Supervised Dimensionality Reduction Presented by Xianwang Wang Masashi Sugiyama.
Dimensionality reduction
Principal Component Analysis and Linear Discriminant Analysis for Feature Reduction Jieping Ye Department of Computer Science and Engineering Arizona State.
CSC321: Lecture 25: Non-linear dimensionality reduction Geoffrey Hinton.
LDA (Linear Discriminant Analysis) ShaLi. Limitation of PCA The direction of maximum variance is not always good for classification.
The Chinese University of Hong Kong Learning Larger Margin Machine Locally and Globally Dept. of Computer Science and Engineering The Chinese University.
Introduction to several works and Some Ideas Songcan Chen
Date of download: 9/18/2016 Copyright © 2016 SPIE. All rights reserved. Key observation of geometric analysis of two different time series construction.
Machine Learning Fisher’s Criteria & Linear Discriminant Analysis
Semi-Supervised Clustering
Chapter 7. Classification and Prediction
DEEP LEARNING BOOK CHAPTER to CHAPTER 6
Object Orie’d Data Analysis, Last Time
Shuang Hong Yang College of Computing, Georgia Tech, USA Hongyuan Zha
Face Detection EE368 Final Project Group 14 Ping Hsin Lee
Background on Classification
LECTURE 10: DISCRIMINANT ANALYSIS
Recognition with Expression Variations
Unsupervised Riemannian Clustering of Probability Density Functions
کاربرد نگاشت با حفظ تنکی در شناسایی چهره
Dimensionality reduction
Recovery from Occlusion in Deep Feature Space for Face Recognition
Machine Learning Basics
Finding Communities by Clustering a Graph into Overlapping Subgraphs
Classification Discriminant Analysis
Jianping Fan Dept of CS UNC-Charlotte
Outline Nonlinear Dimension Reduction Brief introduction Isomap LLE
Boosting Nearest-Neighbor Classifier for Character Recognition
Classification Discriminant Analysis
Learning with information of features
Mixture Density Networks
Warm-up October 26, 2017 Factor: 66B + 12A – 14
Neural Networks and Their Application in the Fields of Coporate Finance By Eric Séverin Hanna Viinikainen.
Presented by: Chang Jia As for: Pattern Recognition
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Feature space tansformation methods
Generalized Locality Preserving Projections
LECTURE 09: DISCRIMINANT ANALYSIS
Parametric Methods Berlin Chen, 2005 References:
Hairong Qi, Gonzalez Family Professor
Face Recognition: A Convolutional Neural Network Approach
CSLT ML Summer Seminar (2)
Goodfellow: Chapter 14 Autoencoders
Presentation transcript:

Globally Maximizing Locally Minimizing unsupervised discriminant projection with applications to face and palm biometrics PAMI 2007 Bo Yang 2/25/2019

Motivation Shortage of existing manifold algorithms for Classification: Locality: has no direct connection to classification non-locality: modeling multi-manifolds the inter-cluster scatter, may provide crucial information for discrimination seeks to maximize the ratio of the nonlocal scatter to the local scatter.

Review PCA LDA

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

Basic Idea of UDP

Characterize the Local Scatter

Characterize the Non-local Scatter

Characterize the Nonlocal Scatter (cont’d)

Determine a Criterion: Maximizing the Ratio of Nonlocal Scatter to Local Scatter

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

Algorithmic Derivations of UDP in Small Sample Size Cases

Algorithmic Derivations of UDP in Small Sample Size Cases (cont’d)

Algorithmic Derivations of UDP in Small Sample Size Cases (cont’d)

Algorithmic Derivations of UDP in Small Sample Size Cases (cont’d)

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

UDP Algorithm

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

Graph with Heat kernel

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

LINKS TO LPP UDP maximizes the ratio of the nonlocal scatter (or the global scatter) to the local scatter whereas LPP minimizes the local scatter

LINKS TO LDA LDA can be regarded as a special case of UDP if we assume that each class has the same number of training samples

LINKS TO LDA (cont’d)

UNSUPERVISED DISCRIMINANT PROJECTION (UDP) Basic Idea of UDP Algorithmic Derivations of UDP in Small Sample Size Cases UDP Algorithm EXTENSION: UDP WITH KERNEL WEIGHTING LINKS TO OTHER LINEAR PROJECTION TECHNIQUES: LDA AND LPP BIOMETRICS APPLICATIONS: EXPERIMENTS AND ANALYSIS

EXPERIMENTS Yale Database FERET Database AR Database PolyU Palmprint Database

Yale Database

Yale Database (cont’d)

FERET Database This subset includes 1,000 images of 200 individuals (each one has five images). It is composed of the images whose names are marked with two-character strings: “ba,” “bj,” “bk,” “be,” “bf.”

AR Database

PolyU Palmprint Database

Comment LPP UDP UDP and LPP essentially share the same basic idea: simultaneously minimizing the local quantity and maximizing the global quantity.

Comment the numerators in (1) and (2), are two equivalent the denominators in (1) and (2), are two similar scatters the projections derived from UDP and LPP are identical under the assumption that the local density is uniform

Comment

Comment we would like to conclude that UDP is an effective algorithm as a simplified, or regularized, version of LPP, but there is no reason to prefer UDP over LPP for the general classification and clustering tasks.

Thank you !