Search

Although the collaborative use of hyperspectral images (HSIs) and LiDAR data in land cover classification tasks has demonstrated significant importance and potential, several challenges remain. Notably, the heterogeneity in cross-modal information integration presents a major obstacle. Furthermore, most existing research relies heavily on category names, neglecting the rich contextual information from language descriptions. Visual-language pretraining (VLP) has achieved notable success in image recognition within natural domains by using multimodal information to enhance training efficiency and effectiveness. VLP has also shown great potential for land cover classification in remote sensing. This paper introduces a dual-sensor multimodal semantic collaborative classification network (DSMSC2N). It uses large language models (LLMs) in an instruction-driven manner to generate land cover category descriptions enriched with domain-specific knowledge in remote sensing. This approach aims to guide the model to accurately focus on and extract key features. Simultaneously, we integrate and optimize the complementary relationship between HSI and LiDAR data, enhancing the separability of land cover categories and improving classification accuracy. We conduct comprehensive experiments on benchmark datasets like Houston 2013, Trento, and MUUFL Gulfport, validating DSMSC2N's effectiveness compared to various baseline methods. [ABSTRACT FROM AUTHOR]

The vision transformer (ViT) has demonstrated performance comparable to that of convolutional neural networks (CNN) in the hyperspectral image classification domain. This is achieved by transforming images into sequence data and mining global spectral-spatial information to establish remote dependencies. Nevertheless, both the ViT and CNNs have their own limitations. For instance, a CNN is constrained by the extent of its receptive field, which prevents it from fully exploiting global spatial-spectral features. Conversely, the ViT is prone to excessive distraction during the feature extraction process. To be able to overcome the problem of insufficient feature information extraction caused using by a single paradigm, this paper proposes an MLP-mixer and a graph convolutional enhanced transformer (MGCET), whose network consists of a spatial-spectral extraction block (SSEB), an MLP-mixer, and a graph convolutional enhanced transformer (GCET). First, spatial-spectral features are extracted using SSEB, and then local spatial-spectral features are fused with global spatial-spectral features by the MLP-mixer. Finally, graph convolution is embedded in multi-head self-attention (MHSA) to mine spatial relationships and similarity between pixels, which further improves the modeling capability of the model. Correlation experiments were conducted on four different HSI datasets. The MGEET algorithm achieved overall accuracies (OAs) of 95.45%, 97.57%, 98.05%, and 98.52% on these datasets. [ABSTRACT FROM AUTHOR]

Hyperspectral pansharpening is crucial for the improvement of the usability of images in various applications. However, it remains underexplored due to a scarcity of data. The primary goal of pansharpening is to enhance the spatial resolution of hyperspectral images by reconstructing missing spectral information without compromising consistency with the original data. This paper addresses the data gap by presenting a new hyperspectral dataset specifically designed for pansharpening and the evaluation of several deep learning strategies using this dataset. The new dataset has two crucial features that make it invaluable for deep learning hyperspectral pansharpening research. (1) It presents the highest cardinality of images in the state of the art, making it the first statistically relevant dataset for hyperspectral pansharpening evaluation, and (2) it includes a wide variety of scenes, ensuring robust generalization capabilities for various approaches. The data, collected by the ASI PRISMA satellite, cover about 262,200 km2 and their heterogeneity is ensured by a random sampling of the Earth's surface. The analysis of the deep learning methods consists in the adaptation of these approaches to the PRISMA hyperspectral data and the quantitative and qualitative evaluation of their performance in this new scenario. The investigation included two settings: Reduced Resolution (RR) to evaluate the techniques in a controlled environment and Full Resolution (FR) for a real-world evaluation. In addition, for the sake of completeness, we have also included machine-learning-free approaches in both scenarios. Our comprehensive analysis reveals that data-driven neural network methods significantly outperform traditional approaches, demonstrating a superior adaptability and performance in hyperspectral pansharpening under both RR and FR protocols. [ABSTRACT FROM AUTHOR]

This paper presents findings from a spaceborne Earth observation experiment utilizing a novel, ultra-compact hyperspectral imaging camera aboard a 3U CubeSat. Leveraging the Offner optical scheme, the camera's hyperspectrometer captures hyperspectral images of terrestrial regions with a 200 m spatial resolution and 12 nanometer spectral resolution across a 400 to 1000 nanometer wavelength range, covering 150 channels in the visible and near-infrared spectrums. The hyperspectrometer is specifically designed for deployment on a 3U CubeSat nanosatellite platform, featuring a robust all-metal cylindrical body of the hyperspectrometer, and a coaxial arrangement of the optical elements ensures optimal compactness and vibration stability. The performance of the imaging hyperspectrometer was rigorously evaluated through numerical simulations prior to construction. Analysis of hyperspectral data acquired over a year-long orbital operation demonstrates the 3U CubeSat's ability to produce various vegetation indices, including the normalized difference vegetation index (NDVI). A comparative study with the European Space Agency's Sentinel-2 L2A data shows a strong agreement at critical points, confirming the 3U CubeSat's suitability for hyperspectral imaging in the visible and near-infrared spectrums. Notably, the ISOI 3U CubeSat can generate unique index images beyond the reach of Sentinel-2 L2A, underscoring its potential for advancing remote sensing applications. [ABSTRACT FROM AUTHOR]

P. ginseng is a precious traditional Chinese functional food, which is used for both medicinal and food purposes, and has various effects such as immunomodulation, anti-tumor and anti-oxidation. The growth year of P. ginseng has an important impact on its medicinal and economic values. Fast and nondestructive identification of the growth year of P. ginseng is crucial for its quality evaluation. In this paper, we propose a FC-CNN network that incorporates spectral and spatial features of hyperspectral images to characterize P. ginseng from different growth years. The importance ranking of the spectra was obtained using the random forest method for optimal band selection. Based on the hyperspectral reflectance data of P. ginseng after radiometric calibration and the images of the best five VNIR bands and five SWIR bands selected, the year-by-year identification of P. ginseng age and its identification experiments for food and medicinal purposes were conducted, and the FC-CNN network and its FCNN and CNN branch networks were tested and compared in terms of their effectiveness in the identification of P. ginseng growth years. It has been experimentally verified that the best year-by-year recognition was achieved by utilizing images from five visible and near-infrared important bands and all spectral curves, and the recognition accuracy of food and medicinal use reached 100%. The FC-CNN network is significantly better than its branching model in the effect of edible and medicinal identification. The results show that for P. ginseng growth year identification, VNIR images have much more useful information than SWIR images. Meanwhile, the FC-CNN network utilizing the spectral and spatial features of hyperspectral images is an effective method for the identification of P. ginseng growth year. [ABSTRACT FROM AUTHOR]

