arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1512.03224math.NAcs.NA
收藏

通过不完整张量的CANDECOMP/PARAFAC分解进行谱压缩感知

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(史蒂文斯理工学院电气与计算机工程系)

Jun Fang, Linxiao Yang, Hongbin Li

AI总结:

本文提出利用张量分解技术解决频谱估计问题,通过将观测数据组织为结构化张量,将频谱估计转化为具有缺失条目的CP分解问题,实现高精度频谱恢复。

摘要:

我们考虑线谱估计问题,旨在从少量随机观测的时间域样本中恢复复正弦波混合物。压缩感知方法通过将连续频率参数空间离散化为有限的网格点集,将线谱估计转化为稀疏信号恢复问题。然而,离散化不可避免地引入误差,导致估计性能下降。本文提出一种新方法,利用近期张量分解的最新进展。具体来说,我们将观测数据组织为结构化张量,并将线谱估计转化为具有缺失条目的CANDECOMP/PARAFAC(CP)分解问题。CP分解的唯一性允许频率成分以无限精度超分辨。仿真结果表明,所提方法的估计精度与现有最先进算法相比具有竞争力。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