Search

In recent years, convolutional neural networks (CNNs) have achieved excellent performance in hyperspectral image classification and have been widely used. However, the convolution kernel used in traditional CNN has the limitation of single scale, which is not conducive to the improvement of hyperspectral classification performance. In addition, training a classification network of high-dimensional data based on limited labeled samples is still one of the challenges of hyperspectral image classification. To solve the above problems, a hyperspectral image classification method based on expansion convolution network (ECNet) is proposed. The expansion convolution injects holes into the standard convolution kernel to expand the receptive field (RF), so as to extract more context features. Because the shallow features of hyperspectral images contain more location and detail information, while the deep features contain stronger semantic information, in order to further enhance the correlation between deep and shallow information, inspired by ResNet, a similar feedback block (SFB) is introduced on the basis of ECNet, and the deep features and shallow features are fused through this feedback mechanism. Thus, an improved version of ECNet method is obtained, which is called feedback ECNet (FECNet). This study was tested on four commonly used hyperspectral datasets [i.e., Indian Pine (IP), Pavia University (UP), Kennedy Space Center (KSC), and Salinas Valley (SV)] and on a higher resolution and complexly distributed land cover dataset (University of Houston (HT). The experimental results show that the proposed method has better classification performance than some state-of-the-art methods, which shows that FECNet has a certain potential in hyperspectral image classification. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) have exhibited extraordinary achievements in hyperspectral image (HSI) classification due to their detailed representation of features. However, the improvement of classification accuracy often leads to an evident increase in the complexity of the model, which makes it challenging for the model with the state-of-the-art performance to be applied in the actual scene. Considering MobileNetV3 as a lightweight feature extractor, this article proposes a model suitable for HSI classification based on MobileNetV3. To decrease the problem of massive redundant calculations in the existing spatial attention module, this article proposes a more concise and efficient spatial attention module based on the visual feature maps experiment. Besides, multiclass focal-loss is applied to solve the problem that the difficulty of classification varies for each sample. The experimental results demonstrate that in the case of using very few training sets, the proposed model can tremendously reduce the number of calculations and parameters while maintaining high accuracy. [ABSTRACT FROM AUTHOR]

Due to the limited spatial resolution of multispectral/hyperspectral data, mixed pixels widely exist and various spectral unmixing techniques have been developed for information extraction at the subpixel level in recent years. One of the challenging problems in spectral mixture analysis is how to model the data of a primary class. Given that the within-class spectral variability (WSV) is inevitable, it is more realistic to associate a group of representative spectra with a pure class. The unmixing method using the extended support vector machines (eSVMs) has handled this problem effectively. However, it has simplified WSV in the mixed cases. In this paper, a further development of eSVMs is presented to address two problems in multiple-endmember spectral mixture analysis: 1) one mixed pixel may be unmixed into different fractions (model overlap); and 2) one fraction may correspond to a group of mixed pixels (fraction overlap). Then, spectral unmixing resolution (SUR) is introduced to characterize how finely the mixture in a mixed pixel can be quantified. The quantitative relationship between SUR and WSV of endmembers is derived via a geometry analysis in support vector machine feature space. Thus, the possible SUR can be estimated when multiple endmembers for each class are given. Moreover, if the requirement of SUR is fixed, the acceptance level of WSV is then limited, which can be used as a guide to remove outliers and purify endmembers for each primary class. Experiments are presented to illustrate model and fraction overlap problems and the application of SUR in uncertainty analysis of spectral unmixing. [ABSTRACT FROM PUBLISHER]

Spectral unmixing is one of the important techniques for hyperspectral data processing. The analysis of spectral mixing is often based on a linear, fully constrained (FC) (i.e., nonnegative and sum-to-one mixture proportions), and least squares criterion. However, the traditional iterative processing of FC least squares (FCLS) linear spectral mixture analysis (LSMA) (FCLS-LSMA) is of heavy computational burden. Recently developed geometric LSMA methods decreased the complexity to some degree, but how to further reduce the computational burden and completely meet the FCLS criterion of minimizing the unmixing residual needs to be explored. In this paper, a simple distance measure is proposed, and then, a new geometric FCLS-LSMA method is constructed based on the distance measure. The method is in line with the FCLS criterion, free of iteration and dimension reduction, and with very low complexity. Experimental results show that the proposed method can obtain the same optimal FCLS solution as the traditional iteration-based FCLS-LSMA, and it is much faster than the existing spectral unmixing methods, particularly the traditional iteration-based method. [ABSTRACT FROM AUTHOR]