scholarly journals Low-Rank and Spectral-Spatial Sparse Unmixing for Hyperspectral Remote Sensing Imagery

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Fan Li
Keyword(s):  
Hyperspectral Image ◽  
Structural Information ◽  
Real Data ◽  
Hyperspectral Data ◽  
Spectral Unmixing ◽  
Low Rank ◽  
Superior Performance ◽  
Dimensional Structure ◽  
Spatial Continuity ◽  
Spatial Weights

Sparse unmixing is an important technique for hyperspectral data analysis. Most sparse unmixing algorithms underutilize the spatial and spectral information of the hyperspectral image, which is unfavourable for the accuracy of endmember identification and abundance estimation. We propose a new spectral unmixing method based on the low-rank representation model and spatial-weighted collaborative sparsity, aiming to exploit structural information in both the spatial and spectral domains for unmixing. The spatial weights are incorporated into the collaborative sparse regularization term to enhance the spatial continuity of the image. Meanwhile, the global low-rank constraint is employed to maintain the spatial low-dimensional structure of the image. The model is solved by the well-known alternating direction method of multiplier, in which the abundance coefficients and the spatial weights are updated iteratively in the inner and outer loops, respectively. Experimental results obtained from simulation and real data reveal the superior performance of the proposed algorithm on spectral unmixing.

scholarly journals Hyperspectral Image Denoising Based on Nonconvex Low-Rank Tensor Approximation and lp Norm Regularization

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Li Bo ◽  
Luo Xuegang ◽  
Lv Junrui
Keyword(s):  
Image Denoising ◽  
Hyperspectral Image ◽  
Structural Information ◽  
Real Data ◽  
Optimization Method ◽  
Nuclear Norm ◽  
Low Rank ◽  
Phase Congruency ◽  
Structure Information ◽  
Lp Norm

A new nonconvex smooth rank approximation model is proposed to deal with HSI mixed noise in this paper. The low-rank matrix with Laplace function regularization is used to approximate the nuclear norm, and its performance is superior to the nuclear norm regularization. A new phase congruency lp norm model is proposed to constrain the spatial structure information of hyperspectral images, to solve the phenomenon of “artificial artifact” in the process of hyperspectral image denoising. This model not only makes use of the low-rank characteristic of the hyperspectral image accurately, but also combines the structural information of all bands and the local information of the neighborhood, and then based on the Alternating Direction Method of Multipliers (ADMM), an optimization method for solving the model is proposed. The results of simulation and real data experiments show that the proposed method is more effective than the competcing state-of-the-art denoising methods.

scholarly journals How Hyperspectral Image Unmixing and Denoising Can Boost Each Other

2020 ◽  
Vol 12 (11) ◽  
pp. 1728
Author(s):  
Behnood Rasti ◽  
Bikram Koirala ◽  
Paul Scheunders ◽  
Pedram Ghamisi
Keyword(s):  
Noise Reduction ◽  
Hyperspectral Image ◽  
Optimization Criterion ◽  
Hyperspectral Data ◽  
Spectral Unmixing ◽  
Low Rank ◽  
Hyperspectral Unmixing ◽  
Selection Strategies ◽  
Linear Unmixing ◽  
The One

Hyperspectral linear unmixing and denoising are highly related hyperspectral image (HSI) analysis tasks. In particular, with the assumption of Gaussian noise, the linear model assumed for the HSI in the case of low-rank denoising is often the same as the one used in HSI unmixing. However, the optimization criterion and the assumptions on the constraints are different. Additionally, noise reduction as a preprocessing step in hyperspectral data analysis is often ignored. The main goal of this paper is to study experimentally the influence of noise on the process of hyperspectral unmixing by: (1) investigating the effect of noise reduction as a preprocessing step on the performance of hyperspectral unmixing; (2) studying the relation between noise and different endmember selection strategies; (3) investigating the performance of HSI unmixing as an HSI denoiser; (4) comparing the denoising performance of spectral unmixing, state-of-the-art HSI denoising techniques, and the combination of both. All experiments are performed on simulated and real datasets.

