Journal
SIGNAL PROCESSING
Volume 170, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.sigpro.2020.107456
Keywords
Feature extraction; Semi-supervised learning; Graph construction; Sparse representation
Categories
Funding
- National Natural Science Foundation of China [U1504610, 61971339, 61471161]
- Natural Science Foundation of Shaanxi Province [2018JZ6002]
- Scientific and Technological Innovation Team of Colleges and Universities in Henan Province [20IRT-STHN018]
- National Key Research and Development Project [2016YFE0104600]
- Natural Science Foundations of Henan Province [192102210130, 182102210283]
Ask authors/readers for more resources
Graph-based feature extraction is an efficient technique for data dimensionality reduction, and it has gained intensive attention in various fields such as image processing, pattern recognition, and machine learning. However, conventional graph-based dimensionality reduction algorithms usually depend on a fixed weight graph called similarity matrix, which seriously affects the subsequent feature extraction process. In this paper, a novel structured optimal graph based sparse feature extraction (SOGSFE) method for semi-supervised learning is proposed. In the proposed method, the local structure learning, sparse representation, and label propagation are simultaneously framed to perform data dimensionality reduction. In particular the similarity matrix and the projection matrix are obtained by an iterative calculation manner. The experimental results on several public image datasets demonstrate the robustness and effectiveness of the proposed method. (C) 2020 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available