The paper introduces a functional Tucker decomposition (FTD) that incorporates a mode-wise continuity constraint into tensor factorization, modeling continuous modes as functions in a reproducing kernel Hilbert space (RKHS) without requiring a predefined basis. It preserves the multilinear subspace structure of the Tucker model and provides a reconstruction error bound for continuous modes, quantifying approximation quality when a subspace estimated on one domain is reused on another. The authors demonstrate the practical value of this subspace transfer on cross-domain classification tasks in hyperspectral imaging and multivariate time-series analysis.
By Noah Steidle, Joppe De Jonghe, Mariya Ishteva
The paper introduces MultiHU‑TD, an interpretable framework for multifeature hyperspectral unmixing that employs tensor decomposition and incorporates the abundance sum‑to‑one constraint via an ADMM algorithm. It extends previous models by adding mathematical morphology and neighborhood patch analysis, and provides detailed mathematical, physical, and graphical interpretations linked to the extended linear mixing model. Experiments on real hyperspectral images demonstrate the model’s interpretability and effectiveness, with code released on GitHub.
By Mohamad Jouni, Mauro Dalla Mura, Lucas Drumetz, Pierre Comon
The paper introduces a new semi‑tensor product for third‑order tensors that relaxes the dimensional constraints of the standard t‑product while preserving the closed‑form nature of T‑SVD. It builds a multi‑term semi‑tensor product singular value decomposition (MSTP‑SVD) that improves low‑rank approximation accuracy, and further accelerates it with randomized projection and power iteration to create the MRSTP‑SVD algorithm. Experiments on image and video compression and completion show that this method balances reconstruction accuracy and computational efficiency.
By Xingchen Xiao (School of Mathematics and Statistics, Southwest University, Chongqing, China), Feng Zhang (School of Mathematics and Statistics, Southwest University, Chongqing, China), Wenjin Qin (School of Mathematics and Statistics, Southwest University, Chongqing, China), Jianjun Wang (School of Mathematics and Statistics, Southwest University, Chongqing, China)
arXiv:2609.24679v1 Announce Type: new
Abstract: We consider the recovery of low-multilinear-rank tensors from linear measurements and propose an adaptive block-weighted modewise Riemannian gradient d...
By Yushi Zhou, Feng Zhang
Tensor Completion using Subspace Information (TCSI) is an algorithm that leverages side information by estimating a subspace and reformulating tensor completion as a matrix regression problem. Theoretical analysis shows that accurate subspace information reduces sample complexity to nearly linear in the uncoupled ambient dimensions and relaxes signal-to-noise ratio requirements compared to existing guarantees. Numerical simulations and an application to reconstructing global Total Electron Content (TEC) maps demonstrate lower reconstruction errors than competing methods.
By Jingyang Li, Michael K. Ng
arXiv:2609.14307v1 Announce Type: new
Abstract: Low-rank tensor factorization provides a flexible framework for completing multidimensional data from incomplete and corrupted observations. However, u...
By Binghao Wang, Feng Zhang, Wendong Wang, Jianjun Wang
arXiv:2606. 31061v1 Announce Type: cross Abstract: Tensor Train (TT) decomposition is a powerful technique for analyzing high-dimensional data.
By Hiroki Takeda, Yuto Miyatake, Daisuke Furihata
The paper introduces TSR-ITNR, a two‑stage, self‑supervised framework for hyperspectral image super‑resolution that fuses high‑resolution multispectral and low‑resolution hyperspectral data. Stage 1 refines an implicit Tucker representation using a low‑rank spatial tensor and spectral basis, enhanced by a pretrained denoiser, to capture fine spatial details and spectral correlations. Stage 2 applies parameter‑free calibration to extract complementary corrections from both observations, preserving geometry and ensuring orthogonal complementarity, leading to superior reconstruction quality demonstrated on benchmark datasets and improved downstream segmentation performance.
By Liqian Yang, Xingchi Chen, Xinfeng Gui, Xiangyong Cao, Qianxin Yi
arXiv:2608. 16241v1 Announce Type: cross Abstract: Feature extraction for hyperspectral image classification is conventionally addressed using rigid tensor decompositions that fail to capture complex spatio-spectral interdependencies, or heavily parameterized convolutional neural networks that are computationally expensive.
By S\"uha Tuna, \"Ulker Ba\c{s}ar
The paper proposes a neurosymbolic regularization framework that adds a differentiable prototype‑rule to rank‑constrained tensor neural networks, aiming to improve class geometry under limited supervision. Experiments on four hyperspectral datasets with various Rank‑R settings and spatially separated folds show that training‑time prototype regularization yields the majority of performance gains, while inference fusion of prototype evidence with neural logits has a smaller, dataset‑dependent effect. The method achieves notable Macro‑F1 improvements, especially on the Botswana and Indian Pines benchmarks.
By Eftychios Protopapadakis, Konstantinos Makantasis, Konstantinos M. Giannoutakis
arXiv:2609.12843v1 Announce Type: new
Abstract: Recently, tensor decompositions are prevalent for multi-dimensional image representation, which learn the instance-specific structure of each image fro...
By Bing-Zhang Fu, Zhi-Long Han, Ting-Zhu Huang, Xi-Le Zhao, Deyu Meng
arXiv:2608. 03928v1 Announce Type: cross Abstract: Tensor cross-concentrated sampling (t-CCS) bridges entrywise sampling and t-CUR slice-wise sampling by observing entries only within selected horizontal and lateral slices.
By Hanqin Cai, Longxiu Huang, Jing Qin, Chengyue Wu