scholarly journals CLASSIFIER FUSION OF POLSAR, HYPERSPECTRAL AND PAN REMOTE SENSING DATA FOR IMPROVING LAND USE CLASSIFICATION

2019 ◽  
Vol XLII-4/W18 ◽  
pp. 913-916
Author(s):  
R. Saadi ◽  
M. Hasanlou ◽  
A. Safari
Keyword(s):  
Hyperspectral Image ◽  
Remote Sensing Data ◽  
Image Data ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Majority Voting ◽  
Classifier Fusion ◽  
Data Sets ◽  
Simple Majority ◽  
Land Use Classification

Abstract. The combined use of PolSAR and hyperspectral data can improve the classification accuracy. This paper proposes a new classification approach for combining use of PolSAR and hyperspectral image data sets. At the first step, polarization signature is generated from coherency matrix of PolSAR image data. In the second step, in order to improve spatial resolution, the Hyperion image was pan-sharped with the ALI Pan image. In the third step, the Random Forest (RF) classifier is used for classifying PolSAR and hyperspectral data sets in five different classes including: Water (Wa), urban area (Ur), vegetation (Vg), road (Ro), and soil (So). Then, in order to fuse the output of RF for incorporated two data sets, simple majority voting (MV) and weighted majority voting (WMV) methods are used. Three UAVSAR, Hyperion and ALI images that acquired on April 2015 was chosen for this study. The results showed the ability of the polarimetric data for classifying urban and vegetation, and hyperspectral images for water, soil and road classes. Also, the combination of two data sets by using of WMV method causes the improvements of the classification performance.

scholarly journals Kernel Joint Sparse Representation Based on Self-Paced Learning for Hyperspectral Image Classification

2019 ◽  
Vol 11 (9) ◽  
pp. 1114
Author(s):  
Sixiu Hu ◽  
Jiangtao Peng ◽  
Yingxiong Fu ◽  
Luoqing Li
Keyword(s):  
Sparse Representation ◽  
Hyperspectral Image ◽  
Feature Space ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Neighborhood Structure ◽  
Joint Sparse Representation ◽  
Negative Effect ◽  
Sparse Coefficient

By means of joint sparse representation (JSR) and kernel representation, kernel joint sparse representation (KJSR) models can effectively model the intrinsic nonlinear relations of hyperspectral data and better exploit spatial neighborhood structure to improve the classification performance of hyperspectral images. However, due to the presence of noisy or inhomogeneous pixels around the central testing pixel in the spatial domain, the performance of KJSR is greatly affected. Motivated by the idea of self-paced learning (SPL), this paper proposes a self-paced KJSR (SPKJSR) model to adaptively learn weights and sparse coefficient vectors for different neighboring pixels in the kernel-based feature space. SPL strateges can learn a weight to indicate the difficulty of feature pixels within a spatial neighborhood. By assigning small weights for unimportant or complex pixels, the negative effect of inhomogeneous or noisy neighboring pixels can be suppressed. Hence, SPKJSR is usually much more robust. Experimental results on Indian Pines and Salinas hyperspectral data sets demonstrate that SPKJSR is much more effective than traditional JSR and KJSR models.

scholarly journals Deep Convolutional Neural Networks for Hyperspectral Image Classification

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Wei Hu ◽  
Yangyu Huang ◽  
Li Wei ◽  
Fan Zhang ◽  
Hengchao Li
Keyword(s):  
Neural Networks ◽  
Convolutional Neural Networks ◽  
Hyperspectral Image ◽  
Image Data ◽  
Classification Performance ◽  
Spectral Signature ◽  
Support Vector ◽  
Data Sets ◽  
Deep Convolutional Neural Networks ◽  
Visual Tasks

Recently, convolutional neural networks have demonstrated excellent performance on various visual tasks, including the classification of common two-dimensional images. In this paper, deep convolutional neural networks are employed to classify hyperspectral images directly in spectral domain. More specifically, the architecture of the proposed classifier contains five layers with weights which are the input layer, the convolutional layer, the max pooling layer, the full connection layer, and the output layer. These five layers are implemented on each spectral signature to discriminate against others. Experimental results based on several hyperspectral image data sets demonstrate that the proposed method can achieve better classification performance than some traditional methods, such as support vector machines and the conventional deep learning-based methods.

HYPERSPECTRAL IMAGE CLASSIFICATION USING LOCAL SPECTRAL ANGLE-BASED MANIFOLD LEARNING

