Hyperspectral Image Denoising via Adversarial Learning

Hyperspectral image denoising by total variation-regularized bilinear factorization

Recently, low-rank matrix recovery has been demonstrated to be an effective tool in hyperspectral images (HSIs) denoising. However, the previous low-rank matrix recovery method with a window of the fixed-shape cannot adaptively exploit spatial structure information and nonlocal similarity. In this paper, multiscale low-rank matrix recovery (MC-LRMR) is proposed to recover HSI corrupted by different kinds of noise. The proposed method contains three main steps. First, HSI is transformed by the principal component analysis (PCA) algorithm and multiscale superpixel segmentation is applied to the first principal component, to segment the HSI into non-overlapping homogeneous regions. Then, the mixed noises, including Gaussian noise, impulse noise, dead lines noise, stripes noise, are removed by the low-rank matrix recovery (LRMR) in a superpixel-by-superpixel manner. Finally, a fusion rule, i.e., average operator, is adopted to combine denoising results of various scales, to acquire a fused noise-free estimation. Experiments on simulated and real HSI data sets can demonstrate the effectiveness of the proposed method.

Hyperspectral image (HSI) denoising is a fundamental task in remote sensing image processing, which is helpful for HSI subsequent applications, such as unmixing and classification. Thanks to the powerful representation ability of untrained deep neural networks, deep image prior (DIP)-based methods achieve tremendous successes in image processing (e.g., denoising and inpainting). However, DIP-based methods neglect the tensor low-rank prior of the underlying HSI which will be beneficial to capturing the global structure of the underlying HSI. To address this issue, we propose a novel model for HSI denoising, which can simultaneously take respective advantages of the tensor low-rank prior and the deep spatial-spectral prior. The tensor low-rank prior leads to a better global structure and the deep spatial-spectral prior is complementary to preserve better local details. On the one hand, we adopt low-rank tensor ring (TR) decomposition to characterize the tensor low-rank prior and capture the global structure of the underlying HSI. On the other hand, we employ untrained deep neural networks to flexibly represent the deep spatial-spectral prior and capture the local details of the underlying HSI. To solve the proposed model, we develop an efficient alternating minimization algorithm. Experimental results on simulated and real data validate the advantages of the proposed model in HSI denoising. Compared with state-of-the-art HSI denoising methods, the proposed method preserves better local details and the global structure of the underlying HSI.

Hyperspectral images (HSIs) have a wealth of applications in many areas, due to their fine spectral discrimination ability. However, in the practical imaging process, HSIs are often degraded by a mixture of various types of noise, for example, Gaussian noise, impulse noise, dead pixels, dead lines, and stripe noise. Low-rank matrix decomposition theory has been widely used in HSI denoising, and has achieved competitive results by modeling the impulse noise, dead pixels, dead lines, and stripe noise as sparse components. However, the existing low-rank-based methods for HSI denoising cannot completely remove stripe noise when the stripe noise is no longer sparse. In this article, we extend the HSI observation model and propose a double low-rank (DLR) matrix decomposition method for HSI denoising and destriping. By simultaneously exploring the low-rank characteristic of the lexicographically ordered noise-free HSI and the low-rank structure of the stripe noise on each band of the HSI, the two low-rank constraints are formulated into one unified framework, to achieve separation of the noise-free HSI, stripe noise, and other mixed noise. The proposed DLR model is then solved by the augmented Lagrange multiplier (ALM) algorithm efficiently. Both simulation and real HSI data experiments were carried out to verify the superiority of the proposed DLR method.

Recently, low-rank tensor recovery methods based on subspace representation have received increased attention in the field of hyperspectral image (HSI) denoising. Unfortunately, those methods usually analyze the prior structural information within different dimensions indiscriminately, ignoring the differences between modes, leaving substantial room for improvement. In this article, we first consider the low-rank properties in the subspace and prove that the structure correlation across the nonlocal self-similarity mode is much stronger than in the spatial sparsity and spectral correlation modes. On that basis, we introduce a new multidirectional low-rank regularization, in which each mode is assigned a different weight to characterize its contribution to estimating the tensor rank. After that, integrating the proposed regularization with the subspace-based tensor recovery framework, an optimization model for HSI mixed noise removal is developed. The proposed model can be addressed efficiently via the alternating minimization algorithm. Extensive experiments implemented with synthetic and real data demonstrate that the proposed method significantly outperforms other state-of-the-art HSI denoising methods, which clearly indicates the effectiveness of the proposed approach in HSI denoising.

Hyperspectral image (HSI) denoising is an effective image processing technology to improve the quality of HSI. By exploiting the spectral-spatial characteristics of HSI, this paper proposes a HSI denoising method based on the Graph-structured Low Rank model and Non-Local constraint (GLRNL). Graph-structured low rank model can reveal the spectral similarity in HSI and preserve the distribution characteristics of spectral bands. The graph structure is used to ensure that the denoised HSI has similar spectral characteristics as the real HSI, and reduce the spectral distortions. Moreover, the non-local constraint in GLRNL adopts the spatial-spectral self-similarity and provides an effective side prior information for low rank calculation. Comparing with some traditional low rank and sparse model based HSI denoising methods, the proposed method achieves the competitive results on different simulated and real HSI data with various types of noise.

