Search

The current hyperspectral image classification (HSIC) model based on the convolutional neural network for feature extraction and softmax classifier has been prone to the barrier of label prediction with limited samples. Substituting for the enormously complicated work of terrain labeling, few-shot learning provides a popular option for HSIC with very few annotated samples. In this article, we proposed a novel edge-inferring framework with the metalearning paradigm for hyperspectral few-shot classification (HSFSC), in which a graph neural network for similarity measurement is first presented to iteratively infer edge labels with the exploitation of instance-level similarity and the distribution-level similarity. Besides, in the metatraining stage, the pixel prediction model and the patch prediction model based on edge-inferring architecture are concretized jointly to improve the classification accuracy of the test samples. Expressly, at the metatesting phase, the dynamic task-guided self-diagnosis strategy is developed for the first time to diagnose the samples separability of the current classification task, which is responsible for dynamically assigning the most reliable results based on the generated reliability grade of the sample. The extensive experimental results and analysis of three hyperspectral image datasets demonstrate the superiority of the proposed HSFSC architecture compared with other advanced methods. [ABSTRACT FROM AUTHOR]

To achieve real-time abundance estimation of hyperspectral images and improve the accuracy and efficiency of estimation, this article proposes a new band processing approach for abundance estimation, to be called sequential band fusion (SBF). To achieve SBF, a new band priority mechanism is proposed. It is derived from the concept of orthogonal subspace projection (OSP) by orthogonalizing undesired targets using projection while minimizing the variance resulting from the background. By taking advantage of OSP, the interfering effects caused by all undesired targets can be eliminated, and then, the detector produced by a target of interest can be further used as a measure of prioritizing bands as well as a means of searching bands for this particular target. As a result, two ranking-based band priority criteria (RP), called maximum OSP-based RP (MaxOSP-RP) and minimum OSP-based RP (MinOSP-RP), and two searching-based band priority criteria (SP), called sequential feedforward band search (SFBS) and sequential backward band search (SBBS), can be derived. We provide a detailed theoretical description and formula derivation of the SBF and combine it with band sequence (BSQ), RP, and SP to propose three different fusion mechanisms: SBF based on BSQ (SBF-BSQ), SBF based on RP (SBF-RP), and SBF with SP (SBF-SP) to make the fusion mechanism applied to different scenarios. Experimental results show that the proposed methods perform well for abundance estimation. [ABSTRACT FROM AUTHOR]

This article presents a new approach, called progressive band subset fusion (PBSF) for hyperspectral anomaly detection. Unlike band selection (BS) which selects bands according to band prioritization or band search strategies, PBSF fuses band subsets progressively during data collection processing. It is completely opposite to BS that must be done after data are acquired and then select bands by removing spectral redundancy as post-data processing. To accomplish PBSF, two versions of PBSF are derived: PBSF of the multiple-band subset (PBSF-MBS) and PBSF of uniform BS (PBSF-UBS). In particular, the fusion process takes place in an anomaly detector from a real-time processing perspective. Three approaches are developed to realize PBSF of two-band subsets simultaneously: PBSF-band sequential (PBSF-BSQ), PBSF-RT, and PBSF-zigzag. Extensive experiments demonstrate that PBSF has advantages over BS in many ways. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) provided with a substantial number of correlated bands causes calculation consumption and an undesirable “dimension disaster” problem for the classification. Band selection (BS) is an effective measure to reduce the information redundancy with the physics spectrum preserved for HSI. Although the existing BS methods have achieved noticeable progress, the correlation between neighbor bands still needs to be mined deeply for an effective selection criterion. This article proposes a BS approach to collecting the discriminative band subset for HSI classification (HSIC), which adopts the self-supervised learning paradigm to implement the BS by the auxiliary spectrum rebuilding (SR) task. In specific, we utilized a convolutional neural network (CNN) and a graph convolutional network (GCN) for the spectral–spatial feature extraction. Next, GCN and CNN are developed for the refinement of the band correlation sequentially. Afterward, the selected bands in terms of the acquired correlation are fed into the presented self-supervised SR network for spectral reconstruction. Simultaneously, the proposed architecture completed the selection with the optimization of the band reconstruction by a defined loss function. In this way, we supply substitution for selection criterion and path searching through the end-to-end framework. The extensive experimental results and analysis demonstrated that the proposed hybrid architecture provided a competitive band subset for the classification, and the accuracies with different types of classifiers are more effective than the compared BS methods. [ABSTRACT FROM AUTHOR]