The joint use of hyperspectral image (HSI) and Light Detection And Ranging (LiDAR) data has been widely applied for land cover classification because it can comprehensively represent the urban structures and land material properties. However, existing methods fail to combine the different image information effectively, which limits the semantic relevance of different data sources. To solve this problem, in this paper, an Attention-guided Fusion and Classification framework based on Convolutional Neural Network (AFC-CNN) is proposed to classify the land cover based on the joint use of HSI and LiDAR data. In the feature extraction module, AFC-CNN employs the three dimensional convolutional neural network (3D-CNN) combined with a multi-scale structure to extract the spatial-spectral features of HSI, and uses a 2D-CNN to extract the spatial features from LiDAR data. Simultaneously, the spectral attention mechanism is adopted to assign weights to the spectral channels, and the cross attention mechanism is introduced to impart significant spatial weights from LiDAR to HSI, which enhance the interaction between HSI and LiDAR data and leverage the fusion information. Then two feature branches are concatenated and transferred to the feature fusion module for higher-level feature extraction and fusion. In the fusion module, AFC-CNN adopts the depth separable convolution connected through the residual structures to obtain the advanced features, which can help reduce computational complexity and improve the fitting ability of the model. Finally, the fused features are sent into the linear classification module for final classification. Experimental results on three datasets, i.e., Houston, MUUFL and Trento datasets show that the proposed AFC-CNN framework achieves better classification accuracy compared with the state-of-the-art algorithms. The overall accuracy of AFC-CNN on Houston, MUUFL and Trento datasets are 94.2%, 95.3% and 99.5%, respectively. [ABSTRACT FROM AUTHOR]

In Blind Hyperspectral Unmixing, the accuracy of the estimated number of endmembers affects the succeeding steps of extraction of endmember signatures and acquiring their fractional abundances. The characteristics of endmember signature depend on the nature of the material on the ground and share similar characteristics for variants of the same material. In this paper, we introduce a new concept of sub-endmembers to identify similar materials that are variants of a global endmember. Identifying the sub-endmembers will provide a meaningful interpretation of the endmember variability along with increased unmixing accuracy. This paper proposes a new algorithm exploiting both the spatial and spectral information present in hyperspectral data. The hyperspectral data are segmented into homogenous regions (superpixels) based on the Simple Linear Iterative Clustering (SLIC) algorithm, and the mean spectral of each region is accounted for in finding the global endmembers. The difference of eigenvalues-based thresholding method is used to find the number of global and sub-endmembers. The method has been tested on synthetic and real hyperspectral data and has successfully estimated the number of global endmembers as well as sub-endmembers. The method is also compared with other state-of-the-art methods, and better performances are obtained at a reasonably lower computational complexity. [ABSTRACT FROM AUTHOR]

Currently, an approach involving a coder with a combined structure for compressing images combining several different coders, the system for connecting them to various bit planes, and the control system for these connections have not been studied. Thus, there is a need to develop a structure and study the effectiveness of a combined codec for compressing images of various types without loss in the spatial domain based on arithmetic and (Run-Length Encoding) RLE-coding algorithms. The essence of separate effective coding is to use independent coders of the same type or one coder connected to the planes alternately in order to compress the higher and lower bit planes of the image or their combinations. In this paper, the results of studying the effectiveness of using a combination of arithmetic and RLE coding for several types of images are presented. As a result of developing this structure, the effectiveness of combined coding for compressing the differences in the channels of hyperspectral images (HSI) has been established, as hyperspectral images consist of multi-spectral bands, instead of just the typical three bands (RGB) or (YCbCr) found in regular images. Where, each pixel in a hyperspectral image represents the entire spectrum of light reflected by the object or scene at that particular location. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging often suffers from various types of noise, including sensor non-uniformity and atmospheric disturbances. Removing multiple types of complex noise in hyperspectral images (HSIs) while preserving high fidelity in spectral dimensions is a challenging task in hyperspectral data processing. Existing methods typically focus on specific types of noise, resulting in limited applicability and an inadequate ability to handle complex noise scenarios. This paper proposes a denoising method based on a network that considers both the spatial structure and spectral differences of noise in an image data cube. The proposed network takes into account the DN value of the current band, as well as the horizontal, vertical, and spectral gradients as inputs. A multi-resolution convolutional module is employed to accurately extract spatial and spectral noise features, which are then aggregated through residual connections at different levels. Finally, the residual mixed noise is approximated. Both simulated and real case studies confirm the effectiveness of the proposed denoising method. In the simulation experiment, the average PSNR value of the denoised results reached 31.47 at a signal-to-noise ratio of 8 dB, and the experimental results on the real data set Indian Pines show that the classification accuracy of the denoised hyperspectral image (HSI) is improved by 16.31% compared to the original noisy version. [ABSTRACT FROM AUTHOR]

This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution. This algorithm seamlessly integrates graph regularization and tensor ring decomposition, presenting an innovative fusion model that effectively leverages the spatial structure and spectral information inherent in hyperspectral images. At the core of the algorithm lies an iterative optimization process embedded within the objective function. This iterative process incrementally refines latent feature representations. It incorporates spatial smoothness constraints and graph regularization terms to enhance the quality of super-resolution reconstruction and preserve image features. Specifically, low-resolution hyperspectral images (HSIs) and high-resolution multispectral images (MSIs) are obtained through spatial and spectral downsampling, which are then treated as nodes in a constructed graph, efficiently fusing spatial and spectral information. By utilizing tensor ring decomposition, HSIs and MSIs undergo feature decomposition, and the objective function is formulated to merge reconstructed results with the original images. Through a multi-stage iterative optimization procedure, the algorithm progressively enhances latent feature representations, leading to super-resolution hyperspectral image reconstruction. The algorithm's significant achievements are demonstrated through experiments, producing sharper, more detailed high-resolution hyperspectral images (HRIs) with an improved reconstruction quality and retained spectral information. By combining the advantages of graph regularization and tensor ring decomposition, the proposed algorithm showcases substantial potential and feasibility within the domain of hyperspectral image super-resolution. [ABSTRACT FROM AUTHOR]