Hyperspectral image (HSI) denoising is a crucial preprocessing procedure for the subsequent HSI applications. Unfortunately, though witnessing the development of deep learning in HSI denoising area, existing convolution-based methods face the trade-off between computational efficiency and capability to model non-local characteristics of HSI. In this paper, we propose a Spatial-Spectral Transformer (SST) to alleviate this problem. To fully explore intrinsic similarity characteristics in both spatial dimension and spectral dimension, we conduct non-local spatial self-attention and global spectral self-attention with Transformer architecture. The window-based spatial self-attention focuses on the spatial similarity beyond the neighboring region. While, the spectral self-attention exploits the long-range dependencies between highly correlative bands. Experimental results show that our proposed method outperforms the state-of-the-art HSI denoising methods in quantitative quality and visual results. The code is released at https://github.com/MyuLi/SST.

Sparse coding provides an excellent image prior for hyperspectral images (HSIs) denoising. However, on one hand, it is challenging to capture the structure within each sparse code for improving the reconstruction accuracy, on the other hand, the inconsistent recovery of the sparse codes corrupts the spectrum similarity in each homogeneous cluster of the HSI. To address these problems, we first propose a novel covariance matrix estimation based structured sparse coding method, where the sparse code matrix is modeled by a matrix normal distribution with a full covariance matrix. By estimating the covariance matrix with a latent variable based Bayesian framework, the data-dependent and noise-robust structure for each sparse code is learned from the noisy observation, with which the sparse codes are reconstructed accurately. Then, an intra-cluster filtering is employed to restore the spectrum similarity in each cluster. Experimental results demonstrate that the proposed method outperforms several state-of-the-art methods in HSIs denoising.

Hyperspectral image (HSI) is often corrupted by various kinds of noises. This letter proposes an innovative HSI denoising approach by leveraging the graph signal processing (GSP) theory and the low-rank (LR) matrix recovery model. With GSP, the piecewise smoothness (PWS) property of the HSI can be efficiently characterized, leading to a new regularization for HSI denoising, termed the adaptive weight graph total variation (AWGTV) regularization. Then, the denoising problem is formulated into a constrained optimization problem that incorporates the AWGTV and the LR property of the HSI. An augmented Lagrange multiplier method is adopted to solve the problem. Numerical experiments conducted on synthetic and real-world datasets and comparisons with existing methods demonstrate the effectiveness of the proposed denoising algorithm.

Hyperspectral images (HSIs) frequently experience various types of noise due to atmospheric interference and sensor instability, which impairs the efficiency of subsequent operations. Consequently, HSI denoising has emerged as a crucial component of HSI preprocessing. Conventional approaches often target a single kind of noise and eliminate it repeatedly, which has disadvantages including inefficiency when handling heterogeneous noise. Lately, models based on deep neural networks have shown encouraging results in the general image denoising domain. This study, which aims to overcome shortcomings in previous techniques, provides a novel denoising methodology by leveraging the effectiveness of the SqueezeNet model. For a thorough assessment, the evaluation framework includes four main indicators: PSNR, SSIM, SAM, and ERGAS. The evaluation is based on real-world hyperspectral images from the [Harvard Hyperspectral Dataset], which cover a variety of scenarios and illumination circumstances. Fire blocks are used by the SqueezeNet-based denoising model to optimize feature extraction with fewer parameters.Benchmarks for comparison include deep learning technique QRNN3D and classical techniques like ITSReg and BM4D.In order to avoid convergence to suboptimal local minima and to speed up and stabilize the learning process, this work presents an incremental training policy. The suggested SqueezeNet-based HSI denoising model performs exceptionally well, attaining competitive results in terms of PSNR of 34.15, SSIM of 0.92, and SAM of 4.56 in addition to impressive ERGAS of 20.47. This study offers an effective denoising solution for hyperspectral images by addressing shortcomings in current techniques, showcasing improvements in efficiency and accuracy.

Hyperspectral imaging is beneficial in a diverse range of applications from diagnostic medicine, to agriculture, to surveillance to name a few. However, hyperspectral images often suffer from degradation such as noise and low resolution. In this paper, we propose an effective model for hyperspectral image (HSI) restoration, specifically image denoising and super-resolution. Our model considers three underlying characteristics of HSIs: sparsity across the spatial-spectral domain, high correlation across spectra, and non-local self-similarity over space. We first exploit high correlation across spectra and non-local self-similarity over space in the degraded HSI to learn an adaptive spatial-spectral dictionary. Then, we employ the local and non-local sparsity of the HSI under the learned spatial-spectral dictionary to design an HSI restoration model, which can be effectively solved by an iterative numerical algorithm with parameters that are adaptively adjusted for different clusters and different noise levels. In experiments on HSI denoising, we show that the proposed method outperforms many state-of-the-art methods under several comprehensive quantitative assessments. We also show that our method performs well on HSI super-resolution.

