A Compared Study Between Some Subspace Based Algorithms

12/23/2019
by   Xing Liu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2019

2DR1-PCA and 2DL1-PCA: two variant 2DPCA algorithms based on none L2 norm

In this paper, two novel methods: 2DR1-PCA and 2DL1-PCA are proposed for...
research
11/02/2017

Random Subspace Two-dimensional LDA for Face Recognition

In this paper, a novel technique named random subspace two-dimensional L...
research
09/29/2017

Comparison of PCA with ICA from data distribution perspective

We performed an empirical comparison of ICA and PCA algorithms by applyi...
research
04/12/2019

Tensor Sparse PCA and Face Recognition: A Novel Approach

Face recognition is the important field in machine learning and pattern ...
research
12/01/2021

Improved sparse PCA method for face and image recognition

Face recognition is the very significant field in pattern recognition ar...
research
04/06/2010

Extended Two-Dimensional PCA for Efficient Face Representation and Recognition

In this paper a novel method called Extended Two-Dimensional PCA (E2DPCA...
research
06/08/2023

Subject clustering by IF-PCA and several recent methods

Subject clustering (i.e., the use of measured features to cluster subjec...

Please sign up or login with your details

Forgot password? Click here to reset