Fast Noise Removal in Hyperspectral Images via Representative Coefficient Total Variation

• URL: http://arxiv.org/abs/2211.01825v1
• Date: Thu, 3 Nov 2022 14:06:37 GMT
• Title: Fast Noise Removal in Hyperspectral Images via Representative Coefficient Total Variation
• Abstract summary: Mining structural priors in data is a widely recognized technique for hyperspectral image (HSI) denoising tasks. Model-based methods have good generalization ability, while the runtime cannot meet the fast processing requirements. We propose a novel regularizer named Representative Coefficient Total Variation (RCTV) to simultaneously characterize the low rank and local smooth properties.
• Score: 38.23169948685068
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mining structural priors in data is a widely recognized technique for hyperspectral image (HSI) denoising tasks, whose typical ways include model-based methods and data-based methods. The model-based methods have good generalization ability, while the runtime cannot meet the fast processing requirements of the practical situations due to the large size of an HSI data $ \mathbf{X} \in \mathbb{R}^{MN\times B}$. For the data-based methods, they perform very fast on new test data once they have been trained. However, their generalization ability is always insufficient. In this paper, we propose a fast model-based HSI denoising approach. Specifically, we propose a novel regularizer named Representative Coefficient Total Variation (RCTV) to simultaneously characterize the low rank and local smooth properties. The RCTV regularizer is proposed based on the observation that the representative coefficient matrix $\mathbf{U}\in\mathbb{R}^{MN\times R} (R\ll B)$ obtained by orthogonally transforming the original HSI $\mathbf{X}$ can inherit the strong local-smooth prior of $\mathbf{X}$. Since $R/B$ is very small, the HSI denoising model based on the RCTV regularizer has lower time complexity. Additionally, we find that the representative coefficient matrix $\mathbf{U}$ is robust to noise, and thus the RCTV regularizer can somewhat promote the robustness of the HSI denoising model. Extensive experiments on mixed noise removal demonstrate the superiority of the proposed method both in denoising performance and denoising speed compared with other state-of-the-art methods. Remarkably, the denoising speed of our proposed method outperforms all the model-based techniques and is comparable with the deep learning-based approaches.

Related papers

• Flash-BoN: Instant Drafts for Inference-Time Scaling in Diffusion Models [91.19049123903137]
  Inference-time scaling for text-to-image generation has progressed from simple Best-of-$N$ sampling to guided search methods.<n>These approaches focus on when and how often to verify during denoising but largely treat the cost of generation itself as fixed.<n>We show that under wall-clock evaluation, simple BoN already matches or outperforms several guided search techniques.
  arXiv  Detail & Related papers  (2026-07-05T19:02:32Z)
• Spatial-Spectral Adaptive Fidelity and Noise Prior Reduction Guided Hyperspectral Image Denoising [11.513560890234864]
  We propose a framework that integrates noise prior reduction and spatial-spectral adaptive fidelity term.<n>Within this framework, we develop a fast and robust pixel-wise model combined with the representative coefficient total variation regularizer.<n>Experiments on simulated and real-world datasets demonstrate that the proposed model achieves superior denoising performance.
  arXiv  Detail & Related papers  (2026-04-14T11:27:23Z)
• Unrestrained Simplex Denoising for Discrete Data. A Non-Markovian Approach Applied to Graph Generation [50.328122325596865]
  We introduce simplex denoising, a simple yet effective generative framework that operates on the probability simplex.<n>For a given clean data point, noisy representations at different times are conditionally independent.<n> Empirically, emphunrestrained simplex denoising surpasses strong discrete diffusion and flow-matching baselines.
  arXiv  Detail & Related papers  (2026-03-30T15:26:56Z)
• Diffusion Models for Solving Inverse Problems via Posterior Sampling with Piecewise Guidance [52.705112811734566]
  A novel diffusion-based framework is introduced for solving inverse problems using a piecewise guidance scheme.<n>The proposed method is problem-agnostic and readily adaptable to a variety of inverse problems.<n>The framework achieves a reduction in inference time of (25%) for inpainting with both random and center masks, and (23%) and (24%) for (4times) and (8times) super-resolution tasks.
  arXiv  Detail & Related papers  (2025-07-22T19:35:14Z)
