Abstract

Graph-based semisupervised hyperspectral image (HSI) classification methods have obtained extensive attention. In graph-based methods, a graph is first constructed, and then the label propagation is carried out on the constructed graph to obtain the labels for unknown samples. However, the results of label propagation may be unreliable, especially in the case of very limited labeled samples. To address the above problem, we propose dual sparse representation graph-based collaborative propagation (DSRG-CP) for HSI classification. Specifically, DSRG-CP adopts sparse representation (SR) to construct spectral and spatial graphs on spectral and spatial dimensions, respectively. Then, label propagation is performed on two graphs iteratively. In each iteration, only the samples with high classification confidence from one graph are added into another graph as labeled samples for the next label propagation. After several iterations, the labels of unlabeled samples are predicted by fusing the results of label propagation from two graphs. In addition, to make the spectral graph more discriminative, the regularizer of spectral statistical information is added into spectral SR model. To make the classification results more consistent in space, the superpixel block constraint is added into spatial graph model as regularizer. To evaluate the performance of the proposed method, DSRG-CP is compared with several graph-based methods and other state-of-the-art methods. Extensive experiments on real HSI data sets show that DSRG-CP can obtain competitive results for HSI classification.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call