插值分解：一种快速连续正交匹配追踪算法
Factorization over interpolation: A fast continuous orthogonal matching pursuit
摘要：
我们提出了一种快速贪婪算法来计算信号的稀疏表示，从连续字典是可因子分解的，即，原子可以作为亚原子的产物分离。现有算法大大降低了离散可因子分解字典中信号稀疏分解的计算复杂度。另一方面，现有的贪婪算法使用连续字典离散化的插值策略来执行离网分解。我们的算法旨在结合因子分解和插值的概念，使低复杂度计算的连续稀疏表示的信号。我们的算法的效率是突出其应用于雷达系统的模拟。
英文摘要：
We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms. Existing algorithms strongly reduce the computational complexity of the sparse decomposition of signals in discrete factorizable dictionaries. On another flavour, existing greedy algorithms use interpolation strategies from a discretization of continuous dictionaries to perform off-the-grid decomposition. Our algorithm aims to combine the factorization and the interpolation concepts to enable low complexity computation of continuous sparse representation of signals. The efficiency of our algorithm is highlighted by simulations of its application to a radar system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
