论文标题
插值分解：快速连续的正交匹配追踪
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.