scholarly journals Hyperspectral Super-Resolution Via Joint Regularization of Low-Rank Tensor Decomposition

2021 ◽  
Vol 13 (20) ◽  
pp. 4116
Author(s):  
Meng Cao ◽  
Wenxing Bao ◽  
Kewen Qu
Keyword(s):  
High Resolution ◽  
Hyperspectral Image ◽  
Super Resolution ◽  
Tensor Decomposition ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Low Rank ◽  
Superior Performance ◽  
Rank Tensor ◽  
Image Super Resolution

The hyperspectral image super-resolution (HSI-SR) problem aims at reconstructing the high resolution spatial–spectral information of the scene by fusing low-resolution hyperspectral images (LR-HSI) and the corresponding high-resolution multispectral image (HR-MSI). In order to effectively preserve the spatial and spectral structure of hyperspectral images, a new joint regularized low-rank tensor decomposition method (JRLTD) is proposed for HSI-SR. This model alleviates the problem that the traditional HSI-SR method, based on tensor decomposition, fails to adequately take into account the manifold structure of high-dimensional HR-HSI and is sensitive to outliers and noise. The model first operates on the hyperspectral data using the classical Tucker decomposition to transform the hyperspectral data into the form of a three-mode dictionary multiplied by the core tensor, after which the graph regularization and unidirectional total variational (TV) regularization are introduced to constrain the three-mode dictionary. In addition, we impose the l1-norm on core tensor to characterize the sparsity. While effectively preserving the spatial and spectral structures in the fused hyperspectral images, the presence of anomalous noise values in the images is reduced. In this paper, the hyperspectral image super-resolution problem is transformed into a joint regularization optimization problem based on tensor decomposition and solved by a hybrid framework between the alternating direction multiplier method (ADMM) and the proximal alternate optimization (PAO) algorithm. Experimental results conducted on two benchmark datasets and one real dataset show that JRLTD shows superior performance over state-of-the-art hyperspectral super-resolution algorithms.

scholarly journals Superpixel Weighted Low-rank and Sparse Approximation for Hyperspectral Unmixing

2022 ◽  
Author(s):  
Taner Ince ◽  
Tugcan Dundar ◽  
Seydi Kacmaz ◽  
Hasari Karci
Keyword(s):  
Spatial Structure ◽  
Hyperspectral Image ◽  
Real Data ◽  
Approximation Problem ◽  
Sparse Approximation ◽  
Hyperspectral Data ◽  
Low Rank ◽  
Data Sets ◽  
Spatial Weight ◽  
Homogeneous Regions

We propose a superpixel weighted low-rank and sparse unmixing (SWLRSU) method for sparse unmixing. The proposed method consists of two steps. In the first step, we segment hyperspectral image into superpixels which are defined as the homogeneous regions with different shape and sizes according to the spatial structure. Then, an efficient method is proposed to obtain a spatial weight term using superpixels to capture the spatial structure of hyperspectral data. In the second step, we solve a superpixel guided low-rank and spatially weighted sparse approximation problem in which spatial weight term obtained in the first step is used as a weight term in sparsity promoting norm. This formulation exploits the spatial correlation of the pixels in the hyperspectral image efficiently, which yields satisfactory unmixing results. The experiments are conducted on simulated and real data sets to show the effectiveness of the proposed method.

scholarly journals Superpixel Weighted Low-rank and Sparse Approximation for Hyperspectral Unmixing

2022 ◽  
Author(s):  
Taner Ince ◽  
Tugcan Dundar ◽  
Seydi Kacmaz ◽  
Hasari Karci
Keyword(s):  
Spatial Structure ◽  
Hyperspectral Image ◽  
Real Data ◽  
Approximation Problem ◽  
Sparse Approximation ◽  
Hyperspectral Data ◽  
Low Rank ◽  
Data Sets ◽  
Spatial Weight ◽  
Homogeneous Regions