Wheat seed classification is a critical task for ensuring crop quality and yield. However, the characteristics of wheat seeds can vary due to variations in climate, soil, and other environmental factors across different years. Consequently, the present classification model is no longer adequate for accurately classifying novel samples. To tackle this issue, this paper proposes an adaptive domain feature separation (ADFS) network that utilizes hyperspectral imaging techniques for cross-year classification of wheat seed varieties. The primary objective is to improve the generalization ability of the model at a minimum cost. ADFS leverages deep learning techniques to acquire domain-irrelevant features from hyperspectral data, thus effectively addressing the issue of domain shifts across datasets. The feature spaces are divided into three parts using different modules. One shared module aligns feature distributions between the source and target datasets from different years, thereby enhancing the model's generalization and robustness. Additionally, two private modules extract class-specific features and domain-specific features. The transfer mechanism does not learn domain-specific features to reduce negative transfer and improve classification accuracy. Extensive experiments conducted on a two-year dataset comprising four wheat seed varieties demonstrate the effectiveness of ADFS in wheat seed classification. Compared with three typical transfer learning networks, ADFS can achieve the best accuracy of wheat seed classification with small batch samples updated, thereby addressing new seasonal variability. [ABSTRACT FROM AUTHOR]

Thanks to its richness in extractable features, Hyperspectral images (HSI) find an accelerated use in medical, industrial, agricultural, and environmental fields. In this paper, we present a wavelet-based reduction technique that creates a Hypercube containing the most significant features extracted from the original HSI and representing a multi-dimensional array that is utilized for training a Convolutional Neural Network (CNN), which is designed here to classify different types of surfaces or materials. The performance of this approach is tested and proved using two distinct datasets. Then, we compare the same approach with the PCA, a widely used reduction method. The most important contribution of this paper is the implementation of an FPGA-based parallel accelerator to train the same suggested CNN in only 10% of the computational time compared to the classical CPU-based techniques. The Microblaze will be explained and exploited here to play the role of an embedded microprocessor. • A Wavelet-based technique gives a reduced Hypercube rich in pixels spectrum features. • A CNN is designed to classify different types of surfaces or materials. • An FPGA-based parallel design is created to reduce 90% of the CNN training time. • The Microblaze is used to play the role of an embedded microprocessor. [ABSTRACT FROM AUTHOR]

This paper proposes a preprocessing algorithm for aerospace hyperspectral images based on a mathematical apparatus effectively applied in pre-compression transformation problems. In particular, several methods have been analyzed for hyperspectral image (signal) preprocessing from the point of view of digital signal processing algorithms. These mathematical methods are used for problems of filtering signals from noise of different natures and for compression and restoration of signals after their transmission through communication channels. The results of comparative analysis of preparatory processing of lossy compression algorithms based on wavelet analysis, discrete and orthogonal transforms are also given, demonstrating minimization of loss level of reconstructed decoded images. The performance of the proposed preprocessing algorithms with quality metrics is presented to evaluate the quality of the reconstructed hyperspectral aerospace images. The results of this study can be applied and used in the tasks of special processing of hyperspectral images, as well as fundamental knowledge of mathematical apparatuses of the proposed orthogonal preprocessing, considering the specificity of the data which is very important in obtaining images ready for compression for the subsequent identification of objects of the Earth's surface and using such mathematical transformations at the hyperspectral image preprocessing stage before compression provides efficient archiving of the obtained data, while reducing the communication channel load. Through the use of quality metrics of the reconstructed images, the preprocessing algorithm provides an understanding of the threshold of the peak signal-to-noise ratio value and the efficiency of its application to calculate and minimize the loss rate. [ABSTRACT FROM AUTHOR]

Anomaly detection is a crucial task for hyperspectral image processing. Most popular methods detect anomalies at the pixel level, while a few algorithms for anomaly detection only utilize subpixel level unmixing technology to extract features without fundamentally analyzing the anomalies. To better detect and separate the anomalies from the background, this paper proposes a dual-view hyperspectral anomaly detection method by taking account of the anomaly analysis at both levels mentioned. At the pixel level, the spectral angular distance is adopted to calculate the similarities between the central pixel and its neighbors in order to further mine the spatial consistency for anomaly detection. On the other hand, from the aspect of the subpixel level analysis, it is considered that the difference between the anomaly and the background usually arises from dissimilar endmembers, where the unmixing will be fully implemented. Finally, the detection results of both views are fused to obtain the anomalies. Overall, the proposed algorithm not only interprets and analyzes the anomalies from dual levels, but also fully employs the unmixing for anomaly detection. Additionally, the performance of multiple data sets also confirmed the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Since individual neural networks have limited deep expressiveness and effectiveness, many learning frameworks face difficulties in the availability and balance of sample selection. As a result, in change detection, it is difficult to upgrade the hit rate of a high-performance model on both positive and negative pixels. Therefore, supposing that the sacrificed components coincide perfectly with the important evaluation objectives, such as positives, it would lose more than gain. To address this issue, in this paper, we propose a multi-visual collaborative deep network (MV-CDN) served by three collaborative network members that consists of three subdivision approaches, the CDN with one collaborator (CDN-C), CDN with two collaborators (CDN-2C), and CDN with three collaborators (CDN-3C). The purpose of the collaborator is to re-evaluate the feature elements in the network transmission, and thus to translate the group-thinking into a more robust field of vision. We use three sets of public double-temporal hyperspectral images taken by the AVIRIS and HYPERION sensors to show the feasibility of the proposed schema. The comparison results have confirmed that our proposed schema outperforms the existing state-of-the-art algorithms on the three tested datasets, which demonstrates the broad adaptability and progressiveness of the proposal. [ABSTRACT FROM AUTHOR]

Object tracking using Hyperspectral Images (HSIs) obtains satisfactory result in distinguishing objects with similar colors. Yet, the tracking algorithm tends to fail when the target undergoes deformation. In this paper, a SiamRPN based hyperspectral tracker is proposed to deal with this problem. Firstly, a band selection method based on a genetic optimization method is designed for rapidly reducing the redundancy of information in HSIs. Specifically, three bands with highest joint entropy are selected. To solve the problem that the information of the template in the SiamRPN model decays over time, an update network is trained on the dataset from general objective tracking benchmark, which can obtain effective cumulative templates. The use of cumulative templates with spectral information makes it easier to track the deformed target. In addition, transfer learning of the pre-trained SiamRPN is designed to obtain a better model for HSIs. The experimental results show that the proposed tracker can obtain good tracking results over the entire public dataset, and that it is better than the other popular trackers when the target's deformation is qualitatively and quantitatively compared, achieving an overall success rate of 57.5% and a deformation challenge success rate of 70.8%. [ABSTRACT FROM AUTHOR]

