Hyperspectral Image Denoising Research Articles

Unsupervised Adaptation Learning for Real Multiplatform Hyperspectral Image Denoising.

Real hyperspectral images (HSIs) are ineluctably contaminated by diverse types of noise, which severely limits the image usability. Recently, transfer learning has been introduced in hyperspectral denoising networks to improve model generalizability. However, the current frameworks often rely on image priors and struggle to retain the fidelity of background information. In this article, an unsupervised adaptation learning (UAL)-based hyperspectral denoising network (UALHDN) is proposed to address these issues. The core idea is first learning a general image prior for most HSIs, and then adapting it to a real HSI by learning the deep priors and maintaining background consistency, without introducing hand-crafted priors. Following this notion, a spatial-spectral residual denoiser, a global modeling discriminator, and a hyperspectral discrete representation learning scheme are introduced in the UALHDN framework, and are employed across two learning stages. First, the denoiser and the discriminator are pretrained using synthetic noisy-clean ground-based HSI pairs. Subsequently, the denoiser is further fine-tuned on the real multiplatform HSI according to a spatial-spectral consistency constraint and a background consistency loss in an unsupervised manner. A hyperspectral discrete representation learning scheme is also designed in the fine-tuning stage to extract semantic features and estimate noise-free components, exploring the deep priors specific for real HSIs. The applicability and generalizability of the proposed UALHDN framework were verified through the experiments on real HSIs from various platforms and sensors, including unmanned aerial vehicle-borne, airborne, spaceborne, and Martian datasets. The UAL denoising scheme shows a superior denoising ability when compared with the state-of-the-art hyperspectral denoisers.

Exploring high-order correlation for hyperspectral image denoising with hypergraph convolutional network

High-order correlation is an important property of hyperspectral images (HSIs) and has been widely investigated in model-based HSI denoising. However, the existing deep learning-based HSI denoising approaches have not fully utilized the high-order correlation. Hypergraph convolutional networks have shown great potential in capturing the high-order correlation. Therefore, in this paper, we propose a novel HSI denoising method by employing hypergraph convolution to characterize the high-order correlation at the patch level. Specifically, our framework is a symmetrically skip-connected 3D encoder–decoder architecture, which enhances the extraction and utilization of local features. Furthermore, to integrate competently the hypergraph convolutional modules into the 3D framework, we devise a dimensional transformation module that facilitates the fusion of 3D convolution and hypergraph convolution. Notably, in the hypergraph convolution operation, we use a data-driven technique to acquire the incidence matrix of a hypergraph, efficiently constructing the HSI into a high-order structure. Our proposed method excels in HSI denoising performance compared to state-of-the-art approaches, evidenced by extensive experiments on synthetic and real-world noisy HSIs.

Hyperspectral Image Denoising and Compression Using Optimized Bidirectional Gated Recurrent Unit

The availability of a higher resolution fine spectral bandwidth in hyperspectral images (HSI) makes it easier to identify objects of interest in them. The inclusion of noise into the resulting collection of images is a limitation of HSI and has an adverse effect on post-processing and data interpretation. Denoising HSI data is thus necessary for the effective execution of post-processing activities like image categorization and spectral unmixing. Most of the existing models cannot handle many forms of noise simultaneously. When it comes to compression, available compression models face the problems of increased processing time and lower accuracy. To overcome the existing limitations, an image denoising model using an adaptive fusion network is proposed. The denoised output is then processed through a compression model which uses an optimized deep learning technique called "chaotic Chebyshev artificial hummingbird optimization algorithm-based bidirectional gated recurrent unit" (CCAO-BiGRU). All the proposed models were tested in Python and evaluated using the Indian Pines, Washington DC Mall and CAVE datasets. The proposed model underwent qualitative and quantitative analysis and showed a PSNR value of 82 in the case of Indian Pines and 78.4 for the Washington DC Mall dataset at a compression rate of 10. The study proved that the proposed model provides the knowledge about complex nonlinear mapping between noise-free and noisy HSI for obtaining the denoised images and also results in high-quality compressed output.

