arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1102.2748cs.CVcs.AI
收藏

基于稀疏近似的特征选择人脸识别

Feature Selection via Sparse Approximation for Face Recognition

Institute of Information Science and Engineering, Central South University(中南大学信息科学与工程学院)

Yixiong Liang, Lei Wang, Yao Xiang, Beiji Zou

摘要:

受生物视觉系统的启发,具有巨大基数的过完备局部特征在人脸识别中的应用越来越广泛。因此,特征选择变得越来越重要,在人脸数据描述和识别中起着至关重要的作用。本文提出了一种基于正则化框架的可训练特征选择人脸识别算法。通过在最小平方误差(MSE)准则下引入稀疏惩罚项,将特征选择问题转化为组合稀疏逼近问题,并利用贪婪算法或凸松弛算法求解.此外,基于同一框架,我们提出了一个稀疏Ho-Kashyap(HK)过程,同时获得最佳稀疏解和相应的边际向量的MSE准则。该方法用于选择最具信息量的人脸图像的Gabor特征进行识别,在基准人脸数据库上的实验结果证明了该方法的有效性。

英文摘要:

Inspired by biological vision systems, the over-complete local features with huge cardinality are increasingly used for face recognition during the last decades. Accordingly, feature selection has become more and more important and plays a critical role for face data description and recognition. In this paper, we propose a trainable feature selection algorithm based on the regularized frame for face recognition. By enforcing a sparsity penalty term on the minimum squared error (MSE) criterion, we cast the feature selection problem into a combinatorial sparse approximation problem, which can be solved by greedy methods or convex relaxation methods. Moreover, based on the same frame, we propose a sparse Ho-Kashyap (HK) procedure to obtain simultaneously the optimal sparse solution and the corresponding margin vector of the MSE criterion. The proposed methods are used for selecting the most informative Gabor features of face images for recognition and the experimental results on benchmark face databases demonstrate the effectiveness of the proposed methods.

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

↑