A Compared Study Between Some Subspace Based Algorithms
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:UOS76CXTrecord.jsonopen to challenge →
classification
cs.CV
cs.LG
keywords
algorithmsdpcarecognitionsomeaboveaccuracybasiscompared
read the original abstract
The technology of face recognition has made some progress in recent years. After studying the PCA, 2DPCA, R1-PCA, L1-PCA, KPCA and KECA algorithms, in this paper ECA (2DECA) is proposed by extracting features in PCA (2DPCA) based on Renyi entropy contribution. And then we conduct a study on the 2DL1-PCA and 2DR1-PCA algorithms. On the basis of the experiments, this paper compares the difference of the recognition accuracy and operational efficiency between the above algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.