.png){kind=icon}
返回
A sub-block-based eigenphases algorithm with optimum sub-block size
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.08.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several algorithms have been proposed for constrained face recognition applications. Among them the eigenphases algorithm and some variations of it using sub-block processing, appears to be desirable alternatives because they achieves high face recognition rate, under controlled conditions. However, their performance degrades when the face images under analysis present variations in the illumination conditions as well as partial occlusions. To overcome these problems, this paper derives the optimal sub-block size that allows improving the performance of previously proposed eigenphases algorithms. Theoretical and computer evaluation results show that, using the optimal block size, the identification performance of the eigenphases algorithm significantly improves, in comparison with the conventional one, when the face image presents different illumination conditions and partial occlusions respectively. The optimal sub-block size also allows achieving a very low false acceptance and false rejection rates, simultaneously, when performing identity verification tasks, which is not possible to obtain using the conventional approach: as well as to improve the performance of other sub-block-based eigenphases methods when rank tests are performed. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Face recognition
Eigenphases
Sub-block processing
PCA
SVM
Partial occlusion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
An efficient algorithm for the 2-D discrete cosine transform二维离散余弦变换的一种有效算法.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏分享收藏分享收藏Artificial neural networks based on principal component analysis input selection for clinical pattern recognition analysisTALANTA
TALANTAIF6.1
PREAI
分享收藏
查看更多内容