When predicting data for which limited supervised information is available, hyperspectral target detection methods based on deep transfer learning expect that the network will not require considerable retraining to generalize to unfamiliar application contexts. Meta-learning is an effective and practical framework for solving this problem in deep learning. This article proposes a new meta-learning based hyperspectral target detection using Siamese network (MLSN). First, a deep residual convolution feature embedding module is designed to embed spectral vectors into the Euclidean feature space. Then, the triplet loss is used to learn the intraclass similarity and interclass dissimilarity between spectra in embedding feature space by using the known labeled source data on the designed three-channel Siamese network for meta-training. The learned meta-knowledge is updated with the prior target spectrum through a designed two-channel Siamese network to quickly adapt to the new detection task. It should be noted that the parameters and structure of the deep residual convolution embedding modules of each channel in the Siamese network are identical. Finally, the spatial information is combined, and the detection map of the two-channel Siamese network is processed by the guiding image filtering and morphological closing operation, and a final detection result is obtained. Based on the experimental analysis of six real hyperspectral image datasets, the proposed MLSN has shown its excellent comprehensive performance. [ABSTRACT FROM AUTHOR]

This article proposes a new approach to hyperspectral band processing for anomaly detection, to be called sequential band fusion (SBF), derived from the band sequential (BSQ) data acquisition format used by a hyperspectral imaging sensor which fuses one single band at a time with previously fused band subset sequentially. In order to realize SBF, four versions, SBF-BSQ, initial band driven SBF (IBD-SBF), band prioritization SBF (BP-SBF), and band selection SBF (BS-SBF), are developed. Furthermore, to validate the sequentially fused results by SBF identical to that produced by combining all joint bands together, its mathematical theory and derivations are also presented. Finally, the full utility of SBF in anomaly detection is demonstrated through extensive experiments. [ABSTRACT FROM AUTHOR]

Wealthy spectral information provided by hyperspectral image (HSI) offers great benefits for many applications in hyperspectral data exploitation. However, processing such high-dimensional data volumes that may result in redundant bands due to its high interband correlation will be a challenge. For target detection and classification, this is particularly true since there may only need a relatively small number of bands that respond one particular target of interest well, while most of other bands do not. Band selection (BS) is a major dimensionality reduction technique to remove the redundant bands and selects a few bands to represent the entire image. However, how to eliminate the effect of uninteresting targets with similar spectra on detection of interesting targets is a severe issue arising in target detection for BS. This article develops a new approach called target-constrained interference-minimized BS (TCIMBS) which can be used to select band subset for specific target detection, while annihilating targets of no interest and suppressing interferers and background. Its idea is derived from target-constrained interference-minimized filter (TCIMF). By taking advantage of TCIMF, two band prioritization (BP) criteria called forward minimum variance BP (FMinV-BP) and backward maximum variance BP (BMaxV-BP) along with their three band search-based BS counterparts called sequential forward TCIMBS (SF-TCIMBS), sequential backward TCIMBS (SB-TCIMBS), and improved SB-TCIMBS (SB-TCIMBS*) are derived. The experimental results suggest that TCIMBS can improve the detection accuracy and also achieve better performance in comparison with several state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Low-rank and sparsity-matrix decomposition (LRaSMD) has received considerable interests lately. One of effective methods for LRaSMD is called go decomposition (GoDec), which finds low-rank and sparse matrices iteratively subject to the predetermined low-rank matrix order $m$ and sparsity cardinality $k$. This article presents an orthogonal subspace-projection (OSP) version of GoDec to be called OSP-GoDec, which implements GoDec in an iterative process by a sequence of OSPs to find desired low-rank and sparse matrices. In order to resolve the issues of empirically determining $p = m+ j$ and $k$ , the well-known virtual dimensionality (VD) is used to estimate $p$ in conjunction with the Kuybeda et al. developed minimax-singular value decomposition (MX-SVD) in the maximum orthogonal complement algorithm (MOCA) to estimate $k$. Consequently, LRaSMD can be realized by implementing OSP-GoDec using $p$ and $k$ determined by VD and MX-SVD, respectively. Its application to anomaly detection demonstrates that the proposed OSP-GoDec coupled with VD and MX-SVD performs very effectively and better than the commonly used LRaSMD-based anomaly detectors. [ABSTRACT FROM AUTHOR]

