Search

Hyperspectral band selection (BS) aims to select a subset of bands from the original image cube for subsequent tasks, such as pixel classification. In this paper, we propose a novel unsupervised BS method, termed the representativeness and redundancy-based BS (RRBS) method, by measuring the representativeness and redundancy of the selected bands. The intuitive motivation is to find a subset of bands, which represents the dataset and has low redundancy. The desired bands are obtained sequentially. In each round of lookup, two novel selection criteria based on orthogonal subspace projection are designed for searching the bands that not only well represent the unselected bands but also lowly correlate with the selected bands. Additionally, kernel tricks are used to develop a nonlinear version of the linear selection criteria. Both the linear and nonlinear selection criteria can explicitly evaluate the representativeness and redundancy simultaneously, and they are also robust to noisy bands. The experimental results verify that the proposed method yields excellent classification performance even selecting very a limited number of bands. [ABSTRACT FROM AUTHOR]

The orthogonal-projection-based band selection (OPBS) algorithm is one of the newly proposed band selection methods. In this letter, we present a nonlinear version of the OPBS method, which is denoted as the Kernel-OPBS method. The OPBS method selects the desired bands one by one, and in each round of lookup, it chooses the band that has the maximum distance to the hyperplane spanned by the currently selected bands. Extending this algorithm to a feature space associated with the original input space through a certain nonlinear mapping function can provide a nonlinear version of the OPBS algorithm. Although it is basically intractable to compute the mapped bands due to the high dimensionality of the feature space produced by the nonlinear mapping function, the selection criterion of the Kernel-OPBS method is actually related to only the inner products of the mapped bands; thus, the kernel function can be applied and it is unnecessary to define the nonlinear mapping function. Experimental results on different data sets demonstrate that the selected bands obtained by the Kernel-OPBS method can achieve higher pixel classification performances than that by the OPBS method. [ABSTRACT FROM AUTHOR]

Band selection (BS) tries to find a few useful bands to represent the whole hyperspectral image cube. This letter proposes a novel unsupervised BS method based on the band correlation analysis (BCA). The BCA method tries to find a subset of bands that can well represent the whole image data set. To avoid the exhaustive search, the BCA method iteratively adds the band with the good representative ability and low redundancy into the selected band set, until the sufficient quantity of bands has been obtained. The redundancy and the representative ability of one band are computed by its correlation with the currently selected bands and the remaining unselected bands, respectively. Through constructing a correlation matrix of total bands, the BCA method can find the bands that with large amounts of information and low redundancy, which ensures that the selected bands are useful for the further applications like pixels classification. Experimental results on three different data sets demonstrate that the proposed method is very effective and can achieve the best performance among the competitors. [ABSTRACT FROM AUTHOR]

Hyperspectral Band Selection (BS) aims to select a few informative and distinctive bands to represent the whole image cube. In this paper, an unsupervised BS framework named the band priority index (BPI) is proposed. The basic idea of BPI is to find the bands with large amounts of information and low correlation. Sequential forward search (SFS) is used to avoid an exhaustive search, and the objective function of BPI consist of two parts: the information metric and the correlation metric. We proposed a new band correlation metric, namely, the joint correlation coefficient (JCC), to estimate the joint correlation between a single band and multiple bands. JCC uses the angle between a band and the hyperplane determined by a band set to evaluate the correlation between them. To estimate the amount of information, the variance and entropy are used as the information metric for BPI, respectively. Since BPI is a framework for BS, other information metrics and different mathematic functions of the angle can also be used in the model, which means there are various implementations of BPI. The BPI-based methods have the advantages as follows: (1) The selected bands are informative and distinctive. (2) The BPI-based methods usually have good computational efficiencies. (3) These methods have the potential to determine the number of bands to be selected. The experimental results on different real hyperspectral datasets demonstrate that the BPI-based methods are highly efficient and accurate BS methods. [ABSTRACT FROM AUTHOR]

Hyperspectral classification is a fundamental problem for applying hyperspectral technology, and unsupervised learning is a promising direction to address the issue. Unsupervised feature learning algorithm extracts representative features, which help efficiently classify the hyperspectral pixels. This paper combines the popular contrastive learning method (prototypical contrastive learning) and the classic representation learning method (autoencoder) to design an unsupervised feature learning network for hyperspectral classification. First, two different encoders are used to extract different features as augmentation function in a contrastive network (ContrastNet). Second, the prototypical contrastive learning method is adopted to train a contrastive network. Third, features extracted by the contrastive network are used for classification. Experiments have proved that our two proposed autoencoder networks show good feature learning capabilities by themselves and the designed contrastive learning network can further learn better representative features from the two modules. The three modules compose an efficient framework for unsupervised feature learning. Our method also performs reasonably fast in the testing phase, which implies that it is applicable in practice under specific conditions. [ABSTRACT FROM AUTHOR]