Spectral Compressed Sensing via CANDECOMP/PARAFAC Decomposition of Incomplete Tensors
National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China(电子科技大学通信抗干扰技术国家级重点实验室);Department of Electrical and Computer Engineering, Stevens Institute of Technology(史蒂文斯理工学院电气与计算机工程系)
We consider the line spectral estimation problem which aims to recover a mixture of complex sinusoids from a small number of randomly observed time domain samples. Compressed sensing methods formulates line spectral estimation as a sparse signal recovery problem by discretizing the continuous frequency parameter space into a finite set of grid points. Discretization, however, inevitably incurs errors and leads to deteriorated estimation performance. In this paper, we propose a new method which leverages recent advances in tensor decomposition. Specifically, we organize the observed data into a structured tensor and cast line spectral estimation as a CANDECOMP/PARAFAC (CP) decomposition problem with missing entries. The uniqueness of the CP decomposition allows the frequency components to be super-resolved with infinite precision. Simulation results show that the proposed method provides a competitive estimate accuracy compared with existing state-of-the-art algorithms.
Tensor Deflation for CANDECOMP/PARAFAC. Part 3: Rank Splitting
BSI-TOYOTA Collaboration Center, RIKEN(理化学研究所BSI-丰田合作中心);System Research Institute, Warsaw(华沙系统研究所);Institute of Information Theory and Automation, Prague(布拉格信息与自动化研究所)
FCNCP: A Coupled Nonnegative CANDECOMP/PARAFAC Decomposition Based on Federated Learning
School of Biomedical Engineering, Faculty of Medicine, Dalian University of Technology(大连理工大学医学院生物医学工程学院);Key Laboratory of Integrated Circuit and Biomedical Electronic System, Liaoning Province, Dalian University of Technology(大连理工大学辽宁省集成电路与生物医学电子系统重点实验室);Stem Cell Clinical Research Center, the First Affiliated Hospital of Dalian Medical University(大连医科大学附属第一医院干细胞临床研究中心);Dalian Innovation Institute of Stem Cell and Precision Medicine(大连干细胞与精准医学创新研究院);Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Ministry of Education, China(教育部社会计算与认知智能重点实验室(大连理工大学))
Error Preserving Correction for CPD and Bounded-Norm CPD
Brain Science Institute, RIKEN(RIKEN脑科学研究所);Systems Research Institute PAS(波兰科学院系统研究所);Skolkovo Institute of Science and Technology (Skoltech)(斯科尔科沃科学技术研究所);Institute of Information Theory and Automation(信息与自动化研究所)
Scalable Tensor Factorizations for Incomplete Data
数据不完整的问题,即,在生物医学信号处理、网络流量分析、文献计量学、社会网络分析、化学计量学、计算机视觉、通信网络等中普遍存在具有缺失值或未知值的数据。我们考虑如何以捕获数据的潜在结构并可能重构缺失值(即,张量完备化)。我们专注于一个最著名的张量分解,捕捉多线性结构,CANDECOMP/PARAFAC(CP)。在存在缺失数据的情况下,CP可以被公式化为仅对已知条目建模的加权最小二乘问题。我们开发了一种算法称为CP-WOPT(CP加权优化),使用一阶优化方法来解决加权最小二乘问题。基于大量的数值实验,我们的算法被证明是成功的因式分解张量与噪声和高达99%的缺失数据。我们的方法的一个独特之处在于它可以扩展到稀疏的大规模数据,例如,1000 x 1000 x 1000,500万个已知条目(密度为0.5%)。我们进一步证明了CP-WOPT在两个现实世界的应用程序的有用性:一个新的EEG(脑电图)应用程序,经常遇到的数据丢失,由于断开电极和建模的计算机网络流量的数据可能会缺席的问题,由于数据收集过程的费用。
Xiamen University(厦门大学);University of Science and Technology of China(中国科学技术大学);Hong Kong University of Science and Technology(香港科技大学);Xiamen University of Technology(厦门理工学院)