Spectral-spatial destriping of hyperspectral image via correntropy based sparse representation and unidirectional Huber–Markov random fields

Author(s):  
Yulong Wang ◽  
Yuan Yan Tang ◽  
Luoqing Li

This paper presents a novel destriping method for hyperspectral images. Most of the previous destriping methods regard only the corrupted subimage as an isolated image and fail to consider the high spectral correlation between the subimages in different bands. This may impede their performance of removing striping noises. The proposed method takes advantage of both spectral and spatial information to contribute to the process of striping noise reduction. Firstly, a correntropy-based sparse representation (CSR) model is utilized to learn the high spectral correlation between the subimages in different bands. Then the spatial information of the target subimage with striping noise is incorporated into the CSR model with a unidirectional Huber–Markov random field prior. We devise an Augmented Lagrange Multiplier type of algorithm to efficiently compute the destriped results. The experimental results on two real-world hyperspectral data sets demonstrate the effectiveness of the proposed method.

2019 ◽  
Vol 11 (9) ◽  
pp. 1114
Author(s):  
Sixiu Hu ◽  
Jiangtao Peng ◽  
Yingxiong Fu ◽  
Luoqing Li

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.


2019 ◽  
Vol 11 (24) ◽  
pp. 2897 ◽  
Author(s):  
Yuhui Zheng ◽  
Feiyang Wu ◽  
Hiuk Jae Shim ◽  
Le Sun

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