The problem of testing whether a signal lies within a given subspace, also named matched subspace detection, has been well studied when the signal is represented as a vector. However, the matched subspace detection methods based on vectors can not be applied to the situations that signals are naturally represented as multi-dimensional data arrays or tensors. Considering that tensor subspaces and orthogonal projections onto these subspaces are well defined in the recently proposed transform-based tensor model, which motivates us to investigate the problem of matched subspace detection in high dimensional case. In this paper, we propose an approach for tensor matched subspace detection based on the transform-based tensor model with tubal-sampling and elementwise-sampling, respectively. First, we construct estimators based on tubal-sampling and elementwise-sampling to estimate the energy of a signal outside a given subspace of a third-order tensor and then give the probability bounds of our estimators, which show that our estimators work effectively when the sample size is greater than a constant. Secondly, the detectors both for noiseless data and noisy data are given, and the corresponding detection performance analyses are also provided. Finally, based on discrete Fourier transform (DFT) and discrete cosine transform (DCT), the performance of our estimators and detectors are evaluated by several simulations, and simulation results verify the effectiveness of our approach.
Low-rankness and Smoothness Meet Subspace: A Unified Tensor Regularization for Hyperspectral Image Super-resolution
College of Science, Jiangxi University of Water Resources and Electric Power(江西水利水电大学理学院);Key Laboratory of Engineering Mathematics and Advanced Computing, Jiangxi University of Water Resources and Electric Power(江西水利水电大学工程数学与先进计算重点实验室);Department of Statistics and Data Science, Southern University of Science and Technology(南方科技大学统计与数据科学系)
Multi-subspace power method for decomposing partially symmetric tensors
John A. Paulson School of Engineering and Applied Sciences, Harvard University(哈佛大学约翰·A·保尔森工程与应用科学学院);Department of Mathematics, University of Georgia(佐治亚大学数学系);Department of Mathematics, University of Texas at Austin(德克萨斯大学奥斯汀分校数学系)
Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
在本文中,新的一般模式的Johnson-Lindenstrauss(JL)子空间嵌入的建议,都是相当快的生成和更容易存储比传统的JL嵌入时,非常大的向量和/或张量。相应的嵌入结果,然后证明了两种不同类型的低维(张量)子空间。这些新的子空间嵌入结果的第一个产生改进的空间复杂度界嵌入秩$r$张量的CP分解包含在一个固定的(但未知的)一组$r$秩一基础张量的跨度。在传统的向量设置这第一个结果产生新的和非常一般的近最优的不经意子空间嵌入结构,需要更少的随机位比标准的JL嵌入时,嵌入子空间的$\mathbb{C}^N$由特殊的Kronecker结构的基向量跨越生成。这里证明的第二个结果提供了任意$r$维子空间$\mathcal{S} \subset \mathbb{C}^N$的新的快速JL嵌入,其也需要更少的随机比特(并且因此更容易存储-即,需要更少的空间),以便实现小的$ε$失真。这些新的不经意子空间嵌入结果通过$(i)$有效地将$\mathcal{S}$中的任何给定向量折叠成(不一定是低秩)张量,然后$(ii)$将所得张量嵌入到$m \leq C r \log^c(N) / ε^2$的$\mathbb{C}^m$中。与压缩和快速压缩最小二乘解方法相关的应用也被考虑,包括用于拟合低秩CP分解的应用,并且所提出的JL嵌入结果在这两种设置中都显示出良好的数值效果。
Alternating least squares as moving subspace correction
Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);ETH Zurich(苏黎世联邦理工学院);University of Bonn(波恩大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学促进学会数理研究所)