Model-Driven Domain Adaptation on Product Manifolds for Unconstrained Face Recognition

被引:19
作者
Huy Tho Ho [1 ,2 ]
Gopalan, Raghuraman [3 ]
机构
[1] Univ Maryland, UMIACS, Dept Elect & Comp Engn, College Pk, MD 20742 USA
[2] Univ Maryland, UMIACS, Ctr Automat Res, College Pk, MD 20742 USA
[3] AT&T Labs Res, Dept Video & Multimedia Technol Res, Middletown, NJ 07748 USA
关键词
Domain adaptation; Unconstrained face recognition; Manifold learning; Tensor computation; TEXTURE CLASSIFICATION; ROBUST; ILLUMINATION; BLUR; KERNEL;
D O I
10.1007/s11263-014-0720-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many classification algorithms see a reduction in performance when tested on data with properties different from that used for training. This problem arises very naturally in face recognition where images corresponding to the source domain (gallery, training data) and the target domain (probe, testing data) are acquired under varying degree of factors such as illumination, expression, blur and alignment. In this paper, we account for the domain shift by deriving a latent subspace or domain, which jointly characterizes the multifactor variations using appropriate image formation models for each factor. We formulate the latent domain as a product of Grassmann manifolds based on the underlying geometry of the tensor space, and perform recognition across domain shift using statistics consistent with the tensor geometry. More specifically, given a face image from the source or target domain, we first synthesize multiple images of that subject under different illuminations, blur conditions and 2D perturbations to form a tensor representation of the face. The orthogonal matrices obtained from the decomposition of this tensor, where each matrix corresponds to a factor variation, are used to characterize the subject as a point on a product of Grassmann manifolds. For cases with only one image per subject in the source domain, the identity of target domain faces is estimated using the geodesic distance on product manifolds. When multiple images per subject are available, an extension of kernel discriminant analysis is developed using a novel kernel based on the projection metric on product spaces. Furthermore, a probabilistic approach to the problem of classifying image sets on product manifolds is introduced. We demonstrate the effectiveness of our approach through comprehensive evaluations on constrained and unconstrained face datasets, including still images and videos.
引用
收藏
页码:110 / 125
页数:16
相关论文
共 70 条
[1]  
[Anonymous], P CVPR
[2]  
[Anonymous], 2008, FAC REAL LIF IM WORK
[3]  
[Anonymous], P ICCV
[4]  
[Anonymous], 2008, PROC WORKSHOP FACES
[5]  
[Anonymous], 2006, P IEEE C COMP VIS PA, DOI [10.1109/CVPR.2006.50, DOI 10.1109/CVPR.2006.50]
[6]  
[Anonymous], P CVPR
[7]  
Arandjelovic O, 2005, PROC CVPR IEEE, P581
[8]  
Arandjelovic Ognjen, 2009, Computer Vision - ACCV 2009. 9th Asian Conference on Computer Vision. Revised Selected Papers, P203
[9]   Lambertian reflectance and linear subspaces [J].
Basri, R ;
Jacobs, DW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (02) :218-233
[10]   A theory of learning from different domains [J].
Ben-David, Shai ;
Blitzer, John ;
Crammer, Koby ;
Kulesza, Alex ;
Pereira, Fernando ;
Vaughan, Jennifer Wortman .
MACHINE LEARNING, 2010, 79 (1-2) :151-175