2014 ◽  
Vol 28 (06) ◽  
pp. 1450016 ◽  
Author(s):  
FULIN LUO ◽  
JIAMIN LIU ◽  
HONG HUANG ◽  
YUMEI LIU
Keyword(s):  
Large Scale ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Remote Sensing Data ◽  
Image Data ◽  
Locally Linear Embedding ◽  
Data Sets ◽  
K Nearest Neighbors ◽  
Actual Geometry ◽  
Spectral Angle

Locally linear embedding (LLE) depends on the Euclidean distance (ED) to select the k-nearest neighbors. However, the ED may not reflect the actual geometry structure of data, which may lead to the selection of ineffective neighbors. The aim of our work is to make full use of the local spectral angle (LSA) to find proper neighbors for dimensionality reduction (DR) and classification of hyperspectral remote sensing data. At first, we propose an improved LLE method, called local spectral angle LLE (LSA-LLE), for DR. It uses the ED of data to obtain large-scale neighbors, then utilizes the spectral angle to get the exact neighbors in the large-scale neighbors. Furthermore, a local spectral angle-based nearest neighbor classifier (LSANN) has been proposed for classification. Experiments on two hyperspectral image data sets demonstrate the effectiveness of the presented methods.

scholarly journals CSA-MSO3DCNN: Multiscale Octave 3D CNN with Channel and Spatial Attention for Hyperspectral Image Classification

2020 ◽  
Vol 12 (1) ◽  
pp. 188 ◽  
Author(s):  
Qin Xu ◽  
Yong Xiao ◽  
Dongyue Wang ◽  
Bin Luo
Keyword(s):  
Spatial Attention ◽  
Hyperspectral Image ◽  
Image Data ◽  
Classification Performance ◽  
Data Sets ◽  
Feature Maps ◽  
Contextual Feature ◽  
Hyperspectral Image Data ◽  
3D Cnn ◽  
Spatial Redundancy

3D convolutional neural networks (CNNs) have been demonstrated to be a powerful tool in hyperspectral images (HSIs) classification. However, using the conventional 3D CNNs to extract the spectral–spatial feature for HSIs results in too many parameters as HSIs have plenty of spatial redundancy. To address this issue, in this paper, we first design multiscale convolution to extract the contextual feature of different scales for HSIs and then propose to employ the octave 3D CNN which factorizes the mixed feature maps by their frequency to replace the normal 3D CNN in order to reduce the spatial redundancy and enlarge the receptive field. To further explore the discriminative features, a channel attention module and a spatial attention module are adopted to optimize the feature maps and improve the classification performance. The experiments on four hyperspectral image data sets demonstrate that the proposed method outperforms other state-of-the-art deep learning methods.

scholarly journals Hyperspectral Image Classification with Localized Graph Convolutional Filtering

2021 ◽  
Vol 13 (3) ◽  
pp. 526
Author(s):  
Shengliang Pu ◽  
Yuanfeng Wu ◽  
Xu Sun ◽  
Xiaotong Sun
Keyword(s):  
Hyperspectral Image ◽  
Principal Component ◽  
Representation Learning ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Spectral Graph Theory ◽  
Feature Reduction ◽  
Graph Representation ◽  
Novel Method ◽  
Local Graph

The nascent graph representation learning has shown superiority for resolving graph data. Compared to conventional convolutional neural networks, graph-based deep learning has the advantages of illustrating class boundaries and modeling feature relationships. Faced with hyperspectral image (HSI) classification, the priority problem might be how to convert hyperspectral data into irregular domains from regular grids. In this regard, we present a novel method that performs the localized graph convolutional filtering on HSIs based on spectral graph theory. First, we conducted principal component analysis (PCA) preprocessing to create localized hyperspectral data cubes with unsupervised feature reduction. These feature cubes combined with localized adjacent matrices were fed into the popular graph convolution network in a standard supervised learning paradigm. Finally, we succeeded in analyzing diversified land covers by considering local graph structure with graph convolutional filtering. Experiments on real hyperspectral datasets demonstrated that the presented method offers promising classification performance compared with other popular competitors.

scholarly journals Efficient Lossless Compression of Multitemporal Hyperspectral Image Data

2018 ◽  
Vol 4 (12) ◽  
pp. 142 ◽  
Author(s):  
Hongda Shen ◽  
Zhuocheng Jiang ◽  
W. Pan
Keyword(s):  
Data Compression ◽  
Hyperspectral Image ◽  
Image Data ◽  
Lossless Compression ◽  
Large Data ◽  
Hyperspectral Data ◽  
Compression Performance ◽  
Temporal Correlations ◽  
Sensing Applications ◽  
Data Volume

