计算机科学 ›› 2017, Vol. 44 ›› Issue (2): 302-305.doi: 10.11896/j.issn.1002-137X.2017.02.051

• 图形图像与模式识别 • 上一篇    下一篇

稀疏正交普鲁克回归处理跨姿态人脸识别问题

张娟   

  1. 南京航空航天大学计算机科学与技术学院 南京210016
  • 出版日期:2018-11-13 发布日期:2018-11-13
  • 基金资助:
    本文受国家青年基金项目:基于生态特征参数的森林场景构建及森林动态演替过程的可视化模拟(61100132)资助

Sparse Orthogonal Procrustes Problem Based Regression for Face Recognition with Pose Variations

ZHANG Juan   

  • Online:2018-11-13 Published:2018-11-13

摘要: 正交普鲁克分析是 一种常用的处理矩阵近似问题的技术。最近,该技术被引入到正交普鲁克回归模型中来处理人脸姿态识别问题并取得了不错的效果。然而,这个模型对残差项使用了矩阵F范数约束,使得模型对于一些噪声(比如光照)非常敏感。为解决该问题,用更加鲁棒的1范约束替代原始的矩阵F范数约束,提出稀疏正交普鲁克回归模型。该模型可以由一个有效的交替迭代算法解决。在几个流行的人脸数据库上做了验证实验,实验结果证明该模型可以有效地处理人脸姿态变化。

关键词: 正交普鲁克分析,人脸姿态,回归模型

Abstract: Orthogonal Procrustes problem (OPP) is a popular technique to deal with matrix approximation problem.Recently,OPP was introduced into a regression model named orthogonal Procrustes problem based regression (OPPR) to handle facial pose variations and achieved interesting results.However,OPPR performs F-norm constraint on the error term,which makes the model sensitive to the noises (i.e.,illumination variations).To address this problem,in this paper,the F-norm constraint was replaced by the L1-norm constraint and the sparse orthogonal Procrustes problem based regression (SOPPR) model was proposed,which is more robust.The proposed model was then solved by an efficient alternating iterative algorithm.Experimental results on public face databases demonstrate the effectiveness of the proposed model for handling facial pose variations.

Key words: Orthogonal procrustes problem,Facial pose variations,Regression model

[1] WRIGHT J,YANG A,GANESH A,et al.Robust face recognition via sparse representation [J].IEEE Trans.PAMI,2009,31(2):210-227.
[2] NASEEM I,TOGNERI R,BENNAMOUN M.Linear regres-sion for face recognition [J].IEEE Trans.PAMI,2010,32(11):2106-2112.
[3] ZHANG L,YANG M,FENG X C.Sparse representation or collaborative representation which helps face recognition[C]∥ICCV.2011.
[4] DING C X,TAO D C.A comprehensive survey on pose-inva-riant face recognition [R].arXiv:1502.04383,2015.
[5] CHAI X J,SHAN S G,CHEN X L,et al.Locally linear regression for pose-invariant face recognition[J].IEEE Trans.on Ima-ge Processing,2007,16(7):1716-1725.
[6] SHARMA A,JACOBS D W.Bypassing synthesis:Pls for face recognition with pose,low-resolution and sketch[C]∥CVPR.2011.
[7] LI A N,SHAN S G,GAO W.Coupled bias-variance tradeoff forcross-pose face recognition [J].IEEE Trans.on Image Proces-sing,2012,21(1):305-315.
[8] ZHANG H C,ZHANG Y N,HUANG T.Pose-robust face re-cognition via sparse representation [J].Pattern Recognition,2013,46(5):1511-1521.
[9] TAI Y,YANG J,LUO L,et al.Orthogonal Procrustes Problem based Regression with Application to Face Recognition with Pose Variations[C]∥Iscide.2015.
[10] GREEN B.The orthogonal approximation of an oblique simple structure in factor analysis [J].Psychometrika,1952,17:429-440.
[11] GOWER J,DIJKSTERHUIS G.Procrustes problems [M].Oxford University Press,2004.
[12] VIKLANDS T.Algorithms for the weighted orthogonal pro-crustes problem and other least squares problems [D].UMEA University,2006.
[13] WAGNER A,WRIGHT J,GANESH A,et al.Towards a practical face recognition system:robust alignment and illumination by sparse representation[J].IEEE Trans.PAMI,2012,34:372-386.
[14] YU L B,ZHANG M,DING C.An efficient algorithm for L1-norm principal component analysis[C]∥ICASSP.2012
[15] YANG A,GANESH A,ZHOU Z,et al.Fast l1-minimization algorithms and application in robust face recognition [R].UC Berkeley,2010.
[16] SIM T,BAKER S,BSAT M.The cmu pose,illumination,andexpression database[J].IEEE Trans.PAMI,2003,25(12):1615-1618.
[17] GROSS R,MATTHEWS I,COHN J,et al.Multi-pie [J].Image and Vision Computing,2010,28:807-813.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!