A robust tensor recovery model based on second-order difference-induced adaptive tensor nuclear norm regularization that consistently improves PSNR and ERGAS under all tested noise settings while achieving competitive SSIM values is proposed.
Abstract
Tensor data, such as hyperspectral images and videos, are often degraded by mixed noise, including Gaussian noise, sparse corruption, and outliers. In this paper, we propose a robust tensor recovery model based on second-order difference-induced adaptive tensor nuclear norm regularization. The underlying clean tensor is represented by a representative coefficient tensor and a learned orthogonal basis along the third mode, so that global low-rank correlations can be characterized in a compact and data-adaptive coefficient domain rather than in a fixed transform space. To incorporate local smoothness into the same representation, tensor nuclear norm penalties are imposed on the spatial second-order difference tensors of the representative coefficients. Compared with conventional first-order total variation, the proposed regularizer models local curvature variations and the correlations among second-order difference patterns, which helps reduce staircase artifacts while preserving structural details. A Hybrid Ordinary–Welsch fidelity term and an $\ell _{1}$ -norm sparse error term are further incorporated to improve robustness against mixed noise. The resulting optimization problem is solved by an ADMM-based algorithm. Experiments on hyperspectral image and video denoising demonstrate that the proposed method consistently improves PSNR and ERGAS under all tested noise settings while achieving competitive SSIM values.
Image Sparse Noise Removal constitutes a core issue within the domain of image processing. The tensor nuclear norm (TNN) has achieved great success in color image sparse denoising, but it suffers from the problem of direction sensitivity. In order to address this problem, a color image sparse noise removal scheme via t...
Li Guo, Pei-Yu Qin· Journal of Physics, Conferen...· 0 citations
This work provides a theoretical analysis which establishes a non-asymptotic reconstruction error bound that characterizes the effects of sampling complexity, optimization convergence, and model mismatch in a structured tensor approximation problem.
Jeongmin Chae, Usama Saleem, Selin Bac et al.· 0 citations
Principal component analysis is a second-order method, it selects covariance dominant directions. In local data models, however, a structural component may be rare or intermittent and therefore have modest variance but large fourth-order response. This note demonstrates a straightforward fourth-order enhancement based...
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 resi...
Lixia Xia, Youqun Chen, Xin Wang et al.· Mathematics· 0 citations
Matricized low-rank approximation via SVD is a standard surrogate for tensor decompositions, but entry-wise reconstruction error fails to capture multiway geometric degradation. Under an orthogonal Tucker model, we characterize this degradation using two metrics: cross-mode Direction Loss, measuring geometric subspace...
Multilinear principal component analysis (MPCA) reduces the dimension of tensor-valued data while preserving their mode-specific structure, but its quadratic scatter criterion can be unstable under heavy-tailed distributions and contamination. We propose spatial-sign-based multilinear principal component analysis (SMPC...
Dong-Xu Yang, Wanfeng Liang, Le Zhou et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.