{"title":"Extended Two-Dimensional PCA for efficient face representation and recognition","authors":"M. Safayani, M. Shalmani, M. Khademi","doi":"10.14864/SOFTSCIS.2008.0.636.0","DOIUrl":null,"url":null,"abstract":"In this paper a novel method called Extended Two-Dimensional PCA (E2DPCA) is proposed which is an extension to the original 2DPCA. We state that the covariance matrix of 2DPCA is equivalent to the average of the main diagonal of the covariance matrix of PCA. This implies that 2DPCA eliminates some covariance information that can be useful for recognition. E2DPCA instead of just using the main diagonal considers a radius of r diagonals around it and expands the averaging so as to include the covariance information within those diagonals. The parameter r unifies PCA and 2DPCA. r = 1 produces the covariance of 2DPCA, r = n that of PCA. Hence, by controlling r it is possible to control the trade-offs between recognition accuracy and energy compression (fewer coefficients), and between training and recognition complexity. Experiments on ORL face database show improvement in both recognition accuracy and recognition time over the original 2DPCA.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Conference on Intelligent Computer Communication and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14864/SOFTSCIS.2008.0.636.0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22
Abstract
In this paper a novel method called Extended Two-Dimensional PCA (E2DPCA) is proposed which is an extension to the original 2DPCA. We state that the covariance matrix of 2DPCA is equivalent to the average of the main diagonal of the covariance matrix of PCA. This implies that 2DPCA eliminates some covariance information that can be useful for recognition. E2DPCA instead of just using the main diagonal considers a radius of r diagonals around it and expands the averaging so as to include the covariance information within those diagonals. The parameter r unifies PCA and 2DPCA. r = 1 produces the covariance of 2DPCA, r = n that of PCA. Hence, by controlling r it is possible to control the trade-offs between recognition accuracy and energy compression (fewer coefficients), and between training and recognition complexity. Experiments on ORL face database show improvement in both recognition accuracy and recognition time over the original 2DPCA.
本文提出了一种扩展二维主成分分析(Extended two - two PCA, E2DPCA)方法,它是对原来的2DPCA方法的扩展。我们指出2DPCA的协方差矩阵等价于PCA协方差矩阵主对角线的平均值。这意味着2DPCA消除了一些对识别有用的协方差信息。E2DPCA不只是使用主对角线,而是考虑它周围的r条对角线的半径,并扩展平均,以便包括这些对角线内的协方差信息。参数r统一了PCA和2DPCA。r = 1表示2DPCA的协方差,r = n表示PCA的协方差。因此,通过控制r,可以控制识别精度和能量压缩(更少的系数)之间以及训练和识别复杂性之间的权衡。在ORL人脸数据库上进行的实验表明,该算法在识别精度和识别时间上都比原来的2DPCA算法有所提高。