Hyperspectral images (HSIs) are inevitably degraded by sensor noise and atmospheric interference, which severely limits their reliability in subsequent analysis tasks. Recent denoising approaches have leveraged the intrinsic spectral low-rank subspace structure of HSIs, typically represented by low-dimensional spectral bases and corresponding spatial coefficients. Despite their effectiveness, most existing methods neglect the distributional discrepancy between denoised results and clean HSIs, thereby constraining the expressive power of deep models. In this paper, we propose SLR-GAN, a subspace low-rank generative adversarial network for hyperspectral image denoising. Specifically, the noisy HSI is first decomposed into a compact spectral basis and spatial coefficient images. A Wasserstein-guided adversarial learning framework is then introduced to refine the coefficient images by explicitly aligning their distribution with that of clean counterparts, leading to more realistic and faithful reconstructions. Extensive experiments on both simulated and real-world HSIs demonstrate that SLR-GAN consistently outperforms state-of-the-art methods in terms of denoising accuracy and robustness.

Distributed optical fiber acoustic sensing (DAS) is a new and rapid-developing detection technology in seismic exploration. Unfortunately, due to the weak energy of scattered optical signals and the inferior coupling between DAS cable and receiving interface, the seismic data received by DAS are often characterized by low signal-to-noise ratio (SNR); this low SNR is likely to affect some subsequent analysis, such as inversion, imaging, and interpretation. In addition, the noise caused by the inferior coupling is a new kind of noise not presented on conventional seismic data. To enhance the SNR of DAS seismic data and suppress the DAS noise effectively, we propose a convolutional adversarial denoising network (CADN) based on the basic strategy of generative adversarial network (GAN) and the usage of a denoiser to replace the original generator in GAN. In CADN, the performance of denoiser is significantly strengthened via its own mean square error (MSE) loss and the adversarial loss between it and the discriminator. To balance the two losses and thus ensure the optimization of denoiser, we construct a novel loss function, where the optimal ratio of MSE and adversarial losses is determined by quantifying the denoising performance. Both real and synthetic examples are included to testify the denoising performance of CADN. Experimental results have demonstrated that CADN can suppress most of the DAS noise and enhance the SNR of DAS seismic data; also, it can recover the effective signals completely, even the extremely weak effective signals reflected by deep layers.

Motor imagery (MI) based Brain-computer interface (BCI) is a promising BCI paradigm that can help neuromuscular injury patients to recover or replace their motor abilities. However, electroencephalography (EEG) based MI-BCI suffers from its long calibration time and low classification accuracy, which restrict its application. Thus, it is important to reduce the calibration time of MI-BCI and enhance its prediction accuracy. In this study, we propose a filter bank Wasserstein adversarial domain adaptation framework (FBWADA) that uses a short amount of training data from a new target subject, and all collected data from an existing subject. A Convolutional Neural Networks (CNN) based feature extractor is designed to extract feature from EEG data. Filter bank strategy is employed to extract feature from multiple sub bands and integrate predictions from all sub bands. Wasserstein Generative Adversarial Networks (WGAN) based domain adaptation network aligns the marginal and conditional distribution of target and source. We evaluate our method on Data set 2a of BCI competition IV. Experiment results show that our method achieves the best performance among compared methods under different amount of training data. Performance of our method trained with certain blocks of data is similar to or better than the best comparing method trained with one more block. This indicates that our method could reduce the need for training data for at least one block.

Non-local low-rank tensor approximation has been developed as a state-of-the-art method for hyperspectral image (HSI) restoration, which includes the tasks of denoising, compressed HSI reconstruction and inpainting. Unfortunately, while its restoration performance benefits from more spectral bands, its runtime also substantially increases. In this paper, we claim that the HSI lies in a global spectral low-rank subspace, and the spectral subspaces of each full band patch group should lie in this global low-rank subspace. This motivates us to propose a unified paradigm combining the spatial and spectral properties for HSI restoration. The proposed paradigm enjoys performance superiority from the non-local spatial denoising and light computation complexity from the low-rank orthogonal basis exploration. An efficient alternating minimization algorithm with rank adaptation is developed. It is done by first solving a fidelity term-related problem for the update of a latent input image, and then learning a low-dimensional orthogonal basis and the related reduced image from the latent input image. Subsequently, non-local low-rank denoising is developed to refine the reduced image and orthogonal basis iteratively. Finally, the experiments on HSI denoising, compressed reconstruction, and inpainting tasks, with both simulated and real datasets, demonstrate its superiority with respect to state-of-the-art HSI restoration methods.