TY - GEN
T1 - Flexible X-Y patches for face recognition
AU - Liu, Ming
AU - Yan, Shuicheng
AU - Fu, Yun
AU - Huang, Thomas S.
PY - 2008
Y1 - 2008
N2 - In this paper, illuminated by the great success of Universal Background Modeling (UBM) for speech/speaker recognition, we present a new algorithm for face recognition. On the one hand, we encode each face image as an ensemble of X-Y patches, which integrate both local appearance and shape information. These X-Y patch representation provides the possibility to compare two spatially different patches, and consequently alleviates the requirement of exact pixel-wise alignment. On the other hand, we train the UBM based on the X-Y patches from the images of differen subjects, and then automatically adapt the UBM for specific subject, and finally face recognition is conducted by comparing the ratio of the likelihoods from the model for specific subject and UBM. UBM elicits the algorithmic robustness to image occlusion since the occluded patches may not contribute evidence to any subjects. Comparison experiments with the state-of-the-art subspace learning algorithms, on the popular CMU PIE face database and with varieties of configurations, demonstrate that our proposed algorithm brings significant improvement in face recognition accuracy, and also show the algorithmic robustness to image occlusions.
AB - In this paper, illuminated by the great success of Universal Background Modeling (UBM) for speech/speaker recognition, we present a new algorithm for face recognition. On the one hand, we encode each face image as an ensemble of X-Y patches, which integrate both local appearance and shape information. These X-Y patch representation provides the possibility to compare two spatially different patches, and consequently alleviates the requirement of exact pixel-wise alignment. On the other hand, we train the UBM based on the X-Y patches from the images of differen subjects, and then automatically adapt the UBM for specific subject, and finally face recognition is conducted by comparing the ratio of the likelihoods from the model for specific subject and UBM. UBM elicits the algorithmic robustness to image occlusion since the occluded patches may not contribute evidence to any subjects. Comparison experiments with the state-of-the-art subspace learning algorithms, on the popular CMU PIE face database and with varieties of configurations, demonstrate that our proposed algorithm brings significant improvement in face recognition accuracy, and also show the algorithmic robustness to image occlusions.
KW - Appearance
KW - Face recognition
KW - Shape
KW - X-Y patches
UR - http://www.scopus.com/inward/record.url?scp=51449120709&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51449120709&partnerID=8YFLogxK
U2 - 10.1109/ICASSP.2008.4518059
DO - 10.1109/ICASSP.2008.4518059
M3 - Conference contribution
AN - SCOPUS:51449120709
SN - 1424414849
SN - 9781424414840
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 2113
EP - 2116
BT - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
T2 - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Y2 - 31 March 2008 through 4 April 2008
ER -