Bayesian Dictionary Learning on Robust Tubal Transformed Tensor Factorization.

The recent study on tensor singular value decomposition (t-SVD) that performs the Fourier transform on the tubes of a third-order tensor has gained promising performance on multidimensional data recovery problems. However, such a fixed transformation, e.g., discrete Fourier transform and discrete cosine transform, lacks being self-adapted to the change of different datasets, and thus, it is not flexible enough to exploit the low-rank and sparse property of the variety of multidimensional datasets. In this article, we consider a tube as an atom of a third-order tensor and construct a data-driven learning dictionary from the observed noisy data along the tubes of the given tensor. Then, a Bayesian dictionary learning (DL) model with tensor tubal transformed factorization, aiming to identify the underlying low-tubal-rank structure of the tensor effectively via the data-adaptive dictionary, is developed to solve the tensor robust principal component analysis (TRPCA) problem. With the defined pagewise tensor operators, a variational Bayesian DL algorithm is established and updates the posterior distributions instantaneously along the third dimension to solve the TPRCA. Extensive experiments on real-world applications, such as color image and hyperspectral image denoising and background/foreground separation problems, demonstrate both effectiveness and efficiency of the proposed approach in terms of various standard metrics.

Hyperspectral Image Denoising by Pixel-Wise Noise Modeling and TV-Oriented Deep Image Prior

Model-based hyperspectral image (HSI) denoising methods have attracted continuous attention in the past decades, due to their effectiveness and interpretability. In this work, we aim at advancing model-based HSI denoising, through sophisticated investigation for both the fidelity and regularization terms, or correspondingly noise and prior, by virtue of several recently developed techniques. Specifically, we formulate a novel unified probabilistic model for the HSI denoising task, within which the noise is assumed as pixel-wise non-independent and identically distributed (non-i.i.d) Gaussian predicted by a pre-trained neural network, and the prior for the HSI image is designed by incorporating the deep image prior (DIP) with total variation (TV) and spatio-spectral TV. To solve the resulted maximum a posteriori (MAP) estimation problem, we design a Monte Carlo Expectation–Maximization (MCEM) algorithm, in which the stochastic gradient Langevin dynamics (SGLD) method is used for computing the E-step, and the alternative direction method of multipliers (ADMM) is adopted for solving the optimization in the M-step. Experiments on both synthetic and real noisy HSI datasets have been conducted to verify the effectiveness of the proposed method.

Hider: A Hyperspectral Image Denoising Transformer With Spatial-Spectral Constraints for Hybrid Noise Removal.

Hyperspectral image (HSI) qualities are limited by a mixture of Gaussian noise, impulse noise, stripes, and deadlines during the sensor imaging process, resulting in weak application performance. To enhance HSI qualities, methods based on convolutional neural networks have been successively applied to restore clean data from the observed data. However, the architecture of these methods lacks spectral and spatial constraints, and the convolution operators have limited receptive fields and inflexible model inferences. Thus, in this study, we propose an efficient end-to-end transformer, named HSI denoising transformer (Hider), for mixed HSI noise removal. First, a U-shaped 3-D transformer architecture is built for multiscale feature aggregation. Second, a multihead global spectral attention module within the spectral transformer block is designed to excavate information in different spectral patterns. Finally, an additional locally enhanced cross-spatial attention module within the spatial-spectral transformer block is constructed to build the long-range spatial relationship to avoid the high computational complexity of global spatial self-attention. Through the imposition of global correlations along spectrum and spatial self-similarity constraints on the transformer, our proposed Hider aims to capture long-range spatial contextual information and cluster objects with the same spectral pattern for HSI denoising. To verify the effectiveness and efficiency of Hider, we conducted extensive simulated and real experiments. The denoising results on both simulated and real-world datasets show that Hider achieves superior evaluation metrics and visual assessments compared with other state-of-the-art methods.

Hyperspectral Image Mixed Noise Removal via Double Factor Total Variation Nonlocal Low-Rank Tensor Regularization