The low spatial resolution of hyperspectral images means that existing mixed pixels rely heavily on spectral information, making it difficult to differentiate between the target of interest and the background. The endmember extraction method is powerful in enhancing spatial structure information for hyperspectral anomaly detection, whereas most approaches are based on matrix representation, which inevitably destroys the spatial or spectral information. In this paper, we treated the hyperspectral image as a third-order tensor and proposed a novel anomaly detection method based on a low-rank linear mixing model of the scene background. The obtained abundance maps possessed more distinctive features than the raw data, which was beneficial for identifying anomalies in the background. Specifically, the low-rank tensor background was approximated as the mode-3 product of an abundance tensor and endmember matrix. Due to the distinctive features of the background's abundance maps, we characterized them by tensor regularization and imposed low rankness through CP decomposition, smoothness, and sparsity. In addition, we utilized the ℓ 1 , 1 , 2 -norm to characterize the tube-wise sparsity of the anomaly, since it accounted for a small portion of the scene. The experimental results obtained using five real datasets demonstrated the outstanding performance of our proposed method. [ABSTRACT FROM AUTHOR]

The continuous changes in Land Use and Land Cover (LULC) produce a significant impact on environmental factors. Highly accurate monitoring and updating of land cover information is essential for environmental protection, sustainable development, and land resource planning and management. Recently, Collaborative Representation (CR)-based methods have been widely used in land cover classification from Hyperspectral Images (HSIs). However, most CR methods consider the spatial information of HSI by taking the average or weighted average of spatial neighboring pixels of each pixel to improve the land cover classification performance, but do not take the spatial structure information for pixels into account. To address this problem, a novel Weighted Spatial–Spectral Joint CR Classification (WSSJCRC) method is proposed in this paper. WSSJCRC only performs spatial filtering on HSI through a weighted spatial filtering operator to alleviate the spectral shift caused by adjacency effect, but also utilizes the labeled training pixels to simultaneously represent each test pixel and its spatial neighborhood pixels to consider the spatial structure information of each test pixel to assist the classification of the test pixel. On this basis, the kernel version of WSSJCRC (i.e., WSSJKCRC) is also proposed, which projects the hyperspectral data into the kernel-induced high-dimensional feature space to enhance the separability of nonlinear samples. The experimental results on three real hyperspectral scenes show that the proposed WSSJKCRC method achieves the best land cover classification performance among all the compared methods. Specifically, the Overall Accuracy (OA), Average Accuracy (AA), and Kappa statistic (Kappa) of WSSJKCRC reach 96.21%, 96.20%, and 0.9555 for the Indian Pines scene, 97.02%, 96.64%, and 0.9605 for the Pavia University scene, and 95.55%, 97.97%, and 0.9504 for the Salinas scene, respectively. Moreover, the proposed WSSJKCRC method obtains the promising accuracy with OA over 95% on the three hyperspectral scenes under the situation of small-scale labeled samples, thus effectively reducing the labeling cost for HSI. [ABSTRACT FROM AUTHOR]

Corn diseases are one of the significant constraints to high–quality corn production, and accurate identification of corn diseases is of great importance for precise disease control. Corn anthracnose and brown spot are typical diseases of corn, and the early symptoms of the two diseases are similar, which can be easily misidentified by the naked eye. In this paper, to address the above problems, a three–dimensional–two–dimensional (3D–2D) hybrid convolutional neural network (CNN) model combining a band selection module is proposed based on hyperspectral image data, which combines band selection, attention mechanism, spatial–spectral feature extraction, and classification into a unified optimization process. The model first inputs hyperspectral images to both the band selection module and the attention mechanism module and then sums the outputs of the two modules as inputs to a 3D–2D hybrid CNN, resulting in a Y–shaped architecture named Y–Net. The results show that the spectral bands selected by the band selection module of Y–Net achieve more reliable classification performance than traditional feature selection methods. Y–Net obtained the best classification accuracy compared to support vector machines, one–dimensional (1D) CNNs, and two–dimensional (2D) CNNs. After the network pruned the trained Y–Net, the model size was reduced to one–third of the original size, and the accuracy rate reached 98.34%. The study results can provide new ideas and references for disease identification of corn and other crops. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging can simultaneously obtain the spatial morphological information of the ground objects and the fine spectral information of each pixel. Through the quantitative analysis of the spectral characteristics of objects, it can complete the task of classification and recognition of ground objects. The appearance of imaging spectrum technology provides great advantages for military target detection and promotes the continuous improvement of military reconnaissance levels. At the same time, spectral camouflage materials and methods that are relatively resistant to hyperspectral reconnaissance technology are also developing rapidly. In order to study the reconnaissance effect of visible/near-infrared hyperspectral images on camouflage targets, this paper analyzes the spectral characteristics of different camouflage targets using the hyperspectral images obtained in the visible and near-infrared bands under natural conditions. Two groups of experiments were carried out. The first group of experiments verified the spectral camouflage characteristics and camouflage effects of different types of camouflage clothing with grassland as the background; the second group of experiments verified the spectral camouflage characteristics and camouflage effects of different types of camouflage paint sprayed on boards and steel plates. The experiment shows that the hyperspectral image based on the near-infrared band has a good reconnaissance effect for different camouflage targets, and the near-infrared band is an effective "window" band for detecting and distinguishing true and false targets. However, the stability of the visible/near-infrared band detection for the target identification under camouflage paint is poor, and it is difficult to effectively distinguish the object materials under the same camouflage paint. This research confirms the application ability of detection based on the visible/near-infrared band, and points out the direction for the development of imaging detectors and camouflage materials in the future. [ABSTRACT FROM AUTHOR]

Recent classification-oriented proposals to thematic maps building from hyperspectral images have used both semisupervised approaches and spatial information for correction of spectral classification. Semisupervised approaches enrich the training data set adding similar samples to each class, whereas spatial correction is based on the natural assumption of thematic class spatial compactness. In this paper, we propose and validate the following innovations: 1) a new spectral classifier, which is called anticipative hybrid extreme rotation forest (AHERF); 2) a spatial–spectral semisupervised approach; and 3) a final spatial classification correction step. The novel heterogeneous ensemble learning approach AHERF starts with a model selection phase, using a small subsample of the training data, in order to define a ranking-based selection probability distribution of the classifier architectures that will be used in the ensemble, so that the architecture best adapted to the data domain will be used more frequently to train individual classifiers in the ensemble. After this initial phase, AHERF trains a heterogeneous ensemble applying random rotations to bootstrapped samples of the remaining training data, aiming to obtain diversified and data-domain adapted individual classifiers. The natural assumption that spatially close pixels will most likely have highly correlated values is exploited in two phases of the process pipeline. First, semisupervised label assignment is supported by spectral similarity and spatial proximity. Unsupervised spectral similarity is detected by latent class discovery. In this paper, we use a clustering algorithm (i.e., k-means). Second, maximizing class spatial compactness removes classification errors that appear as speckle noise in the classification image. The whole approach aims to use minimal sets of labeled pixels for training, which we call the seed training data set. Testing results are computed over the entire image ground truth. For comparison, we provide results in several steps: 1) of classification by AHERF and competing classifiers built by semisupervised training and 2) after spatial correction. We validate the approach on several conventional benchmarking images, achieving results which are comparable with state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Terrain classification is an important research direction in the field of remote sensing. Hyperspectral remote sensing image data contain a large amount of rich ground object information. However, such data have the characteristics of high spatial dimensions of features, strong data correlation, high data redundancy, and long operation time, which lead to difficulty in image data classification. A data dimensionality reduction algorithm can transform the data into low-dimensional data with strong features and then classify the dimensionally reduced data. However, most classification methods cannot effectively extract dimensionality-reduced data features. In this paper, different dimensionality reduction and machine learning supervised classification algorithms are explored to determine a suitable combination method of dimensionality reduction and classification for hyperspectral images. Soft and hard classification methods are adopted to achieve the classification of pixels according to diversity. The results show that the data after dimensionality reduction retain the data features with high overall feature correlation, and the data dimension is drastically reduced. The dimensionality reduction method of unified manifold approximation and projection and the classification method of support vector machine achieve the best terrain classification with 99.57% classification accuracy. High-precision fitting of neural networks for soft classification of hyperspectral images with a model fitting correlation coefficient (R2) of up to 0.979 solves the problem of mixed pixel decomposition. [ABSTRACT FROM AUTHOR]

