一种用于音乐声音稀疏谱表示的专用贪婪追踪算法
A dedicated greedy pursuit algorithm for sparse spectral representation of music sound
摘要:
提出了一种用于音乐声音稀疏谱表示的专用算法。目标是使一段音乐信号的表示成为尽可能少的频谱分量的线性叠加。这种性质的表示称为稀疏表示。在本上下文中,稀疏性是通过从称为字典的过完备集合中贪婪地选择谱分量来实现的。所提出的算法是量身定制的应用与三角字典。它的显着特点是,它避免了对整个字典的实际建设的需要,通过实现所需的操作,通过快速傅立叶变换。所实现的稀疏性在理论上等同于通过正交匹配追踪方法所呈现的稀疏性。所提出的专用实现的贡献是通过减少其存储和计算需求来扩展标准正交匹配追踪算法的适用性。通过与传统方法的比较,在短时傅立叶变换的线,只涉及相应的正交三角基的方法用于产生稀疏谱模型的适用性说明。
英文摘要:
A dedicated algorithm for sparse spectral representation of music sound is presented. The goal is to enable the representation of a piece of music signal, as a linear superposition of as few spectral components as possible. A representation of this nature is said to be sparse. In the present context sparsity is accomplished by greedy selection of the spectral components, from an overcomplete set called a dictionary. The proposed algorithm is tailored to be applied with trigonometric dictionaries. Its distinctive feature being that it avoids the need for the actual construction of the whole dictionary, by implementing the required operations via the Fast Fourier Transform. The achieved sparsity is theoretically equivalent to that rendered by the Orthogonal Matching Pursuit method. The contribution of the proposed dedicated implementation is to extend the applicability of the standard Orthogonal Matching Pursuit algorithm, by reducing its storage and computational demands. The suitability of the approach for producing sparse spectral models is illustrated by comparison with the traditional method, in the line of the Short Time Fourier Transform, involving only the corresponding orthonormal trigonometric basis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。