We propose a superpixel weighted low-rank and sparse unmixing (SWLRSU) method for sparse unmixing. The proposed method consists of two steps. In the first step, we segment hyperspectral image into superpixels which are defined as the homogeneous regions with different shape and sizes according to the spatial structure. Then, an efficient method is proposed to obtain a spatial weight term using superpixels to capture the spatial structure of hyperspectral data. In the second step, we solve a superpixel guided low-rank and spatially weighted sparse approximation problem in which spatial weight term obtained in the first step is used as a weight term in sparsity promoting norm. This formulation exploits the spatial correlation of the pixels in the hyperspectral image efficiently, which yields satisfactory unmixing results. The experiments are conducted on simulated and real data sets to show the effectiveness of the proposed method.

scholarly journals Hyperspectral Data Simulation (Sentinel-2 to AVIRIS-NG) for Improved Wildfire Fuel Mapping, Boreal Alaska

2021 ◽  
Vol 13 (9) ◽  
pp. 1693
Author(s):  
Anushree Badola ◽  
Santosh K. Panda ◽  
Dar A. Roberts ◽  
Christine F. Waigl ◽  
Uma S. Bhatt ◽  
...  
Keyword(s):  
Land Cover ◽  
Spectral Resolution ◽  
Hyperspectral Image ◽  
Spectral Response ◽  
Spectral Characteristics ◽  
Hyperspectral Data ◽  
Spectral Unmixing ◽  
High Spectral Resolution ◽  
Fuel Mapping ◽  
Sentinel 2

Alaska has witnessed a significant increase in wildfire events in recent decades that have been linked to drier and warmer summers. Forest fuel maps play a vital role in wildfire management and risk assessment. Freely available multispectral datasets are widely used for land use and land cover mapping, but they have limited utility for fuel mapping due to their coarse spectral resolution. Hyperspectral datasets have a high spectral resolution, ideal for detailed fuel mapping, but they are limited and expensive to acquire. This study simulates hyperspectral data from Sentinel-2 multispectral data using the spectral response function of the Airborne Visible/Infrared Imaging Spectrometer-Next Generation (AVIRIS-NG) sensor, and normalized ground spectra of gravel, birch, and spruce. We used the Uniform Pattern Decomposition Method (UPDM) for spectral unmixing, which is a sensor-independent method, where each pixel is expressed as the linear sum of standard reference spectra. The simulated hyperspectral data have spectral characteristics of AVIRIS-NG and the reflectance properties of Sentinel-2 data. We validated the simulated spectra by visually and statistically comparing it with real AVIRIS-NG data. We observed a high correlation between the spectra of tree classes collected from AVIRIS-NG and simulated hyperspectral data. Upon performing species level classification, we achieved a classification accuracy of 89% for the simulated hyperspectral data, which is better than the accuracy of Sentinel-2 data (77.8%). We generated a fuel map from the simulated hyperspectral image using the Random Forest classifier. Our study demonstrated that low-cost and high-quality hyperspectral data can be generated from Sentinel-2 data using UPDM for improved land cover and vegetation mapping in the boreal forest.

scholarly journals Superpixel Spectral Unmixing for Hyperspectral Image Superresolution Using a Coupled Encoder-Decoder Network

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Shao-lei Zhang ◽  
Guang-yuan Fu ◽  
Hong-qiao Wang ◽  
Yu-qing Zhao
Keyword(s):  
Hyperspectral Image ◽  
Visual Quality ◽  
Spectral Unmixing ◽  
The Other ◽  
Hyperspectral Images ◽  
Low Rank ◽  
Spectral Information ◽  
Multispectral Images ◽  
Self Similarity ◽  
Rank Constraint