An accurate identification of objects from the acquisition system depends on the clear segmentation and classification of remote sensing images. With the limited financial resources and the high intra-class variations, the earlier proposed algorithms failed to handle the sub-optimal dataset. The building of an efficient training set iteratively in active learning (AL) approaches improves classification performance. The heuristics-based AL provides better results with the inheritance of contextual information and the robustness to noise variations. The uncertainty exists pixel variations make the heuristics-based AL fail to handle the remote sensing image classification. Previously, we focused on the extraction of clear textural pattern information by using the extended differential pattern-based relevance vector machine (EDP-AL). This paper extends that work into the novel pixel-certainty activity learning (PCAL) based on the information about textural patterns obtained from the extended differential pattern (EDP). Initially, distributed intensity filtering (DIF) is used to eliminate noise from the image, and then histogram equalization (HE) is used to improve the image quality. The EDP is used to merge and classify different labels for each image sample, and this algorithm expresses the textural information. The PCAL technique is used to classify the HSI patterns that are important in remote sensing applications using this pattern collection. Pavia University and Indian Pines (IP) are the datasets used to validate the performance of the proposed PCAL (PU). The ability of PCAL to accurately categorize land cover types is demonstrated by a comparison of the proposed PCAL with existing algorithms in terms of classification accuracy and the Kappa coefficient. [ABSTRACT FROM AUTHOR]

Compressive covariance estimation has arisen as a class of techniques whose aim is to obtain second-order statistics of stochastic processes from compressive measurements. Recently, these methods have been used in various image processing and communications applications, including denoising, spectrum sensing, and compression. Notice that estimating the covariance matrix from compressive samples leads to ill-posed minimizations with severe performance loss at high compression rates. In this regard, a regularization term is typically aggregated to the cost function to consider prior information about a particular property of the covariance matrix. Hence, this paper proposes an algorithm based on the projected gradient method to recover low-rank or Toeplitz approximations of the covariance matrix from compressive measurements. The proposed algorithm divides the compressive measurements into data subsets projected onto different subspaces and accurately estimates the covariance matrix by solving a single optimization problem assuming that each data subset contains an approximation of the signal statistics. Furthermore, gradient filtering is included at every iteration of the proposed algorithm to minimize the estimation error. The error induced by the proposed splitting approach is analytically derived along with the convergence guarantees of the proposed method. The proposed algorithm estimates the covariance matrix of hyperspectral images from synthetic and real compressive samples. Extensive simulations show that the proposed algorithm can effectively recover the covariance matrix of hyperspectral images from compressive measurements with high compression ratios ($8-15\%$ approx) in noisy scenarios. Moreover, simulations and theoretical results show that the filtering step reduces the recovery error up to twice the number of eigenvectors. Finally, an optical implementation is proposed, and real measurements are used to validate the theoretical findings. [ABSTRACT FROM AUTHOR]

Superpixel segmentation (SS) methods have been proven to be feasible in improving the performance of hybrid algorithms on hyperspectral images (HSIs). In this paper, a superpixel segmentation algorithm based on the information measures with color histogram driving (IM-CHD) was proposed. First, Shannon entropy was applied to measure the image information and preliminarily select spectral bands. Mutual information (MI) is derived from the concept of entropy and measures the statistical dependence between two random variables. Also, MI can effectively identify the redundant spectral bands. Therefore, in this paper, both MI and color matching functions (CMF) were used to select the most useful spectral bands. Second, the selected spectral bands were combined into a false color image containing the main spectral information. A local optimization algorithm named "hill climbing" was used to achieve the superpixel segmentation. Finally, parameter selection experiments and comparative experiments were performed on two hyperspectral data sets. The experimental results showed that the IM-CHD method was more efficient and accurate than other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

The accurate and timely monitoring of land cover types is of great significance for the scientific planning, rational utilization, effective protection and management of land resources. In recent years, land cover classification based on hyperspectral images and the collaborative representation (CR) model has become a hot topic in the field of remote sensing. However, most of the existing CR models do not consider the problem of sample imbalance, which affects the classification performance of CR models. In addition, the Tikhonov regularization term can improve the classification performance of CR models, but greatly increases the computational complexity of CR models. To address the above problems, a local nearest neighbor (LNN) method is proposed in this paper to select the same number of nearest neighbor samples from each nearest class of the test sample to construct a dictionary. This is then introduced into the original collaborative representation classification (CRC) method and CRC with Tikhonov regularization (CRT) for land cover classification, denoted as LNNCRC and LNNCRT, respectively. To verify the effectiveness of the proposed LNNCRC and LNNCRT methods, the classification performance and running time of the proposed methods are compared with those of six popular CR models on a hyperspectral scene with nine land cover types. The experimental results show that the proposed LNNCRT method achieves the best land cover classification performance, and the proposed LNNCRC and LNNCRT methods not only further exclude the interference of irrelevant training samples and classes, but also effectively eliminate the influence of imbalanced training samples, so as to improve the classification performance of CR models and effectively reduce the computational complexity of CR models. [ABSTRACT FROM AUTHOR]

