Search

Soil salinization is one of the most common land desertification processes that can be found worldwide. It is a certainly severe environment hazard and threatens the stability of ecosystems. As a rapid and inexpensive tool, remote sensing technology combining with the measurements of soil spectra has been widely concerned on identifying and mapping salt effect on lands. However, as effects of the soil moisture often immerge the effects of salt to soil reflectance spectra, soil moisture became a major factor to restrict soil salinity monitoring from soil reflectance. High soil moisture content will lead to failure on soil salinity estimation from soil reflectance data. In this paper, a semianalytical model using an exponent function was developed to estimate soil salt content (SSC) under different moisture levels based on a control laboratory experiment. And the root-mean-square error and mean relative error were 0.799 g/kg and 31.294%, respectively, when the model was applied to estimate SSCs by wet soil reflectance. To sum up, considering both effects of soil moisture and soil salt on soil reflectance, the semianalytical model reduced SSC estimated error. The approach presented in this paper provides a new way of estimating soil salinity from soil spectra under various soil moisture conditions, and it will be a potential application for large-scale SSC mapping. [ABSTRACT FROM PUBLISHER]

A big challenge of hyperspectral image (HSI) classification is the small size of labeled pixels for training classifier. In real remote sensing applications, we always face the situation that an HSI scene is not labeled at all, or is with very limited number of labeled pixels, but we have sufficient labeled pixels in another HSI scene with the similar land cover classes. In this paper, we try to classify an HSI scene containing no labeled sample or only a few labeled samples with the help of a similar HSI scene having a relative large size of labeled samples. The former scene is defined as the target scene, while the latter one is the source scene. We name this classification problem as cross-scene classification. The main challenge of cross-scene classification is spectral shift, i.e., even for the same class in different scenes, their spectral distributions maybe have significant deviation. As all or most training samples are drawn from the source scene, while the prediction is performed in the target scene, the difference in spectral distribution would greatly deteriorate the classification performance. To solve this problem, we propose a dictionary learning-based feature-level domain adaptation technique, which aligns the spectral distributions between source and target scenes by projecting their spectral features into a shared low-dimensional embedding space by multitask dictionary learning. The basis atoms in the learned dictionary represent the common spectral components, which span a cross-scene feature space to minimize the effect of spectral shift. After the HSIs of two scenes are transformed into the shared space, any traditional HSI classification approach can be used. In this paper, sparse logistic regression (SRL) is selected as the classifier. Especially, if there are a few labeled pixels in the target domain, multitask SRL is used to further promote the classification performance. The experimental results on synthetic and real HSIs show the advantages of the proposed method for cross-scene classification. [ABSTRACT FROM AUTHOR]

This paper proposes a spectral-spatial classification algorithm based on principal components (PCs)-based smooth ordering and multiple 1-D interpolation, which can alleviate the general classification problems effectively. Because of the characteristics of hyperspectral image, there always exist easily separable samples (ESSs) and difficultly separable samples (DSSs) in view of the different sets of labeled samples. In this paper, the PC analysis is first used for reducing features and extracting the few first PCs of a hyperspectral image. Then, PC-based smooth ordering is designed for the separation of ESSs and DSSs, and multiple 1-D interpolation is used for the accurate classification of the ESSs. Next, the highly confident samples are selected from the ESSs by the spatial neighborhood information, which are added into the training set for the classification of DSSs. In the case of sufficient training samples, a supervised spectral-spatial method is used for classifying the DSSs by combining the spatial information built with popular extended multiattribute profiles. The proposed algorithm is compared with some state-of-the-art methods on three hyperspectral data sets. The results demonstrate that the presented algorithm achieves much better classification performance in terms of the accuracy and the computation time. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging (HSI) classification has become a popular research topic in recent years, and effective feature extraction is an important step before the classification task. Traditionally, spectral feature extraction techniques are applied to the HSI data cube directly. This paper presents a novel algorithm for HSI feature extraction by exploiting the curvelet-transformed domain via a relatively new spectral feature processing technique—singular spectrum analysis (SSA). Although the wavelet transform has been widely applied for HSI data analysis, the curvelet transform is employed in this paper since it is able to separate image geometric details and background noise effectively. Using the support vector machine classifier, experimental results have shown that features extracted by SSA on curvelet coefficients have better performance in terms of classification accuracy over features extracted on wavelet coefficients. Since the proposed approach mainly relies on SSA for feature extraction on the spectral dimension, it actually belongs to the spectral feature extraction category. Therefore, the proposed method has also been compared with some state-of-the-art spectral feature extraction techniques to show its efficacy. In addition, it has been proven that the proposed method is able to remove the undesirable artifacts introduced during the data acquisition process. By adding an extra spatial postprocessing step to the classified map achieved using the proposed approach, we have shown that the classification performance is comparable with several recent spectral–spatial classification methods. [ABSTRACT FROM PUBLISHER]

Following calibration, hyperspectral images remain affected by spatial dimension nonuniformity, i.e., stripe noise, due to stray light interference, slit contamination, and instrument instability. The full spectrum airborne hyperspectral imager (FAHI) is a Chinese next-generation pushbroom sensor with a spectral range covering the visible near-infrared, shortwave-infrared (SWIR), and thermal infrared regions with spectral sampling intervals of 2.34, 3, and 32 nm, respectively. However, the residual stripe noise remains in FAHI images after relative radiometric correction based on the laboratory calibration, especially in low signal-to-noise ratio bands. To solve this problem, a new technique combining image statistics and spatial filtering algorithms has been developed for FAHI image correction. In this method, image statistics are obtained to calculate the gain and offset of each pixel for image nonuniformity correction. Then, a spatial filter removes the residual stripes. This paper presents the principles of this method along with details of validation experiments and results. To validate the effectiveness of the proposed method, comparison with two destriping methods and quantitative analyses are carried out. Moreover, the method is applied to an SWIR hyperspectral image from the TianGong-1 spacecraft, yielding good results. The experimental results suggest that the proposed method is convenient and practical for improving the relative radiometric accuracy of airborne/spaceborne hyperspectral images. [ABSTRACT FROM AUTHOR]

Spectral variability is one of the major issues when conducting hyperspectral unmixing. Within a given image composed of some elementary materials (herein referred to as endmember classes), the spectral signatures characterizing these classes may spatially vary due to intrinsic component fluctuations or external factors (illumination). These redundant multiple endmember spectra within each class adversely affect the performance of unmixing methods. This paper proposes a mixing model that explicitly incorporates a hierarchical structure of redundant multiple spectra representing each class. The proposed method is designed to promote sparsity on the selection of both spectra and classes within each pixel. The resulting unmixing algorithm is able to adaptively recover several bundles of endmember spectra associated with each class and robustly estimate abundances. In addition, its flexibility allows a variable number of classes to be present within each pixel of the hyperspectral image to be unmixed. The proposed method is compared with other state-of-the-art unmixing methods that incorporate sparsity using both simulated and real hyperspectral data. The results show that the proposed method can successfully determine the variable number of classes present within each class and estimate the corresponding class abundances. [ABSTRACT FROM AUTHOR]