• STAR-Net: An Interpretable Model-Aided Network for Remote Sensing Image Denoising [19.319042523414183]
  We propose a novel RSI denoising method named sparse tensor-aided representation network (STAR-Net)<n>We extend STAR-Net to a sparse variant called STAR-Net-S to deal with the interference caused by non-Gaussian noise in original RSI for the purpose of improving robustness.<n> Comprehensive experiments on synthetic and real-world datasets demonstrate that STAR-Net and STAR-Net-S outperform state-of-the-art RSI denoising methods.
  arXiv  Detail & Related papers  (2025-05-30T08:09:31Z)
• Test-Time Scaling of Diffusion Models via Noise Trajectory Search [7.243632426715941]
  We introduce an $epsilon$-greedy search algorithm that globally explores at extreme timesteps and locally exploits during the intermediate steps where de-mixing occurs.<n>Experiments on EDM and Stable Diffusion reveal state-of-the-art scores for class-conditioned/text-to-image generation.
  arXiv  Detail & Related papers  (2025-05-24T19:13:29Z)
• Robust Representation Consistency Model via Contrastive Denoising [83.47584074390842]
  randomized smoothing provides theoretical guarantees for certifying robustness against adversarial perturbations. diffusion models have been successfully employed for randomized smoothing to purify noise-perturbed samples. We reformulate the generative modeling task along the diffusion trajectories in pixel space as a discriminative task in the latent space.
  arXiv  Detail & Related papers  (2025-01-22T18:52:06Z)
• Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation [71.69331824668954]
  Low-rank tensor representation is an important approach to alleviate spectral variations. Previous low-rank representation methods can only be applied to the regular data cubes. We propose a novel irregular lowrank representation method that can efficiently model the irregular 3D cubes.
  arXiv  Detail & Related papers  (2024-10-24T02:56:22Z)
• Orthogonal Constrained Minimization with Tensor $\ell_{2,p}$ Regularization for HSI Denoising and Destriping [9.158391874035011]
  Hyperspectral images (HSIs) are often contaminated by a mixture of noises such as Gaussian noise, dead lines, stripes, and so on. We propose a novel approach for HSI denoising and destriping called NLTL2p.
  arXiv  Detail & Related papers  (2024-07-04T03:33:19Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• A GPU-Accelerated Light-field Super-resolution Framework Based on Mixed Noise Model and Weighted Regularization [4.898659895355356]
  This paper presents a GPU-accelerated computational framework for reconstructing high resolution (HR) LF images under a mixed Gaussian-Impulse noise condition. We derive a joint $ell1$-$ell2$ data fidelity term for penalizing the HR reconstruction error taking into account the mixed noise situation. We show that the alternating direction method of multipliers algorithm (ADMM) can be used to simplify the computation.
  arXiv  Detail & Related papers  (2022-06-09T05:23:05Z)
• Zero-shot Blind Image Denoising via Implicit Neural Representations [77.79032012459243]
  We propose an alternative denoising strategy that leverages the architectural inductive bias of implicit neural representations (INRs) We show that our method outperforms existing zero-shot denoising methods under an extensive set of low-noise or real-noise scenarios.
  arXiv  Detail & Related papers  (2022-04-05T12:46:36Z)
• Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularization [49.55649406434796]
  We propose a novel non particular approach to robust principal component analysis for HSI denoising. We develop accurate approximations to both rank and sparse components. Experiments on both simulated and real HSIs demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-01-08T11:48:46Z)
• Unsupervised Single Image Super-resolution Under Complex Noise [60.566471567837574]
  This paper proposes a model-based unsupervised SISR method to deal with the general SISR task with unknown degradations. The proposed method can evidently surpass the current state of the art (SotA) method (about 1dB PSNR) not only with a slighter model (0.34M vs. 2.40M) but also faster speed.
  arXiv  Detail & Related papers  (2021-07-02T11:55:40Z)
• Hyperspectral Image Denoising with Log-Based Robust PCA [29.566894890976194]
  It is a challenging task to remove heavy and mixed types noise from Hyperspectral images (HSIs) We propose a novel non approximation approach to RPCA for HSI denoising. Experiments on both simulated real HSIs demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2021-05-25T13:32:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.