This letter introduces a new approach to hyperspectral image classification (HSIC), called progressive band selection processing of hyperspectral image classification (PBSP-HSIC), which performs classification in multiple stages in the sense that each stage performs HSIC progressively according to a specifically selected band subset. Interestingly, such PBSP-HSIC offers a rare view of how different classes are classified in progressive stages, which has never been explored in the past. The experimental results also show that PBSP-HSIC performs better than HSIC using full bands. [ABSTRACT FROM AUTHOR]

This paper presents a class information (CI)-based band selection (BS) approach to hyperspectral image classification (HSIC). It introduces a new concept from an information theory point of view, CI which can be used to determine an appropriate weight imposed on each class of interest. Specifically, two types of criteria, intraclass information criterion (IC) and interclass IC are derived as CI probabilities to measure CI that can be used to determine the number of training samples required to be selected for each class. With such CI-calculated probabilities, another new concept called class self-information (CSI) is also defined for each class that can be further used to define the class entropy (CE) so that CSI and CE can be used to determine the number of bands required for BS, $n_{\text {BS}}$. In order to find desired $n_{\text {BS}}$ bands, two types of BS methods based on CSI and CE are custom-designed, called single class signature-constrained BS (SCSC-BS) which utilizes the constrained energy minimization (CEM) to constrain each individual class signature to select bands for a particular class according to its CSI-determined $n_{\text {BS}}$ and a multiple class signatures-constrained BS (MCSC-BS) which takes advantage of linearly constrained minimum variance (LCMV) to constrain all class signatures to select CE-determined $n_{\text {BS}}$ bands for all classes. These SCSC-BS and MCSC-BS selected bands are then used to perform classification and evaluated by CI-weighted classification measures by real image experiments. The results show that HSIC using judiciously selected partial bands as well as CI-weighted measures can improve HSIC with using full bands. [ABSTRACT FROM AUTHOR]

This paper develops a new approach to band selection for multiple-target detection, called constrained-target band selection (CTBS). Its idea is derived from the concept of constrained energy minimization (CEM) by constraining a target of interest, while minimizing the variance resulting from the background (BKG). By taking advantage of CEM, the variance produced by a target of interest can be further used as a measure of prioritizing bands as well as a means of selecting bands for this particular target. As a result, two CTBS-based band prioritization (BP) criteria, called minimal variance-based BP (MinV-BP) and maximal variance-based BP (MaxV-BP), and two CTBS-based BS methods, called sequential forward CTBS (SF-CTBS) and sequential backward CTBS (SB-CTBS), can be derived for multiple-target detection. Since the bands selected by CTBS vary with targets of interest used to constrain CEM, in order for CTBS to be applied to multiple targets, a new fusion technique, called band fusion selection (BFS), is further developed for CTBS to integrate bands selected by different targets so that CTBS can work for all targets. Unlike most BS methods for target detection which generally simultaneously select a fixed set of bands for all targets of interest, the ideas of constraining multiple-target detection and using BFS are novelty of this paper. Experimental results show that CTBS performs well for multiple-target detection. [ABSTRACT FROM AUTHOR]

Deep convolutional neural networks (CNN) have led to a successful breakthrough for hyperspectral image (HSI) classification. In this paper, a CNN system embedded with an extracted hashing feature is proposed for HSI classification that utilizes the semantic information of the HSI. First, a series of hash functions are constructed to enhance the presentation of the locality and discriminability of classes. Then, the sparse binary hash codes calculated by the discriminative learning algorithm are combined into the original HSI. Next, we design a CNN framework with seven hidden layers to obtain the hierarchical feature maps with both spectral and spatial information for classification. A deconvolution layer aims to improve the robustness of the proposed CNN network and is used to enhance the expression of deep features. The proposed CNN classification architecture achieves powerful distinguishing ability from different classes. The extensive experiments on real hyperspectral images results demonstrate that the proposed CNN network can effectively improve the classification accuracy after the embedding of the extracted semantic features. [ABSTRACT FROM AUTHOR]