This paper introduces a novel heterogeneous domain adaptation (HDA) method for hyperspectral image (HSI) classification with a limited amount of labeled samples in both domains. The method is achieved in the way of cross-domain collaborative learning (CDCL), which is addressed via cluster canonical correlation analysis (C-CCA) and random walker (RW) algorithms. To be specific, the proposed CDCL method is an iterative process of three main components, i.e., RW-based pseudolabeling, cross-domain learning via C-CCA, and final classification based on extended RW (ERW) algorithm. First, given the initially labeled target samples as the training set (TS), the RW-based pseudolabeling is employed to update TS and extract target clusters (TCs) by fusing the segmentation results obtained by RW and ERW classifiers. Second, cross-domain learning via C-CCA is applied using labeled source samples and TCs. The unlabeled target samples are then classified with the estimated probability maps using the model trained in the projected correlation subspace. The newly estimated probability map and TS are used for updating TS again via RW-based pseudolabeling. Finally, when the iterative process converges, the result obtained by the ERW classifier using the final TS and estimated probability maps is regarded as the final classification map. Experimental results on four real HSIs demonstrate that the proposed method can achieve better performance compared with the state-of-the-art HDA and ERW methods. [ABSTRACT FROM AUTHOR]

Band selection refers to finding the most representative channels from hyperspectral images. Usually, certain objective functions are designed and combined via regularization terms. A possible drawback of these methods is that they can only generate one solution in a single run with a given band number. To overcome this problem, multiobjective (MO)-based methods, which were able to simultaneously obtain a series of subsets with different band numbers, were investigated for band selection. However, because the range of band selection problem is discrete, recently proposed weighted Tchebycheff (WT)-based MO methods may suffer weakly Pareto optimal problem. In this case, the solutions for each band number will be nonunique and no optimal solution exists. Decision makers have to manually select a unique solution for each band number. In this paper, we provide a theoretical analysis about the weakly Pareto optimal problem in band selection, and quantitatively give the boundary conditions. Moreover, we further summarize the suggestions which will help users avoid the weakly Pareto optimal problem. According to these criteria, we develop a new adaptive-penalty-based boundary intersection (APBI) framework to improve the MO algorithm in hyperspectral band selection. APBI mainly includes two advantages: 1) avoiding weakly Pareto optimum and 2) reducing the sensibility of the penalty factor. The theoretical analysis is further validated by contrast experiments. The results demonstrate that the weakly Pareto optimal solutions really exist in WT methods, while APBI can overcome this problem. [ABSTRACT FROM AUTHOR]

Recently, deep learning (DL) is of great interest in hyperspectral image (HSI) classification. Although many effective frameworks exist in the literature, the generally limited availability of training samples poses great challenges in applying DL to HSI classification. In this paper, we present a novel DL framework, namely, semisupervised stacked autoencoders (Semi-SAEs) with cotraining, for HSI classification. First, two SAEs are pretrained based on the hyperspectral features and the spatial features, respectively. Second, fine-tuning is alternatively conducted for the two SAEs in a semisupervised cotraining fashion, where the initial training set is enlarged by designing an effective region growing method. Finally, the classification probabilities obtained by the two SAEs are fused using a Markov random field model solved by iterated conditional modes. Experimental results based on three popular hyperspectral data sets demonstrate that the proposed method outperforms other state-of-the-art DL methods. [ABSTRACT FROM AUTHOR]

Despite the availability of an increasing amount of remote sensing images, problems still arise in that the knowledge from existing images is underutilized and the collection of reference knowledge for each newly obtained image is expensive. Recently, an attractive solution called “transfer learning” has received increasing attention in the remote sensing field, by transferring knowledge from source domains to help improve the learning procedure in the target domain. In this paper, we propose a sparse subspace correlation analysis-based supervised classification (SSCA-SC) method for transfer learning in hyperspectral remote sensing image classification, which is not restricted by the data dimensionality or the data acquisition sensors. Specifically, we first propose a sparse subspace correlation analysis (SSCA) method to simultaneously learn the optimal projection matrices for heterogeneous domains into a common subspace and obtain sparse reconstruction coefficients over a shared self-expressive dictionary in the derived subspace. In order to fully utilize the label information to improve the class separability, the SSCA-SC framework learns more discriminative representations for the input data by training a corresponding SSCA model for each class. As a result, the projected data belonging to the same class are maximally correlated and represented well, while those from different classes will have a low correlation. Another advantage of the SSCA-SC framework lies in the fact that it not only learns new representations for the data from different domains but it also designs a discriminative and robust classifier that properly adapts to the new representation. The proposed method was tested with three hyperspectral remote sensing data sets, and the experimental results confirm the effectiveness and reliability of the proposed SSCA-SC method. [ABSTRACT FROM AUTHOR]

Partial least-squares (PLS) regression is a popular method for modeling chemical constituents from spectroscopic data and has been widely applied to retrieve leaf chemical components via hyperspectral remote sensing. However, one persistent challenge for applying the PLS regression is the selection of informative spectral bands among the vast array of acquired spectra. No consensus has been reached yet on how to select informative bands regardless of many techniques being proposed. In this paper, we have composited four individual data sets containing a total of 598 leaf samples from various species to evaluate four different band elimination/selection methods. Results revealed that the stepwise-PLS approach was optimal to estimate leaf chlorophyll content even under different spectral resolutions, from which informative bands were identified. Informative bands, in general, include bands inside the near-infrared (NIR), and in addition, one within the blue range and one within the red range. With such combinations, the PLS regression models meet the requirement for accurate leaf chlorophyll estimation. For most PLS regression models, their accuracies decreased with the reduction of spectral resolution, but the stepwise-PLS approach could consistently estimate the chlorophyll content at different spectral resolutions (with ${R}^{2} \ge 0.77$ for resolutions < 20 nm). The findings, hence, provide valuable insights for selecting informative spectral bands for PLS analysis and lay a strong foundation for retrieving foliar biochemical content using hyperspectral remote sensing data. [ABSTRACT FROM AUTHOR]