A hyperspectral image (HSI) is often corrupted by various types of noise during image acquisition, e.g., Gaussian noise, impulse noise, stripes, deadlines, and more. Thus, as a preprocessing step, HSI denoising plays a vital role in many subsequent tasks. Recently, a variety of mixed noise removal approaches have been developed for HSI, and the methods based on spatial–spectral double factor and total variation (DFTV) regularization have achieved comparable performance. Additionally, the nonlocal low-rank tensor model (NLR) is often employed to characterize spatial nonlocal self-similarity (NSS). Generally, fully exploring prior knowledge can improve the denoising performance, but it significantly increases the computational cost when the NSS prior is employed. To solve this problem, this article proposes a novel DFTV-based NLR regularization (DFTVNLR) model for HSI mixed noise removal. The proposed model employs low-rank tensor factorization (LRTF) to characterize the spectral global low-rankness (LR), introduces 2-D and 1-D TV constraints on double-factor to characterize the spatial and spectral local smoothness (LS), respectively. Meanwhile, the NLR is applied to the spatial factor to characterize the NSS. Then, we developed an algorithm based on proximal alternating minimization (PAM) to solve the proposed model effectively. Particularly, we effectively controlled the computational cost from two aspects, namely taking small-sized double factor as regularization object and putting the time-consuming NLR model before the main loop with fewer iterations to solve it independently. Finally, considerable experiments on simulated and real noisy HSI substantiate that the proposed method is superior to the related state-of-the-art methods in balancing the denoising effect and speed.

Multidimensional Data Processing With Bayesian Inference via Structural Block Decomposition.

How to handle large multidimensional datasets, such as hyperspectral images and video information, efficiently and effectively plays a critical role in big-data processing. The characteristics of low-rank tensor decomposition in recent years demonstrate the essentials in describing the tensor rank, which often leads to promising approaches. However, most current tensor decomposition models consider the rank-1 component simply to be the vector outer product, which may not fully capture the correlated spatial information effectively for large-scale and high-order multidimensional datasets. In this article, we develop a new novel tensor decomposition model by extending it to the matrix outer product or called Bhattacharya-Mesner product, to form an effective dataset decomposition. The fundamental idea is to decompose tensors structurally in a compact manner as much as possible while retaining data spatial characteristics in a tractable way. By incorporating the framework of the Bayesian inference, a new tensor decomposition model on the subtle matrix unfolding outer product is established for both tensor completion and robust principal component analysis problems, including hyperspectral image completion and denoising, traffic data imputation, and video background subtraction. Numerical experiments on real-world datasets demonstrate the highly desirable effectiveness of the proposed approach.

Flex-DLD: Deep Low-Rank Decomposition Model With Flexible Priors for Hyperspectral Image Denoising and Restoration.

Hyperspectral images (HSIs) are composed of hundreds of contiguous waveband images, offering a wealth of spatial and spectral information. However, the practical use of HSIs is often hindered by the presence of complicated noise caused by various factors such as non-uniform sensor response and dark current. Traditional methods for denoising HSIs rely on constrained optimization approaches, where selecting appropriate prior knowledge is critical for achieving satisfactory results. Nevertheless, these traditional algorithms are limited by hand-crafted priors, leaving room for improvement in their denoising performance. Recently, the supervised deep learning technique has emerged as a promising approach for HSI denoising. However, their requirement for paired training data and poor generalization ability on untrained noise distributions pose challenges in practical applications. In this paper, we design a novel algorithm by the synergism of optimization-based methods and deep learning techniques. Specifically, we introduce a plug-and-play Deep Low-rank Decomposition (DLD) model into the optimization framework. Furthermore, we propose an effective mechanism to incorporate traditional prior knowledge into the DLD model. Finally, we provide a detailed analysis of the optimization process and convergence of the proposed method. Empirical evaluations on various tasks, including hyperspectral image denoising and spectral compressive imaging, demonstrate the superiority of our approach over state-of-the-art methods.

Latent Diffusion Enhanced Rectangle Transformer for Hyperspectral Image Restoration.

