Visual learning and recognition of 3-D objects from appearance
International Journal of Computer Vision
Probabilistic Visual Learning for Object Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face Recognition by Elastic Bunch Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
International Journal of Computer Vision
The Quotient Image: Class-Based Re-Rendering and Recognition with Varying Illuminations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Illumination Cones for Recognition under Variable Lighting: Faces
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
From Few to Many: Generative Models for Recognition Under Variable Pose and Illumination
FG '00 Proceedings of the Fourth IEEE International Conference on Automatic Face and Gesture Recognition 2000
Journal of Cognitive Neuroscience
Hi-index | 0.00 |
This paper presents a new low-dimensional face representation using the proposed eigenspaces transformation. The proposed algorithm is based on face images which is acquired with c illumination conditions. We define face images as a non-illumination class and illumination classes from light source conditions and derive the linear transformation function in a low-dimensional eigenspace between a non-illumination class and illumination classes. The proposed illumination compensation algorithm is composed of two steps. In the optimal projection space which is obtained from the DirectLDA algorithm, we first select the illumination class for a given image and then we generate a nonilluminated image by using eigenspace transformation of the illuminated class. We provide experimental results to demonstrate the performance of the proposed algorithm with varying parameters of proposed algorithm.