High-spectral resolution imaging systems play a critical role in the identification and characterization of objects in a scene of interest. Unfortunately, multiple factors impair spectral resolution, as in the case of modern snapshot spectral imagers that associate each hyperpixel with a specific spectral band. In this paper, we introduce a novel postacquisition computational technique aiming to enhance the spectral dimensionality of imaging systems by exploiting the mathematical frameworks of sparse representations and dictionary learning. We propose a coupled dictionary learning model which considers joint feature spaces, composed of low- and high-spectral resolution hypercubes, in order to achieve spectral superresolution performance. We formulate our spectral coupled dictionary learning optimization problem within the context of the alternating direction method of multipliers, and we manage to update the involved quantities via closed-form expressions. In addition, we consider a realistic spectral subsampling scenario, taking into account the spectral response functions of different satellites. Moreover, we apply our spectral superresolution algorithm on real satellite data acquired by Landsat-8 and Sentinel-2 sensors. Finally, we have investigated the problem of hyperspectral image unmixing using the recovered high-spectral resolution data cube, and we are able to demonstrate that the proposed scheme provides significant value in hyperspectral image understanding techniques. Experimental results demonstrate the ability of the proposed approach to synthesize high-spectral-resolution 3-D hypercubes, achieving better performance compared to state-of-the-art resolution enhancement methods. [ABSTRACT FROM AUTHOR]

Hyperspectral unmixing decomposes a hyperspectral imagery (HSI) into a number of constituent materials and associated proportions. Recently, nonnegative tensor factorization (NTF)-based methods have been proposed for hyperspectral unmixing thanks to their capability in representing an HSI without any information loss. However, tensor factorization-based HSI processing approaches often suffer from low-signal-to-noise ratio condition of HSI and nonuniqueness of the solution. This problem can be effectively alleviated by introducing various spatial constraints into tensor factorization to suppress the noise and decrease the number of extreme, stationary, and saddle points. On the other hand, total variation (TV) adaptively promotes piecewise smoothness while preserving edges. In this paper, we propose a TV regularized matrix–vector NTF method. It takes advantage of tensor factorization in preserving global spectral–spatial information and the merits of TV in exploiting local spatial information, thus generating smooth abundance maps with preserved edges. Experimental results on synthetic and real-world data show that the proposed method outperforms the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

This paper presents a statistical detection theory approach to hyperspectral image (HSI) classification which is quite different from many conventional approaches reported in the HSI classification literature. It translates a multi-target detection problem into a multi-class classification problem so that the well-established statistical detection theory can be readily applicable to solving classification problems. In particular, two types of classification, a priori classification and a posteriori classification, are developed in corresponding to Bayes detection and maximum a posteriori (MAP) detection, respectively, in detection theory. As a result, detection probability and false alarm probability can also be translated to classification rate and false classification rate derived from a confusion classification matrix used for classification. To evaluate the effectiveness of a posteriori classification, a new a posteriori classification measure, to be called precision rate (PR), is also introduced by MAP classification in contrast to overall accuracy (OA) that can be considered as a priori classification measure and has been used for Bayes classification. The experimental results provide evidence that a priori classifier as Bayes classifier which performs well in terms of OA does not necessarily perform well as a posteriori classifier in terms of PR. That is, PR is the only criterion that can be used as a posteriori classification measure to evaluate how well a classifier performs. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new anomaly detection method for hyperspectral images based on two well-designed dictionaries: background dictionary and potential anomaly dictionary. In order to effectively detect an anomaly and eliminate the influence of noise, the original image is decomposed into three components: background, anomalies, and noise. In this way, the anomaly detection task is regarded as a problem of matrix decomposition. Considering the homogeneity of background and the sparsity of anomalies, the low-rank and sparse constraints are imposed in our model. Then, the background and potential anomaly dictionaries are constructed using the background and anomaly priors. For the background dictionary, a joint sparse representation (JSR)-based dictionary selection strategy is proposed, assuming that the frequently used atoms in the overcomplete dictionary tend to be the background. In order to make full use of the prior information of anomalies hidden in the scene, the potential anomaly dictionary is constructed. We define a criterion, i.e., the anomalous level of a pixel, by using the residual calculated in the JSR model within its local region. Then, it is combined with a weighted term to alleviate the influence of noise and background. Experiments show that our proposed anomaly detection method based on potential anomaly and background dictionaries construction can achieve superior results compared with other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) have recently exhibited an excellent performance in hyperspectral image classification tasks. However, the straightforward CNN-based network architecture still finds obstacles when effectively exploiting the relationships between hyperspectral imaging (HSI) features in the spectral–spatial domain, which is a key factor to deal with the high level of complexity present in remotely sensed HSI data. Despite the fact that deeper architectures try to mitigate these limitations, they also find challenges with the convergence of the network parameters, which eventually limit the classification performance under highly demanding scenarios. In this paper, we propose a new CNN architecture based on spectral–spatial capsule networks in order to achieve a highly accurate classification of HSIs while significantly reducing the network design complexity. Specifically, based on Hinton’s capsule networks, we develop a CNN model extension that redefines the concept of capsule units to become spectral–spatial units specialized in classifying remotely sensed HSI data. The proposed model is composed by several building blocks, called spectral–spatial capsules, which are able to learn HSI spectral–spatial features considering their corresponding spatial positions in the scene, their associated spectral signatures, and also their possible transformations. Our experiments, conducted using five well-known HSI data sets and several state-of-the-art classification methods, reveal that our HSI classification approach based on spectral–spatial capsules is able to provide competitive advantages in terms of both classification accuracy and computational time. [ABSTRACT FROM AUTHOR]

