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
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Representing image matrices: eigenimages versus eigenvectors
ISNN'05 Proceedings of the Second international conference on Advances in neural networks - Volume Part II
Recognizing face or object from a single image: linear vs. kernel methods on 2d patterns
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Hi-index | 0.00 |
Bayesian subspace analysis (BSA) has been successfully applied in data mining and pattern recognition. However, due to the use of probabilistic measure of similarity, it often needs much more projective vectors for better performance, which makes the compression ratio very low. In this paper, we propose a novel 2D Bayesian subspace analysis (2D-BSA) method for face recognition at high compression ratios. The main difference between the proposed 2D-BSA and BSA is that the former adopts a new Image-as-Matrix representation for face images, opposed to the Image-as-Vector representation in original BSA. Based on the new representation, 2D-BSA seeks two coupled set of projective vectors corresponding to the rows and columns of the difference face images, and then use them for dimensionality reduction. Experimental results on ORL and Yale face databases show that 2D-BSA is much more appropriate than BSA in recognizing faces at high compression ratios.