Due to sensor instability and atmospheric interference, hyperspectral images (HSIs) often suffer from different kinds of noise which degrade the performance of downstream tasks. Therefore, HSI denoising has become an essential part of HSI preprocessing. Traditional methods tend to tackle one specific type of noise and remove it iteratively, resulting in drawbacks including inefficiency when dealing with mixed noise. Most recently, deep neural network-based models, especially generative adversarial networks, have demonstrated promising performance in generic image denoising. However, in contrast to generic RGB images, HSIs often possess abundant spectral information; thus, it is non-trivial to design a denoising network to effectively explore both spatial and spectral characteristics simultaneously. To address the above issues, in this paper, we propose an end-to-end HSI denoising model via adversarial learning. More specifically, to capture the subtle noise distribution from both spatial and spectral dimensions, we designed a Residual Spatial-Spectral Module (RSSM) and embed it in an UNet-like structure as the generator to obtain clean images. To distinguish the real image from the generated one, we designed a discriminator based on the Multiscale Feature Fusion Module (MFFM) to further improve the quality of the denoising results. The generator was trained with joint loss functions, including reconstruction loss, structural loss and adversarial loss. Moreover, considering the lack of publicly available training data for the HSI denoising task, we collected an additional benchmark dataset denoted as the Shandong Feicheng Denoising (SFD) dataset. We evaluated five types of mixed noise across several datasets in comparative experiments, and comprehensive experimental results on both simulated and real data demonstrate that the proposed model achieves competitive results against state-of-the-art methods. For ablation studies, we investigated the structure of the generator as well as the training process with joint losses and different amounts of training data, further validating the rationality and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by $ L_ {q}$ norm. In this paper, a new algorithm based on distributed optimization is suggested for spectral unmixing. In the proposed algorithm, a network including single-node clusters is employed. Each pixel in the hyperspectral images is considered as a node in this network. The sparsity-constrained distributed unmixing is optimized with diffusion least mean p-power (LMP) strategy, and then the update equations for fractional abundance and signature matrices are obtained. Afterward, the proposed algorithm is analyzed for different values of LMP power and $ L_ {q}$ norms. Simulation results based on defined performance metrics illustrate the advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods. [ABSTRACT FROM AUTHOR]

This paper describes a new algorithm for hyperspectral image unmixing. Most unmixing algorithms proposed in the literature do not take into account the possible spatial correlations between the pixels. In this paper, a Bayesian model is introduced to exploit these correlations. The image to be unmixed is assumed to be partitioned into regions (or classes) where the statistical properties of the abundance coefficients are homogeneous. A Markov random field, is then proposed to model the spatial dependencies between the pixels within any class. Conditionally upon a given class, each pixel is modeled by using the classical linear mixing model with additive white Gaussian noise. For this model, the posterior distributions of the unknown parameters and hyperparameters allow the parameters of interest to be inferred. These parameters include the abundances for each pixel, the means and variances of the abundances for each class, as well as a classification map indicating the classes of all pixels in the image. To overcome the complexity of the posterior distribution, we consider a Markov chain Monte Carlo method that generates samples asymptotically distributed according to the posterior. The generated samples are then used for parameter and hyperparameter estimation. The accuracy of the proposed algorithms is illustrated on synthetic and real data. [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]

Multispectral (MS) and hyperspectral (HS) images have been successfully and widely used in remote sensing applications such as target detection, change detection, and anomaly detection. In this paper, we aim at reviewing recent change detection papers and raising some challenges and opportunities in the field from a practitioner's viewpoint using MS and HS images. For example, can we perform change detection using synthetic hyperspectral images? Can we use temporally-fused images to perform change detection? Some of these areas are ongoing and will require more research attention in the coming years. Moreover, in order to understand the context of our paper, some recent and representative algorithms in change detection using MS and HS images are included, and their advantages and disadvantages will be highlighted. [ABSTRACT FROM AUTHOR]

This paper introduces a new hyperspectral image denoising method called Non-local Convolutional Neural Network Denoiser (NL-CNND). The technique exploits data in four bands adjacent to the target one as additional information for the restoring process, and it uses a pre-denoising step based on BM4D. All the bands paired with their pre-denoised versions in a second step feed a Convolutional Neural Network. To network generalization, one of the inputs is the noise level of the input image, allowing a single model to work with different noise levels. This restoration technique overcomes quality when compared to current eight classical and neural methods. The results show higher peak signal to noise ratio, structural similarity index, and spectral angle mapper metrics than all the other restoration methods, surpassing those achieved using Block Matching and 4D Filtering alone. Besides, the results show a higher level of detail visually while at the same time reducing over-smoothing on the input images’ features. The paper also includes an algorithm for complete image restoration, allowing for denoising full-sized hyperspectral images independent of their shape. The dataset creation used for network training is detailed, based on a small set of available hyperspectral images, encompassing data normalization, conversion, and storage.

Predictive coding is attractive for compression on board of spacecraft due to its low computational complexity, modest memory requirements, and the ability to accurately control quality on a pixel-by-pixel basis. Traditionally, predictive compression focused on the lossless and near-lossless modes of operation, where the maximum error can be bounded but the rate of the compressed image is variable. Rate control is considered a challenging problem for predictive encoders due to the dependencies between quantization and prediction in the feedback loop and the lack of a signal representation that packs the signal's energy into few coefficients. In this paper, we show that it is possible to design a rate control scheme intended for onboard implementation. In particular, we propose a general framework to select quantizers in each spatial and spectral region of an image to achieve the desired target rate while minimizing distortion. The rate control algorithm allows achieving lossy near-lossless compression and any in-between type of compression, e.g., lossy compression with a near-lossless constraint. While this framework is independent of the specific predictor used, in order to show its performance, in this paper, we tailor it to the predictor adopted by the CCSDS-123 lossless compression standard, obtaining an extension that allows performing lossless, near-lossless, and lossy compression in a single package. We show that the rate controller has excellent performance in terms of accuracy in the output rate, rate-distortion characteristics, and is extremely competitive with respect to state-of-the-art transform coding. [ABSTRACT FROM PUBLISHER]

Hyperspectral images (HSIs) denoising is a critical research area in image processing duo to its importance in improving the quality of HSIs, which has a negative impact on object detection and classification and so on. In this paper, we develop a noise reduction method based on principal component analysis (PCA) for hyperspectral imagery, which is dependent on the assumption that the noise can be removed by selecting the leading principal components. The main contribution of paper is to introduce the spectral spatial structure and nonlocal similarity of the HSIs into the PCA denoising model. PCA with spectral spatial structure can exploit spectral correlation and spatial correlation of HSI by using 3D blocks instead of 2D patches. Nonlocal similarity means the similarity between the referenced pixel and other pixels in nonlocal area, where Mahalanobis distance algorithm is used to estimate the spatial spectral similarity by calculating the distance in 3D blocks. The proposed method is tested on both simulated and real hyperspectral images, the results demonstrate that the proposed method is superior to several other popular methods in HSI denoising. [ABSTRACT FROM AUTHOR]