Hyperspectral unmixing has attracted much attention in recent years. Single sparse unmixing assumes that a pixel in a hyperspectral image consists of a relatively small number of spectral signatures from large, ever-growing, and available spectral libraries. Joint-sparsity (or row-sparsity) model typically enforces all pixels in a neighborhood to share the same set of spectral signatures. The two sparse models are widely used in the literature. In this paper, we propose a joint-sparsity-blocks model for abundance estimation problem. Namely, the abundance matrix of size $m\times n$ is partitioned to have one row block and $s$ column blocks and each column block itself is joint-sparse. It generalizes both the single (i.e., $s=n$) and the joint (i.e., $s=1$) sparsities. Moreover, concatenating the proposed joint-sparsity-blocks structure and low rankness assumption on the abundance coefficients, we develop a new algorithm called joint-sparse-blocks and low-rank unmixing. In particular, for the joint-sparse-blocks regression problem, we develop a two-level reweighting strategy to enhance the sparsity along the rows within each block. Simulated and real-data experiments demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel sparsity-based algorithm for anomaly detection in hyperspectral imagery. The algorithm is based on the concept that a background pixel can be approximately represented as a sparse linear combination of its spatial neighbors while an anomaly pixel cannot if the anomalies are removed from its neighborhood. To be physically meaningful, the sum-to-one and nonnegativity constraints are imposed to abundance vector based on the linear mixture model, and the upper bound constraint on sparsity level is removed for better recovery of the test pixel. First, the proposed method utilizes the redundant background information to automatically remove anomalies from the background dictionary. Then, the reconstruction error obtained by the new background dictionary is directly used for anomaly detection. Moreover, a kernel version of the proposed method is also derived to completely exploit the nonlinear feature of hyperspectral data. An important advantage of the proposed methods is their capability to adaptively model the background even when some anomaly pixels are involved. Extensive experiments have been conducted on three real hyperspectral data sets. It is demonstrated that the proposed detectors achieve a promising detection performance with a relatively low computational cost. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the temperature and emissivity separation (TES) problem from hyperspectral data acquired in the long-wave infrared region (LWIR) of the electromagnetic spectrum. We derive a general class of TES algorithms [subspace-based TES (SBTES)] relying on the assumption that the emissivity spectra of natural and man-made materials can be well represented in a given subspace of the original data space. Specifically, by exploiting the subspace representation and the Gaussian model for the noise affecting LWIR hyperspectral data, we approach TES under a statistical perspective by obtaining the maximum likelihood estimates of both the temperature and the spectral emissivity. The proposed approach originates several algorithms whose specific form depends on the particular basis matrix adopted to address the emissivity subspace. We study the performance of the presented class of algorithms and derive theoretical bounds on the accuracy of the temperature and emissivity estimators. Furthermore, by specifying two basis matrices for the emissivity subspace, we propose two different algorithms within the SBTES class. Finally, we present the results of an extensive experimental analysis carried out over simulated data to assess and compare the performance of the two presented algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a spectral-spatial feature extraction and classification framework based on an artificial neuron network in the context of hyperspectral imagery. With limited labeled samples, only spectral information is exploited for training and spatial context is integrated posteriorly at the testing stage. Taking advantage of recent advances in face recognition, a joint supervision symbol that combines softmax loss and center loss is adopted to train the proposed network, by which intraclass features are gathered while interclass variations are enlarged. Based on the learned architecture, the extracted spectrum-based features are classified by a center classifier. Moreover, to fuse the spectral and spatial information, an adaptive spectral-spatial center classifier is developed, where multiscale neighborhoods are considered simultaneously, and the final label is determined using an adaptive voting strategy. Finally, experimental results on three well-known data sets validate the effectiveness of the proposed methods compared with the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Deep learning has recently attracted significant attention in the field of hyperspectral images (HSIs) classification. However, the construction of an efficient deep neural network mostly relies on a large number of labeled samples being available. To address this problem, this paper proposes a unified deep network, combined with active transfer learning (TL) that can be well-trained for HSIs classification using only minimally labeled training data. More specifically, deep joint spectral–spatial feature is first extracted through hierarchical stacked sparse autoencoder (SSAE) networks. Active TL is then exploited to transfer the pretrained SSAE network and the limited training samples from the source domain to the target domain, where the SSAE network is subsequently fine-tuned using the limited labeled samples selected from both source and target domains by the corresponding active learning (AL) strategies. The advantages of our proposed method are threefold: 1) the network can be effectively trained using only limited labeled samples with the help of novel AL strategies; 2) the network is flexible and scalable enough to function across various transfer situations, including cross data set and intraimage; and 3) the learned deep joint spectral–spatial feature representation is more generic and robust than many joint spectral–spatial feature representations. Extensive comparative evaluations demonstrate that our proposed method significantly outperforms many state-of-the-art approaches, including both traditional and deep network-based methods, on three popular data sets. [ABSTRACT FROM AUTHOR]

Band selection is an effective approach to mitigate the “Hughes phenomenon” of hyperspectral image (HSI) classification. Recently, sparse representation (SR) theory has been successfully introduced to HSI band selection, and many SR-based methods have been developed and shown great potential and superiority. However, due to the inherent limitations of the SR scheme, i.e., individually representing each band with only a few other bands from the same subspace, the SR-based methods cannot effectively capture the global structures of the data, which limit the band selection performance. In this paper, to overcome this obstacle, the novel Laplacian-regularized low-rank subspace clustering (LLRSC) algorithm is proposed for HSI band selection. On the one hand, the low-rank subspace clustering model is introduced to capture the global structure information for the learned representation coefficient matrix and deal with the HSI band selection task in the clustering framework. On the other hand, considering the high correlation between adjacent bands, 1-D Laplacian regularization is utilized to incorporate the neighboring band information and further reduce the representation bias. Lastly, an eigenvalue analysis algorithm based on band mutation information is utilized to estimate the appropriate size of the band subset. The experimental results indicate that the proposed LLRSC algorithm outperforms the other state-of-the-art methods and achieves a very competitive band selection performance for HSIs. [ABSTRACT FROM AUTHOR]

High-spatial hyperspectral (HH) image reconstruction using both high-spatial multispectral (HM) image and low-spatial hyperspectral (LH) image over the same scene is widely used in many real applications. Nevertheless, the pair of HM image and LH image over the same scene is hard to obtain. To solve this problem, a new HH image reconstruction method using spectral library-based dictionary learning (named as HIRSL) is proposed in this paper, only from one HM image. The above reconstruction problem is formulated in the framework of sparse representation, as an estimation of the band matching matrix, the spectral dictionary, and the sparse coefficients. More specifically, a band matching method is proposed for mapping the common spectral library to a specific spectral library corresponding to the reconstructed HH image in spectral domain. Then, an efficient spectral dictionary learning method is proposed for the construction of spectral dictionary using the matched specific spectral library, which avoids the dependence of the LH image over the same scene. Finally, the sparse coefficients of the HM image with respect to the learned spectral dictionary are estimated using the alternating direction method of multipliers without nonnegative constraint. Comparison results on simulated and real data sets with the relative state-of-the-art methods demonstrate that even only using one HM image, our proposed method achieves a comparable reconstruction quality of high-spatial hyperspectral image both in spatial and spectral domains. [ABSTRACT FROM AUTHOR]

Image classification is considered to be one of the critical tasks in hyperspectral remote sensing image processing. Recently, a convolutional neural network (CNN) has established itself as a powerful model in classification by demonstrating excellent performances. The use of a graphical model such as a conditional random field (CRF) contributes further in capturing contextual information and thus improving the classification performance. In this paper, we propose a method to classify hyperspectral images by considering both spectral and spatial information via a combined framework consisting of CNN and CRF. We use multiple spectral band groups to learn deep features using CNN, and then formulate deep CRF with CNN-based unary and pairwise potential functions to effectively extract the semantic correlations between patches consisting of 3-D data cubes. Furthermore, we introduce a deep deconvolution network that improves the final classification performance. We also introduced a new data set and experimented our proposed method on it along with several widely adopted benchmark data sets to evaluate the effectiveness of our method. By comparing our results with those from several state-of-the-art models, we show the promising potential of our method. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) is often contaminated by mixed noise, which severely affects the visual quality and subsequent applications of the data. In this paper, HSI restoration based on low-rank recovery with a local neighborhood weighted spectral–spatial total variation (TV) model is proposed, which focuses on the preservation of spatial structure and spectral fidelity. The low-rank matrix model is adopted to exploit the spectral and spatial correlation information, and the $l_{1}$ -norm is used as a prior to remove the sparse noise. Furthermore, a local spatial neighborhood weighted spectral–spatial TV is utilized to jointly model the spectral–spatial prior information; specifically, the spectral and spatial differences are both considered in the TV term, and the weight is computed by considering the local neighborhood information in the spatial domain. Alternating direction method of multipliers optimization procedure is extended to solve the presented model. Experimental results demonstrate that the proposed method can remove the mixed noise, enhance the structural information simultaneously, and offer the best performance compared with several state-of-the-art HSI restoration methods. [ABSTRACT FROM AUTHOR]

