Probabilistic Models for Inference about Identity

被引:160
作者
Li, Peng [1 ]
Fu, Yun [1 ]
Mohammed, Umar [1 ]
Elder, James H. [2 ]
Prince, Simon J. D. [1 ]
机构
[1] UCL, Dept Comp Sci, London WC1E 6BT, England
[2] York Univ, Ctr Vis Res, N York, ON M3J 1P3, Canada
基金
英国工程与自然科学研究理事会;
关键词
Computing methodologies; pattern recognition; applications; face and gesture recognition; FACE RECOGNITION; SCALE;
D O I
10.1109/TPAMI.2011.104
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many face recognition algorithms use "distance-based" methods: Feature vectors are extracted from each face and distances in feature space are compared to determine matches. In this paper, we argue for a fundamentally different approach. We consider each image as having been generated from several underlying causes, some of which are due to identity (latent identity variables, or LIVs) and some of which are not. In recognition, we evaluate the probability that two faces have the same underlying identity cause. We make these ideas concrete by developing a series of novel generative models which incorporate both within-individual and between-individual variation. We consider both the linear case, where signal and noise are represented by a subspace, and the nonlinear case, where an arbitrary face manifold can be described and noise is position-dependent. We also develop a "tied" version of the algorithm that allows explicit comparison of faces across quite different viewing conditions. We demonstrate that our model produces results that are comparable to or better than the state of the art for both frontal face recognition and face recognition under varying pose.
引用
收藏
页码:144 / 157
页数:14
相关论文
共 46 条
[1]  
[Anonymous], P INT C COMP VIS
[2]  
[Anonymous], P IEEE CS C COMP VIS
[3]  
[Anonymous], P EUR C COMP VIS
[4]  
[Anonymous], P BRIT MACH VIS C
[5]  
[Anonymous], P IEEE INT C COMP VI
[6]  
[Anonymous], P IEEE 9 INT C COMP
[7]  
[Anonymous], P BRIT MACH VIS C
[8]  
[Anonymous], P ACM SIGMM WORKSH B
[9]  
[Anonymous], P 10 AS C COMP VIS
[10]  
[Anonymous], P IEEE 5 INT C AUT F