Hyperspectral imaging (HSI) technology has been used for various remote sensing applications due to its excellent capability of monitoring regions-of-interest over a period of time. However, the large data volume of four-dimensional multitemporal hyperspectral imagery demands massive data compression techniques. While conventional 3D hyperspectral data compression methods exploit only spatial and spectral correlations, we propose a simple yet effective predictive lossless compression algorithm that can achieve significant gains on compression efficiency, by also taking into account temporal correlations inherent in the multitemporal data. We present an information theoretic analysis to estimate potential compression performance gain with varying configurations of context vectors. Extensive simulation results demonstrate the effectiveness of the proposed algorithm. We also provide in-depth discussions on how to construct the context vectors in the prediction model for both multitemporal HSI and conventional 3D HSI data.

scholarly journals Deep Spectral Spatial Inverted Residual Network for Hyperspectral Image Classification

2021 ◽  
Vol 13 (21) ◽  
pp. 4472
Author(s):  
Tianyu Zhang ◽  
Cuiping Shi ◽  
Diling Liao ◽  
Liguo Wang
Keyword(s):  
Image Classification ◽  
Data Augmentation ◽  
Hyperspectral Image ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Hyperspectral Image Classification ◽  
Feature Maps ◽  
Spatial Feature ◽  
Global Context

Convolutional neural networks (CNNs) have been widely used in hyperspectral image classification in recent years. The training of CNNs relies on a large amount of labeled sample data. However, the number of labeled samples of hyperspectral data is relatively small. Moreover, for hyperspectral images, fully extracting spectral and spatial feature information is the key to achieve high classification performance. To solve the above issues, a deep spectral spatial inverted residuals network (DSSIRNet) is proposed. In this network, a data block random erasing strategy is introduced to alleviate the problem of limited labeled samples by data augmentation of small spatial blocks. In addition, a deep inverted residuals (DIR) module for spectral spatial feature extraction is proposed, which locks the effective features of each layer while avoiding network degradation. Furthermore, a global 3D attention module is proposed, which can realize the fine extraction of spectral and spatial global context information under the condition of the same number of input and output feature maps. Experiments are carried out on four commonly used hyperspectral datasets. A large number of experimental results show that compared with some state-of-the-art classification methods, the proposed method can provide higher classification accuracy for hyperspectral images.

scholarly journals Measuring the Morphology and Dynamics of the Snake River by Remote Sensing

2011 ◽  
Vol 33 ◽  
pp. 3-15
Author(s):  
Carl Legleiter
Keyword(s):  
Remote Sensing ◽  
Image Data ◽  
River System ◽  
Field Work ◽  
Hyperspectral Data ◽  
Snake River ◽  
Central Component ◽  
Data Sets ◽  
Channel Form ◽  
And Behavior

The Snake River is a central component of Grand Teton National Park, and this dynamic fluvial system plays a key role in shaping the landscape and creating diverse aquatic and terrestrial habitat. The river’s complexity and propensity for change make effective characterization of this resource difficult, however, and conventional, ground-based methods are simply inadequate. Remote sensing provides an appealing alternative approach that could facilitate resource management while providing novel insight on the factors controlling channel form and behavior. In this study, we evaluate the potential to measure the morphology and dynamics of a large, complex river system such as the Snake using optical image data. Initially, we made use of existing, publicly available images and basic digital aerial photography acquired in August 2010. Analysis to date has focused on estimating flow depths from these data, and preliminary results indicate that remote bathymetric mapping is feasible but not highly accurate, with important constraints related to the limited radiometric resolution of these data sets. Additional, more sophisticated hyperspectral data are scheduled for collection in 2011, along with further field work.

An Incremental Isomap Method for Hyperspectral Dimensionality Reduction and Classification

2021 ◽  
Vol 87 (6) ◽  
pp. 445-455
Author(s):  
Yi Ma ◽  
Zezhong Zheng ◽  
Yutang Ma ◽  
Mingcang Zhu ◽  
Ran Huang ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Data Points

Many manifold learning algorithms conduct an eigen vector analysis on a data-similarity matrix with a size of N×N, where N is the number of data points. Thus, the memory complexity of the analysis is no less than O(N2). We pres- ent in this article an incremental manifold learning approach to handle large hyperspectral data sets for land use identification. In our method, the number of dimensions for the high-dimensional hyperspectral-image data set is obtained with the training data set. A local curvature varia- tion algorithm is utilized to sample a subset of data points as landmarks. Then a manifold skeleton is identified based on the landmarks. Our method is validated on three AVIRIS hyperspectral data sets, outperforming the comparison algorithms with a k–nearest-neighbor classifier and achieving the second best performance with support vector machine.

Sign in / Sign up

Export Citation Format

Share Document