25 June 2019 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
13 May 2019 in IEEE Geoscience and Remote Sensing Letters
Rotation forest (RoF) is a powerful ensemble classifier and has been demonstrated the outstanding performance in hyperspectral data classification. However, the classification task suffers from the class imbalanced problem which has been considered to be one of the most important challenges. The traditional construction method of RoF biases classifying the majority classes and ignores recognizing the minority classes samples. This letter proposes a novel adaptive ensemble method based on SMOTE and RoF with differentiated sampling rates (AdaSRoF) for the multiclass imbalance problem. The proposed method adaptively generates several balanced data sets with more diversity and less noise by using SMOTE and a dynamic data sampling ratio for base classifiers. The obtained results on two publicly available hyperspectral images show that the proposed method can get more diversity and better performance than support vector machine (SVM), random forest (RF), and RoF in multiclass imbalance learning.
13 October 2017 in IEEE Geoscience and Remote Sensing Letters
In this letter, we propose a new weight-based rotation forest (WRoF) induction algorithm for the classification of hyperspectral image. The main idea of the new method is to guide the growth of trees adaptively via exploring the potential of important instances. The importance of a training instance is reflected by a dynamic weight function. The higher the weight of an instance, the more the next tree will have to focus on the instance. Experimental results on two real hyperspectral data sets show that the WRoF algorithm results in significant classification improvement compared with random forests and rotation forest.
12 May 2023 in IEEE Transactions on Geoscience and Remote Sensing
Recently, graph learning methods have attracted much research attention, which uses first-order nearest-neighbor relation between pixels to construct adjacency graphs for capturing smooth abundance. However, the first-order nearest-neighbor information neglects the shared domain structure of pixels making the higher-order nearest-neighbor relation missing resulting in limited spatial structure learning. Additionally, the feature values in hyperspectral images vary greatly in different bands, tiny value contributions are easily neglected due to the statistical properties of the model, which hinders the learning efficiency of the approach. To address these shortcomings, a higher-order graph regularizer nonnegative matrix factorization with adaptive feature selection method is proposed. Specifically, we introduce pixel second-order nearest-neighbor relation in graph learning to capture the nearest-neighbor domains of pixels with missing connection in first-order neighborhoods and enhance the aggregation of homogeneous regions. Then, the first-order and second-order nearest-neighbor relation are combined to construct higher-order graph regularizer to better preserve the global spatial structure of the image. Additionally, adaptive weight is introduced in the data reconstruction to balance the effects of different feature values by adaptively selecting spectral features to enhance the contribution of tiny features. Finally, the objective function is designed by fusing the higher-order graph regularization, adaptive feature selection and L 1/2 sparse regularizer into the nonnegative matrix factorization framework, and the optimization algorithm of the model is derived using a multiplicative update rule. We conducted extensive experiments on synthetic and real datasets, and the effectiveness and superiority of the proposed method were verified by comparing it with several state-of-the-art methods.
28 September 2021 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Recent research shows that generative adversarial network (GAN) based deep learning derived frameworks can improve the accuracy of hyperspectral image (HSI) classification on limited labeled samples. However, several studies point out that existing GAN-based methods are heavily affected by the complexity and inefficient description issues of HSIs. The discriminator in GAN always attempts to interpret high-dimensional nonlinear spectral knowledge of HSIs, thus resulting in the Hughes phenomenon. Another critical issue is sample generation. The generator is only used as a regularizer for the discriminator, which seriously restricts the performance for classification. In this article, we propose SSAT-GAN, a semisupervised spectral–spatial attention feature extraction approach based on the GAN that feeds raw data into a deep learning framework, in an end-to-end fashion. First, the unlabeled data is added into the discriminator to alleviate the problems of training samples and supplies a reconstructed real HSI data distribution through adversarial training. Second, to enhance the description of HSIs, we build spectral–spatial attention modules (SSAT) and extend them to the discriminator and the generator to extract discriminative characteristics from abundant spatial contexts and spectral signatures. The SSAT modules learn a three-dimensional filter bank with spectral–spatial attention weights to obtain meaningful feature maps to improve the discrimination of the feature representation. In terms of the mode collapse of GANs, the mean minimization loss is employed for unsupervised learning. Experimental results from three real datasets indicate that SSAT-GAN has certain advantages over the state-of-the-art methods.
8 February 2015 in Journal of the Indian Society of Remote Sensing