Aug 2026· Mathematics· Vol 14, pp. 2731· 0 citations· 76 references
TL;DR
The proposed NLRR approach iteratively refines the latent LR tensor structure by minimizing the rank residual, thereby decoupling noise suppression from tensor approximation and outperforms numerous popular or state-of-the-art methods in both quantitative evaluation and visual perception.
Abstract
Hyperspectral image (HSI) denoising remains a critical challenge due to noise corruption during acquisition. While nonlocal low-rank (LR) tensor methods leverage spatial–spectral correlations, they usually fail under heavy or complex noise, as directly estimating LR tensors from noisy observations usually leads to residual noise accumulation. To address this limitation, we propose a novel nonlocal low-rank residual (NLRR) approach, which reformulates LR tensor recovery as a progressive residual minimization problem. Unlike conventional methods that exclusively approximate LR tensors directly from degraded observations, the proposed NLRR approach iteratively refines the latent LR tensor structure by minimizing the rank residual, thereby decoupling noise suppression from tensor approximation. This residual-driven framework uniquely integrates two complementary priors: (1) a nonlocal LR residual prior that exploits spatial self-similarity, and (2) a global spectral LR prior that suppresses spectral redundancy. To generalize the proposed NLRR approach to real-world scenarios with mixed noise, we develop the NLRR-robust principal component analysis (NLRR-RPCA) framework, which incorporates the LR residual along with global spectral LR and sparse tensor priors for mixed noise removal. Additionally, to ensure both numerical stability and computational tractability, we develop an adaptive rank-adjusted alternating minimization algorithm, which dynamically adjusts the ranks of the estimated tensors to better handle different noise scenarios. Extensive experiments on both simulated and real HSI datasets demonstrate that our proposed NLRR approach outperforms numerous popular or state-of-the-art methods in both quantitative evaluation and visual perception.
This work first formulate cloud removal as a joint optimization problem that preserves spectral correlations via low-rank priors while exploiting SAR information, which provides robust structural and textural guidance for restoring spatial details occluded in the optical images.
Hyperspectral images (HSIs) are often simultaneously degraded by spatial downsampling, complex noise contamination, and pixel loss during acquisition, resulting in spatial blurring and spectral distortion that severely hinder quantitative analysis and downstream applications. Most existing HSI restoration methods are d...
Huai-Yuan Wang, Jian-Sheng Wang, Fan-Li Lin et al.· IEEE Transactions on Geoscie...· 1 citation
Hyperspectral unmixing (HU) is a fundamental task for resolving the mixed pixel problem by decomposing a hyperspectral image (HSI) into constituent endmembers and their corresponding abundances. Although deep-learning-based HU methods have achieved promising performance, most rely on manually designed network architect...
Jing-Ran Wang, Feng-Chao Xiong, Zhiyuan Wen et al.· IEEE Transactions on Geoscie...· 0 citations
Existing tensor robust principal component analysis (TRPCA) frameworks have achieved remarkable success in recovering low-rank structures from high-dimensional data. However, current methods often rely on a single noise distribution assumption, limiting their effectiveness in complex real-world scenarios and consequent...
Chinese pushbroom spaceborne hyperspectral imagery is frequently affected by structural artifacts, such as stripes and dead lines, and by mixed noise that is nonindependent and identically distributed across spectral bands. Such degradation is particularly critical for shortwave-infrared (SWIR) mineral mapping. Followi...
Mei Xiao, Jie-Jun Huang, Ming Zhang et al.· IEEE Journal of Selected Top...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.