Anomaly detection (AD) generally finds targets that are spectrally distinct from their surrounding neighborhoods but cannot discriminate its detected targets one from another. It cannot even perform classification because there is no prior knowledge about the data. This paper presents a new approach to AD, to be called a posteriori AD for unlabeled anomaly classification where a posteriori indicates that information obtained directly from processing data is used as new information for subsequent data processing. In particular, a posteriori AD uses a Gaussian filter to capture spatial correlation of detected anomalies as a posteriori information which is included as new information for further AD. In doing so, a posteriori AD develops an iterative version of AD, referred to as iterative anomaly detection (IAD), which implements AD by feeding back Gaussian-filtered AD maps in an iterative manner. It then uses an unsupervised target detection algorithm to identify spectrally distinct anomalies that can be used to specify particular anomaly classes. To terminate IAD, an automatic stopping rule is also derived. Finally, it uses identified distinct anomalies as desired target signatures to implement constrained energy minimization (CEM) to classify all detected anomalies into unlabeled classes. The experimental results show that a posteriori AD is indeed very effective in unlabeled anomaly classification. [ABSTRACT FROM AUTHOR]

This paper develops a new Neyman–Pearson detection approach, to be called band-specified virtual dimensionality (BSVD), to estimating the number of bands required by band selection (BS), $n_{\mathrm {BS}}$ , as well as finding desired bands at the same time. Its idea is derived from target-specified virtual dimensionality (TSVD) where targets under hypotheses as signal sources in TSVD are replaced with bands as signal sources and the test statistics derived for a Neyman–Pearson detector (NPD) is signal-to-noise ratio (SNR) that is used to derive orthogonal subspace projection (OSP) approach for hyperspectral image classification and dimensionality reduction. Accordingly, the resulting virtual dimensionality is referred to as OSP-based BSVD. Several benefits resulting from BSVD cannot be offered by the traditional BS methods. One is its direct approach to dealing with $n_{\mathrm {BS}}$. Another is no-search strategy needed for finding optimal bands. Instead, it uses NPD to determine and rank desired bands for band prioritization. Most importantly, it determines $n_{\mathrm {BS}}$ and finds desired bands simultaneously and progressively. [ABSTRACT FROM AUTHOR]

Despite the fact that many approaches to hyperspectral image classification are reported, specifically spectral–spatial based methods, this paper presents a rather different approach from a viewpoint of mixed pixel classification, referred to iterative target-constrained interference-minimization classifier (ITCIMC), which includes an iterative Gaussian filtered feedback process to capture the spatial contextual information so as to improve hyperspectral image classification for multiple classes at one-shot operation. In order to evaluate classification performance more effectively, new performance measures other than commonly used overall accuracy (OA) are introduced, particularly, precision rate (PR), misclassification (MC) rate which have been overlooked in hyperspectral image classification. To illustrate the differences among OA, MC rate, and PR, two concepts of a priori classification and a posteriori classification are also proposed from a statistical signal processing point of view. As shown by experiments, ITCMC generally performs significantly better than the existing spectral–spatial hyperspectral image classification techniques in terms of PR and MC rate at the expense of slight loss of OA. [ABSTRACT FROM PUBLISHER]

Hyperspectral image classification faces various levels of difficulty due to the use of different types of hyperspectral image data. Recently, spectral–spatial approaches have been developed by jointly taking care of spectral and spatial information. This paper presents a completely different approach from a subpixel target detection view point. It implements four stage processes, a preprocessing stage, which uses band selection (BS) and nonlinear band expansion, referred to as BS-then-nonlinear expansion (BSNE), a detection stage, which implements constrained energy minimization (CEM) to produce subpixel target maps, and an iterative stage, which develops an iterative CEM (ICEM) by applying Gaussian filters to capture spatial information, and then feeding the Gaussian-filtered CEM-detection maps back to BSNE band images to reprocess CEM in an iterative manner. Finally, in the last stage Otsu’s method is applied to converting ICEM-detected real-valued maps to discrete values for classification. The entire process is called BSNE-ICEM. Experimental results demonstrate BSNE-ICEM, which has advantages over support vector machine-based approaches in many aspects, such as easy implementation, fewer parameters to be used, and better false classification and precision rates. [ABSTRACT FROM PUBLISHER]