Now a days, Remote Sensing (RS) techniques are used for earth observation and for detection of soil types with high accuracy and better reliability. This technique provides perspective view of spatial resolution and aids in instantaneous measurement of soil's minerals and its characteristics. There are a few challenges that is present in soil classification using image enhancement such as, locating and plotting soil boundaries, slopes, hazardous areas, drainage condition, land use, vegetation etc. There are some traditional approaches which involves few drawbacks such as, manual involvement which results in inaccuracy due to human interference, time consuming, inconsistent prediction etc. To overcome these draw backs and to improve the predictive analysis of soil characteristics, we propose a Hybrid Deep Learning improved BAT optimization algorithm (HDIB) for soil classification using remote sensing hyperspectral features. In HDIB, we propose a spontaneous BAT optimization algorithm for feature extraction of both spectral-spatial features by choosing pure pixels from the Hyper Spectral (HS) image. Spectral-spatial vector as training illustrations is attained by merging spatial and spectral vector by means of priority stacking methodology. Then, a recurring Deep Learning (DL) Neural Network (NN) is used for classifying the HS images, considering the datasets of Pavia University, Salinas and Tamil Nadu Hill Scene, which in turn improves the reliability of classification. Finally, the performance of the proposed HDIB based soil classifier is compared and analyzed with existing methodologies like Single Layer Perceptron (SLP), Convolutional Neural Networks (CNN) and Deep Metric Learning (DML) and it shows an improved classification accuracy of 99.87%, 98.34% and 99.9% for Tamil Nadu Hills dataset, Pavia University and Salinas scene datasets respectively. [ABSTRACT FROM AUTHOR]

Impervious surfaces have been widely recognized as an indicator for urbanization and environment monitoring. Plenty of methods have been proposed to extract impervious surfaces using remote sensing images. However, accurately extracting impervious surface is still a challenging task due to the confusion between impervious surface and bare soil. Thus, this paper presents a hybrid approach consisting of spectral-spatial feature sparse representation (SS-SR) and post-processing to extract urban impervious surface from hyperspectral images. We first extracted spectral and spatial features from hyperspectral images. Then, the spectral and spatial information of a pixel is represented by the vector stacking strategy. Each pixel vector can be represented by a linear combination of a few atoms from a learned dictionary, which is more suitable for impervious surface estimation. The sparse coefficients were automatically learned and then used for extracting impervious surface. The proposed impervious surface extraction method was evaluated with four hyperspectral datasets. We compared our algorithms with the state-of-the-art per-pixel based impervious surface extraction methods. The encouraging experimental results demonstrate the SS-SR algorithm generally outperforms the classic support vector machines and random forest. The improvement is more significant when combining SS-SR with post-classification approach. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSI) clustering is generally a challenging task because of the complex spectral-spatial structure. Based on the assumption that all the pixels are sampled from the union of subspaces, recent works have introduced a robust technique--the sparse subspace clustering (SSC) algorithm and its enhanced versions (SSC models incorporating spatial information)--to cluster HSIs, achieving excellent performances. However, these methods are all based on the linear representation model, which conflicts with the well-known nonlinear structure of HSIs and limits their performance to a large degree. In this paper, to overcome these obstacles, we present a new kernel sparse subspace clustering algorithm with a spatial max pooling operation (KSSC-SMP) for hyperspectral remote sensing data interpretation. The proposed approach maps the feature points into a much higher dimensional kernel space to extend the linear sparse subspace clustering model to nonlinear manifolds, which can better fit the complex nonlinear structure of HSIs. With the help of the kernel sparse representation, a more accurate representation coefficient matrix can be obtained. A spatial max pooling operation is utilized for the representation coefficients to generate more discriminant features by integrating the spatial-contextual information, which is essential for the accurate modeling of HSIs. This paper is an extension of our previous conference paper, and a number of enhancements are put forward. The proposed algorithm was evaluated on two well-known hyperspectral data sets--the Salinas image and the University of Pavia image--and the experimental results clearly indicate that the newly developed KSSC-SMP algorithm can obtain very competitive clustering results for HSIs, outperforming the current state-of-the-art clustering methods. [ABSTRACT FROM AUTHOR]

This paper focuses on the problem of lossy compression for hyperspectral images and presents an efficient compression algorithm based on distributed source coding. The proposed algorithm employs a block-based quantizer followed by distributed lossless coding, which is implemented through the use of multilevel coset codes. First, a bitrate allocation algorithm is proposed to assign the rational bitrate for each block. Subsequently, the multilinear regression model is employed to construct the side information of each block, and the optimal quantization step size of each block is obtained under the assigned bitrate while minimizing the distortion. Finally, the quantized version of each block is encoded by distributed lossless compression. Experimental results show that the compression performance of the proposed algorithm is competitive with that of state-of-the-art transform-based compression algorithms. Moreover, the proposed algorithm provides both low encoder complexity and error resilience, making it suitable for onboard compression. [ABSTRACT FROM AUTHOR]

In recent years, many studies on hyperspectral image classification have shown that using multiple features can effectively improve the classification accuracy. As a very powerful means of learning, multiple kernel learning (MKL) can conveniently be embedded in a variety of characteristics. This paper proposes a class-specific sparse MKL (CS-SMKL) framework to improve the capability of hyperspectral image classification. In terms of the features, extended multiattribute profiles are adopted because it can effectively represent the spatial and spectral information of hyperspectral images. CS-SMKL classifies the hyperspectral images, simultaneously learns class-specific significant features, and selects class-specific weights. Using an L1-norm constraint (i.e., group lasso) as the regularizer, we can enforce the sparsity at the group/feature level and automatically learn a compact feature set for the classification of any two classes. More precisely, our CS-SMKL determines the associated weights of optimal base kernels for any two classes and results in improved classification performances. The advantage of the proposed method is that only the features useful for the classification of any two classes can be retained, which leads to greatly enhanced discriminability. Experiments are conducted on three hyperspectral data sets. The experimental results show that the proposed method achieves better performances for hyperspectral image classification compared with several state-of-the-art algorithms, and the results confirm the capability of the method in selecting the useful features. [ABSTRACT FROM PUBLISHER]

This paper presents the utilization of empirical mode decomposition (EMD) of hyperspectral images to increase the classification accuracy using support vector machine (SVM)-based classification. EMD has been shown in the literature to be particularly suitable for nonlinear and nonstationary signals and is used in this paper to decompose hyperspectral image bands into several intrinsic mode functions (IMFs) and a final residue. EMD is utilized in this paper to improve hyperspectral-image-classification accuracy by effectively exploiting the feature that EMD performs a decomposition that is spatially adaptive with respect to intrinsic features. This paper presents two different approaches for improved hyperspectral image classification making use of EMD. In the first approach, IMFs corresponding to each hyperspectral image band are obtained and the sums of lower order IMFs are used as new features for classification with SVM. In the second approach, the pieces of information contained in the first and second IMFs of each hyperspectral image band are combined using composite kernels for SVM classification with higher accuracy. [ABSTRACT FROM AUTHOR]