Label information plays an important role in a supervised hyperspectral image classification problem. However, current classification methods all ignore an important and inevitable problem—labels may be corrupted and collecting clean labels for training samples is difficult and often impractical. Therefore, how to learn from the database with noisy labels is a problem of great practical importance. In this paper, we study the influence of label noise on hyperspectral image classification and develop a random label propagation algorithm (RLPA) to cleanse the label noise. The key idea of RLPA is to exploit knowledge (e.g., the superpixel-based spectral–spatial constraints) from the observed hyperspectral images and apply it to the process of label propagation. Specifically, the RLPA first constructs a spectral–spatial probability transform matrix (SSPTM) that simultaneously considers the spectral similarity and superpixel-based spatial information. It then randomly chooses some training samples as “clean” samples and sets the rest as unlabeled samples, and propagates the label information from the “clean” samples to the rest unlabeled samples with the SSPTM. By repeating the random assignment (of “clean” labeled samples and unlabeled samples) and propagation, we can obtain multiple labels for each training sample. Therefore, the final propagated label can be calculated by a majority vote algorithm. Experimental studies show that the RLPA can reduce the level of noisy label and demonstrates the advantages of our proposed method over four major classifiers with a significant margin—the gains in terms of the average overall accuracy, average accuracy, and kappa are impressive, e.g., 9.18%, 9.58%, and 0.1043. The MATLAB source code is available at https://github.com/junjun-jiang/RLPA. [ABSTRACT FROM AUTHOR]

Spatial information has widely been used in hyperspectal image (HSI) classification to improve classification accuracy. However, the structural information may not be fully explored when using spatial information, this paper proposes the joint collaborative representation classification with correlation matrix (CRC-CM) for HSI by using spatial correlation features in patches, which could keep the local intrinsic structure in band images. Considering spatial heterogeneity in a patch, local correlation matrices of a target neighborhood patch and training neighborhood patch are improved by a binary weight matrix and shape-adaptive neighborhood. To explore nonlinear nature of spatial features, corresponding kernel CRC-CM is also proposed. To evaluate the effectiveness of the proposed methods, three real HSIs with different degree of heterogeneity are used. The experimental results show that the proposed spatial correlation features outperform the original spectral feature and other spatial features which widely used in HSI classifiers. [ABSTRACT FROM AUTHOR]

Since the spatial distribution of surface materials is usually regular and locally continuous, it is reasonable to utilize the spectral and spatial information for the hyperspectral image classification. In this paper, a spectral–spatial Gabor surface feature (GSF) fusion approach has been proposed for hyperspectral image classification. First, Gabor magnitude pictures (GMPs) are extracted by applying a set of predefined 2-D Gabor filters to hyperspectral images. Second, the GSF has been extended to the spectral–spatial domains to comply with the 3-D structure of hyperspectral imagery, called 3-DGSF, which utilizes the first-order derivative of GMPs. Meanwhile, a classic superpixel segmentation method, called simple linear iterative clustering (SLIC), is adopted to divide the original hyperspectral image into disjoint superpixels. Third, principal component analysis is adopted to reduce the dimensionality of each extracted 3-DGSF feature cube. Next, a support vector machine classifier is applied on each reduced 3-DGSF features, and the majority voting strategy is used to obtain the classification results. Finally, the superpixel map obtained by SLIC is used to regularize the classification map, and thus, the proposed approach is named as S3-DGSF. Extensive experiments on three real hyperspectral data sets have demonstrated the higher performance of the proposed S3-DGSF approach over several state-of-the-art methods in the literature. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) denoising is a crucial preprocessing procedure to improve the performance of the subsequent HSI interpretation and applications. In this paper, a novel deep learning-based method for this task is proposed, by learning a nonlinear end-to-end mapping between the noisy and clean HSIs with a combined spatial–spectral deep convolutional neural network (HSID-CNN). Both the spatial and spectral information are simultaneously assigned to the proposed network. In addition, multiscale feature extraction and multilevel feature representation are, respectively, employed to capture both the multiscale spatial–spectral feature and fuse different feature representations for the final restoration. The simulated and real-data experiments demonstrate that the proposed HSID-CNN outperforms many of the mainstream methods in both the quantitative evaluation indexes, visual effects, and HSI classification accuracy. [ABSTRACT FROM AUTHOR]

In this paper, a self-paced joint sparse representation (SPJSR) model is proposed for the classification of hyperspectral images (HSIs). It replaces the least-squares (LS) loss in the standard joint sparse representation (JSR) model with a weighted LS loss and adopts a self-paced learning (SPL) strategy to learn the weights for neighboring pixels. Rather than predefining a weight vector in the existing weighted JSR methods, both the weight and sparse representation (SR) coefficient associated with neighboring pixels are optimized by an alternating iterative strategy. According to the nature of SPL, in each iteration, neighboring pixels with nonzero weights (i.e., easy pixels) are included for the joint SR of a testing pixel. With the increase of iterations, the model size (i.e., the number of selected neighboring pixels) is enlarged and more neighboring pixels from easy to complex are gradually added into the JSR learning process. After several iterations, the algorithm can be terminated to produce a desirable model that includes easy homogeneous pixels and excludes complex inhomogeneous pixels. Experimental results on two benchmark hyperspectral data sets demonstrate that our proposed SPJSR is more accurate and robust than existing JSR methods, especially in the case of heavy noise. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) classification, which aims to assign an accurate label for hyperspectral pixels, has drawn great interest in recent years. Although low-rank representation (LRR) has been used to classify HSI, its ability to segment each class from the whole HSI data has not been exploited fully yet. LRR has a good capacity to capture the underlying low-dimensional subspaces embedded in original data. However, there are still two drawbacks for LRR. First, the LRR does not consider the local geometric structure within data, which makes the local correlation among neighboring data easily ignored. Second, the representation obtained by solving LRR is not discriminative enough to separate different data. In this paper, a novel locality- and structure-regularized LRR (LSLRR) model is proposed for HSI classification. To overcome the above-mentioned limitations, we present locality constraint criterion and structure preserving strategy to improve the classical LRR. Specifically, we introduce a new distance metric, which combines both spatial and spectral features, to explore the local similarity of pixels. Thus, the global and local structures of HSI data can be exploited sufficiently. In addition, we propose a structural constraint to make the representation have a near-block-diagonal structure. This helps to determine the final classification labels directly. Extensive experiments have been conducted on three popular HSI data sets. And the experimental results demonstrate that the proposed LSLRR outperforms other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) exhibit good performance in image processing tasks, pointing themselves as the current state-of-the-art of deep learning methods. However, the intrinsic complexity of remotely sensed hyperspectral images still limits the performance of many CNN models. The high dimensionality of the HSI data, together with the underlying redundancy and noise, often makes the standard CNN approaches unable to generalize discriminative spectral–spatial features. Moreover, deeper CNN architectures also find challenges when additional layers are added, which hampers the network convergence and produces low classification accuracies. In order to mitigate these issues, this paper presents a new deep CNN architecture specially designed for the HSI data. Our new model pursues to improve the spectral–spatial features uncovered by the convolutional filters of the network. Specifically, the proposed residual-based approach gradually increases the feature map dimension at all convolutional layers, grouped in pyramidal bottleneck residual blocks, in order to involve more locations as the network depth increases while balancing the workload among all units, preserving the time complexity per layer. It can be seen as a pyramid, where the deeper the blocks, the more feature maps can be extracted. Therefore, the diversity of high-level spectral–spatial attributes can be gradually increased across layers to enhance the performance of the proposed network with the HSI data. Our experiments, conducted using four well-known HSI data sets and 10 different classification techniques, reveal that our newly developed HSI pyramidal residual model is able to provide competitive advantages (in terms of both classification accuracy and computational time) over the state-of-the-art HSI classification methods [ABSTRACT FROM AUTHOR]

