鲁棒的Hankel矩阵补全及去离群点方法
批准号:
12101507
项目类别:
青年科学基金项目(C类)
资助金额:
30.0 万元
负责人:
王天明
依托单位:
学科分类:
连续优化
结题年份:
2024
批准年份:
2021
项目状态:
已结题
项目参与者:
王天明
中文摘要
谱稀疏信号出现在诸如雷达成像、地震数据重建、核磁共振谱法等应用中。此类信号的完整采样是耗时的或是受到技术限制的,采样到的值往往含有离群点和噪声。因此,研究用低质量的部分采样进行信号恢复是很重要的。由于谱稀疏信号对应的Hankel矩阵是低秩的,研究的问题可转化为如何鲁棒地补全低秩的Hankel矩阵。文献中非凸的方法能处理更大型的问题,并取得更好的恢复效果。先进的非凸方法SAP可解决Hankel矩阵的补全和去离群点问题。然而,SAP的理论分析是针对修改过的、每个迭代使用新采样点的版本。在本项目中,申请人首先拟用留一法对SAP原本的迭代进行分析,消除其理论与实际的隔阂;然后利用切空间投影加速SAP迭代中奇异值分解的计算,并推导相应的恢复保证;最后将提出算法的分析推广到有噪声的情况,并在跟实验室合作产生的数据上进行检验。这种更快速且理论更完善的方法能为许多应用中的部分采样和重建提供帮助。
英文摘要
Spectrally sparse signals arise in many applications such as radar imaging, seismic data reconstruction, and nuclear magnetic resonance spectroscopy. However, in these applications, full sampling is either time-consuming or technically prohibited. Moreover, the observed samples are often contaminated by outliers and noise. Therefore, it is important to study how to recover the signal from such degraded partial observations. Since the spectral sparsity of a signal can be exploited by the low-rank property of the corresponding Hankel matrix, the problem considered can be transferred to the robust completion of a Hankel matrix. Related works in the literature can be classified into convex or nonconvex approaches. By comparison, nonconvex approaches are more scalable to large-scale problems, and usually produce better recovery. The state-of-art nonconvex approach SAP can provably solve the simultaneous Hankel matrix completion and outlier removal problem. However, its theoretical analysis is for a modified version of SAP that uses fresh samples in each iteration. In this proposal, we first plan to analyze the original iterative process of SAP using the leave-one-out technique, bridging the gap in theory and practice. We then propose to use the tangent space projection technique to accelerate the SVD computation in each iterate of SAP, and derive the corresponding recovery guarantee. Finally, we would extend the analysis of the proposed method to the noisy setting, and validate its performances with real-world data produced from lab collaboration. Such a faster, and more theoretically sound method would be very useful for the partial sampling and robust recovery problem in many applications.
非凸矩阵恢复算法的理论保证往往是基于随机采样假设和非相干性得出的。为了充分利用非相干性,以前的分析用样本分割或者显示投影到非相干区域的方法。然而这两个技术在实际中都是不必要的,使得理论分析与实际应用之间存在差距。留一法是一种分析统计相关的迭代过程的新工具,它成功改善了包括矩阵补全、相位恢复等很多领域的理论分析。项目的研究目标是探索如何用留一法分析从有离群点和噪声的采样中鲁棒地恢复低秩Hankel矩阵。然而经过细查留一法的文献并更好地了解到Hankel矩阵的证明需要什么,项目负责人发现Hankel矩阵出现在每个反对角线上的随机性与留一法的证明框架不是很匹配。意识到Hankel矩阵相关证明的巨大困难,项目负责人考虑先在一般矩阵补全的留一法分析中加入离群点。完成的工作是第一个非凸的矩阵补全及去离群点算法的留一法分析。在没有离群点时,它的结果也改善了原有的用留一法分析得到的采样复杂度。项目负责人接着在分析中加入了切空间投影和噪声的考虑,希望分析离群点和噪声的经验以及切空间好的性质能够最终对Hankel矩阵的分析有所启发。
国内基金
海外基金