2017
DOI: 10.1016/j.fss.2016.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Local graph embedding based on maximum margin criterion via fuzzy set

Abstract: Recently, many algorithms based on locally graph embedding are proposed for dimensional reduction in nonlinear data. However, these algorithms are not effective when dealing with face images affected by variations in illumination conditions, poses or perspectives and different facial expressions. So, distant data points are not deemphasized efficiently by locally graph embedding algorithms and it may degrade the performance of classification. In order to solve the aforementioned problem, this paper proposes a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(16 citation statements)
references
References 15 publications
0
16
0
Order By: Relevance
“…The proposed S2S distance adopts the kNN-average pooling for the similarity scores computed on all the media in two sets, which makes the identification far less susceptible to the outliers than traditional feature-average pooling. Recently, researchers in [28], [29], [30], [35], and [36] have proposed efficient feature extraction schemes that can be further investigated to develop a face recognition algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed S2S distance adopts the kNN-average pooling for the similarity scores computed on all the media in two sets, which makes the identification far less susceptible to the outliers than traditional feature-average pooling. Recently, researchers in [28], [29], [30], [35], and [36] have proposed efficient feature extraction schemes that can be further investigated to develop a face recognition algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…All of these methods convert image matrix into one highdimension vector [18]- [20]. Yang et al [11], Yang and Yang [12] proposed 2DPCA method that directly uses image matrix, which simplifies the calculation.…”
Section: Introductionmentioning
confidence: 99%
“…These techniques can be generalized under a unified model of linear representation, which reconstruct a query image using a linear combination of available traing samples. Subspace learning based approaches [38] [40] [41] for face recognition is another category of popular and vastly employed techniques among research community (such as PCA, LDA, LPP and LLE etc.). However, methods based on both of these categories required sufficient number of training samples from each class for effective classification, which unfortunality in case of real-world application is extremely difficult to meet.…”
Section: Introductionmentioning
confidence: 99%
“…However, methods based on both of these categories required sufficient number of training samples from each class for effective classification, which unfortunality in case of real-world application is extremely difficult to meet. To address the small sample size problem of face recognition, Wan et al [38] used fuzzy intrinsic and penalty graph to preserve nearest neighbor relationship among images to better characterize the compactness within a class and separate-ability between classes. Then maximum margin criterion (MMC) was used for feature extraction (low-dimensional space) and classification of face images.…”
Section: Introductionmentioning
confidence: 99%