Recently, low-rank embedding (LRE) has yielded satisfactory results in dimensionality reduction (DR), for which low-rank representation and projection learning are integrated into one model to generate robust low-dimensional features. However, LRE requires to convert samples into vectors even if the data naturally appear in high-order form. Furthermore, LRE fails to take the label information into consideration. To address these problems, this paper proposes a novel supervised DR method based on multilinear algebra, i.e., the algebra of tensors. By the motivation of extending LRE into tensor space and simultaneously combining the tensor discriminant analysis, we establish tensor low-rank discriminant embedding (TLRDE) model for hyperspectral image (HSI) DR. The model of TLRDE is solved by an alternative iteration algorithm, whose convergence is also mathematically proven. The proposed TLRDE method employs the tensor representation to preserve the intrinsic geometrical structure, uses low-rank reconstruction to uncover the potential relationship among the data points, and combines label information to enhance the discriminability of features. Moreover, the proposed TLRDE does not suffer from the small sample size problem. The experimental results on three real HSI data sets validate the effectiveness of our proposed TLRDE method. [ABSTRACT FROM AUTHOR]

In the field of hyperspectral image classification, a widely used way for objective performance evaluation of different classification methods is calculating three accuracy indexes, i.e., the overall accuracy, the average accuracy, and the Kappa coefficient. These accuracy indexes are obtained by comparing the classification results with the ground truth, i.e., a reference classification map labeled by human experts. In this paper, the effect of ground truths on the objective performance evaluation of hyperspectral image classification is studied. The purpose is to investigate, if the ground truth is insufficient, whether the above accuracy indexes can be completely responsible. Furthermore, in order to measure the robustness of different classification methods to those insufficient ground truths, four evaluation metrics, i.e., the Pearson linear correlation coefficient, root-mean-square error, Spearman’s rank correlation coefficient, and Kendall’s rank correlation coefficient have been adopted for further analysis. Based on these experiments, an interesting conclusion can be obtained that insufficient ground truths may limit the assessment capability of existing accuracy indexes. This underlines that overoptimistic performance evaluations may exist and stresses the demand of designing more appropriate accuracy indexes for objective performance evaluation with insufficient ground truths. [ABSTRACT FROM AUTHOR]

For hyperspectral image classification, high-dimensional spectral features not only increase the computational and storage burden but also degrade the classification accuracy due to the Hughes phenomenon. Band selection is an important technique to solve these issues without destroying the interpretation of data. This paper presents a matrix-based margin-maximization method of band selection with data-driven diversity. In particular, the matrices composed of adjacent pixels in space are fed to the hinge loss function with a row-sparse constraint. This constraint is used to select the expected bands and preserve the spatial structure information simultaneously while maximizing the margin between the classes. In consideration of the continuity of bands in the spectral dimension, a novel regularization term that is continually updated according to the current context is added to promote the differential expression of dissimilar bands. Finally, the one-against-all parallel mechanism is used to learn a coefficient matrix for each class, and class-related bands are then carefully selected by a partitioning strategy (e.g., k-means clustering) based on the learned coefficient matrix. Experiments are conducted on three hyperspectral data sets and four widely used classifiers. The experimental results have shown that our proposed method is superior to several state-of-the-art methods, especially when the number of selected bands is relatively small. [ABSTRACT FROM AUTHOR]

This paper presents an unsupervised approach to band selection in hyperspectral images that considers both spectral and spatial information in data dimensionality reduction. The approach exploits the concepts of superpixel and chunklets for identifying the spectral channels most suitable to be used in classification for discriminating land-cover classes. The segmented superpixels can be regarded as many small spectral homogeneous and spatial neighboring pixel chunklets. Based on the observation that the superpixel chunklets achieve high homogeneity and consistency within land-cover classes, a series of band criteria (BC) is identified by learning the optimal band transformation that results in low within-class variability and high total variability. Then, the learned BC, which are called band measures, are given in input to an efficient clustering algorithm, i.e., the affinity propagation, for selecting highly separable bands with low redundancy. The effectiveness of proposed approach was assessed on three hyperspectral data sets. The results point out the advantages of the proposed methods over five state-of-the-art unsupervised methods. [ABSTRACT FROM AUTHOR]

In this paper, we present tensor-based linear and nonlinear models for hyperspectral data classification and analysis. By exploiting the principles of tensor algebra, we introduce new classification architectures, the weight parameters of which satisfy the rank-1 canonical decomposition property. Then, we propose learning algorithms to train both linear and nonlinear classifiers. The advantages of the proposed classification approach are that: 1) it significantly reduces the number of weight parameters required to train the model (and thus the respective number of training samples); 2) it provides a physical interpretation of model coefficients on the classification output; and 3) it retains the spatial and spectral coherency of the input samples. The linear tensor-based model exploits the principles of logistic regression, assuming the rank-1 canonical decomposition property among its weights. For the nonlinear classifier, we propose a modification of a feedforward neural network (FNN), called rank-1 FNN, since its weights satisfy again the rank-1 canonical decomposition property. An appropriate learning algorithm is also proposed to train the network. Experimental results and comparisons with state-of-the-art classification methods, either linear (e.g., linear support vector machine) or nonlinear (e.g., deep learning), indicate the outperformance of the proposed scheme, especially in the cases where a small number of training samples is available. [ABSTRACT FROM AUTHOR]