In this paper, we propose a novel hyperspectral image superresolution method based on superpixel spectral unmixing using a coupled encoder-decoder network. The hyperspectral image and multispectral images are fused to generate high-resolution hyperspectral images through the spectral unmixing framework with low-rank constraint. Specifically, the endmember and abundance information is extracted via a coupled encoder-decoder network integrating the priori for unmixing. The coupled network consists of two encoders and one shared decoder, where spectral information is preserved through the encoder. The multispectral image is clustered into superpixels to explore self-similarity, and then, the superpixels are unmixed to obtain an abundance matrix. By imposing a low-rank constraint on the abundance matrix, we further improve the superresolution performance. Experiments on the CAVE and Harvard datasets indicate that our superresolution method outperforms the other compared methods in terms of quantitative evaluation and visual quality.

scholarly journals Hyperspectral Anomaly Detection with Harmonic Analysis and Low-Rank Decomposition

2019 ◽  
Vol 11 (24) ◽  
pp. 3028 ◽  
Author(s):  
Pei Xiang ◽  
Jiangluqi Song ◽  
Huan Li ◽  
Lin Gu ◽  
Huixin Zhou
Keyword(s):  
Anomaly Detection ◽  
Harmonic Analysis ◽  
Hyperspectral Image ◽  
Low Rank ◽  
Superior Performance ◽  
Alternative Methods ◽  
Qualitative Assessment ◽  
Redundant Information ◽  
Rank Decomposition ◽  
Low Rank Decomposition

Hyperspectral anomaly detection methods are often limited by the effects of redundant information and isolated noise. Here, a novel hyperspectral anomaly detection method based on harmonic analysis (HA) and low rank decomposition is proposed. This paper introduces three main innovations: first and foremost, in order to extract low-order harmonic images, a single-pixel-related HA was introduced to reduce dimension and remove redundant information in the original hyperspectral image (HSI). Additionally, adopting the guided filtering (GF) and differential operation, a novel background dictionary construction method was proposed to acquire the initial smoothed images suppressing some isolated noise, while simultaneously constructing a discriminative background dictionary. Last but not least, the original HSI was replaced by the initial smoothed images for a low-rank decomposition via the background dictionary. This operation took advantage of the low-rank attribute of background and the sparse attribute of anomaly. We could finally get the anomaly objectives through the sparse matrix calculated from the low-rank decomposition. The experiments compared the detection performance of the proposed method and seven state-of-the-art methods in a synthetic HSI and two real-world HSIs. Besides qualitative assessment, we also plotted the receiver operating characteristic (ROC) curve of each method and report the respective area under the curve (AUC) for quantitative comparison. Compared with the alternative methods, the experimental results illustrated the superior performance and satisfactory results of the proposed method in terms of visual characteristics, ROC curves and AUC values.

scholarly journals Sparse Unmixing for Hyperspectral Image with Nonlocal Low-Rank Prior

2019 ◽  
Vol 11 (24) ◽  
pp. 2897 ◽  
Author(s):  
Yuhui Zheng ◽  
Feiyang Wu ◽  
Hiuk Jae Shim ◽  
Le Sun
Keyword(s):  
Mixed Model ◽  
Linear Mixed Model ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Simulated Data ◽  
Hyperspectral Data ◽  
Low Rank ◽  
Data Sets ◽  
Self Similarity ◽  
Model Framework

Hyperspectral unmixing is a key preprocessing technique for hyperspectral image analysis. To further improve the unmixing performance, in this paper, a nonlocal low-rank prior associated with spatial smoothness and spectral collaborative sparsity are integrated together for unmixing the hyperspectral data. The proposed method is based on a fact that hyperspectral images have self-similarity in nonlocal sense and smoothness in local sense. To explore the spatial self-similarity, nonlocal cubic patches are grouped together to compose a low-rank matrix. Then, based on the linear mixed model framework, the nuclear norm is constrained to the abundance matrix of these similar patches to enforce low-rank property. In addition, the local spatial information and spectral characteristic are also taken into account by introducing TV regularization and collaborative sparse terms, respectively. Finally, the results of the experiments on two simulated data sets and two real data sets show that the proposed algorithm produces better performance than other state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document