Sparse Graph Embedding Based on the Fuzzy Set for Image Classification
Sparse Graph Embedding Based on the Fuzzy Set for Image Classification
复制标题
基于模糊集的稀疏图嵌入图像分类
DOI:
10.1155/2021/6638985
复制
发表时间:
2021
期刊:
影响因子:
2.3
通讯作者:
Guowei Yang
中科院分区:
文献类型:
--
作者:
Minghua Wan;Mengting Ge;Tianming Zhan;Zhangjing Yang;Hao Zheng;Guowei Yang
In recent years, many face image feature extraction and dimensional reduction algorithms have been proposed for linear and nonlinear data, such as local-based graph embedding algorithms or fuzzy set algorithms. However, the aforementioned algorithms are not very effective for face images because they are always affected by overlaps (outliers) and sparsity points in the database. To solve the problems, a new and effective dimensional reduction method for face recognition is proposed—sparse graph embedding with the fuzzy set for image classification. The aim of this algorithm is to construct two new fuzzy Laplacian scattering matrices by using the local graph embedding and fuzzy k-nearest neighbor. Finally, the optimal discriminative sparse projection matrix is obtained by adding elastic network regression. Experimental results and analysis indicate that the proposed algorithm is more effective than other algorithms in the UCI wine dataset and ORL, Yale, and AR standard face databases.