Kernel nonnegative matrix factorization (KNMF) is an extension of NMF designed to capture nonlinear dependence features in data matrix through kernel functions. In KNMF, the size of the kernel matrices is closely associated with the input data matrix, of which the calculation consumes a large amount of memory and computing resource. When applied on large-scale hyperspectral data, KNMF often meets the bottleneck of memory and may cause the overflow of memory. And when dealing with dynamically acquired data, KNMF requires recomputation of the whole data set when newly acquired data arrived, which produces huge memory and computing resource requirements. To reduce the usage of memory and improve the computational efficiency when applying KNMF on large scale and dynamic hyperspectral data, we extend KNMF by introducing partition matrix theory and considering the relationships among dividing blocks. The decomposition results of hyperspectral data are derived from much smaller scale matrices containing the formerly achieved results and the newly data blocks incrementally. In this paper, we propose an incremental KNMF (IKNMF) to reduce the computing requirements for large-scale data in hyperspectral unmixing. An improved IKNMF (IIKNMF) is also proposed to further improve the abundance results of IKNMF. Experiments are conducted on both synthetic and real hyperspectral data sets. The experimental results demonstrate that the proposed methods can effectively save memory resources without degrading the unmixing performance and the proposed IIKNMF can achieve better abundance results than IKNMF and KNMF. [ABSTRACT FROM AUTHOR]

Most nonlinear mixture models and unmixing methods in the literature assume implicitly that the degrees of multiple scatterings at each band are the same. However, it is commonly against the practical situation that spectral mixing is intrinsically wavelength dependent, and the nonlinear intensity varies along with bands. In this paper, a band-wise nonlinear unmixing algorithm is proposed to circumvent this drawback. Pixel dependent probability parameters of the recent multilinear mixing model that represent different orders of nonlinear contributions are vectorized. Therefore, each band can get a scalar probability parameter which explicitly corresponds to the nonlinear intensity at that band. Before solving the extended model, abundances’ sparsity and probability parameters’ smoothness are exploited to build two physical constraints. After incorporating them into the objective function as regularization terms, the issue of local minima can be well alleviated to produce better solutions. Finally, alternating direction method of multipliers is applied to solve the constrained optimization problem and implement the nonlinear spectral unmixing. Experiments are further carried out with current model-based simulated data, physical-based synthetic data of virtual vegetated areas, and real hyperspectral remote sensing images, to provide a more reasonable validation for the developed model and algorithm. In comparison with state-of-the-art nonlinear unmixing methods, this method performs better in explaining the band dependent nonlinear mixing effect for improving the unmixing accuracy. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging is a widely used technique in remote sensing in which an imaging spectrometer collects hundreds of images (at different wavelength channels) for the same area on the surface of the earth. In the last two decades, several methods (unsupervised, supervised, and semisupervised) have been proposed to deal with the hyperspectral image classification problem. Supervised techniques have been generally more popular, despite the fact that it is difficult to collect labeled samples in real scenarios. In particular, deep neural networks, such as convolutional neural networks (CNNs), have recently shown a great potential to yield high performance in the hyperspectral image classification. However, these techniques require sufficient labeled samples in order to perform properly and generalize well. Obtaining labeled data is expensive and time consuming, and the high dimensionality of hyperspectral data makes it difficult to design classifiers based on limited samples (for instance, CNNs overfit quickly with small training sets). Active learning (AL) can deal with this problem by training the model with a small set of labeled samples that is reinforced by the acquisition of new unlabeled samples. In this paper, we develop a new AL-guided classification model that exploits both the spectral information and the spatial-contextual information in the hyperspectral data. The proposed model makes use of recently developed Bayesian CNNs. Our newly developed technique provides robust classification results when compared with other state-of-the-art techniques for hyperspectral image classification. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) classification is an active and important research task driven by many practical applications. To leverage deep learning models especially convolutional neural networks (CNNs) for HSI classification, this paper proposes a simple yet effective method to extract hierarchical deep spatial feature for HSI classification by exploring the power of off-the-shelf CNN models, without any additional retraining or fine-tuning on the target data set. To obtain better classification accuracy, we further propose a unified metric learning-based framework to alternately learn discriminative spectral–spatial features, which have better representation capability and train support vector machine (SVM) classifiers. To this end, we design a new objective function that explicitly embeds a metric learning regularization term into SVM training. The metric learning regularization term is used to learn a powerful spectral–spatial feature representation by fusing spectral feature and deep spatial feature, which has small intraclass scatter but big between class separation. By transforming HSI data into new spectral–spatial feature space through CNN and metric learning, we can pull the pixels from the same class closer, while pushing the different class pixels farther away. In the experiments, we comprehensively evaluate the proposed method on three commonly used HSI benchmark data sets. State-of-the-art results are achieved when compared with the existing HSI classification methods. [ABSTRACT FROM AUTHOR]

Accurately estimating the elements in Earth observations is crucial when assessing specific features such as air quality index, water pollution, or urbanization process behavior. Moreover, physical–chemical composition can be retrieved from hyperspectral images when proper spectral unmixing architectures are employed. Specifically, when linear and nonlinear combinations of endmembers (pure spectral components) are accurately characterized, hyperspectral unmixing plays a key role in understanding and quantifying phenomena occurring over the instantaneous field-of-view. Thus, reliable detection of nonlinear reflectance behavior can play a key role in enhancing hyperspectral unmixing performance. In this paper, two new methods for adaptive design of mixture models for hyperspectral unmixing are introduced. One of the methods relies on exploiting geometrical features of hyperspectral signatures in terms of nonorthogonal projections onto the space induced by the endmembers’ spectra. Then, an iterative process aims at understanding the order of local nonlinearity that is displayed by each endmember over every pixel. An improved version of an artificial neural network-based approach for nonlinearity order information is also considered and compared. Experimental results show that the proposed approaches are actually able to retrieve thorough information on the nature of the nonlinear effects over the image, while providing excellent performance in reconstructing the given data sets. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for spectral unmixing of remotely sensed hyperspectral data. It exploits probabilistic latent topics in order to take advantage of the semantics pervading the latent topic space when identifying spectral signatures and estimating fractional abundances from hyperspectral images. Despite the contrasted potential of topic models to uncover image semantics, they have been merely used in hyperspectral unmixing as a straightforward data decomposition process. This limits their actual capabilities to provide semantic representations of the spectral data. The proposed model, called dual-depth sparse probabilistic latent semantic analysis (DEpLSA), makes use of two different levels of topics to exploit the semantic patterns extracted from the initial spectral space in order to relieve the ill-posed nature of the unmixing problem. In other words, DEpLSA defines a first level of deep topics to capture the semantic representations of the spectra, and a second level of restricted topics to estimate endmembers and abundances over this semantic space. An experimental comparison in conducted using the two standard topic models and the seven state-of-the-art unmixing methods available in the literature. Our experiments, conducted using four different hyperspectral images, reveal that the proposed approach is able to provide competitive advantages over available unmixing approaches. [ABSTRACT FROM AUTHOR]