This paper studies a new Bayesian unmixing algorithm for hyperspectral images. Each pixel of the image is modeled as a linear combination of so-called endmembers. These endmembers are supposed to be random in order to model uncertainties regarding their knowledge. More precisely, we model endmembers as Gaussian vectors whose means have been determined using an endmember extraction algorithm such as the famous N-finder (N-FINDR) or Vertex Component Analysis (VCA) algorithms. This paper proposes to estimate the mixture coefficients (referred to as abundances) using a Bayesian algorithm. Suitable priors are assigned to the abundances in order to satisfy positivity and additivity constraints whereas conjugate priors are chosen for the remaining parameters. A hybrid Gibbs sampler is then constructed to generate abundance and variance samples distributed according to the joint posterior of the abundances and noise variances. The performance of the proposed methodology is evaluated by comparison with other unmixing algorithms on synthetic and real images. [ABSTRACT FROM AUTHOR]

Due to hardware limitations of the imaging sensors, it is challenging to acquire images of high resolution in both spatial and spectral domains. Fusing a low-resolution hyperspectral image (LR-HSI) and a high-resolution multispectral image (HR-MSI) to obtain an HR-HSI in an unsupervised manner has drawn considerable attention. Though effective, most existing fusion methods are limited due to the use of linear parametric modeling for the spectral mixture process, and even the deep learning-based methods only focus on deterministic fully-connected networks without exploiting the spatial correlation and local spectral structures of the images. In this paper, we propose a novel variational probabilistic autoencoder framework implemented by convolutional neural networks, in order to fuse the spatial and spectral information contained in the LR-HSI and HR-MSI, called FusionNet. The FusionNet consists of a spectral generative network, a spatial-dependent prior network, and a spatial-spectral variational inference network, which are jointly optimized in an unsupervised manner, leading to an end-to-end fusion system. Further, for fast adaptation to different observation scenes, we give a meta-learning explanation to the fusion problem, and combine the FusionNet with meta-learning in a synergistic manner. Effectiveness and efficiency of the proposed method are evaluated based on several publicly available datasets, demonstrating that the proposed FusionNet outperforms the state-of-the-art fusion methods. [ABSTRACT FROM AUTHOR]

Sparse unmixing has become a popular tool for hyperspectral imagery interpretation. It refers to finding the optimal subset of a spectral library to reconstruct the image data and further estimate the proportions of different materials. Recently, multi-objective based sparse unmixing methods have presented promising performance because of their advantages in addressing combinatorial problems. A spectral and multi-objective based sparse unmixing (SMoSU) algorithm was proposed in our previous work, which solves the decision-making problem well. However, it does not show outstanding advantages in strong noise cases. To solve the problem, in this paper, SMoSU is improved based on the estimation of distribution algorithms (EDAs). The machine learning based EDAs have been a reliable approach in solving multi-objective problems. However, most of them are for special problems and relatively weak in theoretical foundations. Thus, it is unreliable to extend it directly to sparse unmixing. Here, we improve EDA on the basis of classification and propose a classification-based model for individual generating under the framework of SMoSU (CM-MoSU). In CM-MoSU, the whole population is divided to be positive and negative. Then, the macroinformation of positive individuals is used to guide the generation of new individuals. Therefore, the optimization task could pay more attention to the feasible space with high quality. Moreover, some theoretical analyses are presented to prove the reliability of CM-MoSU. In experiments, several state-of-the-art sparse unmixing algorithms are compared. Both synthetic and real-world experiments demonstrate the effectiveness of CM-MoSU. [ABSTRACT FROM AUTHOR]

Snapshot compressive imaging (SCI) refers to compressive imaging systems where multiple frames are mapped into a single measurement, with video compressive imaging and hyperspectral compressive imaging as two representative applications. Though exciting results of high-speed videos and hyperspectral images have been demonstrated, the poor reconstruction quality precludes SCI from wide applications. This paper aims to boost the reconstruction quality of SCI via exploiting the high-dimensional structure in the desired signal. We build a joint model to integrate the nonlocal self-similarity of video/hyperspectral frames and the rank minimization approach with the SCI sensing process. Following this, an alternating minimization algorithm is developed to solve this non-convex problem. We further investigate the special structure of the sampling process in SCI to tackle the computational workload and memory issues in SCI reconstruction. Both simulation and real data (captured by four different SCI cameras) results demonstrate that our proposed algorithm leads to significant improvements compared with current state-of-the-art algorithms. We hope our results will encourage the researchers and engineers to pursue further in compressive imaging for real applications. [ABSTRACT FROM AUTHOR]

With the rapid development of hyperspectral remote sensing technology, the spatial resolution and spectral resolution of hyperspectral images are continually increasing, resulting in a continual increase in the scale of hyperspectral data. At present, hyperspectral lossless compression technology has reached a bottleneck. Simultaneously, the rise of deep learning has provided us with new ideas. Therefore, this paper examines the use of deep learning for the lossless compression of hyperspectral images. In view of the differential pulse code modulation (DPCM) method being insufficient for predicting spectral band information, the proposed method, called C-DPCM-RNN, uses a deep recurrent neural network (RNN) to improve the traditional DPCM method and improve the generalization ability and prediction accuracy of the model. The final experimental result shows that C-DPCM-RNN achieves better compression on a set of calibrated AVIRIS test images provided by the Multispectral and Hyperspectral Data Compression Working Group of the Consultative Committee for Space Data Systems in 2006. C-DPCM-RNN overcomes the limits of traditional methods in its performance on uncalibrated AVIRIS test images. [ABSTRACT FROM AUTHOR]

In this paper, we present a nonlinear version of the well-known anomaly detection method referred to as the RX-algorithm. Extending this algorithm to a feature space associated with the original input space via a certain nonlinear mapping function can provide a nonlinear version of the RX-algorithm. This non- linear RX-algorithm, referred to as the kernel RX-algorithm, is basically intractable mainly due to the high dimensionality of the feature space produced by the nonlinear mapping function. However, in this paper it is shown that the kernel RX-algorithm can easily be implemented by kernelizing the RX-algorithm in the feature space in terms of kernels that implicitly compute dot products in the feature space. Improved performance of the kernel RX-algorithm over the conventional RX-algorithm is shown by testing several hyperspectral imagery for military target and mine detection. [ABSTRACT FROM AUTHOR]