Adaptive collaborative graph for discriminant analysis of hyperspectral imagery

Abstract

Recently, sparse graph-based discriminant analysis (SGDA) and collaborative graph-based discriminant analysis (CGDA) have been developed for dimensionality reduction of hyperspectral imagery. In SGDA or CGDA, a graph is constructed by l1 -norm minimization-based representation or l2-norm minimization-based representation, respectively, based on labeled samples. These two methods have shown success over traditional methods by reinforcing discriminative power, but are limited in within-class representation and distribution of representation coefficients. In order to preserve intrinsic geometrical structure of original data and improve the interpretability of the underlying graph, we propose an adaptive collaborative graph for discriminant analysis (ACGDA), which explicitly models the internal relationship among within-class pixels during graph construction. The proposed method couples distance-weighted Tikhonov regularization with l2-norm minimization-based representation, of which the coefficients are solutions to a closed-form expression. The graph adaptively adjusts the collaborative representation by using distance-weighted measurement, which produces stronger ability of discrimination. In addition, the graph weight matrix is designed in the form of a block-diagonal structure, reducing the computational cost and further improving discriminative power. The proposed approach is compared with several traditional and state-of-the-art methods on two benchmark datasets. Experimental results demonstrate that the proposed approach can yield superior classification performance.