Hyperspectral unmixing is an important processing step for many hyperspectral applications, mainly including: 1) estimation of pure spectral signatures (endmembers) and 2) estimation of the abundance of each endmember in each pixel of the image. In recent years, nonnegative matrix factorization (NMF) has been highly attractive for this purpose due to the nonnegativity constraint that is often imposed in the abundance estimation step. However, most of the existing NMF-based methods only consider the information in a single layer while neglecting the hierarchical features with hidden information. To alleviate such limitation, in this paper, we propose a new sparsity-constrained deep NMF with total variation (SDNMF-TV) technique for hyperspectral unmixing. First, by adopting the concept of deep learning, the NMF algorithm is extended to deep NMF model. The proposed model consists of pretraining stage and fine-tuning stage, where the former pretrains all factors layer by layer and the latter is used to reduce the total reconstruction error. Second, in order to exploit adequately the spectral and spatial information included in the original hyperspectral image, we enforce two constraints on the abundance matrix. Specifically, the $L_{1/2}$ constraint is adopted, since the distribution of each endmember is sparse in the 2-D space. The TV regularizer is further introduced to promote piecewise smoothness in abundance maps. For the optimization of the proposed model, multiplicative update rules are derived using the gradient descent method. The effectiveness and superiority of the SDNMF-TV algorithm are demonstrated by comparing with other unmixing methods on both synthetic and real data sets. [ABSTRACT FROM AUTHOR]

Recent advances in computer vision using deep learning with RGB imagery (e.g., object recognition and detection) have been made possible thanks to the development of large annotated RGB image data sets. In contrast, multispectral image (MSI) and hyperspectral image (HSI) data sets contain far fewer labeled images, in part due to the wide variety of sensors used. These annotations are especially limited for semantic segmentation, or pixelwise classification, of remote sensing imagery because it is labor intensive to generate image annotations. Low-shot learning algorithms can make effective inferences despite smaller amounts of annotated data. In this paper, we study low-shot learning using self-taught feature learning for semantic segmentation. We introduce: 1) an improved self-taught feature learning framework for HSI and MSI data and 2) a semisupervised classification algorithm. When these are combined, they achieve the state-of-the-art performance on remote sensing data sets that have little annotated training data available. These low-shot learning frameworks will reduce the manual image annotation burden and improve semantic segmentation performance for remote sensing imagery. [ABSTRACT FROM AUTHOR]

Jointly combining the spatial and spectral features has proved to dramatically improve the performance of classifying hyperspectral image. Recently, utilizing neural networks to automatically model the spatial-spectral feature representations for hyperspectral images has become of great interest. This paper proposes a simple but innovative framework to classify hyperspectral image with two shallow convolutional neural networks (CNNs). First, principal component analysis whitening is applied to decorrelate hundreds of spectral bands. Instead of selecting the principal components to reduce the spectral dimensionality, we retain all the spectral bands but compress the image cuboid into a one-channel spectral quilt by stacking spectral patches. In this way, not only all the spectral information is retained but also the computational complexity of training a neural network is reduced compared with conventional networks that directly input the spectral volumes. Moreover, the spectral quilt will contain some novel textural patterns that are effective at distinguishing classes. Two shallow CNNs are then applied to classify the spectral quilts. As shown in the experiments, both networks can outperform the standard analysis methods. [ABSTRACT FROM AUTHOR]

Band selection, by choosing a set of representative bands in a hyperspectral image, is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms which can only obtain suboptimal solutions toward a specific objective function. This paper focuses on clustering-based band selection and proposes a new framework to solve the above dilemma, claiming the following contributions: 1) an optimal clustering framework, which can obtain the optimal clustering result for a particular form of objective function under a reasonable constraint; 2) a rank on clusters strategy, which provides an effective criterion to select bands on existing clustering structure; and 3) an automatic method to determine the number of the required bands, which can better evaluate the distinctive information produced by certain number of bands. In experiments, the proposed algorithm is compared with some state-of-the-art competitors. According to the experimental results, the proposed algorithm is robust and significantly outperforms the other methods on various data sets. [ABSTRACT FROM AUTHOR]

In this paper, we propose a spectral–spatial unified network (SSUN) with an end-to-end architecture for the hyperspectral image (HSI) classification. Different from traditional spectral–spatial classification frameworks where the spectral feature extraction (FE), spatial FE, and classifier training are separated, these processes are integrated into a unified network in our model. In this way, both FE and classifier training will share a uniform objective function and all the parameters in the network can be optimized at the same time. In the implementation of the SSUN, we propose a band grouping-based long short-term memory model and a multiscale convolutional neural network as the spectral and spatial feature extractors, respectively. In the experiments, three benchmark HSIs are utilized to evaluate the performance of the proposed method. The experimental results demonstrate that the SSUN can yield a competitive performance compared with existing methods. [ABSTRACT FROM AUTHOR]

Deep neural networks have been shown to be useful for the classification of hyperspectral images, particularly when a large amount of labeled data is available. However, we may not have enough reference data to train a deep neural network for many practical geospatial image analysis applications. To address this issue, in this paper, we propose to use a deep feature alignment neural network to carry out the domain adaptation, where the labeled data from a supplementary data source can be utilized to improve the classification performance in a domain where otherwise limited labeled data are available. In the proposed model, discriminative features for the source and target domains are first extracted using deep convolutional recurrent neural networks and then aligned with each other layer-by-layer by mapping features from each layer to transformed common subspaces at each layer. Experimental results are presented with two data sets. One of these data sets represents domain adaptation between images acquired at different times, while the other data set represents a very unique and challenging domain adaptation problem, representing source and target images that are acquired using different hyperspectral imagers that collect data from different viewpoints and platforms (a ground-based forward-looking street view of objects acquired at the close range and an aerial hyperspectral image). We demonstrate that the proposed deep learning framework enables the robust classification of the target domain data by leveraging information from the source domain. [ABSTRACT FROM AUTHOR]

In this paper, a novel method is introduced to detect and correct mislabeled training samples for hyperspectral image classification. First, domain transform recursive filtering-based feature extraction is used to improve the separability of the training samples. Then, constrained energy minimization-based object detection is performed on the training set with each training sample serving as the object spectrum. Finally, the label of each training sample is verified or corrected based on the averaged detection probabilities of different classes. Experiments performed on real hyperspectral data sets demonstrate the effectiveness of the proposed method in improving classification performance with respect to the classifier trained with the original training set that contains a number of mislabeled samples. [ABSTRACT FROM AUTHOR]