Sciweavers

54 search results - page 4 / 11
» Cost-Sensitive Subspace Learning for Face Recognition
Sort
View
ICPR
2008
IEEE
14 years 7 days ago
A 2D model for face superresolution
Traditional face superresolution methods treat face images as 1D vectors and apply PCA on the set of these 1D vectors to learn the face subspace. Zhang et al [7] proposed Two-dire...
B. G. Vijay Kumar, Rangarajan Aravind
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
14 years 6 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
IBPRIA
2007
Springer
13 years 9 months ago
Efficiently Downdating, Composing and Splitting Singular Value Decompositions Preserving the Mean Information
Three methods for the efficient downdating, composition and splitting of low rank singular value decompositions are proposed. They are formulated in a closed form, considering the ...
Javier Melenchón, Elisa Martínez
CVPR
2001
IEEE
14 years 7 months ago
Learning Probabilistic Distribution Model for Multi-View Face Detection
Modeling subspaces of a distribution of interest in high dimensional spaces is a challenging problem in pattern analysis. In this paper, we present a novel framework for pose inva...
Lie Gu, Stan Z. Li, HongJiang Zhang
IVC
2006
175views more  IVC 2006»
13 years 5 months ago
Face recognition using optimal linear components of range images
This paper investigates the use of range images of faces for recognizing people. 3D scans of faces lead to range images that are linearly projected to low-dimensional subspaces fo...
Anuj Srivastava, Xiuwen Liu, Curt Hesher