Coupled marginal fisher analysis for low-resolution face recognition

Authors:
Stephen Siena;Vishnu Naresh Boddeti;B. V. K. Vijaya Kumar
Affiliations:
Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania;Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania;Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume 2
Year:
2012

Citing 8
Cited 0

Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Hallucinating Faces

FG '00 Proceedings of the Fourth IEEE International Conference on Automatic Face and Gesture Recognition 2000
The CMU Pose, Illumination, and Expression (PIE) Database

FGR '02 Proceedings of the Fifth IEEE International Conference on Automatic Face and Gesture Recognition
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction

IEEE Transactions on Pattern Analysis and Machine Intelligence
Eigenfaces for recognition

Journal of Cognitive Neuroscience
On ratio-based color indexing

IEEE Transactions on Image Processing
Low-resolution face recognition via Simultaneous Discriminant Analysis

IJCB '11 Proceedings of the 2011 International Joint Conference on Biometrics
Multidimensional Scaling for Matching Low-Resolution Face Images

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many scenarios require that face recognition be performed at conditions that are not optimal. Traditional face recognition algorithms are not best suited for matching images captured at a low-resolution to a set of high-resolution gallery images. To perform matching between images of different resolutions, this work proposes a method of learning two sets of projections, one for high-resolution images and one for low-resolution images, based on local relationships in the data. Subsequent matching is done in a common subspace. Experiments show that our algorithm yields higher recognition rates than other similar methods.