Application of the Karhunen-Loeve Procedure for the Characterization of Human Faces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Kernel Principal Component Analysis
ICANN '97 Proceedings of the 7th International Conference on Artificial Neural Networks
Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition: A literature survey
ACM Computing Surveys (CSUR)
Improved system for object detection and star/galaxy classification via local subspace analysis
Neural Networks - 2003 Special issue: Neural network analysis of complex scientific data: Astronomy and geosciences
Improvement of reliability in banknote classification using reject option and local PCA
Information Sciences—Informatics and Computer Science: An International Journal
A Design Principle for Coarse-to-Fine Classification
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis
The Journal of Machine Learning Research
2D and 3D face recognition: A survey
Pattern Recognition Letters
Journal of Cognitive Neuroscience
Down-Sampling Face Images and Low-Resolution Face Recognition
ICICIC '08 Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control
Optimal Local Basis: A Reinforcement Learning Approach for Face Recognition
International Journal of Computer Vision
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric classification based on local mean and class statistics
Expert Systems with Applications: An International Journal
Using Local Dependencies within Batches to Improve Large Margin Classifiers
The Journal of Machine Learning Research
Recognition of faces in unconstrained environments: a comparative study
EURASIP Journal on Advances in Signal Processing - Special issue on recent advances in biometric systems: a signal processing perspective
Tongue shape classification by geometric features
Information Sciences: an International Journal
A feature extraction method for use with bimodal biometrics
Pattern Recognition
Adaptive nonlinear manifolds and their applications to pattern recognition
Information Sciences: an International Journal
Evaluation of face recognition techniques using PCA, wavelets and SVM
Expert Systems with Applications: An International Journal
On the relevance of linear discriminative features
Information Sciences: an International Journal
Information Sciences: an International Journal
LPP solution schemes for use with face recognition
Pattern Recognition
Letters: Laplacian bidirectional PCA for face recognition
Neurocomputing
Feature extraction using a fast null space based linear discriminant analysis algorithm
Information Sciences: an International Journal
An adaptive classification system for video-based face recognition
Information Sciences: an International Journal
Coarse-to-fine classification for image-based face detection
CIVR'06 Proceedings of the 5th international conference on Image and Video Retrieval
Information Sciences: an International Journal
User identity verification via mouse dynamics
Information Sciences: an International Journal
Information Sciences: an International Journal
An introduction to kernel-based learning algorithms
IEEE Transactions on Neural Networks
Facial-feature detection and localization based on a hierarchical scheme
Information Sciences: an International Journal
Traffic sign recognition using group sparse coding
Information Sciences: an International Journal
Hi-index | 0.07 |
In this paper, we propose a coarse-to-fine face recognition method. This method consists of two stages and works in a similar way as the well-known sparse representation method. The first stage determines a linear combination of all the training samples that is approximately equal to the test sample. This stage exploits the determined linear combination to coarsely determine candidate class labels of the test sample. The second stage again determines a weighted sum of all the training samples from the candidate classes that is approximately equal to the test sample and uses the weighted sum to perform classification. The rationale of the proposed method is as follows: the first stage identifies the classes that are ''far'' from the test sample and removes them from the set of the training samples. Then the method will assign the test sample into one of the remaining classes and the classification problem becomes a simpler one with fewer classes. The proposed method not only has a high accuracy but also can be clearly interpreted.