Tensor decompositions have been successfully applied to multidimensional data recovery. However, classical tensor decompositions are not suitable for emerging spatio-irregular multidimensional data (i.e., spatio-irregular tensor), whose spatial domain is non-rectangular, e.g., spatial transcriptomics data from bioinformatics and semantic units from computer vision. By using preprocessing (e.g., zero-padding or element-wise 0-1 weighting), the spatio-irregular tensor can be converted to a spatio-regular tensor and then classical tensor decompositions can be applied, but this strategy inevitably introduces bias information, leading to artifacts. How to design a tensor-based method suitable for emerging spatio-irregular tensors is an imperative challenge. To address this challenge, we propose a learnable transform-assisted tensor singular value decomposition (LTA-TSVD) for spatio-irregular tensor recovery, which allows us to leverage the intrinsic structure behind the spatio-irregular tensor. Specifically, we design a learnable transform to project the original spatio-irregular tensor into its latent spatio-regular tensor, and then the latent low-rank structure is captured by classical TSVD on the resulting regular tensor. Empowered by LTA-TSVD, we develop spatio-irregular low-rank tensor completion (SIR-LRTC) and spatio-irregular tensor robust principal component analysis (SIR-TRPCA) models for the spatio-irregular tensor imputation and denoising respectively, and we design corresponding solving algorithms with theoretical convergence. Extensive experiments including the spatial transcriptomics data imputation and hyperspectral image denoising show SIR-LRTC and SIR-TRPCA are superior performance to competing approaches and benefit downstream applications.
IEEE IGARSS
Bi-Level Tensor Decomposition for Hyperspectral Image Restoration
This paper proposes a bi-level tensor decomposition (BLTD), properly exploiting the characterization advantages of tensor subspace representation (TSR) and tensor ring decomposition (TRD). More specifically, the first level is related to the decomposition of a third-order tensor into its TSR using the tensor-tensor product (t-product), and the second level performs TRD on the coefficient tensor obtained by TSR. Leveraging the proposed BLTD, we design a bi-level tensor nuclear norm (BLTNN)-based model for hyperspectral images (HSIs) denoising. To solve the model, we develop an efficient alternating direction method of multipliers (ADMM)-based algorithm. Experimental results demonstrate the superior performance of our method compared to existing methods.
2023
IEEE GRSL
H2TF for Hyperspectral Image Denoising: Where Hierarchical Nonlinear Transform Meets Hierarchical Matrix Factorization
Recently, tensor singular value decomposition(t-SVD) has emerged as a promising tool for hyperspectral image (HSI) processing. In the t-SVD, there are two key building blocks: 1) the low-rank enhanced transform and 2) the accompanying low-rank characterization of transformed frontal slices. Previous t-SVD methods mainly focus on the developments of 1), while neglecting the other important aspect, i.e., the exact characterization of transformed frontal slices. In this letter, we exploit the potentiality in both building blocks by leveraging the hierarchical nonlinear transform (HNT) and the hierarchical matrix factorization (HMF) to establish a new tensor factorization (termed as H2TF). Compared with shallow counter partners, e.g., low-rank matrix factorization (MF) or its convex surrogates, H2TF can better capture complex structures of transformed frontal slices due to its hierarchical modeling abilities. We then suggest the H2TF-based HSI denoising model and develop an alternating direction method of multipliers-based algorithm to address the resultant model. Extensive experiments validate the superiority of our method over state-of-the-art (SOTA) HSI denoising methods.