arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.4207cs.CV
收藏

用于人脸识别的正则化鲁棒编码

Regularized Robust Coding for Face Recognition

The Hong Kong Polytechnic University(香港理工大学)

Meng Yang, Lei Zhang, Jian Yang, David Zhang

摘要:

近年来,基于稀疏表示的分类方法(SRC)被提出用于鲁棒的人脸识别。在SRC中,测试图像被编码为训练样本的稀疏线性组合,并且表示保真度由编码残差的l2范数或l1范数来度量。这种稀疏编码模型假设编码残差服从高斯或拉普拉斯分布,这可能不足以有效地描述实际FR系统中的编码残差。同时,编码系数的稀疏性限制使得SRC算法的计算量非常大。本文提出了一种新的人脸编码模型,即正则化鲁棒编码(RRC),它可以用正则化的回归系数鲁棒地回归给定的信号。通过假设编码残差和编码系数分别独立且同分布,RRC寻求编码问题的最大后验解。提出了一种迭代重加权正则化鲁棒编码(IR3C)算法来有效求解RRC模型。在具有代表性的人脸数据库上进行的大量实验表明,与现有的基于稀疏表示的方法相比,该方法在处理人脸遮挡、腐败、光照和表情变化等问题上具有更好的效果和效率。

英文摘要:

Recently the sparse representation based classification (SRC) has been proposed for robust face recognition (FR). In SRC, the testing image is coded as a sparse linear combination of the training samples, and the representation fidelity is measured by the l2-norm or l1-norm of the coding residual. Such a sparse coding model assumes that the coding residual follows Gaussian or Laplacian distribution, which may not be effective enough to describe the coding residual in practical FR systems. Meanwhile, the sparsity constraint on the coding coefficients makes SRC's computational cost very high. In this paper, we propose a new face coding model, namely regularized robust coding (RRC), which could robustly regress a given signal with regularized regression coefficients. By assuming that the coding residual and the coding coefficient are respectively independent and identically distributed, the RRC seeks for a maximum a posterior solution of the coding problem. An iteratively reweighted regularized robust coding (IR3C) algorithm is proposed to solve the RRC model efficiently. Extensive experiments on representative face databases demonstrate that the RRC is much more effective and efficient than state-of-the-art sparse representation based methods in dealing with face occlusion, corruption, lighting and expression changes, etc.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