Local Preserving Graphs Using Intra-Class Competitive Representation for Dimensionality Reduction of Hyperspectral Image

Abstract

As a key technique in hyperspectral image pre-processing, dimensionality reduction has received a lot of attention. However, most of the graph-based dimensionality reduction methods only consider a single structure in the data and ignore the interfusion of multiple structures. In this paper, we propose two methods for combining intra-class competition for locally preserved graphs by constructing a new dictionary containing neighbourhood information. These two methods explore local information into the collaborative graph through competing constraints, thus effectively improving the overcrowded distribution of intra-class coefficients in the collaborative graph and enhancing the discriminative power of the algorithm. By classifying four benchmark hyperspectral data, the proposed methods are proved to be superior to several advanced algorithms, even under small-sample-size conditions.

Keywords

intra-class competition / graph construction / hyperspectral image / dimensionality reduction