The restoration of hyperspectral image (HSI) plays a pivotal role in subsequent hyperspectral image applications. Despite the remarkable capabilities of deep learning, current HSI restoration methods face challenges in effectively exploring the spatial non-local self-similarity and spectral low-rank property inherently embedded with HSIs. This paper addresses these challenges by introducing a latent diffusion enhanced rectangle Transformer for HSI restoration, tackling the non-local spatial similarity and HSI-specific latent diffusion low-rank property. In order to effectively capture non-local spatial similarity, we propose the multi-shape spatial rectangle self-attention module in both horizontal and vertical directions, enabling the model to utilize informative spatial regions for HSI restoration. Meanwhile, we propose a spectral latent diffusion enhancement module that generates the image-specific latent dictionary based on the content of HSI for low-rank vector extraction and representation. This module utilizes a diffusion model to generatively obtain representations of global low-rank vectors, thereby aligning more closely with the desired HSI. A series of comprehensive experiments were carried out on four common hyperspectral image restoration tasks, including HSI denoising, HSI super-resolution, HSI reconstruction, and HSI inpainting. The results of these experiments highlight the effectiveness of our proposed method, as demonstrated by improvements in both objective metrics and subjective visual quality.

Adaptive Regularized Low-Rank Tensor Decomposition for Hyperspectral Image Denoising and Destriping

Adaptive Regularized Low-Rank Tensor Decomposition for Hyperspectral Image Denoising and Destriping

Unidirectional Spatial and Spectral Smoothed Tensor Ring Decomposition for Hyperspectral Image Denoising and Destriping

Unidirectional Spatial and Spectral Smoothed Tensor Ring Decomposition for Hyperspectral Image Denoising and Destriping

A Neural Network for Hyperspectral Image Denoising by Combining Spatial–Spectral Information

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.

A guidable nonlocal low-rank approximation model for hyperspectral image denoising

Hyperspectral image (HSI) denoising is an essential preprocessing step for improving HSI applications. Recently, subspace-based nonlocal low-rank approximation (SNLR) methods have shown their superiority. However, most of these methods ignore such a potentially important phenomenon, that is, real HSIs contain many high signal-to-noise ratio bands (HSNRBs), and thus result in the underutilization of information. In this paper, we propose a new method called Subspace-based Guided Nonlocal Low-Rank Approximation (SGNLR) for HSI denoising. Our method takes advantage of the abundant spatial information in the representation coefficients of HSNRBs to improve denoising performances. Specifically, we employ low-rank subspace representation to exploit the global spectral correlation of HSI and transform the HSI denoising task as the estimation of spectral basis and spatial representation coefficients (SRCs). Motivated by the consistency of coefficient features between the whole HSI and HSNRBs, we employ the SRCs of HSNRBs to guide the restoration of target coefficients. To restore the SRCs accurately, we design a powerful nonlocal low-rank approximation that takes into account the nonlocal self-similarity (NSS) of SRCs. An efficient algorithm based on alternating minimization is developed to optimize the proposed model. Extensive experiments on both simulated and real-world data demonstrate the outperformance of our method.

Hyperspectral fruit image restoration using non-convex optimization

Hyperspectral (HS) imaging captured at low proximity ranges has become an effective method for assessing the quality and safety of food products in recent years. The majority of Hyperspectral cameras are push-broom type, which often contributes random noise and stripes to the spectral images. As a result, the quality of the collected HS images and the precision of the subsequent processing will both suffer. Despite the fact that there are several denoising techniques that have been studied and recorded in the literature, they frequently fail to fully restore the original HS images when there are strong stripe noises and other intricate mixed noises. In this study, we introduce a new method based on tensor logarithmic Schatten-p norm minimization with anisotropic spatial spectral total variation (ASSTV) regularization for simultaneous denoising and destriping of line scan-based hyperspectral images. Tensor logarithmic Schatten-p norm improves denoising performance by deleting the smaller singular values while protecting the larger singular values. Through the application of ASSTV, stripes and Gaussian noise are eliminated while maintaining the spatial–spectral smoothness of HS images and the directional characteristics of the stripes. The augmented Lagrange multiplier (ALM) approach is used to address the ensuing optimization problem. The quantitative and visual assessments reveal that the suggested technique has improved performance than its counterparts.

An End-to-End Framework for Joint Denoising and Classification of Hyperspectral Images.

Image denoising and classification are typically conducted separately and sequentially according to their respective objectives. In such a setup, where the two tasks are decoupled, the denoising operation does not optimally serve the classification task and sometimes even deteriorates it. We introduce here a unified deep learning framework for joint denoising and classification of high-dimensional images, and we particularly apply it in the framework of hyperspectral imaging. Earlier works on joint image denoising and classification are very scarce, and to the best of our knowledge, no deep learning models were proposed or studied yet for this type of multitask image processing. A key component in our joint learning model is a compound loss function, designed in such a way that the denoising and classification operations benefit each other iteratively during the learning process. Hyperspectral images (HSIs) are particularly challenging for both denoising and classification due to their high dimensionality and varying noise statistics across the bands. We argue that a well-designed end-to-end deep learning framework for joint denoising and classification is superior to current deep learning approaches for processing HSI data, and we substantiate this by results on real HSI images in remote sensing. We experimentally show that the proposed joint learning framework substantially improves the classification performance compared to the common deep learning approaches in HSI processing, and as a by-product, the denoising results are enhanced as well, especially in terms of the semantic content, benefiting from the classification.

Spatial-Spectral Transformer for Hyperspectral Image Denoising

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.

Hyperspectral image denoising via spectral noise distribution bootstrap

Hyperspectral image (HSI) denoising is an ill-posed problem, leading to integrating proper prior knowledge about hyperspectral noise is critical to developing an efficient denoising method. Most existing methods share a common assumption that all bands have equal noise intensity. However, such assumption runs counter to the practical HSIs, leading to unpleasant denoising results. To tackle this, we intend to investigate the intrinsic properties of real HSI noise in the spectral dimension and construct a novel denoising framework bootstrapping by spectral noise distribution N^, termed N^-Net. On the one hand, we develop dense and sparse recurrent calculations, exploiting intrinsic properties of HSI noise (i.e., diversity, dense dependency, and global sparsity) to estimate spectral noise distribution. On the other hand, having the estimated spectral noise distribution, we develop a bootstrap mechanism with a repetitive emphasis on its guidance for subsequent spatial noise separation and clean HSI recovery, ensuring a more delicate denoising effect. In particular, we verify that the proposed denoising framework can achieve promising denoising performances due to the merit of spectral noise distribution bootstrapping, which also promotes new insights for future related research. The code is avaliable at https://github.com/EtPan/N-Net.

Hyperspectral Image Denoising via Weighted Multidirectional Low-Rank Tensor Recovery.

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.

Robust Hyperspectral Unmixing with Practical Learning-Based Hyperspectral Image Denoising

The noise corruption problem commonly exists in hyperspectral images (HSIs) and severely affects the accuracy of hyperspectral unmixing algorithms. The noise formulation existing in HSIs is relatively complex and would change in conjunction with different devices and imaging settings. For real applications, applying denoising approaches without accurate close-to-reality noise modeling before unmixing may not improve, but rather degrade the unmixing performance. This study proposes a robust hyperspectral unmixing method with practical learning-based hyperspectral image denoising. We formulated a close-to-reality noise model for hyperspectral data and provide a calibration approach for the noise parameters. On the basis of the calibrated noise model, synthetic data were generated and used for training a KST-based denoising network. The noisy hyperspectral data were firstly denoised by the trained denoising network and were then used to perform the unmixing process. A variety of unmixing algorithms can be integrated into our method to improve the accuracy of unmixing in noisy situations. In the experiments, several widely used unmixing algorithms were employed to verify the effect of the proposed method. The experimental results on both synthetic and real demonstrated that our proposed method can handle HSI data with various gain settings and helps to improve the unmixing performance effectively.